Results 91 to 100 of about 70,377,857 (147)
On the Hardness of Switching to a Small Number of Edges
Journal of Graph Theory, Volume 113, Issue 2, Page 237-251, October 2026.ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek +2 more
wiley +1 more source
Rich, Sturmian, and trapezoidal words [PDF]
, 2008 In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced by the second and third authors together with J. Justin and S. Widmer, constitute a new class of finite and infinite
Zamboni, L. +5 more
core
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
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
There Exist Binary Circular 5/2+ Power Free Words of Every Length [PDF]
, 2004 We show that there exist binary circular 5/2 power free words of every length. Keywords: Combinatorics on words, Dejean's conjecture, Thue-Morse word
Currie, James D. +3 more
core
International Journal of Mathematical Combinatorics, Vol.2A [PDF]
, 2008 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +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
Experiments with language combinatorics in text classification: lessons learned and future implications [PDF]
, 2017 This paper presents a meta-analysis of experiments performed with language combinatorics (LC), a novel language model generation and feature extraction method based on combinatorial manipulations of sentence elements (e.g., words).
Masui, Fumito, Ptaszynski, Michal
core +1 more source
Combinatorics, Automata and Number Theory
, 2010 editorial reviewedThis collaborative volume presents trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory.
core +1 more source