English
Related papers

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

200 papers

In this article we prove in main Theorem A that any infinity type real hyperplane arrangement $\mathcal{H}_n^m$ (Definition 2.11) with the associated normal system $\mathcal{N}$ (Definitions [2.2,2.4] can be represented isomorphically…

Combinatorics · Mathematics 2026-01-21 C. P. Anil Kumar

We prove that all finitely generated fully residually free groups (limit groups) have a sequence of finite dimensional unitary representations that `strongly converge' to the regular representation of the group. The corresponding statement…

Group Theory · Mathematics 2023-01-18 Larsen Louder , Michael Magee with Appendix by Will Hide , Michael Magee

Asymptotic symmetries of the five dimensional noncompact symmetric space SL(3)/SO(3) are found to form an infinite dimensional Lie algebra, analogously to the asymptotic symmetries of anti-de Sitter spaces in two and three dimensions.…

High Energy Physics - Theory · Physics 2015-06-03 Heikki Arponen

The subspace sum graph $\mathcal{G}(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ was introduced by Das [Subspace Sum Graph of a Vector Space, arXiv:1702.08245], recently. The vertex set of $\mathcal{G}(\mathbb{V})$…

Combinatorics · Mathematics 2017-04-13 Fenglei Tian , Dein Wong

A beautiful theorem of Zeckendorf states that every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. Such decompositions exist more generally, and much is known about them. First, for any positive…

Number Theory · Mathematics 2019-09-05 Neelima Borade , Dexter Cai , David Z. Chang , Bruce Fang , Alex Liang , Steven J. Miller , Wanqiao Xu

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

Combinatorics · Mathematics 2018-02-20 Alex Iosevich , Hans Parshall

Let $G$ be an abelian group. A tri-colored sum-free set in $G^n$ is a collection of triples $({\bf a}_i, {\bf b}_i, {\bf c}_i)$ in $G^n$ such that ${\bf a}_i+{\bf b}_j+{\bf c}_k=0$ if and only if $i=j=k$. Fix a prime $q$ and let $C_q$ be…

Combinatorics · Mathematics 2018-07-09 Robert Kleinberg , Will Sawin , David E. Speyer

We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…

Rings and Algebras · Mathematics 2024-08-20 Gustavo Granja , Aleksandar Milivojevic

Let $k\ge 3$ be an odd integer and let $n$ be a sufficiently large integer. We prove that the maximum number of edges in an $n$-vertex $k$-uniform hypergraph containing no $2$-regular subgraphs is $\binom{n-1}{k-1} + \lfloor\frac{n-1}{k}…

Combinatorics · Mathematics 2018-01-24 Jie Han , Jaehoon Kim

In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…

Number Theory · Mathematics 2016-03-22 Christian Reiher

Let H be a 3-uniform hypergraph of order n with clique number k such that the intersection of all maximum cliques of H is empty. For fixed m=n-k, Szemer\'edi and Petruska conjectured the sharp bound $n\leq {m+2\choose 2}$. In this note the…

Combinatorics · Mathematics 2020-10-06 Adam S. Jobson , André E. Kézdy , Jenő Lehel

It is an open problem in additive number theory to compute and understand the full range of sumset sizes of finite sets of integers, that is, the set $\mathcal{R}_{\mathbf{Z}}(h,k)= \{|hA|:A \subseteq {\mathbf{Z}} \text{ and } |A|=k\}$ for…

Number Theory · Mathematics 2026-04-07 Melvyn B. Nathanson

There has been interest recently in maximizing the number of independent sets in graphs. For example, the Kahn-Zhao theorem gives an upper bound on the number of independent sets in a $d$-regular graph. Similarly, it is a corollary of the…

Combinatorics · Mathematics 2019-03-21 Lauren Keough , A. J. Radcliffe

A finite subset of a Euclidean space is called an $s$-distance set if there exist exactly $s$ values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all…

Metric Geometry · Mathematics 2020-09-29 Hiroshi Nozaki , Masashi Shinohara

The main goal of the paper is to provide a quantitative lower bound greater than $1$ for the relative projection constant $\lambda(Y, X)$, where $X$ is a subspace of $\ell_{2p}^m$ space and $Y \subset X$ is an arbitrary hyperplane. As a…

Functional Analysis · Mathematics 2017-10-02 Tomasz Kobos

Confirming a conjecture of Vera T. S\'os in a very strong sense, we give a complete solution to Tur\'an's hypergraph problem for the Fano plane. That is we prove for $n\ge 8$ that among all $3$-uniform hypergraphs on $n$ vertices not…

Combinatorics · Mathematics 2020-03-24 Louis Bellmann , Christian Reiher

In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…

Combinatorics · Mathematics 2025-10-02 Michael Kiermaier , Reinhard Laue , Alfred Wassermann

Last years a number of papers were devoted to describing automorphisms of semigroups of endomorphisms of free finitely generated universal algebras of some varieties: groups, semigroups, associative commutative algebras, inverse semigroups,…

General Mathematics · Mathematics 2007-05-23 Grigori Zhitomirski

We study the 2-offer semirandom 3-uniform hypergraph model on $n$ vertices. At each step, we are presented with 2 uniformly random vertices. We choose any other vertex, thus creating a hyperedge of size 3. We show a strategy that constructs…

Combinatorics · Mathematics 2024-09-26 Michael Molloy , Pawel Pralat , Gregory B. Sorkin

Let $\varepsilon>0$. We construct an explicit, full-measure set of $\alpha \in[0,1]$ such that if $\gamma \in \mathbb{R}$ then, for almost all $\beta \in[0,1]$, if $\delta \in \mathbb{R}$ then there are infinitely many integers $n\geq 1$…

Number Theory · Mathematics 2023-07-28 Sam Chow , Niclas Technau