Related papers: Minimal cover groups
Let $G$ be a finite group and denote by $o(g)$ the order of an element $g\in G$. We say that $G$ is an $LCM$-group if $o(x^ny)$ is a divisor of the least common multiple of $o(x^n)$ and $o(y)$ for all $x, y\in G$ and $n\in\mathbb{N}$. This…
Let $F_g$ be a closed orientable surface of genus $g$. A set $\Omega = \{ \gamma_1, \dots, \gamma_s\}$ of pairwise non-homotopic simple closed curves on $F_g$ is called a \emph{filling system} or simply a \emph{filling} of $F_g$, if…
Let $X$ be a Riemann surface, and let $f:X\to\mathbb{P}^1_\mathbb{C}$ be an indecomposable (branched) covering of genus $g$ and degree $n$ whose monodromy group has more than one minimal normal subgroup. Closing a gap in the literature, we…
In this work we show that every minimal code in a semisimple group algebra $\mathbb{F}_qG$ is essential if $G$ is a simple group. Since the alternating group $A_n$ is simple if $n=3$ or $n\geq 5$, we present some examples of minimal codes…
The covering number of a finite group $G$, denoted $\sigma(G)$, is the smallest positive integer $k$ such that $G$ is a union of $k$ proper subgroups. We calculate $\sigma(G)$ for a family of primitive groups $G$ with a unique minimal…
Given a finitely generated linear group $G$ over $\mathbb{Q}$, we construct a simple group $\Gamma$ that has the same finiteness properties as $G$ and admits $G$ as a quasi-retract. As an application, we construct a simple group of type…
A cover of an associative (not necessarily commutative nor unital) ring $R$ is a collection of proper subrings of $R$ whose set-theoretic union equals $R$. If such a cover exists, then the covering number $\sigma(R)$ of $R$ is the…
If $m$ is a positive integer or infinity, the $m$-layer (or briefly, the layer) of a group $G$ is the subgroup $G_m$ generated by all elements of $G$ of order $m$. This notion goes back to some contributions of Ya.D. Polovickii of almost 60…
Given a finite covering of graphs $f : Y \to X$, it is not always the case that $H_1(Y;\mathbb{C})$ is spanned by lifts of primitive elements of $\pi_1(X)$. In this paper, we study graphs for which this is not the case, and we give here the…
The deficiency of a group is the maximum over all presentations for that group of the number of generators minus the number of relators. Every finite group has non-positive deficiency. We show that every non-positive integer is the…
A finite group $P$ is said to be \emph{primary} if $|P|=p^{a}$ for some prime $p$. We say a primary subgroup $P$ of a finite group $G$ satisfies the \emph{Frobenius normalizer condition} in $G$ if $N_{G}(P)/C_{G}(P)$ is a $p$-group provided…
A subgroup of a finite group G is said to be second maximal if it is maximal in every maximal subgroup of G that contains it. A question which has received considerable attention asks: can every positive integer occur as the number of the…
We construct uncountably many discrete groups of type $FP$; in particular we construct groups of type $FP$ that do not embed in any finitely presented group. We compute the ordinary, $\ell^2$- and compactly-supported cohomology of these…
For a finite non cyclic group $G$, let $\gamma(G)$ be the smallest integer $k$ such that $G$ contains $k$ proper subgroups $H_1,\dots,H_k$ with the property that every element of $G$ is contained in $H_i^g$ for some $i \in \{1,\dots,k\}$…
A countable group $G$ is said to be \emph{matricial field} (MF) if it admits a strongly converging sequence of approximate homomorphisms into matrices; i.e, the norms of polynomials converge to those in the left regular representation. $G$…
We prove that the symmetric group $S_n$ has a unique minimal cover $\mathcal{M}$ by maximal nilpotent subgroups, and we obtain an explicit and easily computed formula for the order of $\mathcal{M}$. In addition, we prove that the order of…
A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…
Let $n$ be a positive integer and $G(n)$ denote the number of non-isomorphic finite groups of order $n$. It is well-known that $G(n) = 1$ if and only if $(n,\phi(n)) = 1$, where $\phi(n)$ and $(a, b)$ denote the Euler's totient function and…
Consider a nonsolvable finite group G, where R(G) represents the solvable radical of G. For any element x in G, the solvabilizer of x in G, denoted by Sol_G(x), is defined as the set of all elements y in G such that the subgroup generated…
In this paper, we assume that $G$ is a finitely generated torsion free non-elementary Kleinian group with $\Omega(G)$ nonempty. We show that the maximal number of elements of $G$ that can be pinched is precisely the maximal number of rank 1…