In this paper, we introducte a family of univariate Birnbaum-Saunders distributions arising from the skew-normal-t  distribution. We obtain several properties of this distribution such as its moments, the maximum likelihood estimation procedure via an EM-algorithm and a method to evaluate standard errors using the EM-algorithm. Finally, we apply these methods to a real data set to demonstr...

‎‎For a finite group $G$ and a subgroup $H$ of $G$‎, ‎the relative commutativity degree of $H$ in $G$‎, ‎denoted by $d(H,G)$‎, ‎is the probability that an element of $H$ commutes with an element of $G$‎. ‎Let $mathcal{D}(G)={d(H,G):Hleq G}$ be the set of all relative commutativity degrees of subgroups of $G$‎. ‎It is shown that a finite group $G$ admits three relative commutativity degrees if a...

Let G/H be a semisimple symmetric space. The main tool to embed a principal series representation of G into L(G/H) are the H -invariant distribution vectors. If G/H is a non-compactly causal symmetric space, then G/H can be realized as a boundary component of the complex crown Ξ. In this article we construct a minimal G-invariant subdomain ΞH of Ξ with G/H as Shilov boundary. Let π be a spheric...

let $g$ be a finite group‎. ‎a subgroup‎ ‎$h$ of $g$ is called an $mathcal{h}$-subgroup in‎ ‎$g$ if $n_g(h)cap h^{g}leq h$ for all $gin‎ ‎g$. a subgroup $h$ of $g$ is called a weakly‎ ‎$mathcal{h}^{ast}$-subgroup in $g$ if there exists a‎ ‎subgroup $k$ of $g$ such that $g=hk$ and $hcap‎ ‎k$ is an $mathcal{h}$-subgroup in $g$. we‎ ‎investigate the structure of the finite group $g$ under the‎ ‎as...

Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...

In this article we introduce and study the concept of characteristic degree of a subgroup in a finite group. We define the characteristic degree of a subgroup H in a finite group G as the ratio of the number of all pairs (h,α) ∈ H×Aut(G) such that h^α∈H, by the order of H × Aut(G), where Aut(G) is the automorphisms group of G. This quantity measures the probability that H can be characteristic ...

‎Complex-valued harmonic functions that are univalent and‎ ‎sense-preserving in the open unit disk $U$ can be written as form‎ ‎$f =h+bar{g}$‎, ‎where $h$ and $g$ are analytic in $U$‎. ‎In this paper‎, ‎we introduce the class $S_H^1(beta)$‎, ‎where $1<betaleq 2$‎, ‎and‎ ‎consisting of harmonic univalent function $f = h+bar{g}$‎, ‎where $h$ and $g$ are in the form‎ ‎$h(z) = z+sumlimits_{n=2}^inf...

For two graphs $mathrm{G}$ and $mathrm{H}$ with $n$ and $m$ vertices, the corona $mathrm{G}circmathrm{H}$ of $mathrm{G}$ and $mathrm{H}$ is the graph obtained by taking one copy of $mathrm{G}$ and $n$ copies of $mathrm{H}$ and then joining the $i^{th}$ vertex of $mathrm{G}$ to every vertex in the $i^{th}$ copy of $mathrm{H}$. The neighborhood corona $mathrm{G}starmathrm{H}$ of $mathrm{G}$ and $...