Related papers: An Upper Bound of Composition Series

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

The order sequence of a finite group $G$ is a non-decreasing finite sequence formed of the element orders of $G$. Several properties of order sequences were studied by P. J. Cameron and H. K. Dey in a recent paper that concludes with a list…

We make a list of finite simple groups whose group rings over a given field are serial.

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

We derive a lower and an upper bound for the rank of the finite part of operator $K$-theory groups of maximal and reduced $C^*$-algebras of finitely generated groups. The lower bound is based on the amount of polynomially growing conjugacy…

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound 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.

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

For a finite simple graph $G$ we give an upper bound for the regularity of the powers of the edge ideal $I(G)$.

We obtain nontrivial bounds for character sums with multiplicative and additive characters over finite fields over elements with restricted coordinate expansion. In particular, we obtain a nontrivial estimate for such a sum over a finite…

In this article we obtain an improved upper bound for the regularity of binomial edge ideals of trees.

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

We prove that the maximum length of an irredundant base for a primitive action of a finite simple group of Lie type is bounded above by a function which is a polynomial in the rank of the group. We give examples to show that this type of…

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

We determine an upper bound for the size of a stem $p$-group in terms of its breadth and its maximum character degree.

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

Given two positive integers n and c, we determine an upper bound, as a function of n and c, for the maximum order of a finite nilpotent transitive group of degree n and nilpotency class at most c.