Related papers: Circular critical exponents for Thue-Morse factors
In this short article, we study factor colorings of aperiodic linearly recurrent infinite words. We show that there always exists a coloring which does not admit a monochromatic factorization of the word into factors of increasing lengths.
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…
This paper proposes a new factor rotation for the context of functional principal components analysis. This rotation seeks to re-represent a functional subspace in terms of directions of decreasing smoothness as represented by a generalized…
We introduce self-similar algebras and groups closely related to the Thue-Morse sequence, and begin their investigation by describing a character on them, the "spread" character.
In 2005, Rampersad and the second author proved a number of theorems about infinite words x with the property that if w is any sufficiently long finite factor of x, then its reversal w^R is not a factor of x. In this note we revisit these…
We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We…
In recent work, we considered the frequencies of patterns of consecutive primes $\pmod{q}$ and numerically found biases toward certain patterns and against others. We made a conjecture explaining these biases, the dominant factor in which…
We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…
A formula expressing the fermionic determinant as an infinite product of smaller determinants is derived and discussed. These smaller determinants are of a fixed size, independent of the size of the lattice and are indexed by loops of…
The critical exponent $E(\mathbf u)$ of an infinite sequence $\mathbf u$ over a finite alphabet expresses the maximal repetition of a factor in $\mathbf u$. By the famous Dejean's theorem, $E(\mathbf u) \geq 1+\frac1{d-1}$ for every $d$-ary…
Continued fraction expansions and Hankel determinants of automatic sequences are extensively studied during the last two decades. These studies found applications in number theory in evaluating irrationality exponents. The present paper is…
Let $(X,T,\mu,d)$ be a metric measure-preserving system for which $3$-fold correlations decay exponentially for Lipschitz continuous observables. Suppose that $(M_k)$ is a sequence satisfying some weak decay conditions and suppose there…
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…
Recent results for rotations expressed as polynomials of spin matrices are derived here by elementary differential equation methods. Structural features of the results are then examined in the framework of biorthogonal systems, to obtain an…
We study various aspects of Dyck words appearing in binary sequences, where $0$ is treated as a left parenthesis and $1$ as a right parenthesis. We show that binary words that are $7/3$-power-free have bounded nesting level, but this no…
A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…
We provide a non-trivial measure of irrationality for a class of Mahler numbers defined with infinite products which cover the Thue-Morse constant.
Factor complexity $\mathcal{C}$ and palindromic complexity $\mathcal{P}$ of infinite words with language closed under reversal are known to be related by the inequality $\mathcal{P}(n) + \mathcal{P}(n+1) \leq 2 +…
We prove a recursive identity involving formal iterated logarithms and formal iterated exponentials. These iterated logarithms and exponentials appear in a natural extension of the logarithmic formal calculus used in the study of…