English
Related papers

Related papers: Christoffel words and Markoff triples

200 papers

Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Gabriele Fici

Fixed points ${\bf u}=\varphi({\bf u})$ of marked and primitive morphisms $\varphi$ over arbitrary alphabet are considered. We show that if ${\bf u}$ is palindromic, i.e., its language contains infinitely many palindromes, then some power…

Combinatorics · Mathematics 2015-09-14 Sébastien Labbé , Edita Pelantová

A Markov operator $P$ acting on $C(X)$, where $X$ is compact, gives rise to a natural topological quiver. We use the theory of such quivers to attach a $C^{*}$-algebra to $P$ in a fashion that reflects some of the probabilistic properties…

Operator Algebras · Mathematics 2010-04-20 Marius Ionescu , Paul S. Muhly , Victor Vega

We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes.

Formal Languages and Automata Theory · Computer Science 2019-12-18 Štěpán Holub , Mike Müller

Starting from a Markov chain with a finite alphabet, we consider the chain obtained when all but one symbol are undistinguishable for the practitioner. We study necessary and sufficient conditions for this chain to have continuous…

Probability · Mathematics 2014-09-23 Walter A. F. de Carvalho , Sandro Gallo , Nancy L. Garcia

Log-linear models provide a statistically sound framework for Stochastic ``Unification-Based'' Grammars (SUBGs) and stochastic versions of other kinds of grammars. We describe two computationally-tractable ways of estimating the parameters…

Computation and Language · Computer Science 2007-05-23 Mark Johnson , Stuart Geman , Stephen Canon , Zhiyi Chi , Stefan Riezler

Consider a one-sided Markov additive process with an upper and a lower barrier, where each can be either reflecting or terminating. For both defective and non-defective processes and all possible scenarios we identify the corresponding…

Probability · Mathematics 2013-09-20 Jevgenijs Ivanovs

In this paper we study various properties of finite stochastic systems or hidden Markov chains as they are alternatively called. We discuss their construction following different approaches and we also derive recursive filtering formulas…

Probability · Mathematics 2014-07-15 Peter Spreij

We studied rules of transformations of Christoffel symbols under third type almost geodesic mappings in this paper. From this research, we obtained some new invariants of these mappings. These invariants are analogies of Thomas projective…

Differential Geometry · Mathematics 2017-10-17 Nenad O. Vesić

Ziv-Lempel and Crochemore factorization are two kinds of factorizations of words related to text processing. In this paper, we find these factorizations for standard epiesturmian words. Thus the previously known c-factorization of standard…

Discrete Mathematics · Computer Science 2010-11-30 M. Mohammad-Nooria , N. Ghareghanib , P. Sharifani

Polygons are compound geometric objects, but when trying to understand the expected behavior of a large collection of random polygons -- or even to formalize what a random polygon is -- it is convenient to interpret each polygon as a point…

History and Overview · Mathematics 2019-09-23 Clayton Shonkwiler

This article concerns on the existence of multiple solutions for a new Kirchhoff-type problem with negative modulus. We prove that there exist three nontrivial solutions when the parameter is enough small via the variational methods and…

Analysis of PDEs · Mathematics 2020-08-10 Yue Wang

Building on the concept of local lexing the concept of parameterized local lexing is introduced.

Logic in Computer Science · Computer Science 2017-04-14 Steven Obua

Probability generating functions for first passage times of Markov chains are found using the method of collective marks. A system of equations is found which can be used to obtain moments of the first passage times.

Probability · Mathematics 2019-08-14 Yiping ZHANG , Myron HLYNKA , Percy H. BRILL

For a class of Kirchhoff functional, we first give a complete classification with respect to the exponent $p$ for its $L^2$-normalized critical points, and show that the minimizer of the functional, if exists, is unique up to translations.…

Analysis of PDEs · Mathematics 2017-03-30 Xiaoyu Zeng , Yimin Zhang

We establish a relation between the known parametrization of a family of irreducible representations of a Weyl group and Springer's correspondence. We outline a parametrization of unipotent character sheaves on a connected reductive group…

Representation Theory · Mathematics 2012-02-14 G. Lusztig

Over an alphabet of size 3 we construct an infinite balanced word with critical exponent 2+sqrt(2)/2. Over an alphabet of size 4 we construct an infinite balanced word with critical exponent (5+sqrt(5))/4. Over larger alphabets, we give…

Combinatorics · Mathematics 2018-01-17 Narad Rampersad , Jeffrey Shallit , Élise Vandomme

A word $w$ is said to be closed if it has a proper factor $x$ which occurs exactly twice in $w$, as a prefix and as a suffix of $w$. Based on the concept of Ziv-Lempel factorization, we define the closed $z$-factorization of finite and…

Combinatorics · Mathematics 2021-06-08 Marieh Jahannia , Morteza Mohammad-noori , Narad Rampersad , Manon Stipulanti

The topological string interpretation of homological knot invariants has led to several insights into the structure of the theory in the case of sl(N). We study possible extensions of the matrix factorization approach to knot homology for…

High Energy Physics - Theory · Physics 2007-05-23 Sergei Gukov , Johannes Walcher

We classify toric Fano threefolds having at worst terminal singularities such that a rank of a $G$-invariant part of a class group equals one, where $G$ is a group acting on the variety by automorphisms.

Algebraic Geometry · Mathematics 2022-09-05 Arman Sarikyan