English
Related papers

Related papers: A subexponential upper bound for van der Waerden n…

200 papers

We show that there exists an absolute constant $c > 0$, such that, for any finite set $A$ of quaternions, \[ \max\{|A+A, |AA| \} \gtrsim |A|^{4/3 + c}. \] This generalizes a sum-product bound for real numbers proved by Konyagin and…

Combinatorics · Mathematics 2021-11-11 Abdul Basit , Ben Lund

Suppose that f : F_p^n -> [0,1] has expected value t in [p^(-n/9),1] (so, the density t can be quite low!). Furthermore, suppose that support(f) has no three-term arithmetic progressions. Then, we develop non-trivial lower bounds for f_j,…

Combinatorics · Mathematics 2007-07-11 Ernie Croot

We prove a strengthening of the trickle down theorem for partite complexes. Given a $(d+1)$-partite $d$-dimensional simplicial complex, we show that if "on average" the links of faces of co-dimension 2 are $\frac{1-\delta}{d}$-(one-sided)…

Discrete Mathematics · Computer Science 2023-06-21 Dorna Abdolazimi , Shayan Oveis Gharan

Let p_n denote the persistence probability that the first n iterated partial sums of integrable, zero-mean, i.i.d. random variables X_k, are negative. We show that p_n is bounded above up to universal constant by the square root of the…

Probability · Mathematics 2011-02-01 Amir Dembo , Fuchang Gao

Let $W_t$ denote the wheel on $t+1$ vertices. We prove that for every integer $t \geq 3$ there is a constant $c=c(t)$ such that for every integer $k\geq 1$ and every graph $G$, either $G$ has $k$ vertex-disjoint subgraphs each containing…

Discrete Mathematics · Computer Science 2018-10-23 Pierre Aboulker , Samuel Fiorini , Tony Huynh , Gwenaël Joret , Jean-Florent Raymond , Ignasi Sau

We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…

Probability · Mathematics 2020-03-02 Gil Kur

We study the volume of maximal representations from a surface group into $\mathrm{SO}_0(2,3)$. We show that it is bounded from above, uniformly in the genus of the surface. We also prove that on the Gothen components, it is bounded from…

Differential Geometry · Mathematics 2026-05-07 Timothé Lemistre

We prove that the decreasing rearrangement of a dyadic A1 weight w with dyadic A1 constant [w]_{1,T}=c with respect to a tree T of homogeneity k,on a non-atomic probability space, is a usual A1 weight on (0,1] with A1 constant not more than…

Functional Analysis · Mathematics 2012-08-01 Eleftherios Nikolidakis

A graph $G$ is 3-colorable if and only if it maps homomorphically to the complete 3-vertex graph $K_3$. The last condition can be checked by a $k$-consistency algorithm where the parameter $k$ has to be chosen large enough, dependent on…

Computational Complexity · Computer Science 2014-02-18 Albert Atserias , Anuj Dawar , Oleg Verbitsky

A conjecture of Rosenberger says that a group of the form $\langle x,y|x^p=y^q=W(x,y)^r=1\rangle$ (with $r>1$) is either virtually solvable or contains a non-abelian free subgroup. This note is an account of an attack on the conjecture in…

Group Theory · Mathematics 2024-05-24 James Howie

Let $D$ be a set of positive integers. A $D$-diffsequence of length $k$ is a sequence of positive integers $a_1 < \cdots < a_k$ such that $a_{i+1}-a_i\in D$ for $i=1,\ldots,k-1$. For $D=\{2^i\mid i\in \mathbb{Z}_{\ge 0}\}$, it is known that…

Combinatorics · Mathematics 2025-09-01 Kanav Talwar , Utkarsh Gupta

Let $v(k)$ be the smallest integer larger than $1$ that does not occur among the denominators in any identity of the form $$ 1=\frac1{n_1}+\cdots+\frac1{n_k}, $$ where $1 \le n_1<\cdots<n_k$ are pairwise distinct integers. In their 1980…

Number Theory · Mathematics 2026-05-26 Wouter van Doorn , Quanyu Tang

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

Combinatorics · Mathematics 2026-04-29 Alexander Povolotsky

In this paper, we are interested in the problem of scattering by strictly convex obstacles in the plane. We provide an upper bound for the number $N(r,\gamma)$ of resonances in the box $\{r \le \Re(\lambda) \le r + 1$; $\Im(\lambda) \ge -…

Analysis of PDEs · Mathematics 2023-01-27 Lucas Vacossin

We prove a dispersive estimate for the evolution of Schroedinger operators H = -\Delta + V(x) in three dimensions. The potential should belong to the closure of bounded compactly-supported functions with respect to the golbal Kato norm.…

Analysis of PDEs · Mathematics 2016-08-31 Marius Beceanu , Michael Goldberg

The van der Waerden simplicial complex, denoted ${\tt vdw}(n,k)$, is the simpicial complex whose facets correspond to the arithmetic progressions of length $k$ in the set $\{1,\ldots,n\}$. We study the Lefschetz properties of the Artinian…

Commutative Algebra · Mathematics 2026-04-01 Naveena Ragunathan , Adam Van Tuyl

Let $d$ be a probability distribution. Under certain mild conditions we show that $$ \lim_{x\to\infty}x\sum_{n=1}^\infty \frac{d^{*n}(x)}{n}=1,\qquad\text{where}\quad d^{*n}:=\underbrace{\,d*d*\cdots*d\,}_{n\text{ times}}. $$ For a…

Number Theory · Mathematics 2015-05-14 William D. Banks , Konstantin A. Makarov

We prove that there exist infinitely many coprime numbers $a$, $b$, $c$ with $a+b=c$ and $c>\operatorname{rad}(abc)\exp(6.563\sqrt{\log c}/\log\log c)$. These are the most extremal examples currently known in the $abc$ conjecture, thereby…

Number Theory · Mathematics 2024-06-05 Curtis Bright

A graph is $(c_1, c_2, ..., c_k)$-colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, ..., V_k$, such that for every $i: 1\leq i\leq k$ the subgraph $G[V_i]$ has maximum degree at most $c_i$. We show that every planar…

Combinatorics · Mathematics 2012-08-17 Owen Hill , Gexin Yu

We study off-diagonal Ramsey numbers $r(H, K_n^{(k)})$ of $k$-uniform hypergraphs, where $H$ is a fixed linear $k$-uniform hypergraph and $K_n^{(k)}$ is complete on $n$ vertices. Recently, Conlon et al.\ disproved the folklore conjecture…

Combinatorics · Mathematics 2025-07-10 Xiaoyu He , Jiaxi Nie , Yuval Wigderson , Hung-Hsun Hans Yu
‹ Prev 1 8 9 10 Next ›