English
Related papers

Related papers: Spread Furstenberg Sets

200 papers

We study product sets of finite arithmetic progressions of polynomials over a finite field. We prove a lower bound for the size of the product set, uniform in a wide range of parameters. We apply our results to resolve the function field…

Number Theory · Mathematics 2023-09-19 Lior Bary-Soroker , Noam Goldgraber

It is known that in $\mathbb{R}^n,n\geq 2$, a compact set which contains $n-1$ spheres with all radii in $[1/2,1]$ or with all possible centres in $[0,1]^n$ has full Hausdorff dimension. In fact the later set has positive Lebesgue measure.…

Classical Analysis and ODEs · Mathematics 2018-01-09 Han Yu

In this work, we introduce a natural notion concerning finite vector spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$, which forms a partial spread, is called almost affinely disjoint if any $(k+1)$-dimensional subspace…

Combinatorics · Mathematics 2021-06-29 Hedongliang Liu , Nikita Polyanskii , Ilya Vorobyev , Antonia Wachter-Zeh

By juxtaposing ideas from fractal geometry and dynamical systems, Furstenberg proposed a series of conjectures in the late 1960's that explore the relationship between digit expansions with respect to multiplicatively independent bases. In…

Number Theory · Mathematics 2025-01-09 Daniel Glasscock , Joel Moreira , Florian K. Richter

Given a finite set satisfying condition $\mathcal{A}$, the subset selection problem asks, how large of a subset satisfying condition $\mathcal{B}$ can we find? We make progress on three instances of subset selection problems in planar point…

Combinatorics · Mathematics 2024-12-20 József Balogh , Felix Christian Clemen , Adrian Dumitrescu , Dingyuan Liu

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

Combinatorics · Mathematics 2019-08-12 Pintu Debnath , Sayan Goswami

A set system $\mathcal{F}$ is $t$-\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least $t$. A set system $\mathcal{F}$ is $k$-\textit{Sperner}, if it does not contain a chain of length…

Combinatorics · Mathematics 2022-09-07 József Balogh , William B. Linz , Balázs Patkós

For integers $n \geq k \geq 1$, the {\em Kneser graph} $K(n, k)$ is the graph with vertex-set consisting of all the $k$-element subsets of $\{1,2,\ldots,n\}$, where two $k$-element sets are adjacent in $K(n,k)$ if they are disjoint. We show…

Combinatorics · Mathematics 2025-03-19 Hou Tin Chau , David Ellis , Ehud Friedgut , Noam Lifshitz

For $\alpha$ in $(0,1]$, a subset $E$ of $\RR$ is called Furstenberg set of type $\alpha$ or $F_\alpha$-set if for each direction $e$ in the unit circle there is a line segment $\ell_e$ in the direction of $e$ such that the Hausdorff…

Classical Analysis and ODEs · Mathematics 2012-11-13 Ursula Molter , Ezequiel Rela

In this survey we collect and discuss some recent results on the so called "Furstenberg set problem", which in its classical form concerns the estimates of the Hausdorff dimension of planar sets containing, for any direction, a subset of an…

Classical Analysis and ODEs · Mathematics 2013-05-17 Ezequiel Rela

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

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Combinatorics · Mathematics 2025-05-30 Rajko Nenadov , Lander Verlinde

The challenge of determining bounds for the minimal number of vectors in a three-dimensional Kochen-Specker (KS) set has captivated the quantum foundations community for decades. This paper establishes a weak lower bound of 10 vectors,…

Quantum Physics · Physics 2025-06-04 Tom Williams , Andrei Constantin

In this paper, we prove that if $S\subseteq\mathbb{R}^d$ is hyperplane absolute winning on a closed hyperplane diffuse set $L\subseteq\mathbb{R}^d$, then $\mathrm{dim}_H S\cap K=\mathrm{dim}_H K$ for any irreducible self-conformal set…

Dynamical Systems · Mathematics 2025-12-09 Junjie Huang , Bing Li , Bo Wang , Na Yuan

A family $\mathcal{F}$ of subsets of $[n]=\{1,2,\ldots,n\}$ shatters a set $A \subseteq [n]$ if for every $A' \subseteq A$ there is an $F \in \mathcal{F}$ such that $F \cap A=A'$. We develop a framework to analyze $f(n,k,d)$, the maximum…

Combinatorics · Mathematics 2024-10-29 Noga Alon , Varun Sivashankar , Daniel G. Zhu

We show that if $E \subset \mathbb{F}_q^d$, the $d$-dimensional vector space over the finite field with $q$ elements, and $|E| \geq \rho q^d$, where $ q^{-\frac{1}{2}}\ll \rho \leq 1$, then $E$ contains an isometric copy of at least $c…

Combinatorics · Mathematics 2010-09-22 David Covert , Derrick Hart , Alex Iosevich , Steven Senger , Ignacio Uriarte-Tuero

A $k$-configuration is a collection of $k$ distinct integers $x_1,\ldots,x_k$ together with their pairwise arithmetic means $\frac{x_i+x_j}{2}$ for $1 \leq i < j \leq k$. Building on recent work of Filmus, Hatami, Hosseini and Kelman on…

Number Theory · Mathematics 2025-01-20 Adrian Beker

In this paper, we consider the so-called "Furstenberg set problem" in high dimensions. First, following Wolff's work on the two dimensional real case, we provide "reasonable" upper bounds for the problem for $\mathbb{R}$ or $\mathbb{F}_p$.…

Combinatorics · Mathematics 2019-02-20 Ruixiang Zhang

Fix a field $F$. In this paper, we study the sets $\D_F(n) \subset [0,n]$ defined by [\D_F(n):= {0 \leq m \leq n: T^n-1\text{has a divisor of degree $m$ in} F[T]}.] When $\D_F(n)$ consists of all integers $m$ with $0 \leq m \leq n$, so that…

Number Theory · Mathematics 2012-06-12 Paul Pollack , Lola Thompson

We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if $A\subset\mathbb{R}^2$ is a Borel set of Hausdorff dimension $s>1$, then its distance set has Hausdorff…

Classical Analysis and ODEs · Mathematics 2019-12-17 Tamás Keleti , Pablo Shmerkin