English
Related papers

Related papers: A structure theorem for level sets of multiplicati…

200 papers

Let $p$ be a prime number and let $S=\{x^p+c_1,\dots,x^p+c_r\}$ be a finite set of unicritical polynomials for some $c_1,\dots,c_r\in\mathbb{Z}$. Moreover, assume that $S$ contains at least one irreducible polynomial over $\mathbb{Q}$. Then…

Number Theory · Mathematics 2023-08-29 Wade Hindes , Reiyah Jacobs , Benjamin Keller , Albert Kim , Peter Ye , Aaron Zhou

Let $(X, \mathcal{B},\mu,T)$ be an ergodic measure preserving system, $A \in \mathcal{B}$ and $\epsilon>0$. We study the largeness of sets of the form \begin{equation*} \begin{split} S = \left\{ n\in\mathbb{N}\colon\mu(A\cap…

Dynamical Systems · Mathematics 2019-08-06 Sebastián Donoso , Anh N. Le , Joel Moreira , Wenbo Sun

We establish mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive…

Dynamical Systems · Mathematics 2022-05-19 Nikos Frantzikinakis

We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with high probability and for the remaining queries, the decoder…

Data Structures and Algorithms · Computer Science 2010-01-27 Victor Chen , Elena Grigorescu , Ronald de Wolf

Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…

Number Theory · Mathematics 2023-11-07 Alp Bassa , Gaetan Bisson , Roger Oyono

We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…

Symbolic Computation · Computer Science 2023-06-12 Christian Eder , Pierre Lairez , Rafael Mohr , Mohab Safey El Din

We study the distribution of families of multiplicative functions among the coprime residue classes to moduli varying uniformly in a wide range, obtaining analogues of the Siegel--Walfisz Theorem for large classes of multiplicative…

Number Theory · Mathematics 2024-02-27 Akash Singha Roy

The reconstruction theorem is a cornerstone of the theory of regularity structures [Hai14]. In [CZ20] the authors formulate and prove this result in the language of distributions theory on the Euclidean space $\mathbb{R}^d$, without any…

Mathematical Physics · Physics 2021-04-27 Paolo Rinaldi , Federico Sclavi

We build a bridge from density combinatorics to dimension theory of continued fractions. We establish a fractal transference principle that transfers common properties of subsets of $\mathbb N$ with positive upper density to properties of…

Number Theory · Mathematics 2025-10-28 Yuto Nakajima , Hiroki Takahasi

After defining a notion of $\epsilon$-density, we provide for any real algebraic number $\alpha$ an estimate of the smallest $\epsilon$ such that for each $m>1$ the set of vectors of the form $(t,t\alpha,...,t\alpha^{m-1})$ for $t\in\R$ is…

Number Theory · Mathematics 2011-10-18 Nevio Dubbini , Maurizio Monge

We give negative answers to two questions of Bergelson, Moreira, and Richter concerning recurrence along functions from a Hardy field. For the pair \(f_1(t)=t^{3/2}\) and \(f_2(t)=\lambda t^{3/2}+t\), where \(\lambda\in\mathbb…

Number Theory · Mathematics 2026-05-19 Kangbo Ouyang , Leiye Xu , Shuhao Zhang

Let $d \ge 3$ be an integer and let $P \in \mathbb{Z}[x]$ be a polynomial of degree $d$ whose Galois group is $S_d$. Let $(a_n)$ be a linearly recuresive sequence of integers which has $P$ as its characteristic polynomial. We prove, under…

Number Theory · Mathematics 2021-02-09 Olli Järviniemi

We consider the problem of representing the fraction $5/P$ as a sum of three distinct unit fractions $1/A+1/B+1/C$ with $A<B<C$ and $A,B,C\in\mathbb{N}$. The case of primes $P\equiv 1 \pmod{5}$ is analyzed, where two constructive types of…

Number Theory · Mathematics 2025-11-26 E. Dyachenko

We introduce an interesting method of proving separable reduction theorems - the method of elementary submodels. We are studying whether it is true that a set (function) has given property if and only if it has this property with respect to…

Functional Analysis · Mathematics 2013-01-08 Marek Cúth

A multiset consists of elements, but the notion of a multiset is distinguished from that of a set by carrying information of how many times each element occurs in a given multiset. In this work we will investigate the notion of iterative…

Logic · Mathematics 2020-07-08 Håkon Robbestad Gylterud

Let $P\in\Z[n]$ with $P(0)=0$ and $\VE>0$. We show, using Fourier analytic techniques, that if $N\geq \exp\exp(C\VE^{-1}\log\VE^{-1})$ and $A\subseteq\{1,\...,N\}$, then there must exist $n\in\N$ such that \[\frac{|A\cap…

Classical Analysis and ODEs · Mathematics 2019-08-15 Neil Lyall , Akos Magyar

We show that for every ergodic and aperiodic probability preserving system $(X,\mathcal{B},m,T)$, there exists $f:X\to \mathbb{Z}^d$, whose corresponding cocycle satisfies the $d$-dimensional local central limit theorem. We use the…

Dynamical Systems · Mathematics 2024-09-23 Zemer Kosloff , Shrey Sanadhya

We study the existence of various sign and value patterns in sequences defined by multiplicative functions or related objects. For any set $A$ whose indicator function is 'approximately multiplicative' and uniformly distributed on short…

Number Theory · Mathematics 2019-12-04 Terence Tao , Joni Teräväinen

We show that there is a set which is not a set of multiple recurrence despite being a set of recurrence for nil-Bohr sets. This answers Huang, Shao, and Ye's \enquote{higher-order} version of Katznelson's Question on Bohr recurrence and…

Dynamical Systems · Mathematics 2025-12-25 Ryan Alweiss

A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…

Combinatorics · Mathematics 2007-05-23 Terence Tao