相关论文: Common factors in automatic and Sturmian sequences
We show that there is no automaton accepting the Tribonacci representations of $n$ and $x$ in parallel, where $\psi = 1.839\cdots$ is the Tribonacci constant, and $x= \lfloor n \psi \rfloor$. Similarly, there is no Tribonacci automaton…
We study k-median clustering under the sequential no-substitution setting. In this setting, a data stream is sequentially observed, and some of the points are selected by the algorithm as cluster centers. However, a point can be selected as…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.
We study the pseudorandomness of automatic sequences in terms of well-distribution and correlation measure of order 2. We detect non-random behavior which can be derived either from the functional equations satisfied by their generating…
Drawing inspiration from a recent paper of Heuberger, Krenn, and Lipnik, we define the class of strongly k-recursive sequences. We show that every k-automatic sequence is strongly $k$-recursive, therefore k-recursive, and discuss that the…
We show that there is no Curtis-Hedlund-Lyndon Theorem for factor maps between tiling dynamical systems: there are codes between such systems which cannot be achieved by working within a finite window. By considering 1-dimensional tiling…
We conceive finite automata as dynamical systems on discontinuum and investigate their factors. Factors of finite automata include many well-known simple dynamical systems, e.g. hyperbolic systems and systems with finite attractors. In the…
Factorial k-means (FKM) clustering is a method for clustering objects in a low-dimensional subspace. The advantage of this method is that the partition of objects and the low-dimensional subspace reflecting the cluster structure are…
General formula for symmetry factors (S-factor) of Feynman diagrams containing fields with high spins is derived. We prove that symmetry factors of Feynman diagrams of well-known theories do not depend on spins of fields. In contributions…
Let X=(X^0,\mu,T) be an ergodic measure preserving system. For a natural number k we consider the averages (*) 1/N \sum_{n=1}^N \prod_{j=1}^k f_j(T^{n a_j}x) where the functions f_j are bounded, and a_j are integers. A factor of X is…
For a finite alphabet $\mathcal{A}$ and a sequence $x \in \mathcal{A}^{\mathbb{N}}$, Kamae and Zamboni defined the maximal pattern complexity function $p^*_x(n)$ as a natural generalization of usual word complexity. They defined a…
In this book chapter, written in French, we consider the classical family of Sturmian words, defined as the aperiodic infinite words containing only $n+1$ factors of a length $n$, which is the minimal possible value. We will discuss several…
In the theory of linear switching systems with discrete time, as in other areas of mathematics, the problem of studying the growth rate of the norms of all possible matrix products $A_{\sigma_{n}}\cdots A_{\sigma_{0}}$ with factors from a…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
It is shown that quantum-type coherence, leading to indeterminism and interference of probabilities, may in principle exist in the absence of the Planck constant and a Hamiltonian. Such coherence is a combined effect of a symmetry (not…
A formal inverse of a given automatic sequence (the sequence of coefficients of the composition inverse of its associated formal power series) is also automatic. The comparison of properties of the original sequence and its formal inverse…
A method for estimating the merit factors of sequences will be provided. The result is also effective in determining the nonexistence of certain infinite collections of cyclic difference sets and cyclic matrices and associated binary…
Although quantum coherence is a basic trait of quantum mechanics, the presence of coherences in the quantum description of a certain phenomenon does not rule out the possibility to give an alternative description of the same phenomenon in…
A Sturmian sequence is an infinite nonperiodic string over two letters with minimal subword complexity. In two papers, the first written by Morse and Hedlund in 1940 and the second by Coven and Hedlund in 1973, a surprising correspondence…