Results 91 to 100 of about 73,359 (215)
Note on decipherability of three-word codes
International Journal of Mathematics and Mathematical Sciences, 2002 The theory of uniquely decipherable (UD) codes has been widely developed in connection with automata theory, combinatorics on words, formal languages, and monoid theory.
F. Blanchet-Sadri, T. Howell
doaj +1 more source
Some structures of the catalan numbers I [PDF]
ریاضی و جامعهThe Catalan numbers are ubiquitous in counting problems which is one of the primary reasons for its popularity. From various sources like books and Wikipedia we see that in combinatorial mathematics.
Daniel Yaqubi, Madjid Mirzavaziri
doaj +1 more source
Palindromic Decompositions with Gaps and Errors
, 2017 Identifying palindromes in sequences has been an interesting line of research in combinatorics on words and also in computational biology, after the discovery of the relation of palindromes in the DNA sequence with the HIV virus. Efficient algorithms for
A Apostolico +17 more
core +1 more source
, 2014 In 2000, Babson and Steingr\'imsson introduced the notion of what is now known as a permutation vincular pattern, and based on it they re-defined known Mahonian statistics and introduced new ones, proving or conjecturing their Mahonity. These conjectures
Kitaev, Sergey, Vajnovszki, Vincent
core
Binary Matrixes Based on Pascal’s Triangle’s Arithmetics and Char Sequences
Известия Иркутского государственного университета: Серия "Математика", 2016 This work describes consisting of zeroes and ones mathematical model, binary matrix obtained by the arithmetical and combinatorial transformations of Pascal's triangle.
O. Kuzmin, B. Starkov
doaj
$3$-dimensional Continued Fraction Algorithms Cheat Sheets [PDF]
, 2015 Multidimensional Continued Fraction Algorithms are generalizations of the Euclid algorithm and find iteratively the gcd of two or more numbers. They are defined as linear applications on some subcone of $\mathbb{R}^d$.
Labbé, Sébastien
core
Short survey about combinatorics on words and algorithmic methods in a ring (draft) [PDF]
, 2016 Mikhail Kharitonov
openalex +1 more source
Random Fibonacci Words via Clone Schur Functions
Forum of Mathematics, SigmaWe investigate positivity and probabilistic properties arising from the Young–Fibonacci lattice $\mathbb {YF}$ , a 1-differential poset on words composed of 1’s and 2’s (Fibonacci words) and graded by the sum of the digits.
Leonid Petrov, Jeanne Scott
doaj +1 more source
Combinatorics of Words and Semigroup Algebras Which Are Sums of Locally Nilpotent Subalgebras [PDF]
, 2004 Vesselin Drensky, Lakhdar Hammoudi
openalex +1 more source
Heisenberg-Weyl algebra revisited: Combinatorics of words and paths [PDF]
, 2009 Paweł Błasiak +4 more
openalex +1 more source