English
Related papers

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

200 papers

We show that for every $\varepsilon>0$ there is an absolute constant $c(\varepsilon)>0$ such that the following is true. The union of any $n$ arithmetic progressions, each of length $n$, with pairwise distinct differences must consist of at…

Combinatorics · Mathematics 2017-05-15 Shoni Gilboa , Rom Pinchasi

Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not…

Number Theory · Mathematics 2022-11-29 Petr Kucheriaviy

The Ramsey number $R(k)$ is the minimum $n \in \mathbb{N}$ such that every red-blue colouring of the edges of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $K_k$. We prove that \[ R(k) \leqslant (4 -…

Combinatorics · Mathematics 2025-08-06 Marcelo Campos , Simon Griffiths , Robert Morris , Julian Sahasrabudhe

Let $1 \leq a \leq b$ be integers. A triple of the form $(x,ax+d,bx+2d)$, where $x,d$ are positive integers is called an {\em (a,b)-triple}. The {\em degree of regularity} of the family of all $(a,b)$-triples, denoted dor($a,b)$, is the…

Combinatorics · Mathematics 2007-05-23 Nikos Frantzikinakis , Bruce Landman , Aaron Robertson

The Wiener index of a connected graph is the summation of all distances between unordered pairs of vertices of the graph. In this paper, we give an upper bound on the Wiener index of a $k$-connected graph $G$ of order $n$ for integers…

Combinatorics · Mathematics 2018-11-08 Zhongyuan Che , Karen L. Collins

A spanner is a sparse subgraph that approximately preserves the pairwise distances of the original graph. It is well known that there is a smooth tradeoff between the sparsity of a spanner and the quality of its approximation, so long as…

Data Structures and Algorithms · Computer Science 2020-05-12 Amir Abboud , Greg Bodwin

For a parabolic equation associated to a uniformly elliptic operator, we obtain a $W^{3, \varepsilon}$ estimate, which provides a lower bound on the Lebesgue measure of the set on which a viscosity solution has a quadratic expansion. The…

Analysis of PDEs · Mathematics 2014-10-09 Jean-Paul Daniel

It is shown, subject to the abc-conjecture, that \[\sum_{n\le N}\exp(2\pi i\alpha n^3)\ll_{\epsilon,\alpha}N^{5/7+\epsilon}\] for any $\epsilon>0$ and any quadratic irrational $\alpha$.

Number Theory · Mathematics 2009-05-13 D. R. Heath-Brown

In this paper, we present counterexamples showing that for any $p\in (1,\infty)$, $p\neq 2$, there is a non-divergence form uniformly elliptic operator with piecewise constant coefficients in $\mathbb{R}^2$ (constant on each quadrant in…

Analysis of PDEs · Mathematics 2014-04-24 Hongjie Dong , Doyoon Kim

Van der Waerden's theorem asserts that if you color the natural numbers with, say, five different colors, then you can always find arbitrarily long sequences of numbers that have the same color and that form an arithmetic progression.…

Functional Analysis · Mathematics 2012-06-06 Heinrich-Gregor Zirnstein

We derive the asymptotic behaviors of $\log_{r}W(r, k)$ and $\log_{k}W(r, k)$, when $W(r, k)$ is a van der Waerden Number. We use the approach to consider the subsets on the real line in which $W(2, 7)$ might lie.

Number Theory · Mathematics 2016-02-23 Robert J Betts

Let $c$ denote the largest constant such that every $C_{6}$-free graph $G$ contains a bipartite and $C_4$-free subgraph having $c$ fraction of edges of $G$. Gy\H{o}ri et al. showed that $\frac{3}{8} \le c \le \frac{2}{5}$. We prove that…

Combinatorics · Mathematics 2017-08-21 Dániel Grósz , Abhishek Methuku , Casey Tompkins

For a given positive integer $n$, how long can the process $x \mapsto n\text{ }(\text{mod } x)$ last before reaching $0$? We improve Erd\H{o}s and Shallit's upper bound of $O(n^{\frac{1}{3}+\varepsilon})$ to…

Number Theory · Mathematics 2022-11-16 Zachary Chase , Mayank Pandey

Let k be a number field, and denote by k^[d] the compositum of all degree d extensions of k in a fixed algebraic closure. We first consider the question of whether all algebraic extensions of k of degree less than d lie in k^[d]. We show…

Number Theory · Mathematics 2017-05-09 Itamar Gal , Robert Grizzard

Using computational techniques we derive six new upper bounds on the classical two-color Ramsey numbers: R(3,10) <= 42, R(3,11) <= 50, R(3,13) <= 68, R(3,14) <= 77, R(3,15) <= 87, and R(3,16) <= 98. All of them are improvements by one over…

Combinatorics · Mathematics 2013-03-21 Jan Goedgebeur , Stanisław P. Radziszowski

Let $G$ be a connected graph of order $n$.The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. In this paper we show that the well-known upper bound $\big( \frac{n}{\delta+1}+2\big) {n…

Combinatorics · Mathematics 2023-06-22 Peter Dankelmann , Alex Alochukwu

We show that for integer $n>0$, any subset $A \subset Z_4^n$ free of three-term arithmetic progressions has size $|A| < 4^{c n}$, with an absolute constant $c \approx 0.926$.

Number Theory · Mathematics 2016-05-24 Ernie Croot , Vsevolod Lev , Peter Pach

We develop recent ideas of Elsholtz, Proske, and Sauermann to construct denser subsets of $\{1,\dots,N\}$ that lack arithmetic progressions of length $3$. This gives the first quasipolynomial improvement since the original construction of…

Combinatorics · Mathematics 2024-07-03 Zach Hunter

Let $A^2(D)$ be the Bergman space over the open unit disk $D$ in the complex plane. Korenblum conjectured that there is an absolute constant $c \in (0,1)$ such that whenever $|f(z)|\le |g(z)|$ in the annulus $c<|z|<1$ then $||f(z)|| \le…

Complex Variables · Mathematics 2015-05-13 Chun-Yen Shen

We prove a new upper bound for diagonal two-colour Ramsey numbers, showing that there exists a constant $C$ such that \[r(k+1, k+1) \leq k^{- C \frac{\log k}{\log \log k}} \binom{2k}{k}.\]

Combinatorics · Mathematics 2007-05-23 David Conlon
‹ Prev 1 3 4 5 6 7 10 Next ›