English
Related papers

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

200 papers

For any fixed $d\geq1$ and subset $X$ of $\mathbb{N}^d$, let $r_X(n)$ be the maximum cardinality of a subset $A$ of $\{1,\dots,n\}^d$ which does not contain a subset of the form $\vec{b} + rX$ for $r>0$ and $\vec{b} \in \mathbb{R}^d$. Such…

Combinatorics · Mathematics 2023-11-27 Natalie Behague , Joseph Hyde , Natasha Morrison , Jonathan A. Noel , Ashna Wright

We study spaces of lines that meet a smooth hypersurface X in P^n to high order. As an application, we give a polynomial upper bound on the number of planes contained in a smooth degree d hypersurface in P^5 and provide a proof of a result…

Algebraic Geometry · Mathematics 2022-08-10 Anand Patel , Eric Riedl , Geoffrey Smith , Dennis Tseng

In 1976 S. Shelah posed the following problem: for which variety V of algebras the automorphism group of any free algebra F from V of "large" infinite rank interprets by means of first-order logic set theory (according to his results, for…

Group Theory · Mathematics 2007-05-23 Vladimir Tolstykh

In this note, we determine the maximum size of a $\{V_{k}, \Lambda_{l}\}$-free family in the lattice of vector subspaces of a finite vector space both in the non-induced case as well as the induced case, for a large range of parameters $k$…

Combinatorics · Mathematics 2019-10-10 Jimeng Xiao , Casey Tompkins

In this paper we give anticoncentration bounds for sums of independent random vectors in finite-dimensional vector spaces. In particular, we asymptotically establish a conjecture of Leader and Radcliffe (1994) and a question of Jones…

Probability · Mathematics 2023-08-15 Tomas Juškevičius , Valentas Kurauskas

Let $\mathfrak{g}$ be a complex simple Lie algebra and $Z(\mathfrak{g})$ be the center of the universal enveloping algebra $U(\mathfrak{g})$. Denote by $V_\lambda$ the finite-dimensional irreducible $\mathfrak{g}$-module with highest weight…

Representation Theory · Mathematics 2024-01-18 Binni Sun , Yufeng Zhao

In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…

Number Theory · Mathematics 2026-04-10 Soumyarup Banerjee , Ben Kane , Kwan To Ng

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…

Combinatorics · Mathematics 2025-08-27 David Conlon , Jeck Lim

The permutohedron $P_n$ of order $n$ is a polytope embedded in $\mathbb{R}^n$ whose vertex coordinates are permutations of the first $n$ natural numbers. It is obvious that $P_n$ lies on the hyperplane $H_n$ consisting of points whose…

Combinatorics · Mathematics 2026-04-10 Bochao Kong , Ji Zeng

The convexity number of a set $X \subset \mathbb{R}^2$ is the minimum number of convex subsets required to cover it. We study the following question: what is the largest possible convexity number $f(n)$ of $\mathbb{R}^2 \setminus S$, where…

Combinatorics · Mathematics 2026-01-05 Chaya Keller , Micha A. Perles

A balanced pair in a finite ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We prove that every finite $N$-free…

Combinatorics · Mathematics 2012-05-22 Imed Zaguia

We revisit the following problem (along with its higher dimensional variant): Given a set $S$ of $n$ points inside an axis-parallel rectangle $U$ in the plane, find a maximum-area axis-parallel sub-rectangle that is contained in $U$ but…

Combinatorics · Mathematics 2016-10-17 Adrian Dumitrescu , Minghui Jiang

The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…

General Topology · Mathematics 2024-12-30 Denis I. Saveliev

K\"{u}hn, Osthus, and Treglown and, independently, Khan proved that if $H$ is a $3$-uniform hypergraph with $n$ vertices such that $n\in 3\mathbb{Z}$ and large, and $\delta_1(H)>{n-1\choose 2}-{2n/3\choose 2}$, then $H$ contains a perfect…

Combinatorics · Mathematics 2020-04-28 Hongliang Lu , Xingxing Yu , Xiaofan Yuan

In 1973 Bermond, Germa, Heydemann and Sotteau conjectured that if $n$ divides $\binom{n}{k}$, then the complete $k$-uniform hypergraph on $n$ vertices has a decomposition into Hamilton Berge cycles. Here a Berge cycle consists of an…

Combinatorics · Mathematics 2014-04-01 Daniela Kühn , Deryk Osthus

Equivalences under the affine group ${\rm Aff} (\mathbb{R}^3)$ of constant Hessian rank $1$ surfaces $S^2 \subset \mathbb{R}^3$, sometimes called parabolic, were, among other objects, studied by Doubrov, Komrakov, Rabinovich, Eastwood,…

Differential Geometry · Mathematics 2022-02-08 Joel Merker

We consider arrangements of n hyperplanes of codimension one in a real projective space of dimension d. Let us denote by F the maximal possible number f of connected components of the complement in the projective space of dimension d to the…

Combinatorics · Mathematics 2015-01-06 I. Shnurnikov

We show that every sequence of torsion-free arithmetic congruence lattices in $\mathrm{PGL}(2,\mathbb R)$ or $\mathrm{PGL}(2,\mathbb C)$ satisfies a strong quantitative version of the Limit Multiplicity property. We deduce that for $R>0$ in…

Number Theory · Mathematics 2020-11-23 Mikolaj Fraczyk

Finding the maximum size of a Sidon set in $\mathbb{F}_2^t$ is of research interest for more than 40 years. In order to tackle this problem we recall a one-to-one correspondence between sum-free Sidon sets and linear codes with minimum…

Combinatorics · Mathematics 2026-01-05 Ingo Czerwinski , Alexander Pott

We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K_5 (the core) where the edges are replaced by…

Combinatorics · Mathematics 2010-12-23 Andrei Gagarin , Gilbert Labelle , Pierre Leroux