English
Related papers

Related papers: Large sum-free sets in finite vector spaces I

200 papers

In spite of a recent breakthrough on upper bounds of the size of cap sets (by Croot, Lev and Pach (2017) and Ellenberg and Gijswijt (2017)), the classical cap set constructions had not been affected. In this work, we introduce a very…

Combinatorics · Mathematics 2023-01-02 Christian Elsholtz , Gabriel F. Lipnik

We prove that the maximal dimension of a subspace $V$ of the generic tensor product of $m$ symbol algebras of prime degree $p$ with $\operatorname{Tr}(v^{p-1})=0$ for all $v\in V$ is $\frac{p^{2m}-1}{p-1}$. The same upper bound is thus…

Rings and Algebras · Mathematics 2024-03-21 Adam Chapman

Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…

Rings and Algebras · Mathematics 2020-11-30 Erhard Aichinger

For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…

Number Theory · Mathematics 2023-02-09 Aliaksei Semchankau

Let $p$ be a prime with $p>3$, and let $a,b$ be two rational $p-$integers. In this paper we present general congruences for $\sum_{k=0}^{p-1}\binom ak\binom{-1-a}k\frac p{k+b}\pmod {p^2}$. For $n=0,1,2,\ldots$ let $D_n$ and $b_n$ be Domb…

Number Theory · Mathematics 2020-02-28 Zhi-Hong Sun

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

Combinatorics · Mathematics 2024-01-24 Christian Elsholtz , Laura Proske , Lisa Sauermann

We show that if $\cal S$ is a compact Riemann surface of genus $g = p+1$, where $p$ is prime, with a group of automorphisms $G$ such that $|G|\geq\lambda(g-1)$ for some real number $\lambda>6$, then for all sufficiently large $p$ (depending…

Group Theory · Mathematics 2007-05-23 M. Belolipetsky , G. A. Jones

A set of integers is called sum-free if it contains no triple $(x,y,z)$ of not necessarily distinct elements with $x+y=z$. In this paper, we provide a structural characterisation of sum-free subsets of $\{1,2,\ldots,n\}$ of density at least…

Combinatorics · Mathematics 2018-08-14 Tuan Tran

For integers $m$ and $n$, we study the problem of finding good lower bounds for the size of progression-free sets in $(\mathbb{Z}_{m}^{n},+)$. Let $r_{k}(\mathbb{Z}_{m}^{n})$ denote the maximal size of a subset of $\mathbb{Z}_{m}^{n}$…

Number Theory · Mathematics 2023-01-02 Christian Elsholtz , Benjamin Klahn , Gabriel F. Lipnik

We prove that if the maximal dimension of an anisotropic homogeneous polynomial form of prime degree $p$ over a field $F$ with $\operatorname{char}(F)=p$ is a finite integer $d$ greater than 1 then the symbol length of $p$-algebras of…

Rings and Algebras · Mathematics 2016-07-11 Adam Chapman

If $f(p, n)$ is the number of pairwise nonisomorphic groups of order $p^n$, and $g(p,n)$ is the number of groups of order $p^n$ whose automorphism group is a $p$-group, then, for $n \leq 7$, we prove that the ratio $g(p,n)/f (p,n)$ is…

Group Theory · Mathematics 2015-05-18 Joshua Maglione

Let $X$ be a compact Riemann surface of genus $g\geq 2$. Let $Aut(X)$ be its group of automorphisms and $G\subseteq Aut(X)$ a subgroup. Sharp upper bounds for $|G|$ in terms of $g$ are known if $G$ belongs to certain classes of groups, e.g.…

Complex Variables · Mathematics 2017-07-05 Andreas Schweizer

A subset $S$ of an abelian group $G$ is called $3$-$\mathrm{AP}$ free if it does not contain a three term arithmetic progression. Moreover, $S$ is called complete $3$-$\mathrm{AP}$ free, if it is maximal w.r.t. set inclusion. One of the…

Combinatorics · Mathematics 2025-09-30 Bence Csajbók , Zoltán Lóránt Nagy

We extend the concepts of sum-free sets and Sidon-sets of combinatorial number theory with the aim to provide explicit constructions for spherical designs. We call a subset $S$ of the (additive) abelian group $G$ {\it $t$-free} if for all…

Combinatorics · Mathematics 2015-12-10 Béla Bajnok

Given a set $A \subseteq \mathbb{F}_p^n$, what conditions does one need to guarantee that iterated sumsets of the form $A+\cdots+A$ expand quickly (say, within $O(p)$ terms) to the whole space? When only the size of $A$ is known, such…

Combinatorics · Mathematics 2025-10-13 Manik Dhar , Sammy Luo

A function from $\mathbb{F}_{2^n}$ to $\mathbb{F}_{2^n}$ is $k$th order sum-free if the sum of its values over each $k$-dimensional $\mathbb{F}_2$-affine subspace is nonzero. It is conjectured that for $n$ odd and prime,…

Number Theory · Mathematics 2025-12-08 Zoë Gemmell , Tim Trudgian

We show that a subset of $\mathbb{F}_{p}^{n}$ of $\mathrm{VC_{2}}$-dimension at most $k$ is well approximated by a union of atoms of a quadratic factor of complexity $(\ell,q)$ (denoting the complexities of the linear and quadratic part,…

Combinatorics · Mathematics 2025-10-17 C. Terry , J. Wolf

Let $\lambda^{*}>0$ denote the largest possible value of $\lambda$ such that $$ \{{array}{lllllll} \Delta^{2}u=\frac{\lambda}{(1-u)^{p}} & \{in}\ \ B, 0<u\leq 1 & \{in}\ \ B, u=\frac{\partial u}{\partial n} =0 & \{on}\ \ \partial B. {array}…

Analysis of PDEs · Mathematics 2011-07-26 Baishun Lai , Zhuoran Du

In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and…

Combinatorics · Mathematics 2022-05-16 Bela Bollobas , Imre Leader , Marius Tiba

A subset $A$ of a group $G$ is called product-free if there is no solution to $a=bc$ with $a,b,c$ all in $A$. It is easy to see that the largest product-free subset of the symmetric group $S_n$ is obtained by taking the set of all odd…

Combinatorics · Mathematics 2022-05-31 Peter Keevash , Noam Lifshitz , Dor Minzer