Related papers: Sumsets and fixed points of substitutions

The subject of this paper is a simulation to that in [1] but here we consider substitutions corresponding to transpositions instead of replacements.

Two sets $A,B$ of positive integers are called \emph{exact additive complements}, if $A+B$ contains all sufficiently large integers and $A(x)B(x)/x\rightarrow1$. Let $A=\{a_1<a_2<\cdots\}$ be a set of positive integers. Denote $A(x)$ by the…

Let $A=\{a_{1},\ldots,a_{k}\}$ be a nonempty finite subset of an additive abelian group $G$. For a positive integer $h$, the $h$-fold signed sumset of $A$, denoted by $h_{\pm}A$, is defined as $$h_{\pm}A=\left\lbrace \sum_{i=1}^{k}…

The quantity $f(n,r)$, defined as the number of permutations of the set $[n]=\{1,2,... n\}$ whose fixed points sum to $r$, shows a sharp discontinuity in the neighborhood of $r=n$. We explain this discontinuity and study the possible…

For any $a\in\mathbb{C}$, the zeros of $\zeta(s)-a$, denoted by $\rho_a=\beta_a+i\gamma_a$, are called $a$-points of the Riemann zeta function $\zeta(s)$. In this paper, we reformulate some basic results about the $a$-points of $\zeta(s)$…

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…

Indexing of static and dynamic sets is fundamental to a large set of applications such as information retrieval and caching. Denoting the characteristic vector of the set by B, we consider the problem of encoding sets and multisets to…

Sumterms are introduced as syntactic entities, and sumtuples are introduced as semantic entities. Equipped with these concepts a new description is obtained of the notion of a sum as (the name for) a role which can be played by a number.…

The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of finite propositional programs, it can be computed in polynomial time, more specifically, in O(|At(P)|size(P))…

This is a sequel to the paper arXiv:1312.6438 by the same authors. In this sequel, we quantitatively improve several of the main results of arXiv:1312.6438, and build on the methods therein. The main new results is that, for any finite set…

Let $G$ be an additive abelian group. Let $A=\{a_{0}, a_{1},\ldots, a_{k-1}\}$ be a nonempty finite subset of $G$. For a positive integer $h$ satisfying $1\leq h\leq k$, we let \[h\hat{}_{\underline{+}}A:=\{\Sigma_{i=0}^{k-1}\lambda_{i}…

We answer two questions of Kra, Moreira, Richter and Robertson regarding the existence of infinite sumsets of the form $B + C$ in dense and sparse sets of integers and the relation of sumsets to sets of recurrence. We then further…

In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.

Given a set $A\subseteq\mathbb{N}$, we consider the relationship between stability of the structure $(\mathbb{Z},+,0,A)$ and sparsity of the set $A$. We first show that a strong enough sparsity assumption on $A$ yields stability of…

A set of reals $A=\{a_1,...,a_n\}$ labeled in increasing order is called convex if there exists a continuous strictly convex function $f$ such that $f(i)=a_i$ for every $i$. Given a convex set $A$, we prove…

Let $A \subset \mathbb{Z}^d$ be a finite set. It is known that $NA$ has a particular size ($\vert NA\vert = P_A(N)$ for some $P_A(X) \in \mathbb{Q}[X]$) and structure (all of the lattice points in a cone other than certain exceptional…

Given $m \in \mathbb{N}$ and a $p$-random subset $A \subseteq \mathbb{N}$, we asymptotically determine $\log \Pr(|\mathbb{N} \setminus (A + A)| \ge m)$ for $p$ above the threshold for this property. The proof is based on a bespoke container…

Intersection types have been originally developed as an extension of simple types, but they can also be used for refining simple types. In this survey we concentrate on the latter option; more precisely, on the use of intersection types for…

A method for selecting solution constructors in narrowing is presented. The method is based on a sort discipline that describes regular sets of ground constructor terms as sorts. It is extended to cope with regular sets of ground…

In this note we describe a method for finding prime numbers as fixed points of particularly simple sequences. Some basic calculations show that success rates for identifying primes this way are over 99.9%. In particular, it seems that the…