Related papers: Non-standard binary representations and the Stern …
In a recent preprint on ArXiv, Bacher introduced a twisted version of the Stern sequence. His paper contains in particular three conjectures relating the generating series for the Stern sequence and for the twisted Stern sequence. Soon…
It is shown that metric representation of DNA sequences is one-to-one. By using the metric representation method, suppression of nucleotide strings in the DNA sequences is determined. For a DNA sequence, an optimal string length to display…
Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.
We classify all binary error correcting completely regular codes of length $n$ with minimum distance $\delta>n/2$.
We introduce the sequence $(i_n)_{n \geq 0}$ defined by $i_n = (-1)^{inv_2(n)}$, where $inv_2(n)$ denotes the number of inversions (i.e., occurrences of 10 as a scattered subsequence) in the binary representation of n. We show that this…
Many problems in Computer Science can be abstracted to the following question: given a set of objects and rules respectively, which new objects can be produced? In the paper, we consider a succinct version of the question: given a set of…
We introduce a full binary directed tree structure to represent the set of natural numbers, further categorizing them into three distinct subsets: pure odd numbers, pure even numbers, and mixed numbers. We adopt a binary string…
In a recent paper, Roland Bacher conjectured three identities concerning Stern's sequence and its twist. In this paper we prove Bacher's conjectures. Possibly of independent interest, we also give a way to compute the Stern value (or…
An identity for binomial symbols modulo an odd positive integer $n$ relating to the least prime factor of $n$ is proved. The identity is discussed within the context of Pell conics.
We prove a relationship between certain integer expressions involving operators similar to the binary exclusive or. This gives a proof and generalization of a result conjectured about sequence A178729 in Sloane's Online Encyclopedia of…
We discuss an equivalence relation on the set of square binary matrices with the same number of 1's in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of…
In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such…
We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n symbols). It has been conjectured that the shortest…
We will consider the indefinite truncated multidimensional moment problem. Necessary and sufficient conditions for a given truncated multisequence to have a signed representing measure $\mu$ with ${\rm card}\,{\rm supp}\, \mu$ as small as…
Let $\mathcal{A}$ be a finite subset of $\mathbb{N}$ including $0$ and $f_\mathcal{A}(n)$ be the number of ways to write $n=\sum_{i=0}^{\infty}\epsilon_i2^i$, where $\epsilon_i\in\mathcal{A}$. We consider asymptotics of the summatory…
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…
In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…
Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two…
We show that there is a bijection between real-linear automorphisms of the multicomplex numbers of order $n$ and signed permutations of length $2^{n-1}$. This allows us to deduce a number of results on the multicomplex numbers, including a…
Let $f_4(n)$ be the number of hyperquaternary representations of $n$ and $b_4(n)$ be the number of balanced quaternary representations of $n$. We show that there is no integer $k$ such that $f_4(n+k)=b_4(n)$ for all $n\ge -k$, in contrast…