English
Related papers

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

200 papers

Let M be a subset of {0, .., n} and F be a family of subsets of an n element set such that the size of A intersection B is in M for every A, B in F. Suppose that l is the maximum number of consecutive integers contained in M and n is…

Combinatorics · Mathematics 2012-05-04 Dhruv Mubayi , Vojtech Rodl

In this paper, we show that circular $(s,t)$-Furstenberg sets in $\mathbb R^2$ have Hausdorff dimension at least $$\max\{\frac{t}3+s,(2t+1)s-t\} \text{ for all $0<s,t\le 1$}.$$ This result extends the previous dimension estimates on…

Classical Analysis and ODEs · Mathematics 2023-02-28 Jiayin Liu

A $k$-uniform hypergraph with $n$ vertices is an $(n,k,\ell)$-omitting system if it does not contain two edges whose intersection has size exactly $\ell$. If in addition it does not contain two edges whose intersection has size greater than…

Combinatorics · Mathematics 2021-01-13 Tom Bohman , Xizhi Liu , Dhruv Mubayi

Given a family $\mathcal{F}$ of subsets of $[n]$, we say two sets $A, B \in \mathcal{F}$ are comparable if $A \subset B$ or $B \subset A$. Sperner's celebrated theorem gives the size of the largest family without any comparable pairs. This…

Combinatorics · Mathematics 2014-11-18 Noga Alon , Shagnik Das , Roman Glebov , Benny Sudakov

A family of axis-aligned boxes in $\er^d$ is \emph{$k$-neighborly} if the intersection of every two of them has dimension at least $d-k$ and at most $d-1$. Let $n(k,d)$ denote the maximum size of such a family. It is known that $n(k,d)$ can…

Combinatorics · Mathematics 2023-03-06 Noga Alon , Jarosław Grytczuk , Andrzej P. Kisielewicz , Krzysztof Przesławski

Given natural numbers $k \leq s \leq n$, we ask: what is the minimal VC-dimension of a family $\mathcal{F}$ of $s$-subsets of $[n]$ that covers all $k$-subsets of $[n]$? We first show that for sufficiently large $n$ this number is always…

Combinatorics · Mathematics 2024-01-24 George Peterzil , Johanna Steinmeyer

We introduce Fermi Sets, a universal and physically interpretable neural architecture for fermionic many-body wavefunctions. Building on a ``parity-graded'' representation [1], we prove that any continuous fermionic wavefunction on a…

Strongly Correlated Electrons · Physics 2026-04-21 Liang Fu

We call a family $\mathcal{F}$ $(3,2,\ell)$-intersecting if $|A \cap B|+|B \cap C|+|C \cap A| \geq \ell$ for all $A$, $B$, $C \in \mathcal{F}$. We try to look for the maximum size of such a family $\mathcal{F}$ in case when $\mathcal{F}…

Combinatorics · Mathematics 2025-11-25 Kartal Nagy

Folkman's Theorem asserts that for each $k \in \mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \subset [n]$ of size $k$ with the property that all the…

Combinatorics · Mathematics 2017-06-28 József Balogh , Sean Eberhard , Bhargav Narayanan , Andrew Treglown , Adam Zsolt Wagner

An $(n,k)$-Sperner partition system is a collection of partitions of some $n$-set, each into $k$ nonempty classes, such that no class of any partition is a subset of a class of any other. The maximum number of partitions in an…

Combinatorics · Mathematics 2020-11-13 Yanxun Chang , Charles J. Colbourn , Adam Gowty , Daniel Horsley , Junling Zhou

A family $\mathcal{F}$ of subsets of $\{1,2,\ldots,n\}$ is called a $t$-intersecting family if $|F\cap G| \geq t$ for any two members $F, G \in \mathcal{F}$ and for some positive integer $t$. If $t=1$, then we call the family $\mathcal{F}$…

Combinatorics · Mathematics 2022-11-23 Jagannath Bhanja , Sayan Goswami

A $k$-wise $\ell$-divisible set family is a collection $\mathcal{F}$ of subsets of ${ \{1,\ldots,n \} }$ such that any intersection of $k$ sets in $\mathcal{F}$ has cardinality divisible by $\ell$. If $k=\ell=2$, it is well-known that…

Combinatorics · Mathematics 2025-04-29 Chenying Lin , Gilles Zémor

One of the main problems of the research area of network coding is to compute good lower and upper bounds of the achievable cardinality of so-called subspace codes in $\operatorname{PG}(n,q)$, i.e., the set of subspaces of $\mathbb{F}_q^n$,…

Combinatorics · Mathematics 2017-09-27 Daniel Heinlein , Sascha Kurz

Furstenberg, Katznelson and Weiss proved in the early 1980s that every measurable subset of the plane with positive density at infinity has the property that all sufficiently large real numbers are realised as the Euclidean distance between…

Combinatorics · Mathematics 2013-01-18 Ian D. Morris

Let $k \subset K$ be an extension of fields, and let $A \subset M_{n}(K)$ be a $k$-algebra. We study parameter spaces of $m$-dimensional subspaces of $K^{n}$ which are invariant under $A$. The space $\mathbb{F}_{A}(m,n)$, whose $R$-rational…

Algebraic Geometry · Mathematics 2009-02-27 A. Nyman

We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmerkin in 2012: if $\log r / \log s$ is irrational and $X$ and $Y$ are $\times r$- and $\times s$-invariant subsets of $[0,1]$, respectively,…

Combinatorics · Mathematics 2024-01-09 Daniel Glasscock , Joel Moreira , Florian K. Richter

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

Combinatorics · Mathematics 2022-04-22 Bela Bollobas , Imre Leader , Marius Tiba

Federer's characterization states that a set $E\subset \mathbb{R}^n$ is of finite perimeter if and only if $\mathcal H^{n-1}(\partial^*E)<\infty$. Here the measure-theoretic boundary $\partial^*E$ consists of those points where both $E$ and…

Metric Geometry · Mathematics 2020-01-08 Panu Lahti

A family of vectors $A \subset [k]^n$ is said to be intersecting if any two elements of $A$ agree on at least one coordinate. We prove, for fixed $k \ge 3$, that the size of a symmetric intersecting subfamily of $[k]^n$ is $o(k^n)$, which…

Combinatorics · Mathematics 2021-07-01 Sean Eberhard , Jeff Kahn , Bhargav Narayanan , Sophie Spirkl

Ever since the famous Erd\H{o}s-Ko-Rado theorem initiated the study of intersecting families of subsets, extremal problems regarding intersecting properties of families of various combinatorial objects have been extensively investigated.…

Combinatorics · Mathematics 2021-01-12 Xiangliang Kong , Yuanxiao Xi , Bingchen Qian , Gennian Ge
‹ Prev 1 3 4 5 6 7 10 Next ›