English
Related papers

Related papers: Generating subgroups of ray class groups with smal…

200 papers

In this article the study of the Prime Graph Question for the integral group ring of almost simple groups which have an order divisible by exactly $4$ different primes is continued. We provide more details on the recently developed "lattice…

Representation Theory · Mathematics 2020-04-09 Andreas Bächle , Leo Margolis

Let $A$ be a commutative ring, and assume every non-trivial ideal of $A$ has finite-index. We show that if ${\rm{SL}}_n(A)$ has bounded elementary generation then every conjugation-invariant norm on it is either discrete or precompact. If…

Group Theory · Mathematics 2025-04-07 Leonid Polterovich , Yehuda Shalom , Zvi Shem-Tov

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

Combinatorics · Mathematics 2013-11-28 Hye Jung Kim , J. B. Nation , Anne V. Shepler

The kernel of the natural projection of a graph product of groups onto their direct product is called the Cartesian subgroup of the graph product. This construction generalises commutator subgroups of right-angled Coxeter and Artin groups.…

Group Theory · Mathematics 2025-07-30 Fedor Vylegzhanin

Let $E/\mathbb{Q}$ be an elliptic curve. For a prime $p$ of good reduction, let $r(E,p)$ be the smallest non-negative integer that gives the $x$-coordinate of a point of maximal order in the group $E(\mathbb{F}_p)$. We prove unconditionally…

Number Theory · Mathematics 2021-06-21 Steven Jin , Lawrence C. Washington

The edge isoperimetric problem for a graph $G$ is to determine, for each $n$, the minimum number of edges leaving any set of $n$ vertices. In general this problem is NP-hard, but exact solutions are known in some special cases, for example…

Combinatorics · Mathematics 2018-09-05 Ben Barber , Joshua Erde

Given a finitely generated multiplicative subgroup of rational numbers $\Gamma$, assuming the Generalized Riemann Hypothesis, we determine an asymptotic formula for average over prime numbers, powers of the order of the reduction group…

Number Theory · Mathematics 2016-02-04 Cihan Pehlivan

We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve…

Number Theory · Mathematics 2012-04-06 Jean-François Biasse , Claus Fieker

We investigate exponential sums over those numbers $\leq x$ all of whose prime factors are $\leq y$. We prove fairly good minor arc estimates, valid whenever $\log^{3}x \leq y \leq x^{1/3}$. Then we prove sharp upper bounds for the $p$-th…

Number Theory · Mathematics 2019-02-20 Adam J. Harper

Let $S = \mathbb{C}[x_{i,j}]$ be the ring of polynomial functions on the space of $m \times n$ matrices, and consider the action of the group $\mathbf{GL} = \mathbf{GL}_m \times \mathbf{GL}_n$ via row and column operations on the matrix…

Commutative Algebra · Mathematics 2020-08-07 Hang Huang

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

Number Theory · Mathematics 2016-11-23 Adrian Dudek

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

Number Theory · Mathematics 2021-07-12 Asif Zaman

We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the…

Information Theory · Computer Science 2017-03-28 Daniel Augot , Pierre Loidreau , Gwezheneg Robert

Let $G$ be a finite nilpotent group and $K$ a number field with torsion relatively prime to the order of $G$. By a sequence of central group extensions with cyclic kernel we obtain an upper bound for the minimum number of prime ideals of…

Number Theory · Mathematics 2010-07-23 Nadya Markin , Stephen V. Ullom

We investigate some extremal problems in Fourier analysis and their connection to a problem in prime number theory. In particular, we improve the current bounds for the largest possible gap between consecutive primes assuming the Riemann…

Number Theory · Mathematics 2021-08-09 Emanuel Carneiro , Micah B. Milinovich , Kannan Soundararajan

This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…

Number Theory · Mathematics 2016-12-12 Youness Lamzouri , Xiannan Li , Kannan Soundararajan

In this article, we study the normal generation of the mapping class group. We first show that a mapping class is a normal generator if its restriction on the invariant subsurface normally generates the (pure) mapping class group of the…

Geometric Topology · Mathematics 2023-10-10 Hyungryul Baik , Dongryul M. Kim , Chenxi Wu

Class groups of real quadratic fields represent fundamental structures in algebraic number theory with significant computational implications. While Stark's conjecture establishes theoretical connections between special units and class…

Number Theory · Mathematics 2025-06-27 Ruopengyu Xu , Chenglian Liu

An old open problem in number theory is whether Chebotarev density theorem holds in short intervals. More precisely, given a Galois extension $E$ of $\mathbb{Q}$ with Galois group $G$, a conjugacy class $C$ in $G$ and an $1\geq…

Number Theory · Mathematics 2024-10-15 Lior Bary-Soroker , Ofir Gorodetsky , Taelin Karidi , Will Sawin

Let $n\geq 3$ and $r_n$ be a $3$-polytopal graph such that for every $3\leq i\leq n$, $r_n$ has at least one vertex of degree $i$. We find the minimal vertex count for $r_n$. We then describe an algorithm to construct the graphs $r_n$. A…

Combinatorics · Mathematics 2021-05-04 Riccardo W. Maffucci