English
Related papers

Related papers: A note on Freiman's theorem in vector spaces

200 papers

Let $\mathcal{P}$ be an $n$-point subset of Euclidean space and $d\geq 3$ be an integer. In this paper we study the following question: What is the smallest (normalized) relative change of the volume of subsets of $\mathcal{P}$ when it is…

Discrete Mathematics · Computer Science 2010-03-03 Anastasios Zouzias

Let P be a set of n weighted points, Q be a set of m unweighted points in the plane, and k a non-negative integer. We consider the problem of computing a subset $Q'\subseteq Q$ with size at most k such that the sum of the weights of the…

Data Structures and Algorithms · Computer Science 2024-11-28 Waseem Akram , Sanjeev Saxena

Let $A$ be a subset of $G$, where $G$ is a finite abelian group of torsion $r$. It was conjectured by Ruzsa that if $|A+A|\leq K|A|$, then $A$ is contained in a coset of $G$ of size at most $r^{CK}|A|$ for some constant $C$. The case $r=2$…

Combinatorics · Mathematics 2019-01-31 Yifan Jing , Souktik Roy

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

We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…

Combinatorics · Mathematics 2022-07-22 Natan Rubin

We prove a robust version of Freiman's $3k - 4$ theorem on the restricted sumset $A+_{\Gamma}B$, which applies when the doubling constant is at most $\tfrac{3+\sqrt{5}}{2}$ in general and at most $3$ in the special case when $A = -B$. As…

Number Theory · Mathematics 2020-03-03 Xuancheng Shao , Max Wenqiang Xu

For positive integers $m$ and $n$, define $f(m,n)$ to be the smallest integer such that any subset $A$ of the $m \times n$ integer grid with $|A| \geq f(m,n)$ contains a rectangle; that is, there are $x\in [m]$ and $y \in [n]$ and…

Combinatorics · Mathematics 2013-10-29 Jeremy F. Alm , Jacob Manske

We present a new property of the trigonometric system arranged in a natural order. It is shown that the sequence of subspaces of trigonometric polynomials is optimal in the sense of order of convergence on convolution classes K*Up in Lq for…

Classical Analysis and ODEs · Mathematics 2015-06-04 Alexander Kushpel

The subspace structure of Beidleman near-vector spaces is investigated. We characterise finite dimensional Beidleman near-vector spaces and we classify the R-subgroups of finite dimensional Beidleman near-vector spaces. We provide an…

Commutative Algebra · Mathematics 2018-10-18 P Djagba , K-T Howell

A family of subsets $\mathcal{F}$ is intersecting if $A \cap B \neq \emptyset$ for any $A, B \in \mathcal{F}$. In this paper, we show that for given integers $k > d \ge 2$ and $n \ge 2k+2d-3$, and any intersecting family $\mathcal{F}$ of…

Combinatorics · Mathematics 2024-07-22 Hao Huang , Yi Zhang

Let K be a complete, algebraically closed nonarchimedean valued field, and let f(z) in K(z) be a rational function of degree d at least 2. We give an algorithm to determine whether f(z) has potential good reduction over K, based on a…

Dynamical Systems · Mathematics 2013-04-08 Robert Rumely

Given a function $f$ on $\mathbb{F}_2^n$, we study the following problem. What is the largest affine subspace $\mathcal{U}$ such that when restricted to $\mathcal{U}$, all the non-trivial Fourier coefficients of $f$ are very small? For the…

Computational Complexity · Computer Science 2023-05-04 Siddharth Iyer , Michael Whitmeyer

For a finite vector space $V$ and a non-negative integer $r\le\dim V$ we estimate the smallest possible size of a subset of $V$, containing a translate of every $r$-dimensional subspace. In particular, we show that if $K\subset V$ is the…

Number Theory · Mathematics 2010-03-22 Swastik Kopparty , Vsevolod F. Lev , Shubhangi Saraf , Madhu Sudan

A set $A\subset \mathbb{F}_p^n$ is sum-free if $A+A$ does not intersect $A$. If $p\equiv 2 \mod 3$, the maximal size of a sum-free in $\mathbb{F}_p^n$ is known to be $(p^n+p^{n-1})/3$. We show that if a sum-free set $A\subset…

Combinatorics · Mathematics 2023-03-03 Leo Versteegen

It is well known that if S is a subset of the integers mod p, and if the second-largest Fourier coefficient is ``small'' relative to the largest coefficient, then the sumset S+S is much larger than S. We show in the present paper that if…

Combinatorics · Mathematics 2007-11-28 Ernie Croot , Tomasz Schoen

Let K be a field that is complete with respect to a nonarchimedean absolute value such that K has a countable dense subset. We prove that the Berkovich analytification V^an of any d-dimensional quasi-projective scheme V over K embeds in…

Algebraic Geometry · Mathematics 2015-06-04 Ehud Hrushovski , François Loeser , Bjorn Poonen

For a k-flat F inside a locally compact CAT(0)-space X, we identify various conditions that ensure that F bounds a (k+1)-dimensional half flat in X. Our conditions are formulated in terms of the ultralimit of X. As applications, we obtain…

Metric Geometry · Mathematics 2010-09-17 S. Francaviglia , J. -F. Lafont

Let $A$ be a simple algebra over a field $F$. Under a mild cardinality assumption on $F$, we determine the greatest possible dimension for an $F$-affine subspace of $A$ that is included in the group of units $A^\times$, and we describe the…

Rings and Algebras · Mathematics 2026-05-07 Clément de Seguins Pazzis

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

Combinatorics · Mathematics 2019-05-06 Marcelo Soares Campos

Given a subset $A$ of the $n$-dimensional Boolean hypercube $\mathbb{F}_2^n$, the sumset $A+A$ is the set $\{a+a': a, a' \in A\}$ where addition is in $\mathbb{F}_2^n$. Sumsets play an important role in additive combinatorics, where they…

Data Structures and Algorithms · Computer Science 2021-07-27 Anindya De , Shivam Nadimpalli , Rocco A. Servedio
‹ Prev 1 3 4 5 6 7 10 Next ›