English
Related papers

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

200 papers

We determine the sharp threshold for the containment of all $n$-vertex trees of bounded degree in random geometric graphs with $n$ vertices. This provides a geometric counterpart of Montgomery's threshold result for binomial random graphs,…

Combinatorics · Mathematics 2025-05-23 Michael Anastos , Sahar Diskin , Dawid Ignasiak , Lyuben Lichev , Yetong Sha

We construct finitely generated torsion-free solvable groups $G$ that have infinite rank, but such that all finitely generated torsion-free metabelian subquotients of $G$ are virtually abelian. In particular all finitely generated…

Group Theory · Mathematics 2023-08-30 Adrien Le Boudec , Nicolás Matte Bon

For a prime $p \equiv 2 \pmod 3$, it is well known that the largest sum-free subsets of $\mathbb{F}_p^n$ have size $\frac{p+1}{3} p^{n-1}$, and the extremal sets must be a cuboid of the form $\{\frac{p+1}{3}, \frac{p+1}{3}+1, \ldots,…

Combinatorics · Mathematics 2025-12-30 Xin Wei , Xiande Zhang , Gennian Ge

In this paper, we are interested in a generalization of the notion of sum-free sets. We address a conjecture first made in the 90s by Chung and Goldwasser. Recently, after some computer checks, this conjecture was formulated again by…

Combinatorics · Mathematics 2013-02-19 Alain Plagne , Anne de Roton

We answer two questions of Hindman, Stepr\=ans and Strauss, namely we prove that every strongly summable ultrafilter on an abelian group is sparse and has the trivial sums property. Moreover we show that in most cases the sparseness of the…

Logic · Mathematics 2016-07-28 David J. Fernández Bretón

We introduce subclasses of exact categories in terms of admissible intersections or admissible sums or both at the same time. These categories are recently studied by Br\"ustle, Hassoun, Shah, Tattar and Wegner to give characterisations of…

Representation Theory · Mathematics 2020-06-08 Souheila Hassoun , Sunny Roy

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Group Theory · Mathematics 2021-02-23 Yanis Amirou

Let $A$ be a subset of the cyclic group $\mathbf{Z}/p\mathbf{Z}$ with $p$ prime. It is a well-studied problem to determine how small $|A|$ can be if there is no unique sum in $A+A$, meaning that for every two elements $a_1,a_2\in A$, there…

Combinatorics · Mathematics 2023-09-20 Benjamin Bedert

We study the distances of edges within cliques in a soft random geometric graph on a torus, where the vertices are points of a homogeneous Poisson point process, and far-away points are less likely to be connected than nearby points. We…

Probability · Mathematics 2024-07-17 Ercan Sönmez , Clara Stegehuis

We classify abelian subgroups of the automorphism group of any compact simple Lie algebra whose centralizer has the same dimension as the dimension of the subgroup. This leads to a classification of the maximal abelian subgroups of compact…

Group Theory · Mathematics 2021-02-08 Jun Yu

A subset of a group is product-free if it does not contain elements a, b, c such that ab = c. We review progress on the problem of determining the size of the largest product-free subset of an arbitrary finite group, including a lower bound…

Group Theory · Mathematics 2007-11-08 Kiran S. Kedlaya

We characterize and construct linearly ordered sets, abelian groups and fields that are {\emph symmetrically complete}, meaning that the intersection over any chain of closed bounded intervals is nonempty. Such ordered abelian groups and…

Logic · Mathematics 2013-08-06 Katarzyna , Franz-Viktor Kuhlmann , Saharon Shelah

We answer a question of Katona and Makar-Limanov, by showing that in an abelian group of order $2h$ the $h$-element subset sums are asymptotically (as $h\to \infty$) equidistributed. In fact we prove a more general result where the order of…

Combinatorics · Mathematics 2025-05-20 Péter Pál Pach

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…

Group Theory · Mathematics 2022-02-01 Jonas Deré , Michal Ferov , Mark Pengitore

Inspired by recent questions of Nathanson, we show that for any infinite abelian group $G$ and any integers $m_1, \ldots, m_H$, there exist finite subsets $A,B \subseteq G$ such that $|hA|-|hB|=m_h$ for each $1 \leq h \leq H$. We also…

Combinatorics · Mathematics 2025-06-09 Jacob Fox , Noah Kravitz , Shengtong Zhang

We study norm convergence and summability of Fourier series in the setting of reduced twisted group $C^*$-algebras of discrete groups. For amenable groups, F{\o}lner nets give the key to Fej\'er summation. We show that Abel-Poisson…

Operator Algebras · Mathematics 2009-07-28 Erik Bedos , Roberto Conti

Let X be compact abelian group and G its dual (a discrete group). If B is an infinite subset of G, let C_B be the set of all x in X such that <phi(x) : phi \in B> converges to 1. If F is a free filter on G, let D_F be the union of all the…

General Topology · Mathematics 2007-05-23 Joan E. Hart , Kenneth Kunen

Let $G$ be a finite abelian group. A nonempty subset $A$ in $G$ is called a basis of order $h$ if $hA=G$; when $hA \neq G$, it is called a nonbasis of order $h$. Our interest is in all possible sizes of $hA$ when $A$ is a nonbasis of order…

Number Theory · Mathematics 2022-11-28 Bela Bajnok , Peter Pal Pach

We prove that the family of largest cuts in the binomial random graph exhibits the following stability property: If $1/n \ll p = 1-\Omega(1)$, then, with high probability, there is a set of $n - o(n)$ vertices that is partitioned in the…

Combinatorics · Mathematics 2024-02-23 Ilay Hoshen , Wojciech Samotij , Maksim Zhukovskii

The Subset Sum problem asks whether a given set of $n$ positive integers contains a subset of elements that sum up to a given target $t$. It is an outstanding open question whether the $O^*(2^{n/2})$-time algorithm for Subset Sum by…

Data Structures and Algorithms · Computer Science 2015-08-26 Per Austrin , Mikko Koivisto , Petteri Kaski , Jesper Nederlof