English
Related papers

Related papers: Sharp upper bounds on the minimal number of elemen…

200 papers

In [3] is was shown that for any group $G$ whose rank (i.e., minimal number of generators) is at most 3, and any finite index subgroup $H\leq G$ with index $[G:H]\geq rank(G)$, one can always find a left-right transversal of $H$ which…

Group Theory · Mathematics 2019-12-06 Maurice Chiodo , Robert Crumplin , Oscar Donlan , Paweł Piwek

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…

Group Theory · Mathematics 2022-07-13 Francesco Fumagalli , Felix Leinen , Orazio Puglisi

We show that the normal closure of any periodic element of the mapping class group of a non-orientable surface whose order is greater than 2 contains the commutator subgroup, which for $g\geq 7$ is equal to the twist subgroup, and provide…

Geometric Topology · Mathematics 2019-03-26 Marta Leśniak

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\}$…

Group Theory · Mathematics 2013-10-08 Andrea Lucchini , Martino Garonzi

The generalized order $e_G(g)$ of an element $g$ of a group $G$ is the smallest positive integer $k$ such that there exist $x_1,\ldots,x_k \in G$ such that $g^{x_1} \ldots g^{x_k}=1$, where $g^x=x^{-1}gx$. Let $e(G) = \max \{e_G(g)\ |\ g…

Group Theory · Mathematics 2025-07-30 Martino Garonzi , Christe Montijo , Alexandre Zalesski

Recently Rai obtained an upper bound for the order of the Schur multiplier of a $d$-generator special $p$-group when its derived subgroup has the maximum value $ p^{\frac{1}{2}d(d-1)}$ for $ d\geq 3 $ and $ p\neq 2. $ Here we try to obtain…

Group Theory · Mathematics 2018-07-16 Farangis Johari , Peyman Niroomand

A transitive permutation group of prime degree is doubly transitive or solvable. We give a direct proof of this theorem by Burnside which uses neither S-ring type arguments, nor representation theory.

Group Theory · Mathematics 2019-07-30 Peter Müller

For a finite group $G$, $N_\infty$ operads encode collections of norm maps, and by work of Blumberg--Hill and Rubin their homotopy category is equivalent to the poset of $G$--transfer systems on the subgroup lattice of $G$. In \cite{ABB+25}…

Combinatorics · Mathematics 2026-05-08 Bheemarasetty Chakravarthy , Surojit Ghosh

A linear group G on a finite vector space V, (that is, a subgroup of GL(V)) is called (1/2)-transitive if all the G-orbits on the set of nonzero vectors have the same size. We complete the classification of all the (1/2)-transitive linear…

Group Theory · Mathematics 2014-12-15 Martin W. Liebeck , Cheryl E. Praeger , Jan Saxl

We prove that every finite simple group of Lie type $G$ can be generated by three regular unipotent elements. In certain cases we show that two regular unipotents are sufficient to generate $G$.

Group Theory · Mathematics 2025-11-18 M. A. Pellegrini , A. E. Zalesski

We study the group of interval exchange transformations and obtain several characterizations of its commutator group. In particular, it turns out that the commutator group is generated by elements of order 2.

Group Theory · Mathematics 2011-09-08 Yaroslav Vorobets

The minimal faithful permutation degree $\mu(G)$ of a finite group $G$ is the least integer $n$ such that $G$ is isomorphic to a subgroup of the symmetric group $S_n$. If $G$ has a normal subgroup $N$ such that $\mu(G/N) > \mu(G)$, then $G$…

Group Theory · Mathematics 2026-05-26 E. A. O'Brien , Sunil Kumar Prajapati , Ayush Udeep

In this paper we prove new lower bounds for the maximal size of permutation codes by connecting the theory of permutation codes with the theory of linear block codes. More specifically, using the columns of a parity check matrix of an…

Information Theory · Computer Science 2019-01-28 Giacomo Micheli , Alessandro Neri

Let $G$ be a graph of order $n$. A classical upper bound for the domination number of a graph $G$ having no isolated vertices is $\lfloor\frac{n}{2}\rfloor$. However, for several families of graphs, we have $\gamma(G) \le…

Combinatorics · Mathematics 2025-12-09 Subramanian Arumugam , Suresh Manjanath Hegde , Shashanka Kulamarva

We use character theory and character estimates to show that the number of $T_2$-systems of $A_n$ is at least \begin{equation*} \frac{1}{8n\sqrt{3}}\exp\left(\frac{2\pi}{\sqrt{6}}n^{1/2}\right)(1+o(1)). \end{equation*} Applying this result,…

Group Theory · Mathematics 2017-10-30 Stefan-Christoph Virchow

Let $\Gamma$ be a group acting on a set $X$. The distinguishing number for this action of $\Gamma$ on $X$, denoted by $D_{\Gamma}(X)$, is the smallest natural number $k$ such that the elements of $X$ can be labeled with $k$ labels so that…

Combinatorics · Mathematics 2017-01-03 Saeid Alikhani , Samaneh Soltani

Suppose that G is a linearly reductive group. We study the minimal free resolution of the invariant ring. If G is a finite linearly reductive group, then the ring of invariants is generated in degree at most |G|, the group order. We prove…

Commutative Algebra · Mathematics 2007-05-23 Harm Derksen

A finite group $G$ is called a Schur group, if any Schur ring over $G$ is the transitivity module of a permutation group on the set $G$ containing the regular subgroup of all right translations. It was proved by R. P\"oschel (1974) that…

Combinatorics · Mathematics 2015-05-07 Sergei Evdokimov , István Kovács , Ilya Ponomarenko

We give a modern account of Alfred Bochert's results from 1892 on the minimal degree of doubly, triply and quadruply transitive permutation groups.

Group Theory · Mathematics 2022-09-27 Bernd Schomburg

The motion of a graph is the minimum number of vertices that are moved by a non-trivial automorphism. Equivalently, it can be defined as the minimal degree of its automorphism group (as a permutation group on the vertices). In this paper we…

Combinatorics · Mathematics 2025-03-28 Antonio Montero , Primož Potočnik
‹ Prev 1 4 5 6 7 8 10 Next ›