Related papers: On balanced sequences and their critical exponent
Natural numbers satisfying a certain unusual property are defined by the author in a previous note. Later, the author called such numbers $v$-palindromic numbers and proved a periodic phenomenon pertaining to such numbers and repeated…
We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…
These lecture notes provide an introduction to combinatorics on words and its interactions with dynamics, algebra, and arithmetic. The central theme is the notion of low factor complexity for infinite words. We investigate the following…
We examine affine correspondences of the form g(y)=f(x), for f and g polynomials satisfying deg(g) < deg(f), with the property that every critical point of the correspondence admits at least one finite forward orbit. In the case g(y)=y,…
An outline is given of an extended perturbative solution of Euclidean QCD which systematically accounts for a class of nonperturbative effects, while allowing renormalization by the perturbative counterterms. Proper vertices Gamma are…
In this paper we characterize the definiteness of the discrete symplectic system, study a nonhomogeneous discrete symplectic system, and introduce the minimal and maximal linear relations associated with these systems. Fundamental…
The identification of binary sequences with large merit factor (small mean-squared aperiodic autocorrelation) is an old problem of complex analysis and combinatorial optimization, with practical importance in digital communications…
It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound log_{2}(n)} + 1 for the number of distinct Lyndon factors that a Lyndon…
The behavior of the leading singular values and vectors of noisy low-rank matrices is fundamental to many statistical and scientific problems. Theoretical understanding currently derives from asymptotic analysis under one of two regimes:…
This work discusses model reduction for differential-algebraic systems with quadratic output equations. Under mild conditions, these systems can be transformed into a Weierstra{\ss} canonical form and, thus, be decoupled into differential…
The problem is considered of arranging symbols around a cycle, in such a way that distances between different instances of a same symbol be as uniformly distributed as possible. A sequence of moments is defined for cycles, similarly to the…
Determining the index of the Simon congruence is a long outstanding open problem. Two words $u$ and $v$ are called Simon congruent if they have the same set of scattered factors, which are parts of the word in the correct order but not…
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
Matrix completion algorithms recover a low rank matrix from a small fraction of the entries, each entry contaminated with additive errors. In practice, the singular vectors and singular values of the low rank matrix play a pivotal role for…
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…
Let $\Sigma$ be a countable alphabet. For $r\geq 1$, an infinite sequence $s$ with characters from $\Sigma$ is called $r$-quasi-regular, if for each $\sigma\in\Sigma$ the ratio of the longest to shortest interval between consecutive…
We study the dynamics of the renormalization operator acting on the space of pairs (v,t), where v is a diffeomorphism and t belongs to [0,1], interpreted as unimodal maps x-->v(q_t(x)), where q_t(x)=-2t|x|^a+2t-1. We prove the so called…
We consider a Markov chain that iteratively generates a sequence of random finite words in such a way that the $n^{\mathrm{th}}$ word is uniformly distributed over the set of words of length $2n$ in which $n$ letters are $a$ and $n$ letters…
Brlek et al. (2008) studied smooth infinite words and established some results on letter frequency, recurrence, reversal and complementation for 2-letter alphabets having same parity. In this paper, we explore smooth infinite words over…
A word contains a \emph{half-flip} if it contains non-empty factors $uv$ and $vu$ where $|u|=|v|$. Fici reports a non-constructive proof of the existence of an infinite word over a finite alphabet avoiding half-flips and asks for the size…