English
Related papers

Related papers: A Note on Lower Bounds in Szemer\'edi's Theorem wi…

200 papers

In this paper we obtain Berry-Esse\'en bounds on partial sums of functionals of heavy-tailed moving averages, including the linear fractional stable noise, stable fractional ARIMA processes and stable Ornstein-Uhlenbeck processes. Our rates…

Probability · Mathematics 2019-04-15 Andreas Basse-O'Connor , Mark Podolskij , Christoph Thäle

Nazarov and Tarasov recently generalized the notion of the rank of a partition to skew partitions. We give several characterizations of the rank of a skew partition and one possible characterization that remains open. One of the…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

We show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…

Number Theory · Mathematics 2025-09-25 Le Duc Hieu

In this paper, we prove super-polynomial lower bounds for the model of \emph{sum of ordered set-multilinear algebraic branching programs}, each with a possibly different ordering ($\sum \mathsf{smABP}$). Specifically, we give an explicit…

Computational Complexity · Computer Science 2024-02-20 Prerona Chatterjee , Deepanshu Kush , Shubhangi Saraf , Amir Shpilka

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

Combinatorics · Mathematics 2020-10-20 Mehdi Makhul , Oliver Roche-Newton , Sophie Stevens , Audie Warren

We derive new bounds of the remainder in a combinatorial central limit theorem without assumptions on independence and existence of moments of summands. For independent random variables our theorems imply Esseen and Berry-Esseen type…

Probability · Mathematics 2014-05-08 Andrei N. Frolov

Obtaining superlinear lower bounds on tensor rank is a major open problem in complexity theory. In this paper we propose a generalization of the approach used by Strassen in the proof of his 3n/2 border rank lower bound. Our approach…

Computational Complexity · Computer Science 2020-07-07 Pascal Koiran

A version of the fundamental mean-square convergence theorem is proved for stochastic differential equations (SDE) which coefficients are allowed to grow polynomially at infinity and which satisfy a one-sided Lipschitz condition. The…

Numerical Analysis · Mathematics 2013-11-26 M. V. Tretyakov , Z. Zhang

Let $\mathrm{R}$ be a real closed field. The problem of obtaining tight bounds on the Betti numbers of semi-algebraic subsets of $\mathrm{R}^k$ in terms of the number and degrees of the defining polynomials has been an important problem in…

Algebraic Geometry · Mathematics 2016-10-06 Saugata Basu , Cordian Riener

We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…

Combinatorics · Mathematics 2011-04-29 Alexander Barg , Oleg R. Musin

A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…

Symbolic Computation · Computer Science 2026-02-11 Jean-Guillaume Dumas , Stefano Lia , John Sheekey

A difficult problem in the theory of random tensors is to calculate the expectation values of polynomials in the tensor entries, even in the large N limit and in a Gaussian distribution. Here we address this issue, focusing on a family of…

Mathematical Physics · Physics 2013-10-15 Valentin Bonzom , Frederic Combes

Let T be a bounded linear operator acting on a complex Banach space X and (\lambda_n) a sequence of complex numbers. Our main result is that if |\lambda_n|/|\lambda_{n+1}| \to 1 and the sequence (\lambda_n T^n) is frequently universal then…

Functional Analysis · Mathematics 2013-10-14 George Costakis , Ioannis Parissis

Let $A$ be an isotropic, sub-gaussian $m \times n$ matrix. We prove that the process $Z_x := \|Ax\|_2 - \sqrt m \|x\|_2$ has sub-gaussian increments. Using this, we show that for any bounded set $T \subseteq \mathbb{R}^n$, the deviation of…

Probability · Mathematics 2016-06-08 Christopher Liaw , Abbas Mehrabian , Yaniv Plan , Roman Vershynin

We prove an improvement on Schmidt's upper bound on the number of number fields of degree $n$ and absolute discriminant less than X for $6 \leq n \leq 94$. We carry this out by improving and applying a uniform bound on the number of monic…

Number Theory · Mathematics 2022-10-04 Manjul Bhargava , Arul Shankar , Xiaoheng Wang

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Combinatorics · Mathematics 2026-01-05 Saugata Basu , Laxmi Parida

For a set of permutations (patterns) $\Pi$ in $S_k$, consider the set of all permutations in $S_n$ that avoid all patterns in $\Pi$. An important problem in current algebraic combinatorics is to find pattern sets $\Pi$ such that the…

Combinatorics · Mathematics 2022-10-24 Avichai Marmor

Two versions of the Ajtai-Szemer\'edi Theorem are considered in the Cartesian square of a finite non-Abelian group $G$. In case $G$ is sufficiently quasirandom, we obtain strong forms of both versions: if $E \subseteq G\times G$ is fairly…

Combinatorics · Mathematics 2015-05-20 Tim Austin

Consider a stationary, weakly dependent sequence of random variables. Given only mild conditions, allowing for polynomial decay of the autocovariance function, we show a Berry-Esseen bound of optimal order $n^{-1/2}$ for studentized…

Probability · Mathematics 2025-04-22 Moritz Jirak

In 1975 Szemer\'edi proved the long-standing conjecture of Erd\H{o}s and Tur\'an that any subset of $\bbZ$ having positive upper Banach density contains arbitrarily long arithmetic progressions. Szemer\'edi's proof was entirely…

Dynamical Systems · Mathematics 2010-06-09 Tim Austin
‹ Prev 1 8 9 10 Next ›