English
Related papers

Related papers: On skew corner-free sets

200 papers

A $(k; r, s; n, q)$-set (short: $(r,s)$-set) of $\mathrm{PG}(n, q)$ is a set of points $X$ with $|X| = k$ such that no $s$-space contains more than $r$ points of $X$. We investigate the asymptotic size of $(r, s)$-sets for $n$ fixed and $q…

Combinatorics · Mathematics 2022-11-14 Ferdinand Ihringer , Jacques Verstraëte

A set of integers is called sum-free if it contains no triple $(x,y,z)$ of not necessarily distinct elements with $x+y=z$. In this paper, we provide a structural characterisation of sum-free subsets of $\{1,2,\ldots,n\}$ of density at least…

Combinatorics · Mathematics 2018-08-14 Tuan Tran

We prove that a subset of $\mathbb{F}_q^n$ that contains a hyperplane in any direction has size at least $q^{n}-O(q^2)$.

Combinatorics · Mathematics 2017-05-30 Beat Zurbuchen

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 the affine space $\mathbb{F}_q^n$ over the finite field of order $q$, a point set $S$ is said to be $(d,k,r)$-evasive if the intersection between $S$ and any variety, of dimension $k$ and degree at most $d$, has cardinality less than…

Combinatorics · Mathematics 2025-07-11 Jeck Lim , Jiaxi Nie , Ji Zeng

There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch…

Combinatorics · Mathematics 2025-01-06 William Gasarch , James Glenn , Clyde Kruskal

In this paper, we investigate a problem concerning quartets, which are a particular type of tree on four leaves. Loosely speaking, a set of quartets is said to be `definitive' if it completely encapsulates the structure of some larger tree,…

Combinatorics · Mathematics 2011-01-28 Chris Dowden

We generalize the Sarkozy-Furstenberg theorem on squares in difference sets of integers, and show that, given any positive definite function f:Z_N->C with density at least r(N), where r(N)=O((\log N)^{-c}), there is a perfect square s<=N/2…

Number Theory · Mathematics 2011-07-19 Sinisa Slijepcevic

A Kakeya set $S \subset (\mathbb{Z}/N\mathbb{Z})^n$ is a set containing a line in each direction. We show that, when $N$ is any square-free integer, the size of the smallest Kakeya set in $(\mathbb{Z}/N\mathbb{Z})^n$ is at least…

Combinatorics · Mathematics 2021-12-28 Manik Dhar , Zeev Dvir

We prove that if a subset of $(\mathbb{F}_q^n)^k$ (with $q$ an odd prime power) avoids a full-rank three-point pattern $\vec{x},\vec{x}+M_1\vec{d},\vec{x}+M_2\vec{d}$ then it is exponentially small, having size at most $3 \cdot c_q^{nk}$…

Combinatorics · Mathematics 2022-08-31 Mohamed Omar

We prove that |A^n| > c_n |A|^{[\frac{n+1}{2}]} for any finite subset A of a free group if A contains at least two noncommuting elements, where c_n>0 are constants not depending on A. Simple examples show that the order of these estimates…

Group Theory · Mathematics 2015-05-18 Stanislav Safin

The Corners Theorem states that for any $\alpha > 0$ there exists an $N_0$ such that for any abelian group $G$ with $|G| = N \geq N_0$ and any subset $A \subset G \times G$ with $|A| \ge \alpha N^2$ we can find a corner in $A$ , i.e. there…

Combinatorics · Mathematics 2023-06-22 Matei Mandache

A classical theorem of Spencer shows that any set system with n sets and n elements admits a coloring of discrepancy O(n^1/2). Recent exciting work of Bansal, Lovett and Meka shows that such colorings can be found in polynomial time. In…

Discrete Mathematics · Computer Science 2016-04-13 Thomas Rothvoss

We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.

Combinatorics · Mathematics 2009-04-14 James Currie , Narad Rampersad

We prove that if $f$ is a non zero cusp form of weight $k$ on $\Gamma_0(N)$ with character $\chi$ such that $N/(\text{conductor }\chi)$ square-free, then there exists a square-free $n\ll_{\epsilon} k^{3+\epsilon}N^{7/2+\epsilon}$ such that…

Number Theory · Mathematics 2020-02-03 Pramath Anamby , Soumya Das

We present constructions of symmetric complete sum-free sets in general finite cyclic groups. It is shown that the relative sizes of the sets are dense in $[0,\frac{1}{3}]$, answering a question of Cameron, and that the number of those…

Combinatorics · Mathematics 2017-05-02 Ishay Haviv , Dan Levy

We establish that if $d \geq 2k + 6$ and $q$ is odd and sufficiently large with respect to $\alpha \in (0,1)$, then every set $A\subseteq \mathbf{F}_q^d$ of size $|A| \geq \alpha q^d$ will contain an isometric copy of every spherical…

Combinatorics · Mathematics 2023-01-27 Neil Lyall , Akos Magyar , Hans Parshall

We show that in n-fold cartesian product, n >= 4, a related component need not be a full component. We also prove that when n >= 4, uniform boundedness of lengths of geodesics is not a necessary condition for boundedness of solutions of (1)…

Functional Analysis · Mathematics 2007-07-16 K Gowri Navada

In this paper we show that the largest possible size of a subset of $\mathbb{F}_q^n$ avoiding right angles, that is, distinct vectors $x,y,z$ such that $x-z$ and $y-z$ are perpendicular to each other is at most $O(n^{q-2})$. This improves…

Combinatorics · Mathematics 2020-12-16 Balázs Bursics , Dávid Matolcsi , Péter Pál Pach , Jakab Schrettner

In 2002, Koh and Tay conjectured that every bridgeless graph of order $n\geq 5$ and size at least ${n\choose 2}-n+5$ has an orientation of diameter two. Later, Cochran, Czabarka, Dankelmann and Sz\'{e}kely proved this conjecture and asked…

Combinatorics · Mathematics 2025-08-26 Sopon Boriboon , Teeradej Kittipassorn