Related papers: Exponent and number of generators in a finite grou…

In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…

We describe a bound on the degree of the generators for some adjoint rings on surfaces and threefolds.

Let $G$ be a finite group of order $n$, and denote by $\rho(G)$ the product of element orders of $G$. The aim of this work is to provide some upper bounds for $\rho(G)$ depending only on $n$ and on its least prime divisor, when $G$ belongs…

This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

An upper bound of composition series of groups of finite order is obtained. The bound is a nontrivial bound and so far best possible.

Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…

We give a characterization of limits of dihedral groups in the space of finitely generated marked groups. We also describe the topological closure of dihedral groups in the space of marked groups on a fixed number of generators.

The `upper rank' of a group is the supremum of the (Pr\"{u}fer) ranks of its finite quotients, and for a prime $p$, the `upper $p$-rank' is the supremum of the sectional $p$-ranks of those quotients. The former is finite if and only if the…

We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.

In this paper we prove that a finite group of order $r$ has at most $$ 7.3722\cdot r^{\frac{\log_2r}{4}+1.5315}$$ subgroups.

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

All groups have 2 generators. For every prime power q, the Generalized Burnside Theorem (Theorem GB) produces an infinite number of solvable groups, Some, such as groups of a prime power exponent, have only elements of finite order and are…

In this paper we present some inequalities for the order, the exponent and the number of generators of the $c$-nilpotent multiplier (the Baer invariant with respect to the variety of nilpotent groups of class at most $c \geq 1$) of a finite…

Given a group G denote with exp(G) its exponent, which is the least common multiple of the order of its elements. In this paper we solve the problem of finding the finite simple groups having a proper subgroup with the same exponent. For…

We derive a lower bound on the size of finite non-cyclic quotients of the braid group that is superexponential in the number of strands. We also derive a similar lower bound for nontrivial finite quotients of the commutator subgroup of the…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

The exact degree bound for the generators of rings of polynomial invariants is determined for the finite, non-cyclic groups having a cyclic subgroup of index two. It is proved that the Noether number of these groups equals one half the…

We determine the finite groups whose real irreducible representations have different degrees.

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…