English
Related papers

Related papers: The restricted sumsets in finite abelian groups

200 papers

We prove that any definable family of subsets of a definable infinite set $A$ in an o-minimal structure has cardinality at most $|A|$. We derive some consequences in terms of counting definable types and existence of definable topological…

Logic · Mathematics 2023-06-05 Pablo Andújar Guerrero

We show that for a subset $A$ of the cyclic group of prime order $p>3$, if the sumset $A+A-2A$ is not the whole group, then $|A|\le \frac27\,p$. Besides combinatorial arguments, we utilize a general technique involving linear programming.

Number Theory · Mathematics 2025-10-21 Vsevolod Lev , Máté Matolcsi , Péter Pál Pach , Dániel Varga

Let $G=(V,E)$ be a simple graph. For any integer $k\geq 1$, a subset of $V$ is called a $k$-tuple total dominating set of $G$ if every vertex in $V$ has at least $k$ neighbors in the set. The minimum cardinality of a minimal $k$-tuple total…

Combinatorics · Mathematics 2019-08-06 Adel P. Kazemi

Every finite group whose order is divisible by a prime $p$ has at least $2 \sqrt{p-1}$ conjugacy classes.

Group Theory · Mathematics 2015-01-14 Attila Maróti

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…

Combinatorics · Mathematics 2025-08-27 David Conlon , Jeck Lim

A subset $A$ of an abelian group $G$ is sequenceable if there is an ordering $(a_1, \ldots, a_k)$ of its elements such that the partial sums $(s_0, s_1, \ldots, s_k)$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i a_i$ for $1 \leq i \leq k$,…

Combinatorics · Mathematics 2022-05-25 Simone Costa , Stefano Della Fiore

A cover of a finite group $G$ is a family of proper subgroups of $G$ whose union is $G$, and a cover is called minimal if it is a cover of minimal cardinality. A partition of $G$ is a cover such that the intersection of any two of its…

Group Theory · Mathematics 2019-04-10 Martino Garonzi , Michell Lucena Dias

Let $A$ and $B$ be finite subsets of $\mathbb{C}$ such that $|B|=C|A|$. We show the following variant of the sum product phenomenon: If $|AB|<\alpha|A|$ and $\alpha \ll \log |A|$, then $|kA+lB|\gg |A|^k|B|^l$. This is an application of a…

Combinatorics · Mathematics 2010-09-14 Karsten Chipeniuk

Let $S=(a_1)\cdots(a_k)$ be a minimal zero-sum sequence over a finite cyclic group $G$. The index conjecture states that if $k=4$ and $\gcd(|G|,6)=1$, then $S$ has index $1$. In this paper we prove that if $S$ is singular then the index of…

Number Theory · Mathematics 2017-09-15 Fan Ge

For arbitrary $c_0>0$, if $A$ is a subset of the primes less than $x$ with cardinality $\delta x (\log x)^{-1}$ with $\delta\geq (\log x)^{-c_0}$, then there exists a positive constant $c$ such that the cardinality of $A+A$ is larger than…

Number Theory · Mathematics 2013-03-20 Zhen Cui , Hongze Li , Boqing Xue

We show that a K-approximate subgroup A of a residually nilpotent group G is contained in boundedly many cosets of a finite-by-nilpotent subgroup, the nilpotent factor of which is of bounded step. Combined with an earlier result of the…

Combinatorics · Mathematics 2020-06-09 Matthew Tointon

Let $G$ be a connected graph of order $n$, whose minimum vertex degree is at least $k$. A subset $S$ of vertices in $G$ is a $k$-tuple total dominating set if every vertex of $G$ is adjacent to at least $k$ vertices in $S$. The minimum…

Combinatorics · Mathematics 2018-01-23 Sharareh Alipour , Amir Jafari , Morteza Saghafian

In this note we study sets of normal generators of finitely presented residually $p$-finite groups. We show that if an infinite, finitely presented, residually $p$-finite group $G$ is normally generated by $g_1,\dots,g_k$ with order…

Group Theory · Mathematics 2014-02-04 Andreas Thom

The $2$-domination number $\gamma_2(G)$ of a graph $G$ is the minimum cardinality of a set $S\subseteq V(G)$ such that every vertex from $V(G)\setminus S$ is adjacent to at least two vertices in $S$. The annihilation number $a(G)$ is the…

Combinatorics · Mathematics 2019-04-30 Jun Yue , Shizhen Zhang , Yiping Zhu , Sandi Klavžar , Yongtang Shi

For an integer $k \ge 1$, a (distance) $k$-dominating set of a connected graph $G$ is a set $S$ of vertices of $G$ such that every vertex of $V(G) \setminus S$ is at distance at most~$k$ from some vertex of $S$. The $k$-domination number,…

Combinatorics · Mathematics 2015-08-03 Randy Davila , Caleb Fast , Michael Henning , Franklin Kenter

If A is infinite and well-ordered, then |2^A|<=|Part(A)|<=|A^A|.

General Mathematics · Mathematics 2022-08-16 Kerry M. Soileau

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

A subset $B$ of a group $G$ is called a difference basis of $G$ if each element $g\in G$ can be written as the difference $g=ab^{-1}$ of some elements $a,b\in B$. The smallest cardinality $|B|$ of a difference basis $B\subset G$ is called…

Combinatorics · Mathematics 2021-11-01 Taras Banakh , Volodymyr Gavrylkiv

We show that there exist infinite sets $A = \{a_1,a_2,\dots\}$ and $B = \{b_1,b_2,\dots\}$ of natural numbers such that $a_i+b_j$ is prime whenever $1 \leq i < j$.

Number Theory · Mathematics 2024-01-30 Terence Tao , Tamar Ziegler

Let $hA$ denote the $h$-fold sumset of a subset $A$ of an abelian group. Resolving a problem of Nathanson, we show that for any prescribed permutations $\sigma_1, \ldots, \sigma_H \in \mathfrak{S}_n$, there exist finite subsets $A_1,…

Combinatorics · Mathematics 2025-01-07 Noah Kravitz
‹ Prev 1 8 9 10 Next ›