English
Related papers

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

200 papers

In this note some properties of the sum of element orders of a finite abelian group are studied.

Group Theory · Mathematics 2018-05-31 Marius Tărnăuceanu , Dan Gregorian Fodor

Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. We determine the precise size of the largest $\mathcal{L}$-free subset of $[n]$ for…

Combinatorics · Mathematics 2017-07-26 Robert Hancock , Andrew Treglown

We study a zero-sum problem dealing with minimal zero-sum sequences of maximal length over finite abelian groups. A positive answer to this problem yields a structural description of sets of lengths with maximal elasticity in transfer Krull…

Combinatorics · Mathematics 2020-07-21 Aqsa Bashir , Alfred Geroldinger , Qinghai Zhong

It was shown in Part I that there exist strongly dense free subgroups in any semisimple algebraic group over a large enough field. These are nonabelian free subgroups all of whose subgroups are either cyclic or Zariski-dense. Here we show…

Group Theory · Mathematics 2022-12-19 Emmanuel Breuillard , Robert Guralnick , Michael Larsen

In a recent paper of the first author and I. M. Isaacs it was shown that if m = m(G) is the maximal order of an abelian subgroup of the finite group G, then |G| divides m! ([AI18, Thm. 5.2]). The purpose of this brief note is to improve on…

Group Theory · Mathematics 2020-09-21 Stefanos Aivazidis , Robert M. Guralnick

For a finite abelian group $G$ and a positive integer $d$, let $\mathsf s_{d \mathbb N} (G)$ denote the smallest integer $\ell \in \mathbb N_0$ such that every sequence $S$ over $G$ of length $|S| \ge \ell$ has a nonempty zero-sum…

Number Theory · Mathematics 2010-07-05 Alfred Geroldinger , David J. Grynkiewicz , Wolfgang A. Schmid

For a rational number $r>1$, a set $A$ of positive integers is called an $r$-multiple-free set if $A$ does not contain any solution of the equation $rx = y$. The extremal problem on estimating the maximum possible size of $r$-multiple-free…

Number Theory · Mathematics 2015-03-17 Sang June Lee

Let $A \subset \mathbb{Z}_{>0}$ of size $n$. It is conjectured that for any $C >0$ and $n$ large enough that $A$ contains a sum-free subset of size at least $n/3 +C$. We study this problem and find an alternate proof of Bourgain's result…

Number Theory · Mathematics 2022-07-29 George Shakan

A hypergroup is called an elementary abelian 2-hypergroup if it is a constrained direct product of the closed subsets of two elements. In this paper, the elementary abelian 2-hypergroups are studied. All closed subsets and all strongly…

Combinatorics · Mathematics 2025-06-19 Yu Jiang

We prove limit theorems for row sums of a rowwise independent infinitesimal array of random variables with values in a locally compact Abelian group. First we give a proof of Gaiser's theorem, since it does not have an easy access and it is…

Probability · Mathematics 2014-03-25 Matyas Barczy , Alexander Bendikov , Gyula Pap

We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…

Group Theory · Mathematics 2017-05-17 Mark Shusterman

Let $G$ be a discrete abelian group. F{\o}lner showed that if $A \subseteq G$ has positive upper Banach density, then $A - A$ contains an almost Bohr set -- a set of the form $B \setminus E$ where $B$ is a Bohr set and $E$ has zero Banach…

Dynamical Systems · Mathematics 2026-05-27 Pierre-Yves Bienvenu , John T. Griesmer , Anh N. Le , Thái Hoàng Lê

We prove that the sizes of the maximal dissociated subsets of a given finite subset of an abelian group differ by a logarithmic factor at most. On the other hand, we show that the set $\{0,1\}^n\seq\Z^n$ possesses a dissociated subset of…

Combinatorics · Mathematics 2015-03-17 Vsevolod F. Lev , Raphael Yuster

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…

Group Theory · Mathematics 2019-06-18 Stefanos Aivazidis , Thomas W. Müller

Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a function defined on a collection of variables which…

Artificial Intelligence · Computer Science 2011-07-04 D. Cohen , M. Cooper , P. Jeavons , A. Krokhin

In this work, we develop a unified framework for establishing sharp threshold results for various Ramsey properties. To achieve this, we view such properties as non-colourability of auxiliary hypergraphs. Our main technical result gives…

Combinatorics · Mathematics 2026-03-04 Ehud Friedgut , Eden Kuperwasser , Wojciech Samotij , Mathias Schacht

Not any nonsingular equation over a metabelian group has solution in a larger metabelian group. However, any nonsingular equation over a solvable group with a subnormal series with abelian torsion-free quotients has a solution in a larger…

Group Theory · Mathematics 2023-10-24 Anton A. Klyachko , Mikhail A. Mikheenko , Vitaly A. Roman'kov

Generalising a previous result, we determine all non-abelian finite simple groups whose order has largest prime divisor not exceeding $10^4$. The computer code for this and similar calculations is made available.

Group Theory · Mathematics 2026-05-19 Andrei V. Zavarnitsine

Let $G$ be a finite abelian group of order $n$, and for each $a\in G$ and integer $1\le h\le n$ let $\mathcal{F}_a(h)$ denote the family of all $h$-element subsets of $G$ whose sum is $a$. A problem posed by Katona and Makar-Limanov is to…

Combinatorics · Mathematics 2025-09-11 Jing Wang

We give a sharpened form of Siegel Lemma's w. r. t. the maximum norm. This implies a new lower bound on the greatest element of a sum-distinct set of positive integers (Erd\"os-Moser problem). The main tools are Minkowski's theorem on…

Number Theory · Mathematics 2007-05-23 Iskander Aliev