Related papers: Subsum Sets: Intervals, Cantor Sets, and Cantorval…
This article could be called "theme and variations" on Cantor's celebrated diagonal argument. Given a square nxn tableau T=(a_i^j) on a finite alphabet A, let L be the set of its row-words. The permanent Perm(T) is the set of words…
We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by…
Let $\mathscr{X}$ be the set of positive real sequences $x=(x_n)$ such that the series $\sum_n x_n$ is divergent. For each $x \in \mathscr{X}$, let $\mathcal{I}_x$ be the collection of all $A\subseteq \mathbf{N}$ such that the subseries…
In order to better understand the structure of closed collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice. In this note, we find the maximal closed sets over a finite alphabet.…
A sequence of points $z_k$ in the unit disk is said to be thin for a given decrease function $\rho$, if there is a nontrivial bounded holomorphic function such that the infinite series $\sum_k \rho(1-|z_k|)|f(z_k)|$ converges. All sequences…
We consider the SUBSET SUM problem and its important variants in this paper. In the SUBSET SUM problem, a (multi-)set $X$ of $n$ positive numbers and a target number $t$ are given, and the task is to find a subset of $X$ with the maximal…
The framework of a new scale invariant analysis on a Cantor set $C\subset $ $% I=[0,1] $, presented originally in {\it S. Raut and D. P. Datta, Fractals, 17, 45-52, (2009)}, is clarified and extended further. For an arbitrarily small…
We obtain for the Kempner series (i.e. harmonic series where certain digits are excluded from all denominators, for example the digit 9 in base 10) new representations as geometrically convergent series. The coefficients for these…
Every conditionally convergent series of real numbers has a subseries that diverges. The subseries numbers, previously studied in arXiv:1801.06206 , answer the question how many subsets of the natural numbers are necessary, such that every…
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…
The paper is concerned with maximal subgroups of the ample (better known as topological full) groups of homeomorphisms of totally disconnected compact metrizable topological spaces. We describe all maximal subgroups that are stabilizers of…
A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…
The study of sums of finite sets of integers has mostly concentrated on sets with very small sumsets (Freiman's theorem and related work) and on sets with very large sumsets (Sidon sets and $B_h$-sets). This paper considers the full range…
Certain notions of convergence of sequences functions such as pointwise convergence and (uniform) convergence on compact or bounded sets come from suitable topological function spaces; see [1]. Under certain conditions these topologies…
It is well-known that any sequence of at least N integers contains a subsequence whose sum is 0 (mod N). However, there can be very few subsequences with this property (e.g. if the initial sequence is just N 1's, then there is only one…
In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…
Computers are good at evaluating finite sums in closed form, but there are finite sums which do not have closed forms. Summands which do not produce a closed form can often be ``fixed'' by multiplying them by a suitable polynomial. We…
The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
Considering the sets of subsums of series (or achievement sets) we show that for conditionally convergent series the multidimensional case is much more complicated than that of the real line. Although we are far from the full topological…