English
Related papers

Related papers: The sharp threshold for maximum-size sum-free subs…

200 papers

This paper aims at studying solvable-by-finite and locally solvable maximal subgroups of an almost subnormal subgroup of the general skew linear group $\GL_n(D)$ over a division ring $D$. It turns out that in the case where $D$ is…

Rings and Algebras · Mathematics 2021-12-21 Huynh Viet Khanh , Bui Xuan Hai

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Combinatorics · Mathematics 2012-06-26 Robert S. Coulter , Todd Gutekunst

Let $A$ be a finite, nonempty subset of an abelian group. We show that if every element of $A$ is a sum of two other elements, then $A$ has a nonempty zero-sum subset. That is, a (finite, nonempty) sum-full subset of an abelian group is not…

Number Theory · Mathematics 2021-05-20 Vsevolod F. Lev , Janos Nagy , Peter Pal Pach

An $r$-coloring of a subset $A$ of a finite abelian group $G$ is called sum-free if it does not induce a monochromatic Schur triple, i.e., a triple of elements $a,b,c\in A$ with $a+b=c$. We investigate $\kappa_{r,G}$, the maximum number of…

Combinatorics · Mathematics 2017-10-24 Hiep Hàn , Andrea Jiménez

Freiman's theorem asserts, roughly speaking, if that a finite set in a torsion-free abelian group has small doubling, then it can be efficiently contained in (or controlled by) a generalised arithmetic progression. This was generalised by…

Combinatorics · Mathematics 2010-02-22 Terence Tao

Let G be a torsion-free abelian group of finite rank. The orbits of the action of Aut(G) on the set of maximal independent subsets of G determine the indecomposable decompositions of G. G contains a direct sum of pure strongly…

Group Theory · Mathematics 2020-04-13 Phill Schultz

In this paper, we study product-free subsets of the free semigroup over a finite alphabet $A$. We prove that the maximum density of a product-free subset of the free semigroup over $A$, with respect to the natural measure that assigns a…

Combinatorics · Mathematics 2018-12-13 Imre Leader , Shoham Letzter , Bhargav Narayanan , Mark Walters

It is known that every torsion-free abelian group of finite rank has a maximal completely decomposable summand that is unique up to isomorphism. We show that groups of infinite rank need not have maximal completely decomposable summands,…

Group Theory · Mathematics 2018-10-24 Gabor Braun. Phill Schultz , Lutz Struengmann

$S \subseteq \mathbb{Z}_{2n}$ is said to be sum-free if $S$ has no solution to the equation $a+b=c$. The sum-free process on $\mathbb{Z}_{2n}$ starts with $S:=\emptyset$, and iteratively inserts elements of $\mathbb{Z}_{2n}$, where each…

Combinatorics · Mathematics 2019-12-03 Patrick Bennett

Let $A$ be a finite subset of an arbitrary additive group $G$, and let $\phi(A)$ denote the cardinality of the largest subset $B$ in $A$ that is sum-avoiding in $A$ (that is to say, $b_1+b_2 \not \in A$ for all distinct $b_1,b_2 \in B$).…

Combinatorics · Mathematics 2017-01-18 Terence Tao , Van Vu

We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\{1,...,n\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our…

Number Theory · Mathematics 2015-05-13 Daniel Katz

Let $G$ be a finite abelian group, let $0 < \alpha < 1$, and let $A \subseteq G$ be a random set of size $|G|^\alpha$. We let $$ \mu(A) = \max_{B,C:|B|=|C|=|A|}|\{(a,b,c) \in A \times B \times C : a = b + c \}|. $$ The issue is to determine…

Discrete Mathematics · Computer Science 2014-01-07 John P Steinberger

We study the appearance of the giant component in random subgraphs of a given large finite graph G=(V,E) in which each edge is present independently with probability p. We show that if G is an expander with vertices of bounded degree, then…

Probability · Mathematics 2012-09-26 Itai Benjamini , Stéphane Boucheron , Gábor Lugosi , Raphaël Rossignol

Let $\mathbb{F}_p$ be a finite field of prime order $p$ and let $A \subset \mathbb{F}_p$ be a subset. In the dense regime when $|A| \geq \alpha p$ for some $\alpha \in (0,1)$, we determine the optimal constant $f(\alpha)$ in the inequality…

Number Theory · Mathematics 2026-04-21 Xuancheng Shao

In the study of the local dynamics of a germ of diffeomorphism fixing the origin in C, an important problem is to determine the centralizer of the germ in the group Diff(C,0) of germs of diffeomorphisms fixing the origin. When the germ is…

Dynamical Systems · Mathematics 2009-03-16 Kingshook Biswas

For a positive integer $h$ and a subset $A$ of a given finite abelian group, we let $hA$, $h \hat{\;} A$, and $h_{\pm}A$ denote the $h$-fold sumset, restricted sumset, and signed sumset of $A$, respectively. Here we review some of what is…

Number Theory · Mathematics 2017-05-16 Béla Bajnok

In this paper we rectify two previous results found in the literature. Our work leads to a new upper bound for the largest sum-free subset of $[1,n]$ with lowest value in $\left [\frac{n}{3},\frac{n}{2}\right ]$, and the identification of…

Combinatorics · Mathematics 2023-10-05 Renato Cordeiro de Amorim

We show that a zero-sum-free sequence of length $n$ over an abelian group spans at least $2n$ distinct subsequence sums, unless it possesses a rigid, easily-described structure.

Combinatorics · Mathematics 2022-06-02 Vsevolod F. Lev

The sumset is one of the most basic and central objects in additive number theory. Many of the most important problems (such as Goldbach's conjecture and Fermat's Last theorem) can be formulated in terms of the sumset $S + S = \{x+y :…

Number Theory · Mathematics 2014-01-21 Steven J. Miller , Kevin Vissuet

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

Combinatorics · Mathematics 2018-12-27 Ishay Haviv