Related papers: Counting multiplicative groups with prescribed sub…

For prime powers q, let s(q) denote the probability that a randomly-chosen principally-polarized abelian surface over the finite field F_q is not simple. We show that there are positive constants B and C such that for all q, B (log…

Let $k$ and $n$ be natural numbers. Let $\omega_k(n)$ denote the number of distinct prime factors of $n$ with multiplicity $k$ as studied by Elma and the third author. We obtain asymptotic estimates for the first and the second moments of…

Let $\alpha$ and $\beta$ be irrational real numbers and $0<\F<1/30$. We prove a precise estimate for the number of positive integers $q\leq Q$ that satisfy $\|q\alpha\|\cdot\|q\beta\|<\F$. If we choose $\F$ as a function of $Q$ we get…

We investigate number-theoretic properties of the collection of nilpotent injectors or nilpotent projectors containing certain subgroups of finite soluble (or ${\mathcal N}$-constrained) groups.

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…

This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…

This is the first of two papers devoted to connections between asymptotic functions of groups and computational complexity. One of the main results of this paper states that if for every $m$ the first $m$ digits of a real number $\alpha\ge…

We discuss $Q(n)$, the number of ways a given integer $n$ may be written as a sum of distinct primes, and study its asymptotic form $Q_{as}(n)$ valid in the limit $n\to\infty$. We obtain $Q_{as}(n)$ by Laplace inverting the fermionic…

The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…

We derive an asymptotic formula which counts the number of abelian extensions of prime degrees over rational function fields. Specifically, let $\ell$ be a rational prime and $K$ a rational function field $\Bbb F_q(t)$ with $\ell \nmid q$.…

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…

Let $K$ be a number field and $G$ a finite abelian group. We study the asymptotic behaviour of the number of tamely ramified $G$-extensions of $K$ with ring of integers of fixed realisable class as a Galois module.

Let $G$ be a finite almost simple group with socle $G_0$. A (nontrivial) factorization of $G$ is an expression of the form $G=HK$, where the factors $H$ and $K$ are core-free subgroups. There is an extensive literature on factorizations of…

Suppose $\ell$ is a prime number, $\ell >3$, $K$ is a field that is an unramified finite extension of the field $\Q_\ell$ of $\ell$-adic numbers, and $G$ is a finite group that is a semi-direct product of a normal $\ell'$-subgroup $H$ and a…

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

We employ techniques from group theory to show that, in many cases, counting problems on graphs are almost as hard to solve in a small number of instances as they are in all instances. Specifically, we show the following results. 1.…

Answering a question of Geoff Robinson, we compute the large n limiting proportion of i(n,q)/q^[n^2/2], where i(n,q) denotes the number of involutions in GL(n,q). We give similar results for the finite unitary, symplectic, and orthogonal…

Let $G$ be a wreath product of the form $C_2 \wr H$, where $C_2$ is the cyclic group of order 2. Under mild conditions for $H$ we determine the asymptotic behavior of the counting functions for number fields $K/k$ with Galois group $G$ and…

Given a Gromov-hyperbolic group $G$ endowed with a finite symmetric generating set, we study the statistics of counting measures on the spheres of the associated Cayley graph under linear representations of $G$. More generally, we obtain a…

We present efficient quantum algorithms for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups $\Z_{p^r}\rtimes_{\phi}\Z_{p^2}$, where $p$ is any odd prime number and $r$ is any integer such that $r>4$. We also…