English
Related papers

Related papers: Double-jump phase transition for the reverse Littl…

200 papers

We prove that, for almost all $r \leq N^{1/2}/\log^{O(1)}N$, for any given $b_1 \mod r$ with $(b_1, r) = 1$, and for almost all $b_2 \mod r$ with $(b_2, r) = 1$, we have that almost all natural numbers $2n \leq N$ with $2n \equiv b_1 + b_2…

Number Theory · Mathematics 2021-06-03 Juho Salmensuu

We prove a new upper bound for the minimum $d$-degree threshold for perfect matchings in $k$-uniform hypergraphs when $d<k/2$. As a consequence, this determines exact values of the threshold when $0.42k \le d < k/2$ or when $(k,d)=(12,5)$…

Combinatorics · Mathematics 2016-05-12 Jie Han

Given a star-shaped domain $K\subseteq \mathbb R^d$, $n$ vectors $v_1,\dots,v_n \in \mathbb R^d$, a number $R>0$, and i.i.d. random variables $\eta_1,\dots,\eta_n$, we study the geometric and arithmetic structure of the set of vectors $V =…

Probability · Mathematics 2015-10-15 Omer Friedland , Ohad Giladi , Olivier Guédon

We investigate a fifty-year-old conjecture of Erd\H{o}s and Graham concerning whether the binomial coefficient ${n \choose k}$ with $1 \leq k \leq \frac{n}{2}$ must always have a divisor $\leq n$ that is ``close'' to $n$: that is, bigger…

Number Theory · Mathematics 2026-05-21 Hung M. Bui , Kyle Pratt , Alexandru Zaharescu

The Legendre conjecture has resisted analysis over a century, even under assumption of the Riemann Hypothesis. We present, a significant improvement on previous results by greatly reducing the assumption to a more modest statement called…

General Mathematics · Mathematics 2019-03-05 Madieyna Diouf

In 1991 De Giorgi conjectured that, given $\lambda >0$, if $\mu_\varepsilon$ stands for the density of the Allen-Cahn energy and $v_\varepsilon$ represents its first variation, then $\int [v_\varepsilon^2 + \lambda] d\mu_\varepsilon$ should…

Differential Geometry · Mathematics 2023-04-17 Giovanni Bellettini , Mattia Freguglia , Nicola Picenni

We prove an inequality related to questions in Approximation Theory, Probability Theory, and to Irregularities of Distribution. Let $h_R$ denote an $L ^{\infty}$ normalized Haar function adapted to a dyadic rectangle $R\subset [0,1] ^{3}$.…

Classical Analysis and ODEs · Mathematics 2007-06-21 Michael T Lacey , Dmitry Bilyk

Diaconis and Perlman (1990) conjecture that the distribution functions of two weighted sums of iid gamma random variables cross exactly once if one weight vector majorizes the other. We disprove this conjecture when the shape parameter of…

Statistics Theory · Mathematics 2016-07-12 Yaming Yu

A strictly increasing sequence $\mathscr{A}$ of positive integers is said to be primitive if no term of $\mathscr{A}$ divides any other. Erd\H{o}s showed that the series $\sum_{a \in \mathscr{A}} \frac{1}{a \log a}$, where $\mathscr{A}$ is…

Number Theory · Mathematics 2017-11-28 Bakir Farhi

We prove the following conjecture of Leighton and Moitra. Let $T$ be a tournament on $[n]$ and $S_n$ the set of permutations of $[n]$. For an arc $uv$ of $T$, let $A_{uv}=\{\sigma \in S_n \, : \, \sigma(u)<\sigma(v) \}$. $\textbf{Theorem.}$…

Combinatorics · Mathematics 2017-03-13 Hüseyin Acan , Pat Devlin , Jeff Kahn

Let $S_n$ denote the symmetric group on $n$ elements, and $\Sigma\subseteq S_{n}$ a symmetric subset of permutations. Aldous' spectral gap conjecture, proved by Caputo, Liggett and Richthammer [arXiv:0906.1238], states that if $\Sigma$ is a…

Group Theory · Mathematics 2020-10-14 Ori Parzanchevski , Doron Puder

Stochastic convex optimization is one of the most well-studied models for learning in modern machine learning. Nevertheless, a central fundamental question in this setup remained unresolved: "How many data points must be observed so that…

Machine Learning · Computer Science 2023-11-10 Daniel Carmon , Roi Livni , Amir Yehudayoff

In their seminal paper from 1983, Erd\H{o}s and Szemer\'edi showed that any $n$ distinct integers induce either $n^{1+\epsilon}$ distinct sums of pairs or that many distinct products, and conjectured a lower bound of $n^{2-o(1)}$. They…

Combinatorics · Mathematics 2009-09-08 Noga Alon , Omer Angel , Itai Benjamini , Eyal Lubetzky

This is an exposition of the following `weak' Erd\H{o}s-Szemer\'edi conjecture for integer sets proved by Bourgain and Chang in 2004. For any $\gamma > 0$ there exists $\Lambda(\gamma) > 0$ such that for an arbitrary $A \subset \mathbb{N}$,…

Number Theory · Mathematics 2017-10-26 Dmitrii Zhelezov

The Littlewood conjecture, proven by Konyagin and McGehee-Pigno-Smith in the 1980s, states that if $A\subset \mathbb{Z}$ is a finite set of integers with $\lvert A\rvert=N$ then $\| \widehat{1_A}\|_1\geq c\log N$ for some absolute constant…

Number Theory · Mathematics 2026-04-21 Thomas F. Bloom , Ben Green

Let S_n=X_1+...+X_n be a sum of independent symmetric random variables such that |X_{i}|\leq 1. Denote by W_n=\epsilon_{1}+...+\epsilon_{n} a sum of independent random variables such that \prob{\eps_i = \pm 1} = 1/2. We prove that…

Probability · Mathematics 2019-11-13 Dainius Dzindzalieta , Matas Šileikis , Tomas Juškevičius

Let $A_n=(a_0,a_1,\dots,a_{n-1})$ be drawn uniformly at random from $\{-1,+1\}^n$ and define \[ M(A_n)=\max_{0<u<n}\,\Bigg|\sum_{j=0}^{n-u-1}a_ja_{j+u}\Bigg|\quad\text{for $n>1$}. \] It is proved that $M(A_n)/\sqrt{n\log n}$ converges in…

Combinatorics · Mathematics 2014-03-18 Kai-Uwe Schmidt

Barry Simon conjectured in 2005 that the Szeg\H{o} matrices, associated with Verblunsky coefficients $\{\alpha_n\}_{n\in\mathbb{Z}_+}$ obeying $\sum_{n = 0}^\infty n^\gamma |\alpha_n|^2 < \infty$ for some $\gamma \in (0,1)$, are bounded for…

Spectral Theory · Mathematics 2020-12-02 David Damanik , Jake Fillman , Shuzheng Guo , Darren C. Ong

In 1974, Erd\H{o}s and Kleitman conjectured that if a family $\mathcal{F}\subseteq 2^{[n]}$ contains no matching of size \(s\) and is maximal with respect to this property, then $ |\mathcal{F}|\ge \left(1-2^{-(s-1)}\right)\cdot 2^{n}. $ For…

Combinatorics · Mathematics 2026-03-20 Gennian Ge , Jialuo Wang , Zixiang Xu

The Johnson-Lindenstrauss lemma is a fundamental result in probability with several applications in the design and analysis of algorithms in high dimensional geometry. Most known constructions of linear embeddings that satisfy the…

Data Structures and Algorithms · Computer Science 2015-03-17 Raghu Meka
‹ Prev 1 3 4 5 6 7 10 Next ›