Related papers: On the regular sum-free sets
This paper examines Automatic Complexity, a complexity notion introduced by Shallit and Wang in 2001. We demonstrate that there exists a normal sequence $T$ such that $I(T) = 0$ and $S(T) \leq 1/2$, where $I(T)$ and $S(T)$ are the lower and…
The notion of $b$-regular sequences was generalized to abstract numeration systems by Maes and Rigo in 2002. Their definition is based on a notion of $\mathcal{S}$-kernel that extends that of $b$-kernel. However, this definition does not…
We consider Cantor real numeration system as a frame in which every non-negative real number has a positional representation. The system is defined using a bi-infinite sequence $\Beta=(\beta_n)_{n\in\Z}$ of real numbers greater than one. We…
We study the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence. While $k$-automatic sequences are characterised by finiteness of $k$-kernels, the $k$-kernels of asymptotically…
Let $A$ be a subset of a finite field $\mathbb{F}$. When $\mathbb{F}$ has prime order, we show that there is an absolute constant $c > 0$ such that, if $A$ is both sum-free and equal to the set of its multiplicative inverses, then $|A| <…
A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…
Polytope numbers for a given polytope are an integer sequence defined by the combinatorics of the polytope. Recent work by H. K. Kim and J. Y. Lee has focused on writing polytope number sequences as sums of simplex number sequences. We…
Given any oracle, A, we construct a basic sequence Q, computable in the jump of A, such that no A-computable real is Q-distribution-normal. A corollary to this is that there is a Delta^0_{n+1} basic sequence with respect to which no…
The concept of a sequence of exact zero-divisors on a noetherian local ring is defined and studied. Some properties of sequences of exact zero-divisors are compared with regular sequences.
This paper concerns the self-similarity of topological spaces, in the sense defined in math.DS/0411344. I show how to recognize self-similar spaces, or more precisely, universal solutions of self-similarity systems. Examples include the…
We introduce the notions of $\tau$-exceptional and signed $\tau$-exceptional sequences for any finite dimensional algebra. We prove that for a fixed algebra of rank $n$, and for any positive integer $t \leq n$, there is a bijection between…
In this paper, we prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the…
This paper describes the homology of various simplicial complexes associated to set families from combinatorial number theory, including primitive sets, pairwise coprime sets, product-free sets, and coprime-free sets. We present a condition…
We propose a generalisation of the Cameron-Erdos conjecture for sum-free sets to arbitrary non-translation invariant linear equations over Z in three or more variables and, using well-known methods from graph theory, prove a weak form of…
In this paper we define a notion of automatic randomness tests (ART) which capture measure theoretic typicalness of infinite binary sequences within the framework of automata theory. An individual ART is found to be equivalent to a…
We count the ordered sum-free triplets of subsets in the group $\mathbb{Z}/p\mathbb{Z}$, i.e., the triplets $(A,B,C)$ of sets $A,B,C \subset \mathbb{Z}/p\mathbb{Z}$ for which the equation $a+b=c$ has no solution with $a\in A$, $b \in B$ and…
We show that a zero-sum-free sequence of length $n$ over an abelian group spans at least $2n$ distinct subsequence sums, unless it possesses a rigid, easily-described structure.
Gerbner, Patk\'{o}s, Tuza, and Vizer recently initiated the study of $F$-saturated regular graphs. One of the essential problems in this line of research is determining when such a graph exists. Using generalized sum-free sets we prove that…
A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…
A sequence in an additively written abelian group is called zero-free if each of its nonempty subsequences has sum different from the zero element of the group. The article determines the structure of the zero-free sequences with lengths…