Related papers: Arithmetic progressions in finite groups

This paper develops some general results about actions of finite groups on (infinite) abelian groups in the finite Morley rank category. They are linked to a range of problems on groups of finite Morley rank discussed in [16]. Crucially,…

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…

We construct explicitly in any finite field of the form Fq[x]/(x^m-a) elements with multiplicative order at least 2^{(2m)^(1/2)}

Given a prime power $q$ and a positive integer $n$, let $\mathbb{F}_{q^{n}}$ represents a finite extension of degree $n$ of the finite field ${\mathbb{F}_{q}}$. In this article, we investigate the existence of $m$ elements in arithmetic…

In this short note we introduce a new metric on certain finite groups. It leads to a class of groups for which the element orders satisfy an interesting inequality. This extends the class CP_2 studied in our previous paper [16].

We give an explicit description of the category of central extensions of a group scheme by a sheaf of Abelian groups. Based on this, we describe a framework for computing with central extensions of finite commutative group schemes, torsors…

This note deals with the computation of the factorization number $F_2(G)$ of a finite group $G$. By using the M\"{o}bius inversion formula, explicit expressions of $F_2(G)$ are obtained for two classes of finite abelian groups, improving…

The principle result of this article is the determination of the possible finite subgroups of arithmetic lattices in U(2,1).

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

We study the set of Dedekind cuts over a linearly ordered Abelian group as a structure over the language (0,<,+,-). Moreover, we obtain a simple set of axioms for the universal part of the theory of such structures. Finally, we prove that…

Given a prime power $p^d$ with $p$ a prime and $d$ a positive integer, we classify the finite groups $G$ with $p^{2d}$ dividing $|G|$ in which all subgroups of order $p^d$ are complemented and the finite groups $G$ having a normal…

We establish correspondances between factorisations of finite abelian groups (direct factors, unitary factors, non isomorphic subgroup classes) and factorisations of integer matrices. We then study counting functions associated to these…

Given a finite group $G$, the \emph{Prime Order Element (POE) Graph} $\Gamma(G)$ consists of the group elements as the vertices, and two vertices $x$ and $y$ are adjacent if and only if $o(xy)$ is prime. This paper presents a thorough…

We present a sharp upper bound for the number of generators of a finite group in terms of the ratio between the order and the exponent.

Let $G$ be a finite group and $\alpha(G)=\frac{|C(G)|}{|G|}$\,, where $C(G)$ denotes the set of cyclic subgroups of $G$. In this short note, we prove that $\alpha(G)\leq\alpha(Z(G))$ and we describe the groups $G$ for which the equality…

We prove that if a set is `large' in the sense of Erd\H{o}s, then it approximates arbitrarily long arithmetic progressions in a strong quantitative sense. More specifically, expressing the error in the approximation in terms of the gap…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

A celebrated and deep result of Green and Tao states that the primes contain arbitrarily long arithmetic progressions. In this note I provide a straightforward argument demonstrating that the primes get arbitrarily close to arbitrarily long…