Related papers: Circular critical exponents for Thue-Morse factors
We consider moments of higher powers of quadratic Dirichlet character sums. In a restricted region, we give their asymptotic behavior by using de la Bret\`{e}che's multivariable Tauberian theorem. We also give the lower bound of the…
A circular word, or a necklace, is an equivalence class under conjugation of a word. A fundamental question concerning regularities in standard words is bounding the number of distinct squares in a word of length $n$. The famous conjecture…
The hyperdeterminant of a polynomial (interpreted as a symmetric tensor) factors into several irreducible factors with multiplicities. Using geometric techniques these factors are identified along with their degrees and their…
Two-term recurrence relations are supplied for indefinite integrals of functions that involve factors of the types ${P_2}^n$, ${P_3}^n$, ${P_4}^n$, ${P_1}^m {Q_1}^n$, $E_1 {P_1}^n$, ${P_1}^m {Q_2}^n$, $E_1 {P_2}^n$, ${P_2}^m {Q_2}^n$,…
We consider Rote words, which are infinite binary words with factor complexity $2n$. We prove that the repetition threshold for this class is $5/2$. Our technique is purely computational, using the Walnut theorem prover and a new technique…
A word over an ordered alphabet is said to be clustering if identical letters appear adjacently in its Burrows-Wheeler transform. Such words are strictly related to (discrete) interval exchange transformations. We use an extended version of…
An infinite $\pm 1$-sequence is called {\it Apwenian} if its Hankel determinant of order $n$ divided by $2^{n-1}$ is an odd number for every positive integer $n$. In 1998, Allouche, Peyri\`ere, Wen and Wen discovered and proved that the…
In this paper, we investigate quantum Fourier analysis on subfactors and unitary fusion categories. We prove the complete positivity of the comultiplication for subfactors and derive a primary $n$-criterion of unitary categorifcation of…
We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq \Delta C(n) + 2, for all n \in N. For a large class of words it is a better estimate…
In this paper we improve drastically the estimate for the multiplicity of a binary recurrence. The main contribution comes from an effective version of the Faltings' Product Theorem.
We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…
An interesting phenomenon in combinatorics on words is when every recurrent word satisfying some avoidance constraints has the same factor set as a morphic word. An early example is the Hall-Thue word, fixed point of the morphism…
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we…
The q-characters of quantum loop algebras are very important objects in representation theory. In [20], we showed that q-characters factor as a power series of the form studied in [9] times a character, an important phenomenon which had…
The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…
We derive a formula which expresses a second order cumulant whose entries are products as a sum of cumulants where the entries are single factors. This extends to the second order case the formula of Krawczyk and Speicher. We apply our…
We describe majorization between selfadjoint operators in a $\sigma$-finite II$_\infty$ factor $(\mathcal{M},\tau)$ in terms of simple spectral relations. For a diffuse abelian von Neumann subalgebra $\mathcal{A}\subset \mathcal{M}$ with…
We obtain an iterative formula that converges incrementally to the smallest singular value. Similarly, we obtain an iterative formula that converges decreasingly to the largest singular value.
This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.
The purpose of this article is to study the eigenvalues $u_1^{\, t}=e^{it\theta_1},\dots,u_N^{\,t}=e^{it\theta_N}$ of $U^t$ where $U$ is a large $N\times N$ random unitary matrix and $t>0$. In particular we are interested in the typical…