English
Related papers

Related papers: $B_{h}[g]$ modular sets from $B_{h}$ modular sets

200 papers

A subset A of an abelian group G is a Bh[g] set on G if every element of G can be written at most g ways as sum of h elements in A. In this work we present three constructions of Bh[g] sets on product of groups.

Number Theory · Mathematics 2016-10-28 Diego Ruiz , Carlos Trujillo

For $h \geq 1$, a $B_h$-set is a set of integers such that every integer $n$ has at most one representation in the form $n = a_{i_1} + \cdots + a_{i_h}$, where $a_{i_j} \in A$ for all $j = 1,\ldots, h$ and $a_{i_1} \leq \ldots \leq…

Number Theory · Mathematics 2025-03-03 Melvyn B. Nathanson

A subset $A$ of a commutative semigroup $X$ is called a $B_h$ set in $X$ if the only solutions to $a_1+\dots+a_h = b_1 + \cdots +b_h$ (with $a_i,b_i \in A$) are the trivial solutions $\{a_1,\dots,a_h\} = \{b_1,\dots,b_h\}$ (as multisets).…

Number Theory · Mathematics 2024-01-03 Kevin O'Bryant

For $h \geq 1$, a $B_h$-set is a set of integers such that every integer $n$ has at most one representation in the form $n = a_{i_1} + \cdots + a_{i_h}$, where $a_{i_r} \in A$ for all $r = 1,\ldots, h$ and $a_{i_1} \leq \ldots \leq…

Number Theory · Mathematics 2024-09-26 Melvyn B. Nathanson , Kevin O'Bryant

Let $h,k \ge 2$ be integers. A set $A$ of positive integers is called asymptotic basis of order $k$ if every large enough positive integer can be written as the sum of $k$ terms from $A$. A set of positive integers $A$ is said to be a…

Number Theory · Mathematics 2022-03-01 Sándor Z. Kiss , Csaba Sándor

Let $K = \mathbb{R}$ or $\mathbb{C}$. An $n$-element subset $A$ of $K$ is a $B_h$-set if every element of $K$ has at most one representation as the sum of $h$ not necessarily distinct elements of $A$. Associated to the $B_h$ set $A =…

Combinatorics · Mathematics 2025-03-07 Melvyn B. Nathanson

Given $h,g \in \mathbb{N}$, we write a set $X \subset \mathbb{Z}$ to be a $B_{h}^{+}[g]$ set if for any $n \in \mathbb{Z}$, the number of solutions to the additive equation $n = x_1 + \dots + x_h$ with $x_1, \dots, x_h \in X$ is at most…

Number Theory · Mathematics 2024-07-03 Yifan Jing , Akshat Mudgal

Let $(G,+)$ be an Abelian group. Given $h\in \mathbb{Z}^+$, a non-empty subset $A$ of $G$ is called an $S_h$-set if all the sums of $h$ distinct elements of $A$ are different. We extend the concept of $S_h$-set to a more general context in…

A set A of positive integers is called a h-bais of [0,n] if each integer in [0,n]is a sum of no more than h members of A. In this paper, we will give a new construction for h-basis.

Combinatorics · Mathematics 2016-11-30 An-Ping Li

Let $h$ be a positive integer and $A, B_1, B_2,\dots, B_h$ be finite sets in a commutative group. We bound $|A+B_1+...+B_h|$ from above in terms of $|A|, |A+B_1|,\dots,|A+B_h|$ and $h$. Extremal examples, which demonstrate that the bound is…

Combinatorics · Mathematics 2017-02-20 Brendan Murphy , Eyvindur Ari Palsson , Giorgis Petridis

Let $h,k \ge 2$ be integers. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…

Number Theory · Mathematics 2020-01-07 Sándor Z. Kiss , Csaba Sándor

We call a subset $A$ of the (additive) abelian group $G$ {\it $t$-independent} if for all non-negative integers $h$ and $k$ with $h+k \leq t$, the sum of $h$ (not necessarily distinct) elements of $A$ does not equal the sum of $k$ (not…

Number Theory · Mathematics 2015-12-10 Béla Bajnok , Imre Ruzsa

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…

Logic · Mathematics 2013-07-25 Kevin Davila Castellar , Ismael Gutierrez Garcia

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

Combinatorics · Mathematics 2025-01-13 Jagannath Bhanja

Let $A$ be a set in an abelian group $G$. For integers $h,r \geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If…

Number Theory · Mathematics 2015-04-01 Francesco Monopoli

A set $A$ of nonnegative integers is called a $B_h$-set if every solution to $a_1+\dots+a_h = b_1+\dots+b_h$, where $a_i,b_i \in A$, has $\{a_1,\dots,a_h\}=\{b_1,\dots,b_h\}$ (as multisets). Let $\gamma_k(h)$ be the $k$-th positive element…

Number Theory · Mathematics 2024-05-01 Kevin O'Bryant

Let $A=\{a_0,a_1,\ldots,a_{k-1}\}$ be a set of $k$ integers. For any integer $h\ge 1$ and any ordered $k$-tuple of positive integers $\mathbf{r}=(r_0,r_1,\ldots,r_{k-1})$, we define a general $h$-fold sumset, denoted by $h^{(\mathbf{r})}A$,…

Number Theory · Mathematics 2015-02-26 Quan-Hui Yang , Yong-Gao Chen

For a finite abelian group $G$, a nonempty subset $A$ of $G$, and a positive integer $h$, we let $hA$ denote the $h$-fold sumset of $A$; that is, $hA$ is the collection of sums of $h$ not-necessarily-distinct elements of $A$. Furthermore,…

Number Theory · Mathematics 2016-11-23 Bela Bajnok

Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 30s when Sidon asked for the maximal size of a subset of consecutive integers with that property. This question is now answered in a…

Number Theory · Mathematics 2016-11-10 Laurent Habsieger , Alain Plagne

Let S be an abelian semigroup, written additively. Let A be a finite subset of S. We denote the cardinality of A by |A|. For any positive integer h, the sumset hA is the set of all sums of h not necessarily distinct elements of A. We define…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson
‹ Prev 1 2 3 10 Next ›