Related papers: A Note on Additive Complements

A pairing function for the non-negative integers is said to be binary perfect if the binary representation of the output is of length 2k or less whenever each input has length k or less. Pairing functions with square shells, such as the…

In this note, we show the existence of integer sequences of lengths at least 3 (except 7) such that for every integer in position $i\equiv 1\pmod{4}$ (respectively position $j\equiv 3\pmod{4}$), counting from left to right, the sum of the…

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

Let $A, B \subseteq \mathbb{N}$ be two finite sets of natural numbers. We say that $B$ is an additive divisor for $A$ if there exists some $C \subseteq \mathbb{N}$ with $A = B+C$. We prove that among those subsets of $\{0, 1, \ldots, k\}$…

An additive system for the nonnegative integers is a family (A_i)_{i\in I} of sets of nonnegative integers with 0 \in A_i for all i \in I such that every nonnegative integer can be written uniquely in the form \sum_{i\in I} a_i with a_i \in…

For $h=3$ and $h=4$ we prove the existence of infinite $B_h$ sequences $\B$ with counting function $$\mathcal{B}(x)= x^{\sqrt{(h-1)^2+1}-(h-1) + o(1)}.$$ This result extends a construction of I. Ruzsa for $B_2$ sequences.

We prove that there are finitely many perfect powers in elliptic divisibility sequences generated by a non-integral point on elliptic curves of the from $y^2=x(x^2+b)$, where $b$ is any positive integer. We achieve this by using the…

A subset $C$ of an abelian group $G$ is a minimal additive complement to $W \subseteq G$ if $C + W = G$ and if $C' + W \neq G$ for any proper subset $C' \subset C$. In this paper, we study which sets of integers arise as minimal additive…

We study whether sufficiently large integers can be written in the form cp+T_x, where p is either zero or a prime congruent to r mod d, and T_x=x(x+1)/2 is a triangular number. We also investigate whether there are infinitely many positive…

The partial sums of integer sequences that count the occurrences of a specific pattern in the binary expansion of positive integers have been investigated by different authors since the 1950s. In this note, we introduce generalized pattern…

We give a complete classification of binary linear complementary dual codes of lengths up to $13$ and ternary linear complementary dual codes of lengths up to $10$.

For a real number $q\in(1,2)$ and $x\in[0,1/(q-1)]$, the infinite sequence $(d_i)$ is called a \emph{$q$-expansion} of $x$ if $$ x=\sum_{i=1}^\infty\frac{d_i}{q^i},\quad d_i\in\{0,1\}\quad\textrm{for all}~ i\ge 1. $$ For $m=1, 2, \cdots$ or…

A ring is called a commutator ring if every element is a sum of additive commutators. In this paper we give examples of such rings. In particular, we show that given any ring R, a right R-module N, and a set X, End_R(\bigoplus_X N) and…

For any real sequence {c(n)} tending to infinity as n tends to infinity, this constructs a function f which is continuous and integrable, and such that for every nonzero x, limsup c(n) f(n x) is infinite.

Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite linear orders) and…

The critical exponent of an infinite word $\bf x$ is the supremum, over all finite nonempty factors $f$, of the exponent of $f$. In this note we show that for all integers $k\geq 2,$ there is a binary infinite $k$-automatic sequence with…

The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…

An MSTD set is a finite set of integers with more sums than differences. It is proved that, for infinitely many positive integers $k$, there are infinitely many affinely inequivalent MSTD sets of cardinality $k$. There are several related…

Let $A_q$ be a $q$-letter alphabet and $w$ be a right infinite word on this alphabet. A subword of $w$ is a block of consecutive letters of $w$. The subword complexity function of $w$ assigns to each positive integer $n$ the number $f_w(n)$…

We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…