English
Related papers

Related papers: The mixed Littlewood conjecture for pseudo-absolut…

200 papers

In this paper, we study some supercongruences involving the sequence $$ t_n(x)=\sum_{k=0}^n\binom{n}{k}\binom{x}{k}\binom{x+k}{k}2^k $$ and solve some open problems. For any odd prime $p$ and $p$-adic integer $x$, we determine…

Number Theory · Mathematics 2025-10-14 Hui-Li Han , Chen Wang

Let $f$ be sampled uniformly at random from the set of degree $n$ polynomials whose coefficients lie in $\{ \pm 1\}$. A folklore conjecture, known to hold under GRH, states that the probability that $f$ is irreducible tends to $1$ as $n$…

Number Theory · Mathematics 2024-01-09 Lior Bary-Soroker , David Hokken , Gady Kozma , Bjorn Poonen

In this revised form, the proof of the principal lemma has been simplified and the main theorem has been extended to all characteristics for those varieties which are smooth in codimension one. This principal theorem essentially says the…

alg-geom · Mathematics 2009-09-25 J. Alexander , A. Hirschowitz

This survey paper is based on a talk given at the 44th Summer Symposium in Real Analysis in Paris. This line of research was initiated by a question of Haight and Weizs\"aker concerning almost everywhere convergence properties of series of…

Classical Analysis and ODEs · Mathematics 2022-09-27 Zoltán Buczolich

In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in…

Number Theory · Mathematics 2014-10-07 Efrat Bank , Lior Bary-Soroker

The second Hardy-Littlewood conjecture asserts that the prime counting function $\pi(x)$ satisfies the subadditive inequality \begin{align*} \pi(x+y)\leqslant \pi(x)+\pi (y) \end{align*} for all integers $x,y\geqslant 2$. By linking the…

Number Theory · Mathematics 2025-03-05 Bittu Chahal , Ertan Elma , Nic Fellini , Akshaa Vatwani , Do Nhat Tan Vo

Consider a sum $S_n=v_i\varepsilon_1+\cdots+v_n\varepsilon_{n}$, where $(v_i)^{n}_{i=1}$ are non-zero vectors in $\mathbb{R}^{d}$ and $(\varepsilon_i)^{n}_{i=1}$ are independent Rademacher random variables (i.e.,…

Probability · Mathematics 2019-10-23 Dainius Dzindzalieta , Tomas Juškevičius

Assuming Dickson's conjecture, we obtain multidimensional analogues of recent results on the behavior of certain multiplicative arithmetic functions near twin-prime arguments. This is inspired by analogous unconditional theorems of Schinzel…

Number Theory · Mathematics 2021-02-05 Stephan Ramon Garcia , Gabe Udell , Jiahui Yu

We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short…

Number Theory · Mathematics 2026-05-08 Luan Alberto Ferreira

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont

The Index Conjecture in zero-sum theory states that when $n$ is coprime to $6$ and $k$ equals $4$, every minimal zero-sum sequence of length $k$ modulo $n$ has index $1$. While other values of $(k,n)$ have been studied thoroughly in the…

Number Theory · Mathematics 2025-10-15 Andrew Pendleton

In the setting where we have $n$ independent observations of a random variable $X$, we derive explicit error bounds in total variation distance when approximating the number of observations equal to the maximum of the sample (in the case…

Probability · Mathematics 2026-04-10 Fraser Daly

In this paper we show that the set of mixed type badly approximable simultaneously small linear forms is of maximal dimension. As a consequence of this theorem we settle a conjecture of the first author.

Number Theory · Mathematics 2014-06-18 Mumtaz Hussain , Simon Kristensen

We study the distribution of prime numbers under the unlikely assumption that Siegel zeros exist. In particular we prove for \[ \sum_{n \leq X} \Lambda(n) \Lambda(\pm n+h) \] an asymptotic formula which holds uniformly for $h = O(X)$. Such…

Number Theory · Mathematics 2022-02-08 Kaisa Matomäki , Jori Merikoski

Let $p_n$ denote the $n^{th}$ prime. Goldston, Pintz, and Yildirim recently proved that $ \liminf_{n\to \infty} \frac{(p_{n+1}-p_n)}{\log p_n} =0.$ We give an alternative proof of this result. We also prove some corresponding results for…

Number Theory · Mathematics 2007-05-23 D. A. Goldston , S. W. Graham , J. Pintz , C. Y. Yilidirm

The absolute sets of local systems on a smooth complex algebraic variety are the subject of a conjecture of N. Budur and B. Wang based on an analogy with special subvarieties of Shimura varieties. An absolute set should be the…

Algebraic Geometry · Mathematics 2022-02-18 Nero Budur , Leonardo A. Lerer , Haopeng Wang

A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…

Number Theory · Mathematics 2007-05-23 Greg Martin , Kevin O'Bryant

In this note we give a short and self-contained proof that, for any $\delta > 0$, $\sum_{x \leq n \leq x+x^\delta} \lambda(n) = o(x^\delta)$ for almost all $x \in [X, 2X]$. We also sketch a proof of a generalization of such a result to…

Number Theory · Mathematics 2015-02-10 Kaisa Matomäki , Maksym Radziwiłł

There is a growing body of work on proving hardness results for average-case estimation problems by bounding the low-degree advantage (LDA) - a quantitative estimate of the closeness of low-degree moments - between a null distribution and a…

Computational Complexity · Computer Science 2025-05-26 Rares-Darius Buhai , Jun-Ting Hsieh , Aayush Jain , Pravesh K. Kothari

We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers…

Number Theory · Mathematics 2014-02-27 Minoru Fujimoto , Kunihiko Uehara