English
Related papers

Related papers: Improved bounds for skew corner-free sets

200 papers

For large $R$, we consider measurable sets $A\subseteq [0,R]^2$ that avoid triples of points of the form $(x,y)$, $(x+t,y)$, $(x,y+1/t)$ with $x,y\in\mathbb{R}$ and $t>0$, i.e., the vertices of upward-oriented, axis-aligned right triangles…

Classical Analysis and ODEs · Mathematics 2026-05-29 Aleksandar Bulj , Vjekoslav Kovač

We construct near-optimal coresets for kernel density estimates for points in $\mathbb{R}^d$ when the kernel is positive definite. Specifically we show a polynomial time construction for a coreset of size $O(\sqrt{d}/\varepsilon\cdot…

Machine Learning · Computer Science 2019-04-15 Jeff M. Phillips , Wai Ming Tai

We show that if $A\subset \{1,\ldots,N\}$ has no solutions to $a-b=n^2$ with $a,b\in A$ and $n\geq 1$ then \[|A|\ll \frac{N}{(\log N)^{c\log\log \log N}}\] for some absolute constant $c>0$. This improves upon a result of…

Number Theory · Mathematics 2021-02-25 Thomas F. Bloom , James Maynard

We show that a set $A \subset \{0,1\}^{n}$ with edge-boundary of size at most $|A| (\log_{2}(2^{n}/|A|) + \epsilon)$ can be made into a subcube by at most $(2 \epsilon/\log_{2}(1/\epsilon))|A|$ additions and deletions, provided $\epsilon$…

Combinatorics · Mathematics 2013-11-28 David Ellis

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…

Combinatorics · Mathematics 2019-03-21 Christian Elsholtz , Péter Pál Pach

In this article, we study Steklov eigenvalues and mixed Steklov Neumann eigenvalues on a smooth bounded domain in $\mathbb{R}^{n}$, $n \geq 2$, having a spherical hole. We focus on two main results related to Steklov eigenvalues. First, we…

Spectral Theory · Mathematics 2024-12-24 Sagar Basak , Sheela Verma

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

Computational Geometry · Computer Science 2007-05-23 Qi Cheng

We prove that the upper bound for the van der Corput property of the set of shifted primes is O((log n)^{-1+o(1)}), giving an answer to a problem considered by Ruzsa and Montgomery for the set of shifted primes p-1. We construct normed…

Number Theory · Mathematics 2011-12-14 Sinisa Slijepcevic

We improve upper bounds on sphere packing densities and sizes of spherical codes in high dimensions. In particular, we prove that the maximal sphere packing densities $\delta_n$ in $\mathbb{R}^n$ satisfy \[\delta_n\leq \frac{1+o(1)}{e}\cdot…

Metric Geometry · Mathematics 2024-07-16 Masoud Zargar

Schmidt proved in 2014 that if $\varepsilon>0$, almost all binary sequences of length $n$ have peak sidelobe level between $(\sqrt{2}-\varepsilon)\sqrt{n\log n}$ and $(\sqrt{2}+\varepsilon)\sqrt{n\log n}$. Because of the small gap between…

Combinatorics · Mathematics 2015-12-04 Idris Mercer

We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\{1,...,n\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our…

Number Theory · Mathematics 2015-05-13 Daniel Katz

In this paper, we prove $\text{ex}(n, C_{2k})\le (16\sqrt{5}\sqrt{k\log k} + o(1))\cdot n^{1+1/k}$. We improved on Bukh--Jiang's method used in their 2017 publication, thereby reducing the best known upper bound by a factor of $\sqrt{5\log…

Combinatorics · Mathematics 2020-09-11 Zhiyang He

We show that for bounded domains in $\mathbb C^n$ with $\mathcal C^{1,1}$ smooth boundary, if there is a closed set $F$ of $2n-1$-Lebesgue measure $0$ such that $\partial \Omega \setminus F$ is $\mathcal C^{2}$-smooth and locally…

Complex Variables · Mathematics 2025-10-22 Quang Dieu Nguyen , Pascal J. Thomas

The union-closed sets conjecture states that in any nonempty union-closed family $\mathcal{F}$ of subsets of a finite set, there exists an element contained in at least a proportion $1/2$ of the sets of $\mathcal{F}$. Using the…

Combinatorics · Mathematics 2023-05-24 Lei Yu

We show that there exists an absolute constant $c_0<1$ such that for all $n \ge 2$, any measurable set $A \subset S^{n-1}$ of density at least $c_0$ contains $n$ pairwise orthogonal vectors. The result is sharp up to the value of the…

Metric Geometry · Mathematics 2025-06-12 Dmitrii Zakharov

Let $s(n)$ be the minimum number of edges in a graph that contains every $n$-vertex tree as a subgraph. Chung and Graham [J. London Math. Soc. 1983] claim to prove that $s(n)\leqslant O(n\log n)$. We point out a mistake in their proof. The…

Combinatorics · Mathematics 2025-08-06 Neel Kaul , David R. Wood

Two words have a reverse if they have the same pair of distinct letters on the same pair of positions, but in reversed order. A set of words no two of which have a reverse is said to be reverse-free. Let F(n,k) be the maximum size of a…

Combinatorics · Mathematics 2013-11-12 Josef Cibulka

We provide a sharp lower bound for the perimeter of the inner parallel sets of a convex body $\Omega$. The bound depends only on the perimeter and inradius $r$ of the original body and states that \[|\partial\Omega_t| \geq…

Metric Geometry · Mathematics 2020-05-05 Simon Larson

We investigate the poset of skew diagrams ordered by adding or forming the union of skew diagrams. We will show that a skew diagram which has at least n convex corners to the upper left and also to the lower right is larger than the skew…

Combinatorics · Mathematics 2011-04-04 Christian Gutschwager

Chung and Graham [J. London Math. Soc., 1983] claimed that there exists an $n$-vertex graph $G$ containing all $n$-vertex trees as subgraphs that has at most $\frac{5}{2}n \log_2 n + O(n)$ edges. We identify an error in their proof. This…

Combinatorics · Mathematics 2025-12-02 Jaehoon Kim , Minseo Kim