English
Related papers

Related papers: Furstenberg sets in finite fields: Explaining and …

200 papers

In 1974, Erd\H{o}s and Kleitman conjectured that if a family $\mathcal{F}\subseteq 2^{[n]}$ contains no matching of size \(s\) and is maximal with respect to this property, then $ |\mathcal{F}|\ge \left(1-2^{-(s-1)}\right)\cdot 2^{n}. $ For…

Combinatorics · Mathematics 2026-03-20 Gennian Ge , Jialuo Wang , Zixiang Xu

Let $ k, m, n $ be positive integers with $ k \geq 2 $. A $ k $-multiset of $ [n]_m $ is a collection of $ k $ integers from the set $ \{1, 2, \ldots, n\} $ in which the integers can appear more than once but at most $ m $ times. A family…

Combinatorics · Mathematics 2023-03-14 Jiaqi Liao , Zequn Lv , Mengyu Cao , Mei Lu

The classical Erd\H{o}s-Ginzburg-Ziv constant of a group $G$ denotes the smallest positive integer $\ell$ such that any sequence $S$ of length at least $\ell$ contains a zero-sum subsequence of length $\exp(G)$. In a recent paper, Caro and…

Combinatorics · Mathematics 2023-05-01 Simone Costa , Stefano Della Fiore

A family $\F$ of sets is said to be intersecting if any two sets in $\F$ have nonempty intersection. The celebrated Erd{\H o}s-Ko-Rado theorem determines the size and structure of the largest intersecting family of $k$-sets on an $n$-set…

Combinatorics · Mathematics 2019-09-09 Ali Taherkhani

The well-known Erdos-Ko-Rado Theorem states that if F is a family of k-element subsets of {1,2,...,n} (n>2k-1) such that every pair of elements in F has a nonempty intersection, then |F| is at most $\binom{n-1}{k-1}$. The theorem also…

Combinatorics · Mathematics 2008-08-08 Greg Brockman , Bill Kay

For a set $E\subset \mathbb F_q^d$, we define the $k$-resultant magnitude set as $ \Delta_k(E) =\{\|\textbf{x}_1 + \dots + \textbf{x}_k\|\in \mathbb F_q: \textbf{x}_1, \dots, \textbf{x}_k \in E\},$ where $\|\textbf{v}\|=v_1^2+\cdots+ v_d^2$…

Combinatorics · Mathematics 2015-02-06 David Covert , Doowon Koh , Youngjin Pi

For a subset $A$ of $\{1,2,\ldots,N\}^2$ of size $\alpha N^2$ we show existence of $(m,n)\neq(0,0)$ such that the set $A$ contains at least $(\alpha^3 - o(1))N^2$ triples of points of the form $(a,b)$, $(a+m,b+n)$, $(a-n,b+m)$. This answers…

Combinatorics · Mathematics 2021-12-06 Vjekoslav Kovač

The Furstenberg-S\'ark\"ozy theorem asserts that the difference set $E-E$ of a subset $E \subset \mathbb{N}$ with positive upper density intersects the image set of any polynomial $P \in \mathbb{Z}[n]$ for which $P(0)=0$. Furstenberg's…

Dynamical Systems · Mathematics 2023-04-03 Vitaly Bergelson , Andrew Best

In this note, we consider Szemer\'{e}di's theorem on $k$-term arithmetic progressions over finite fields $\mathbb{F}_p^n$, where the allowed set $S$ of common differences in these progressions is chosen randomly of fixed size. Combining a…

Number Theory · Mathematics 2025-08-05 Jason Zheng

The notion of $(k,m)$-agreeable society was introduced by Deborah Berg et al.: a family of convex subsets of $\R^d$ is called $(k,m)$-agreeable if any subfamily of size $m$ contains at least one non-empty $k$-fold intersection. In that…

Combinatorics · Mathematics 2012-07-10 Michael Abrahams , Meg Lippincott , Thierry Zell

Let $e(n,s)$ denote the maximum size of a family $\mathcal{F}$ of subsets of an $n$-element set that contains no $s$ pairwise disjoint members. In 1968, answering a question of Erd\H{o}s, Kleitman determined $e(sm-1,s)$ and $e(sm,s)$ for…

Combinatorics · Mathematics 2026-05-07 Andrey Kupavskii , Georgy Sokolov

For a family $\mathcal{F}$ of subsets of a finite set, define $\mathcal{D}(\mathcal{F})=\{F\setminus F': F, F'\in\mathcal{F}\}$. A family $\mathcal{F}$ is called intersecting if $F\cap F'\not=\emptyset$ for all $F, F'\in\mathcal{F}$. Frankl…

Combinatorics · Mathematics 2024-12-02 Yan zilong , Peng Yuejian

This paper establishes an analog of the Erd\H{o}s-Ko-Rado theorem to polynomial rings over finite fields, affirmatively answering a conjecture of C. Tompkins. A $k$-uniform family of subsets of a set of finite size $n$ is $l$-intersecting…

Number Theory · Mathematics 2024-10-25 Nika Salia , Dávid Tóth

Let $k$ and $m$ be positive integers. A collection of $k$-multisets from $\{1,..., m \}$ is intersecting if every pair of multisets from the collection is intersecting. We prove that for $m \geq k+1$, the size of the largest such collection…

Combinatorics · Mathematics 2011-11-23 Karen Meagher , Alison Purdy

Let $V$ denote an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. For an $m$-dimensional $\mathbb{F}_q$-subspace $U$ of $V$ assume that $\dim_q \left(\langle {\bf v}\rangle_{\mathbb{F}_{q^n}} \cap U\right) \geq 2$ for each non zero vector…

Combinatorics · Mathematics 2025-01-27 Bence Csajbók , Giuseppe Marino , Valentina Pepe

Erd\H{o}s showed that every set of $n$ positive integers contains a subset of size at least $n/(k+1)$ containing no solutions to $x_1 + \cdots + x_k = y$. We prove that the constant $1/(k+1)$ here is best possible by showing that if $(F_m)$…

Combinatorics · Mathematics 2014-12-17 Sean Eberhard

We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size at most $k$. We show that if for some $b \ge i \ge 0$ the shatter function $f_R$ of a set system $([n],R)$ satisfies $f_R(b) < 2^i(b-i+1)$…

Discrete Mathematics · Computer Science 2009-12-17 Otfried Cheong , Xavier Goaoc , Cyril Nicaud

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progression and such collection is also piecewise syndetic in Z. They used algebraic structure of beta N. The above result…

Combinatorics · Mathematics 2019-09-27 Sayan Goswami , Subhajit Jana

Suppose that $A \subset \{1,\dots, N\}$ has no two elements differing by a square. Then $|A| \ll N e^{-c\sqrt{\log N}}$.

Number Theory · Mathematics 2025-01-13 Ben Green , Mehtaab Sawhney

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $\lambda_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(\lambda_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and…

Classical Analysis and ODEs · Mathematics 2021-04-21 Richárd Balka , Márton Elekes , Viktor Kiss