Related papers: On the $k$-abelian complexity of the Cantor sequen…

Our contribution is a bounded cubic compilation theorem. For each fixed resource parameter $k$, syntactic proof checking at resource level $k$ is faithfully represented by a finite bounded-domain system of cubic polynomial equations. Every…

It is well known that all numbers that are normal of order $k$ in base $b$ are also normal of all orders less than $k$. Another basic fact is that every real number is normal in base $b$ if and only if it is simply normal in base $b^k$ for…

In the present article, modeling certain rational numbers, that are represented in terms of Cantor series, are described. The statements on relations between digits in the representations of rational numbers by Cantor series (for the case…

Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…

For any integer $k \geq 2$, let $\{Q_{n}^{(k)} \}_{n \geq -(k-2)}$ denote the $k$-generalized Pell-Lucas sequence which starts with $0, \dots ,2,2$($k$ terms) where each next term is the sum of the $k$ preceding terms. In this paper, we…

Let (k(n)) n=1,2,... be a strictly increasing sequence of positive integers . We consider a specific sequence of differential operators Tk(n),{\lambda} , n=1,2,... on the space of entire functions , that depend on the sequence (k(n))…

In this article we compute the {\em local algebraic $K$-theory}, $ i = 0, 1$, of the algebra of complex numbers $\mathbb{C}$ endowed with the trivial filtration, i.e. $\mathbb{C}_{\mu}= \mathbb{C}$, for any $\mu \in \mathbb{N}$; {\em local…

Let $C$ be the middle-third Cantor set. Define $C*C=\{x*y:x,y\in C\}$, where $*=+,-,\cdot,\div$ (when $*=\div$, we assume $y\neq0$). Steinhaus \cite{HS} proved in 1917 that \[ C-C=[-1,1], C+C=[0,2]. \] In 2019, Athreya, Reznick and Tyson…

In this paper, we show that the concatenation of the Fibonacci sequence is \textit{normal} in base $10$, meaning every string of a given length, $k$, occurs as frequently as every other string of length $k$ (there are as many $1$'s as $2$'s…

Let $C$ be the classical middle third Cantor set. It is well known that $C+C = [0,2]$ (Steinhaus, 1917). (Here $+$ denotes the Minkowski sum.) Let $U$ be the set of $z \in [0,2]$ which have a unique representation as $z = x + y$ with $x, y…

In this article we establish an exponential lower bound on the Graver complexity of integer programs. This provides new type of evidence supporting the presumable intractability of integer programming. Specifically, we show that the Graver…

Every element $u$ of $[0,1]$ can be written in the form $u=x^2y$, where $x,y$ are elements of the Cantor set $C$. In particular, every real number between zero and one is the product of three elements of the Cantor set. On the other hand…

We prove that a sequence satisfying a certain symmetry property is $2$-regular in the sense of Allouche and Shallit, i.e., the $\mathbb{Z}$-module generated by its $2$-kernel is finitely generated. We apply this theorem to develop a general…

We determine continuous bijections $f$, acting on a real interval into itself, whose $k$-fold iterate is the quasi-arithmetic mean of all its subsequent iterates from $f^0$ up to $f^n$ (where $0\le k\le n$). Namely, we prove that if at most…

The linear complexity and the $k$-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, the…

We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…

We study the properties of the sequence of words $(B_i)$, where $B_1 = 101$ and $B_{i+1} = B_i C_i$ for $i \geq 1$, where $C_i$ is $B_i$ with the first $i$ symbols removed, and the infinite binary sequence ${\bf b} = 10101101011011101…

We study the set of $k$-abelian critical exponents of all Sturmian words. It has been proven that in the case $k = 1$ this set coincides with the Lagrange spectrum. Thus the sets obtained when $k > 1$ can be viewed as generalized Lagrange…

For any integer $k \geq 2$, let $\{Q_{n}^{(k)} \}_{n \geq -(k-2)}$ denote the $k$-generalized Pell-Lucas sequence which starts with $0, \dots ,2,2$($k$ terms) where each next term is the sum of the $k$ preceding terms. In this paper, we…

Abelian complexity of a word $\mathbf{u}$ is a function that counts the number of pairwise non-abelian-equivalent factors of $\mathbf{u}$ of length $n$. We prove that for any $c$-balanced Parry word $\mathbf{u}$, the values of the abelian…