English
Related papers

Related papers: Strong characterizing sequences of countable group…

200 papers

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

Let $A$ be an associative algebra over an algebraically closed field $K$ of characteristic 0. A decomposition $A=A_1\oplus\cdots \oplus A_r$ of $A$ into a direct sum of $r$ vector subspaces is called a \textsl{regular decomposition} if, for…

Rings and Algebras · Mathematics 2026-01-30 Lucio Centrone , Plamen Koshlukov , Kauê Pereira

Let $A = \{0 = a_0 < a_1 < \cdots < a_{\ell + 1} = b\}$ be a finite set of non-negative integers. We prove that the sumset $NA$ has a certain easily-described structure, provided that $N \geqslant b-\ell$, as recently conjectured by Shakan…

Number Theory · Mathematics 2021-04-01 Andrew Granville , Aled Walker

Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may be modeled by a set M whose density inside X is…

Combinatorics · Mathematics 2008-06-04 Omer Reingold , Luca Trevisan , Madhur Tulsiani , Salil Vadhan

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…

Group Theory · Mathematics 2020-05-01 Andrea Lucchini

We prove a modified version for a conjecture of Weiss from 2004. Let $G$ be a semisimple real algebraic group defined over $\mathbb{Q}$, $\Gamma$ be an arithmetic subgroup of $G$. A trajectory in $G/\Gamma$ is divergent if eventually it…

Dynamical Systems · Mathematics 2021-05-07 Nattalie Tamam

We show that for every integer $d$, there is a constant $N(d)$ such that if $K$ is any field and $F$ is a finite subset of $GL_d(K)$, which generates a non amenable subgroup, then $F^{N(d)}$ contains two elements, which freely generate a…

Group Theory · Mathematics 2008-04-10 Emmanuel Breuillard

Let $(S,\cdot)$ be a semigroup and $\mathfrak{m}$ be a $\sigma$-algebra on $S$. We say $(S,\cdot,\mathfrak{m})$ is a measurable semigroup if $\pi:S\times S\longrightarrow S$ by $\pi(x,y)=x\cdot y$ is a measurable function. In this paper ,…

Functional Analysis · Mathematics 2019-05-07 A. Pashapournia , M. Akbari Tootkaboni , D. Ebrahimbagha

A subset $\{g_1, \ldots , g_d\}$ of a finite group $G$ is said to invariably generate $G$ if the set $\{g_1^{x_1}, \ldots, g_d^{x_d}\}$ generates $G$ for every choice of $x_i \in G$. The Chebotarev invariant $C(G)$ of $G$ is the expected…

Group Theory · Mathematics 2018-11-28 Andrea Lucchini , Gareth Tracey

A precompact group topology $\tau$ on an abelian group $G$ is called {\em single sequence characterized} (for short, {\em ss-characterized}) if there is a sequence $\mathbf{u}= (u_n)$ in $G$ such that $\tau$ is the finest precompact group…

Group Theory · Mathematics 2012-06-05 D. Dikranjan , S. S. Gabriyelyan , V. Tarieladze

A proper colouring of a graph $G$ is $\beta$-frugal if every colour appears at most $\beta$ times in the neighbourhood of each vertex. Let $\chi_\beta(G)$ denote the minimum number of colours needed for a $\beta$-frugal colouring of $G$.…

Combinatorics · Mathematics 2026-03-30 Quentin Chuet

The purpose of the article is to provide an unified way to formulate zero-sum invariants. Let $G$ be a finite additive abelian group. Let $B(G)$ denote the set consisting of all nonempty zero-sum sequences over G. For $\Omega \subset B(G$),…

Combinatorics · Mathematics 2017-02-06 Weidong Gao , Yuanlin Li , Jiangtao Peng , Guoqing Wang

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

Number Theory · Mathematics 2014-02-04 Caixia Shen , Li-meng Xia , Yuanlin Li

Shannon's entropy is a definitive lower bound for statistical compression. Unfortunately, no such clear measure exists for the compressibility of repetitive strings. Thus, ad hoc measures are employed to estimate the repetitiveness of…

Data Structures and Algorithms · Computer Science 2023-11-16 Giulia Bernardini , Gabriele Fici , Paweł Gawrychowski , Solon P. Pissis

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

Let G be a finitely generated free, free abelian of arbitrary exponent, free nilpotent, or free solvable group, or a free group in the variety A_mA_n, and let A = {a_1,..., a_r} be a basis for G. We prove that, in most cases, if S is a…

Group Theory · Mathematics 2013-02-05 Lucas Sabalka , Dmytro Savchuk

By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if $A \subset [1,2]$ is a $(\delta,\sigma)$-set, with $|A| = \delta^{-\sigma},$ then…

Classical Analysis and ODEs · Mathematics 2025-11-19 András Máthé , William O'Regan

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

We present unpublished work of D.Carter, G.Keller, and E.Paige on bounded generation in special linear groups. Let n be a positive integer, and let A = O be the ring of integers of an algebraic number field K (or, more generally, let A be a…

Group Theory · Mathematics 2007-09-28 Dave Witte Morris

We show that a finite zero-sum-free sequence $\alpha$ over an abelian group has at least $c|\alpha|^{4/3}$ distinct subsequence sums, unless $\alpha$ is "controlled" by a small number of its terms; here $|\alpha|$ denotes the number of…

Number Theory · Mathematics 2022-12-21 Vsevolod F. Lev