English
Related papers

Related papers: On the Geometry of the Multiplicatively Closed Set…

200 papers

For each prime $p$, let $I_p \subset \mathbb{Z}/p\mathbb{Z}$ denote a collection of residue classes modulo $p$ such that the cardinalities $|I_p|$ are bounded and about $1$ on average. We show that for sufficiently large $x$, the sifted set…

Number Theory · Mathematics 2023-11-01 Kevin Ford , Sergei Konyagin , James Maynard , Carl Pomerance , Terence Tao

A topological group $G$ is topologically normally generated if there exists $g \in G$ such that the normal closure of $g$ is dense in $G$. Let $S$ be a tame, infinite type surface whose mapping class group $\mathrm{Map}(S)$ is generated by…

Group Theory · Mathematics 2026-02-04 Juhun Baik

We study the problem of estimating the number of points of coincidences of an idealized gap on the set of integers under a given multiplicative function $g:\mathbb{N}\longrightarrow \mathbb{C}$ respectively additive function…

Number Theory · Mathematics 2026-04-21 Theophilus Agama

The dynamical system generated by the iterated calculation of the high order gaps between neighboring terms of a sequence of natural numbers is remarkable and only incidentally characterized at the boundary by the notable Proth-Glibreath…

Number Theory · Mathematics 2024-12-11 Raghavendra N. Bhat , Cristian Cobeli , Alexandru Zaharescu

Let us call a simple graph on $n\geq 2$ vertices a prime gap graph if its vertex degrees are $1$ and the first $n-1$ prime gaps. We show that such a graph exists for every large $n$, and in fact for every $n\geq 2$ if we assume the Riemann…

A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…

High Energy Physics - Theory · Physics 2008-11-26 Pierre Mathieu , David Ridout

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…

Combinatorics · Mathematics 2008-04-09 Andrey Radoslavov Antonov , Sascha Kurz

When can $n$ given numbers be combined using arithmetic operators from a given subset of $\{+, -, \times, \div\}$ to obtain a given target number? We study three variations of this problem of Arithmetic Expression Construction: when the…

For a finite set of non-zero natural numbers that contains at least one element different from 1 and the least common multiple of any of its subsets, there exists a subset of at least half of its members which has a common divisor larger…

Number Theory · Mathematics 2018-08-29 Tom Fischer

We study pseudodeterministic constructions, i.e., randomized algorithms which output the same solution on most computation paths. We establish unconditionally that there is an infinite sequence $\{p_n\}_{n \in \mathbb{N}}$ of increasing…

Computational Complexity · Computer Science 2016-12-07 Igor C. Oliveira , Rahul Santhanam

In this paper several examples of gaps (lacunes) between dimensions of maximal and submaximal symmetric models are considered, which include investigation of number of independent linear and quadratic integrals of metrics and counting the…

Differential Geometry · Mathematics 2012-03-06 Boris Kruglikov

In this expository paper, we present a motivated construction of large graphs not containing a given complete bipartite subgraph. The key insight is that the algebraic constructions yield very non-smooth probability distributions.

Combinatorics · Mathematics 2015-07-24 Boris Bukh

We consider the multiplicative structure of sets of the form AA+1, where where A is a large, finite set of real numbers. In particular, we show that the additively shifted product set, AA+1 must have a large part outside of any generalized…

Combinatorics · Mathematics 2012-05-23 Steven Senger

Let $F$ be a field. We show that the largest irredundant generating sets for the algebra of $n\times n $ matrices over $F$ have $2n-1$ elements when $n>1$. (A result of Laffey states that the answer is $2n-2$ when $n>2$, but its proof…

Rings and Algebras · Mathematics 2025-04-04 Yonatan Blumenthal , Uriya First

Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…

Number Theory · Mathematics 2025-08-11 Ayla Gafni , Terence Tao

Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of…

Number Theory · Mathematics 2022-10-21 Buxin Su

A new notion of thickness for subsets of $B[0,1]\subset \mathbb{R}^n$ called affine thickness is defined; this notion of thickness is a generalisation of Falconer-Yavicoli thickness and is adapted to be used in the study of certain sets…

Metric Geometry · Mathematics 2026-01-26 Richard A. Howat

We explain the triangular gaps observed experimentally in the most popular sizes of the $h$-fold iterated sumset, $hA,$ when $A$ is a randomly chosen four-element subset of the first $q$ natural numbers, for $q$ much larger than $h.$

Combinatorics · Mathematics 2025-11-06 Steven Senger

We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…

Number Theory · Mathematics 2025-08-13 William Banks , Kevin Ford , Terence Tao

We associate in a canonical way a substitution to any abstract numeration system built on a regular language. In relationship with the growth order of the letters, we define the notion of two independent substitutions. Our main result is…

Combinatorics · Mathematics 2009-07-28 Fabien Durand , Michel Rigo