English
Related papers

Related papers: Generalized H-fold sumset and Subsequence sum

200 papers

More than twenty years ago, Manickam, Mikl\'{o}s, and Singhi conjectured that for any integers $n, k$ satisfying $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose sum…

Combinatorics · Mathematics 2011-08-09 Noga Alon , Hao Huang , Benny Sudakov

Define a \textit{$t$-matching} of size $m$ in a $k$-uniform family as a collection $\{A_1, A_2, \ldots, A_m\} \subseteq \binom{[n]}{k}$ such that $|A_i \cap A_j| < t$ for all $1 \leq i < j \leq m$. Let $\mathcal{F}\subseteq \binom{[n]}{k}$.…

Combinatorics · Mathematics 2025-08-19 Haixiang Zhang , Mengyu Cao , Mei Lu

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

Combinatorics · Mathematics 2024-01-12 Noga Alon , Natalie Dodson , Carmen Jackson , Rose McCarty , Rajko Nenadov , Lani Southern

For integer $h\geq2$ and $A\subseteq\mathbb{N}$, we define $hA$ to be all integers which can be written as a sum of $h$ elements of $A$. The set $A$ is called an asymptotic basis of order $h$ if $n\in hA$ for all sufficiently large integers…

Number Theory · Mathematics 2023-01-27 Shi-Qiang Chen , Csaba Sándor , Quan-Hui Yang

A nonempty finite set of positive integers A is relatively prime if gcd(A) = 1 and it is relatively prime to n if gcd(A [ fng) = 1. The number of nonempty subsets of A which are relatively prime to n is \Phi(A, n) and the number of such…

Number Theory · Mathematics 2009-10-27 Mohamed El Bachraoui

For a nonempty finite set $A$ of integers, let $S(A) = \left\{ \sum_{b\in B} b: \emptyset \not= B\subseteq A\right\}$ be the set of all nonempty subset sums of $A$. In 1995, Nathanson determined the minimum cardinality of $S(A)$ in terms of…

Number Theory · Mathematics 2024-02-13 Mohan , Jagannath Bhanja , Ram Krishna Pandey

Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $\chi:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$…

Combinatorics · Mathematics 2018-02-12 Aaron Robertson

For graphs $G$ and $H$, we consider Ramsey numbers $r(G,H)$ with tight lower bounds, namely, $r(G,H) \geq (\chi(G)-1)(|H|-1)+1,$ where $\chi(G)$ denotes the chromatic number of $G$ and $|H|$ denotes the number of vertices in $H$. We say $H$…

Combinatorics · Mathematics 2025-01-31 Fan Chung , Qizhong Lin

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

The aim of this paper is to prove a general version of Pl\"unnecke's inequality. Namely, assume that for finite sets $A$, $B_1, ... B_k$ we have information on the size of the sumsets $A+B_{i_1}+... +B_{i_l}$ for all choices of indices…

Combinatorics · Mathematics 2008-10-09 Katalin Gyarmati , Mate Matolcsi , Imre Z. Ruzsa

Professor Georges Rhin considers a nonzero algebraic integer $\a$ with conjugates $\a_1=\a, \ldots, \a_d$ and asks what can be said about $\d \sum_{ | \a_i | >1} | \a_i |$, that we denote ${\rm{R}}(\a)$. If $\a$ is supposed to be a totally…

Number Theory · Mathematics 2024-01-24 V. Flammang

Let $A$ be a nonempty finite subset of an additive abelian group $G$. Define $A + A := \{a + b : a, b \in A\}$ and $A \dotplus A := \{a + b : a, b \in A~\text{and}~ a \neq b\}$. The set $A$ is called a {\em sum-dominant (SD) set} if $|A +…

Number Theory · Mathematics 2017-12-27 Raj Kumar Mistri , R. Thangadurai

For a hypergraph $H$, the transversal is a subset of vertices whose intersection with every edge is nonempty. The cardinality of a minimum transversal is the transversal number of $H$, denoted by $\tau(H)$. The Tuza constant $c_k$ is…

Combinatorics · Mathematics 2023-10-25 Yun-Shan Lu , Hung-Lung Wang

A Heffter array over an additive group $G$ is any partially filled array $A$ satisfying that: (1) each one of its rows and columns sum to zero in $G$, and (2) if $i\in G\setminus\{0\}$, then either $i$ or $-i$ appears exactly once in $A$.…

Combinatorics · Mathematics 2024-10-31 Raúl M. Falcón , Lorenzo Mella

Suppose that $A$, $B$ and $S$ are non-empty subsets of a finite abelian group $G$. Then the generalized restricted sumset $$ A\stackrel{S}+B:=\{a+b:\,a\in A,\ b\in B,\ a-b\not\in S\} $$ contains at least $$ \min\{|A|+|B|-3|S|,p(G)\} $$…

Number Theory · Mathematics 2016-09-13 Shanshan Du , Hao Pan

This paper gives an improved sum-product estimate for subsets of a finite field whose order is not prime. It is shown, under certain conditions, that $$\max\{|A+A|,|A\cdot{A}|\}\gg{\frac{|A|^{12/11}}{(\log_2|A|)^{5/11}}}.$$ This new…

Combinatorics · Mathematics 2011-06-07 Liangpan Li , Oliver Roche-Newton

A $k$-configuration is a collection of $k$ distinct integers $x_1,\ldots,x_k$ together with their pairwise arithmetic means $\frac{x_i+x_j}{2}$ for $1 \leq i < j \leq k$. Building on recent work of Filmus, Hatami, Hosseini and Kelman on…

Number Theory · Mathematics 2025-01-20 Adrian Beker

Suppose that $A,B$ are two non-empty subsets of the finite nilpotent group $G$. If $A\not=B$, then the cardinality of the restricted sumset $$A\dotplus B={a+b: a\in A, b\in B, a\neq b} $$ is at least $$\min{p(G),|A|+|B|-2},$$ where $p(G)$…

Combinatorics · Mathematics 2012-08-22 Shanshan Du , Hao Pan

In this paper we define a new class of partially filled arrays, called relative Heffter arrays, that are a generalization of the Heffter arrays introduced by Archdeacon in 2015. Let $v=2nk+t$ be a positive integer, where $t$ divides $2nk$,…

Combinatorics · Mathematics 2019-10-17 Simone Costa , Fiorenza Morini , Anita Pasotti , Marco Antonio Pellegrini

Let (G, *) be a semigroup, D subset of G, and n >= 2 be an integer. We say that (D, *) is an n-closed subset of G if a_1* ... *a_n in D for every a_1, ..., a_n in D. Hence every closed set is a 2-closed set. The concept of n-closed sets…

Group Theory · Mathematics 2011-07-27 Ayman Badawi
‹ Prev 1 4 5 6 7 8 10 Next ›