相关论文: The Narayana Morphism and Related Words

Narayana's cows problem is a problem similar to the Fibonacci's rabbit problem. We define the numbers which are the solutions of this problem as Narayana's cows numbers. Narayana's cows sequence satisfies the third order recurrence relation…

In this paper, we introduce and develop the method of diagonalization of functions $f:\mathbb{N}\longrightarrow \mathbb{R}$. We apply this method to show that the equations of the form $\Gamma_r(n)+k=m^2$ has a finite number of solutions…

Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member…

The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…

Let N_1 (resp.N_2) be a nest A (resp. B) be the corresponding nest algebra, A_0 (resp. B_0) be the subalgebra of compact operators. We prove that the nests N_1, N_2 are isomorphic if and only if the algebras A, B are weakly-* Morita…

In this paper, we find all repdigits which can be expressed as the product of a Narayana, and a product of two repdigits is Narayana.

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…

An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…

The Fibonacci word is the fixed point beginning with the letter $a$ of morphism $\sigma(a)=ab$, $\sigma(b)=a$ defined over the alphabet $\{a,b\}$. In this paper, we get explicit expression of the number of distinct fractional powers in each…

We introduce a new simplicial nerve of higher dimensional automata whose homology groups yield a new definition of the globular homology. With this new definition, the drawbacks noticed with the construction of math.CT/9902151 disappear.…

We introduce two classes of morphisms over the alphabet $A=\{0,1\}$ whose fixed points contain infinitely many antipalindromic factors. An antipalindrome is a finite word invariant under the action of the antimorphism…

We study O(n)-symmetric two-dimensional conformal field theories (CFTs) for a continuous range of n below two. These CFTs describe the fixed point behavior of self-avoiding loops. There is a pair of known fixed points connected by an RG…

This paper surveys Campana's theory of C-pairs (or "geometric orbifolds") in the complex-analytic setting, to serve as a reference for future work. Written with a view towards applications in hyperbolicity, rational points, and entire…

We analyze the algorithm in [Holub, 2009], which decides whether a given word is a fixed point of a nontrivial morphism. We show that it can be implemented to have complexity in O(mn), where n is the length of the word and m the size of the…

A two-dimensional finite automaton has a read-only input head that moves in four directions on a finite array of cells labelled by symbols of the input alphabet. A three-way two-dimensional automaton is prohibited from making upward moves,…

Metrically homogeneous graphs are connected graphs which, when endowed with the path metric, are homogeneous as metric spaces. In this paper we introduce the concept of twisted automorphisms, a notion of isomorphism up to a permutation of…

We establish rigidity (or uniqueness) theorems for nc automorphisms which are natural extensions of clasical results of H.~Cartan and are improvements of recent results. We apply our results to nc-domains consisting of unit balls of…

We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least…

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…