English
Related papers

Related papers: Counting multiplicative groups with prescribed sub…

200 papers

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…

Number Theory · Mathematics 2024-03-06 Greg Martin , Chau Nguyen

We know that any finite abelian group $G$ appears as a subgroup of infinitely many multiplicative groups $\mathbb{Z}_n^\times$ (the abelian groups of size $\phi(n)$ that are the multiplicative groups of units in the rings…

Number Theory · Mathematics 2024-09-12 Matthias Hannesson , Greg Martin

Let $\lambda_1(n)$ denote the least invariant factor in the invariant factor decomposition of the multiplicative group $M_n = (\mathbb Z/n\mathbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/\sqrt{\log x}$, for the…

Number Theory · Mathematics 2020-02-04 Ben Chang , Greg Martin

Let $K$ be a number field and let $G$ be a finitely generated subgroup of $K^\times$. For all but finitely many primes $\mathfrak p$ of $K$, the reduction $(G \bmod \mathfrak p)$ generates a well-defined subgroup of the multiplicative group…

Number Theory · Mathematics 2025-08-13 Pietro Sgobba

For any $k>1$, we find the asymptotics of the counting function of $k$-th power-free elements in an additive arithmetic semigroup with exponential growth of the abstract prime counting function. This paper continues the authors' earlier…

Number Theory · Mathematics 2016-04-13 V. L. Chernyshev , D. S. Minenkov , V. E. Nazaikinskii

Let $I(n)$ denote the number of isomorphism classes of subgroups of $(\Bbb Z/n\Bbb Z)^\times$, and let $G(n)$ denote the number of subgroups of $(\Bbb Z/n\Bbb Z)^\times$ counted as sets (not up to isomorphism). We prove that both $\log…

Number Theory · Mathematics 2017-10-03 Greg Martin , Lee Troupe

Let \(C(x)\), \(A(x)\), and \(N(x)\) denote the counting functions of cyclic, abelian, and nilpotent numbers not exceeding \(x\), respectively. Their asymptotic formulas have been established in recent work by Pollack and Just. In this…

Number Theory · Mathematics 2026-05-05 Kang Shengyu

Refining a result of Erdos and Mays, we give asymptotic series expansions for the functions $A(x)-C(x)$, the count of $n\leq x$ for which every group of order $n$ is abelian (but not all cyclic), and $N(x)-A(x)$, the count of $n\leq x$ for…

Number Theory · Mathematics 2021-02-02 Matthew Just

A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…

Number Theory · Mathematics 2023-03-13 Eric Naslund

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

Group Theory · Mathematics 2012-11-08 László Tóth

We investigate the power of counting in Group Isomorphism. We first leverage the count-free variant of the Weisfeiler--Leman Version I algorithm for groups (Brachter & Schweitzer, LICS 2020) in tandem with limited non-determinism and…

Data Structures and Algorithms · Computer Science 2024-01-24 Nathaniel A. Collins , Michael Levet

Motivated by their research on automorphism groups of pseudo-real Riemann surfaces, Bujalance, Cirre and Conder have conjectured that there are infinitely many primes $p$ such that $p+2$ has all its prime factors $q\equiv -1$ mod~$(4)$. We…

Number Theory · Mathematics 2024-01-22 Gareth A. Jones , Alexander K. Zvonkin

In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…

Data Structures and Algorithms · Computer Science 2026-02-05 Dan Johnson , Michael Levet , Petr Vojtěchovský , Brett Widholm

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

Data Structures and Algorithms · Computer Science 2013-12-12 David Rosenbaum

One of the classical problems in group theory is determining the set of positive integers $n$ such that every group of order $n$ has a particular property $P$, such as cyclic or abelian. We first present the Sylow theorems and the idea of…

Group Theory · Mathematics 2015-01-15 Logan Crew

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Number Theory · Mathematics 2022-09-12 Arghya Datta

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

Number Theory · Mathematics 2026-05-29 Jan-Hendrik Evertse , Kálmán Győry , Lajos Hajdu , Florian Luca , László Remete

We present a new notion of non-positively curved groups: the collection of discrete countable groups acting (AU-)acylindrically on finite products of $\delta$-hyperbolic spaces with general type factors and associated subdirect products.…

Group Theory · Mathematics 2025-12-29 Sahana Balasubramanya , Talia Fernos

We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…

Number Theory · Mathematics 2017-12-13 Eyal Moses

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…

Group Theory · Mathematics 2022-05-02 Laura Ciobanu , Albert Garreta
‹ Prev 1 2 3 10 Next ›