Related papers: A new lower bound for the Ramsey numbers $R(3,k)$

Constructing small-sized coresets for various clustering problems in different metric spaces has attracted significant attention for the past decade. A central problem in the coreset literature is to understand what is the best possible…

We derive some combinatorial formulas related to the diagonal Ramsey numbers $R(k)$. Each formula is a statement of the form "$F(n,k) = 0$ if and only if $n \ge R(k)$," where $F(n,k)$ is a combinatorial expression which depends on $n$ and…

Ramsey's theorem states that if $N$ is sufficiently large, then no matter how one colors the edges among $N$ vertices with two colors, there are always $k$ vertices spanning edges in only one color. Given this theorem, it is natural to ask…

Given a non-principal Dirichlet character chi mod q, an important problem in number theory is to obtain good estimates for the size of L(1,chi). In this paper we focus on sharpening the upper bounds known for |L(1,chi)|; in particular, we…

A weakly optimal $K_s$-free $(n,d,\lambda)$-graph is a $d$-regular $K_s$-free graph on $n$ vertices with $d=\Theta(n^{1-\alpha})$ and spectral expansion $\lambda=\Theta(n^{1-(s-1)\alpha})$, for some fixed $\alpha>0$. Such a graph is called…

We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…

We say that a subset $M$ of $\mathbb R^n$ is exponentially Ramsey if there are $\epsilon>0$ and $n_0$ such that $\chi(\mathbb R^n,M)\ge(1+\epsilon)^n$ for any $n>n_0$, where $\chi(\mathbb R^n,M)$ stands for the minimum number of colors in a…

Burr and Erd\H{o}s in 1975 conjectured, and Chv\'atal, R\"odl, Szemer\'edi and Trotter later proved, that the Ramsey number of any bounded degree graph is linear in the number of vertices. In this paper, we disprove the natural directed…

Ramsey-type problems for linear equations began with Schur's theorem and were systematically generalized by Richard Rado. In the off-diagonal framework for two colors, one considers two different linear equations…

For $s \ge 4$, the 3-uniform tight cycle $C^3_s$ has vertex set corresponding to $s$ distinct points on a circle and edge set given by the $s$ cyclic intervals of three consecutive points. For fixed $s \ge 4$ and $s \not\equiv 0$ (mod 3) we…

In a recent paper, Oliver Riordan shows that for $r \ge 4$ and $p$ up to and slightly larger than the threshold for a $K_r$-factor, the hypergraph formed by the copies of $K_r$ in $G(n,p)$ contains a copy of the binomial random hypergraph…

Already since the work by Abbe and Rayleigh the difficulty of super resolution where one wants to recover a collection of point sources from low-resolved microscopy measurements is thought to be dependent on whether the distance between the…

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

This paper sets out the results of a range of searches for linear and cyclic graph colourings with specific Ramsey properties. The new graphs comprise mainly 'template graphs' which can be used in a construction described by the current…

Let $R_k(H;K_m)$ be the smallest number $N$ such that every coloring of the edges of $K_{N}$ with $k+1$ colors has either a monochromatic $H$ in color $i$ for some $1\leqslant i\leqslant k$, or a monochromatic $K_{m}$ in color $k+1$. In…

Let $\frac{a_1}{b_1}, \frac{a_2}{b_2}, \ldots$ be the Farey fractions of order $n$. We then prove that the inequality $(a_l - a_k)(b_l - b_k) \ge 0$ holds for all $k$ and $l > k$ with $l-k \le \left(\frac{1}{12} - o(1) \right)n$, sharpening…

We establish sharp upper bounds for the $2k$th moment of the Riemann zeta function on the critical line, for all real $0 \leqslant k \leqslant 2$. This improves on earlier work of Ramachandra, Heath-Brown and Bettin-Chandee-Radziwi\l\l

We give a polynomial improvement to the cycle-complete Ramsey numbers \[ r(C_{\ell},K_k) \geq k^{1+1/(\ell- 2) + \varepsilon_{\ell} + o(1)}, \] for all fixed odd $\ell > 7$ with $k \rightarrow \infty$, for some $\varepsilon_{\ell} > 0$.

We give an elementary proof of the fact that regressive Ramsey numbers are Ackermannian. This fact was first proved by Kanamori and McAloon with mathematical logic techniques.

In an additive group (G,+), a three-dimensional corner is the four points g, g+d(1,0,0), g+d(0,1,0), g+d(0,0,1), where g is in G^3, and d is a non-zero element of G. The Ramsey number of interest is R_3(G) the maximal cardinality of a…