Related papers: Subsum Sets: Intervals, Cantor Sets, and Cantorval…

We study properties of the set of subsums for a convergent series $ k_1 \sin x + \dots + k_m \sin x +\dots + k_1\sin x^n +\dots + k_m \sin x^n + \dots $, where $k_1, k_2, k_3,\dots,k_m$ are fixed positive integers and $0<x<1$. Depends on…

For a sequence $x \in l_1 \setminus c_{00}$, one can consider the achievement set $E(x)$ of all subsums of series $\sum_{n=1}^{\infty} x(n)$. It is known that $E(x)$ is one of the following types of sets: * finite union of closed intervals,…

In this paper we look at the topological type of algebraic sum of achievement sets. We show that there is a Cantorval such that the algebraic sum of its $k$ copies is still a Cantorval for any $k \in \mathbb{N}$. We also prove that for any…

Given a nonincreasing sequence of positive numbers $(a_n)$ such that the series $\sum a_n$ is convergent, by $E(a_n)$ we denote the set of all subsums of the series $\sum a_n$ and call it the achievement set of $(a_n)$. It is well known…

Cameron introduced a bijection between the set of sum-free sets and the set of all zero-one sequences. In this paper, we study the sum-free sets of natural numbers corresponding to certain zero-one sequences which contain the Cantor-like…

We show that the closure of the value set of a real linear recurrence sequence is the union of a countable set and a finite collection of intervals. Conversely, any finite collection of closed intervals is the closure of the value set of…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $\alpha$ ($\leq k$), let \[\Sigma_{\alpha}…

A zero-sum sequence over ${\mathbb Z}$ is a sequence with terms in ${\mathbb Z}$ that sum to $0$. It is called minimal if it does not contain a proper zero-sum subsequence. Consider a minimal zero-sum sequence over ${\mathbb Z}$ with…

The constant $C_A(n)$ is defined to be the smallest natural number $k$ such that any sequence of $k$ elements in $\mathbb Z_n$ has a subsequence of consecutive terms whose $A$-weighted sum is zero, where the weight set $A\subseteq \mathbb…

A zero-sum sequence of integers is a sequence of nonzero terms that sum to 0. Let $k>0$ be an integer and let $[-k,k]$ denote the set of all nonzero integers between $-k$ and $k$. Let $\ell(k)$ be the smallest integer $\ell$ such that any…

We show that for any pair of self-similar Cantor sets with sum of Hausdorff dimensions greater than 1, one can create an interval in the sumset by applying arbitrary small perturbations (without leaving the class of self-similar Cantor…

A finite set of integers $A$ is a sum-dominant (also called an More Sums Than Differences or MSTD) set if $|A+A| > |A-A|$. While almost all subsets of $\{0, \dots, n\}$ are not sum-dominant, interestingly a small positive percentage are. We…

A subset of the Cantor cube is null-additive if its algebraic sum with any null set is null. We construct a set of cardinality continuum such that: all continuous images of the set into the Cantor cube are null-additive, it contains a…

Let C(a) be the central Cantor set generated by a sequence a with terms in (0,1). It is known that the difference set C(a)-C(a) of C(a) can has one of three possible forms: a finite union of closed intervals, a Cantor set, or a Cantorval.…

Consider $d$ disjoint closed subintervals of the unit interval and consider an orientation preserving expanding map which maps each of these subintervals to the whole unit interval. The set of points where all iterates of this expanding map…

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

Let $\mathcal S$ be a multiset of integers. We say $\mathcal S$ is a $\textit{zero-sum sequence}$ if the sum of its elements is 0. We study zero-sum sequences whose elements lie in the interval $[-k,k]$ such that no subsequence of length…

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$),…

A sum-and-distance system is a collection of finite sets of integers such that the sums and differences formed by taking one element from each set generate a prescribed arithmetic progression. Such systems, with two component sets, arise…