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

Let $Q=(q_n)_{n=1}^{\infty}$ be a sequence of integers greater than or equal to 2. We say that a real number $x$ in $[0,1)$ is {\it $Q$-distribution normal} if the sequence $(q_1q_2... q_n x)_{n=1}^{\infty}$ is uniformly distributed mod 1.…

This work is devoted to solving some closely related open problems on the average and asymptotic behavior of the $2$-adic complexity of binary sequences. First, for fixed $N$, we prove that the expected value $E^{\mathrm{2-adic}}_N$ of the…

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

For a block $B$ of a finite group we prove that $k(B)\le(\det C-1)/l(B)+l(B)\le\det C$ where $k(B)$ (respectively $l(B)$) is the number of irreducible ordinary (respectively Brauer) characters of $B$, and $C$ is the Cartan matrix of $B$. As…

In this paper, we extend recent work of the third author and Ziegler on triples of integers $(a,b,c)$, with the property that each of $(a,b,c)$, $(a+1,b+1,c+1)$ and $(a+2,b+2,c+2)$ is multiplicatively dependent, completely classifying such…

Our main result is a construction of four families C_1,C_2,B_1,B_2 which are equipollent with the power set of the real line R and satisfy the following properties. (i) The members of the families are proper subfields of R whose algebraic…

Every binary De~Bruijn sequence of order n satisfies a recursion 0=x_n+x_0+g(x_{n-1}, ..., x_1). Given a function f on (n-1) bits, let N(f; r) be the number of functions generating a De Bruijn sequence of order n which are obtained by…

Parikh-collinear morphisms have the property that all the Parikh vectors of the images of letters are collinear, i.e., the associated adjacency matrix has rank 1. In the conference DLT-WORDS 2023 we showed that fixed points of…

In combinatorics on words, a classical topic of study is the number of specific patterns appearing in infinite sequences. For instance, many works have been dedicated to studying the so-called factor complexity of infinite sequences, which…

Cantor sets of integers have a rich set of arithmetic combinatorial properties. We consider classical Cantor sets, with a base and a fixed set of allowed digits. For such sets, we (a) give examples of such sets that satisfy the intersective…

This survey is devoted to necessary and suffcient conditions for a rational number to be representable by a Cantor series. Necessary and suffcient conditions are formulated for the case of an arbitrary sequence $(q_k)$.

Wall's theorem on arithmetic progressions says that if $0.a_1a_2a_3\dots$ is normal, then for any $k,\ell\in \mathbb{N}$, $0.a_ka_{k+\ell}a_{k+2\ell}\dots$ is also normal. We examine a converse statement and show that if…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Let $\mathbb{K}$ be an uncountable field of characteristic zero and let $f$ be a function from $\mathbb{K}^n$ to $\mathbb{K}$. We show that if the restriction of $f$ to every affine plane $L\subset\mathbb{K}^n$ is regular, then $f$ is a…

Let $A(K)$ be the algebra of continuous functions on a compact set $K\subset\mathbb C$ which are analytic on the interior of $K$, and $R(K)$ the closure (with the uniform convergence on $K$) of the functions that are analytic on a…

We present an elementary proof of the generalization of the $k$-bonacci Binet formula, a closed form calculation of the $k$-bonacci numbers using the roots of the characteristic polynomial of the $k$-bonacci recursion.

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…

Denote by $A(p, n, k)$ the number of commuting $p$-tuples of permutations on $[n]$ that have exactly $k$ distinct orbits. It was conjectured in~\cite{abdesselam2023log} that $A(p, n, k)$ is log-concave with respect to $k$ for every $p\geq…

Consider an elliptic curve defined over an imaginary quadratic field $K$ with good reduction at the primes above $p\geq 5$ and has complex multiplication by the full ring of integers $\mathcal{O}_K$ of $K$. In this paper, we construct…