Results 31 to 40 of about 593 (116)
Interactions between Digital Geometry and Combinatorics on Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We review some recent results in digital geometry obtained by using a combinatorics on words approach to discrete geometry. Motivated on the one hand by the well-known theory of Sturmian words which model conveniently discrete lines in the plane, and on ...
Srečko Brlek
doaj +1 more source
On infinite permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We define an infinite permutation as a sequence of reals taken up to the order, or, equivalently, as a linear ordering of a finite or countable set. Then we introduce and characterize periodic permutations; surprisingly, for each period $t$ there is an ...
Dmitri G. Fon-Der-Flaass, Anna E. Frid
doaj +1 more source
On the Lie complexity of Sturmian words
Theoretical Computer Science, 2022 Bell and Shallit recently introduced the Lie complexity of an infinite word $s$ as the function counting for each length the number of conjugacy classes of words whose elements are all factors of $s$. They proved, using algebraic techniques, that the Lie complexity is bounded above by the first difference of the factor complexity plus one; hence, it is
Alessandro De Luca 0002, Gabriele Fici
openaire +5 more sources
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Perrin, D, RESTIVO, Antonio
openaire +4 more sources
Abelian Repetitions in Sturmian Words [PDF]
, 2013 We investigate abelian repetitions in Sturmian words. We exploit a bijection between factors of Sturmian words and subintervals of the unitary segment that allows us to study the periods of abelian repetitions by using classical results of elementary Number Theory.
Gabriele Fici +5 more
openaire +5 more sources
On minimal Sturmian partial words
Discrete Applied Mathematics, 2011 The subword complexity \(p_w (n)\) of a word \(w\) is the function that maps \(n\) to the number of distinct length-\(n\) factors occurring in \(w\). A partial word is a word with a ``don't care'' symbol \(\diamond\) that matches every other symbol. The notion of subword complexity can be extended to partial words \(w\) by counting the total number of ...
Blanchet-Sadri, Francine, Lensmire, John
openaire +4 more sources
Sturmian words, Lyndon words and trees
Theoretical Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Berstel, Jean, de Luca, Aldo
openaire +4 more sources
Discrete Dynamics in Nature and Society, Volume 2018, Issue 1, 2018., 2018 This paper is concerned with boundary value problems for a fourth‐order nonlinear difference equation. Via variational methods and critical point theory, sufficient conditions are obtained for the existence of at least two nontrivial solutions, the existence of n distinct pairs of nontrivial solutions, and nonexistence of solutions.
Xia Liu +3 more
wiley +1 more source
The Existence and Structure of Rotational Systems in the Circle
Abstract and Applied Analysis, Volume 2018, Issue 1, 2018., 2018 By a rotational system, we mean a closed subset X of the circle, T=R/Z, together with a continuous transformation f : X → X with the requirements that the dynamical system (X, f) be minimal and that f respect the standard orientation of T. We show that infinite rotational systems (X, f), with the property that map f has finite preimages, are extensions
Jayakumar Ramanathan, Simeon Reich
wiley +1 more source
Solvability of Nth Order Linear Boundary Value Problems
International Journal of Differential Equations, Volume 2015, Issue 1, 2015., 2015 This paper presents a method that provides necessary and sufficient conditions for the existence of solutions of nth order linear boundary value problems. The method is based on the recursive application of a linear integral operator to some functions and the comparison of the result with these same functions.
P. Almenar, L. Jódar, Peiguang Wang
wiley +1 more source