Related papers: When is an automatic set an additive basis?

We present bounds on the maximal gain of adaptive and randomized algorithms over non-adaptive, deterministic ones for approximating linear operators on convex sets. If the sets are additionally symmetric, then our results are optimal. For…

We study substitutive systems generated by nonprimitive substitutions and show that transitive subsystems of substitutive systems are substitutive. As an application we obtain a complete characterisation of the sets of words that can appear…

In this paper, we consider the problem of order preservation under addition and multiplication operators over the vector space of univariate real-valued random variables. Consistent with the case of usual order over the real numbers-as…

Let $\beta>1$. For $x \in [0,\infty)$, we have so-called the $\beta$-expansion of $x$ in base $\beta$ as follows: $$x= \sum_{j \leq k} x_{j}\beta^{j} = x_{k}\beta^{k}+ \cdots + x_{1}\beta+x_{0}+x_{-1}\beta^{-1} + x_{-2}\beta^{-2} + \cdots$$…

We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…

This paper introduces a new problem concerning additive properties of convex sets. Let $S= \{s_1 < \dots <s_n \}$ be a set of real numbers and let $D_i(S)= \{s_x-s_y: 1 \leq x-y \leq i\}$. We expect that $D_i(S)$ is large, with respect to…

We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…

Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…

In this paper we study the sequence of strings of $k$ last nonzero digits of $n!$ in a given base $b$. We determine for which $b$ this sequence is automatic and show how to generate it using a uniform morphism. We also compute how often…

While model checking has often been considered as a practical alternative to building formal proofs, we argue here that the theory of sequent calculus proofs can be used to provide an appealing foundation for model checking. Since the…

Set partitions are arrangements of distinct objects into groups. The problem of listing all set partitions arises in a variety of settings, in particular in combinatorial optimization tasks. After a brief review, we give practical…

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

We consider the multiplicative structure of sets of the form AA+1, where where A is a large, finite set of real numbers. In particular, we show that the additively shifted product set, AA+1 must have a large part outside of any generalized…

This paper provides a complete suite of axioms for a version of set theory that I call Explication. Explication borrows from the two most prominent existing systems of set theory. Explication starts with class variables. After several…

Given a right-infinite word $\bf x$ over a finite alphabet $A$, the rank of $\bf x$ is the size of the smallest set $S$ of words over $A$ such that $\bf x$ can be realized as an infinite concatenation of words in $S$. We show that the…

For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Given a finite residue field $k$, one looks for a smoothness basis that is invariant under the automorphism group of $k$. We construct models for some finite fields that admit such a basis. This work aims at accelerating algorithms for…

There exists a set $A$ of positive integers such that the number of representations of a large positive integer $m$ as a sum of two elements of $A$ grows with a lower bound of order $\log m$, but for which there is no subset $D$ of $A$…

Additive composition (Foltz et al, 1998; Landauer and Dumais, 1997; Mitchell and Lapata, 2010) is a widely used method for computing meanings of phrases, which takes the average of vector representations of the constituent words. In this…