Results 91 to 100 of about 73,517 (203)
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
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
Size‐Ramsey Numbers of Structurally Sparse Graphs
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT Size‐Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erdős, Faudree, Rousseau, and Schelp in 1978. Research has mainly focused on the size‐Ramsey numbers of n$$ n $$‐vertex graphs with constant maximum degree Δ$$ \Delta $$.
Nemanja Draganić +4 more
wiley +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
, 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
Combinatorics on partial word borders
Theoretical Computer Science, 2016 A partial word contains holes that can be filled with any character of the alphabet, a border is a non-empty proper prefix that is also a suffix, and the border array contains the length of the longest border of each prefix of the word. The authors determine the maximal number of holes with specified longest border, in particular in an unbordered ...
Allen, Emily +5 more
openaire +2 more sources
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
Enumerative combinatorics on words [PDF]
, 2001 Generating series, also called generating functions, play an important role in combinatorial mathematics. Many enumeration problems can be solved by transferring the basic operations on sets into algebraic operations on formal series leading to a solution of an enumeration problem.
openaire +2 more sources
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
Generación de curvas fractales a partir de homomorfismos entre lenguajes [con Mathematica R]
Revista Integración, 2012 En este artículo se hace una implementación con el software Mathematica 8.0 de algunas propiedades combinatorias de la cadena o palabra de Fibonacci, la cual se puede generar a partir de la iteración de un homomorfismo entre lenguajes.
José L. Ramírez, Gustavo N. Rubiano
doaj