English
Related papers

Related papers: Simple proofs for Furstenberg sets over finite fie…

200 papers

Let $F$ be a global field, $A$ a central simple algebra over $F$ and $K$ a finite (separable or not) field extension of $F$ with degree $[K:F]$ dividing the degree of $A$ over $F$. An embedding of $K$ in $A$ over $F$ exists implies an…

Number Theory · Mathematics 2013-03-05 Sheng-Chi Shih , Tse-Chung Yang , Chia-Fu Yu

For a prime power $q$ and a positive integer $n$, we say a subspace $U$ of ${\mathbb{F}_q^n}$ is {\em cyclically covering} if the union of the cyclic shifts of $U$ is equal to $\mathbb{F}_q^n$. We investigate the problem of determining the…

Combinatorics · Mathematics 2019-05-30 Peter Cameron , David Ellis , William Raynaud

It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…

Quantum Physics · Physics 2007-05-23 Adonai S. Sant'Anna

We prove a version of the Cauchy-Davenport theorem for general linear maps. For subsets $A,B$ of the finite field $\mathbb{F}_p$, the classical Cauchy-Davenport theorem gives a lower bound for the size of the sumset $A+B$ in terms of the…

Combinatorics · Mathematics 2015-08-12 Simao Herdade , John Kim , Swastik Kopparty

We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…

Combinatorics · Mathematics 2022-05-05 Ali Mohammadi , Giorgis Petridis

Kirszbraun's Theorem states that every Lipschitz map $S\to\mathbb R^n$, where $S\subseteq \mathbb R^m$, has an extension to a Lipschitz map $\mathbb R^m \to \mathbb R^n$ with the same Lipschitz constant. Its proof relies on Helly's Theorem:…

Logic · Mathematics 2014-02-26 Matthias Aschenbrenner , Andreas Fischer

A Kakeya set in $\mathbb{F}_q^n$ is a set containing a line in every direction. We show that every Kakeya set in $\mathbb{F}_q^n$ has density at least $1/2^{n-1}$, matching the construction by Dvir, Kopparty, Saraf and Sudan.

Combinatorics · Mathematics 2021-12-14 Boris Bukh , Ting-Wei Chao

Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asyptotically sharp version of Freiman's theorem in F_2^n: if A in F_2^n is a set for which |A + A| <= K|A| then A is…

Combinatorics · Mathematics 2007-05-23 Ben Green , Terence Tao

The $k$-subset sum problem over finite fields is a classical NP-complete problem.Motivated by coding theory applications, a more complex problem is the higher $m$-th moment $k$-subset sum problem over finite fields. We show that there is a…

Number Theory · Mathematics 2019-10-22 Tim Lai , Alicia Marino , Angela Robinson , Daqing Wan

For a discrete group G, we consider the minimal C*-subalgebra of $\ell^\infty(G)$ that arises as the image of a unital positive G-equivariant projection. This algebra always exists and is unique up to isomorphism. It is trivial if and only…

Operator Algebras · Mathematics 2014-10-10 Mehrdad Kalantar , Matthew Kennedy

It is still open whether there exist infinitely many Fermat primes or infinitely many composite Fermat numbers. The same question concerning the Mersenne numbers is also unsolved. Extending some results from [9], we characterizethe the…

General Topology · Mathematics 2022-11-15 Menachem Shlossberg

The author, together with Nagy, studied the following problem on unavoidable intersections of given size in binary affine spaces. Given an $m$-element set $S\subseteq \mathbb{F}_2^n$, is there guaranteed to be a $[k,t]$-flat, that is, a…

Combinatorics · Mathematics 2025-06-02 Benedek Kovács

Let $L$ be a set of lines of an affine space over a field and let $S$ be a set of points with the property that every line of $L$ is incident with at least $N$ points of $S$. Let $D$ be the set of directions of the lines of $L$ considered…

Combinatorics · Mathematics 2016-05-04 Simeon Ball , Aart Blokhuis , Diego Domenzain

A generating set for a finite group $G$ is said to be minimal if no proper subset generates $G$, and $m(G)$ denotes the maximal size of a minimal generating set for $G$. We prove a conjecture of Lucchini, Moscatiello and Spiga by showing…

Group Theory · Mathematics 2023-07-20 Scott Harper

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

Let $G$ be a finite group acting on a vector space $V = \mathbb{F}_p^n$ over a prime field. Given finite sets $S \subset G$ and $E \subset V$, we study the restricted orbit union $S(E) = \bigcup_{g\in S} g(E)$ and establish quantitative…

Combinatorics · Mathematics 2026-02-10 Norbert Hegyvári , Le Quang Hung , Alex Iosevich , Thang Pham

We prove the discrete analogue of Kakeya conjecture over $\mathbb{R}^n$. This result suggests that a (hypothetically) low dimensional Kakeya set cannot be constructed directly from discrete configurations. We also prove a generalization…

Combinatorics · Mathematics 2014-09-04 Ruixiang Zhang

Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…

Metric Geometry · Mathematics 2022-03-23 Brett Leroux , Luis Rademacher

A set of locally finite perimeter $E \subset \mathbb{R}^{n}$ is called an anisotropic minimal surface in an open set $A$ if $\Phi(E;A) \le \Phi(F;A)$ for some surface energy $\Phi(E;A) = \int_{\partial^{*}E \cap A} \| \nu_{E}\| d…

Differential Geometry · Mathematics 2020-07-28 Max Goering

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont