Results 41 to 50 of about 4,202,174 (239)
Rationality, irrationality, and Wilf equivalence in generalized factor order [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Let $P$ be a partially ordered set and consider the free monoid $P^{\ast}$ of all words over $P$. If $w,w' \in P^{\ast}$ then $w'$ is a factor of $w$ if there are words $u,v$ with $w=uw'v$. Define generalized factor order on $P^{\ast}$ by letting $u \leq
Sergey Kitaev +3 more
doaj +1 more source
Structure and enumeration of $(3+1)$-free posets (extended abstract) [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 A poset is $(3+1)$-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets are the subject of the $(3+1)$-free conjecture of Stanley and Stembridge.
Mathieu Guay-Paquet +2 more
doaj +1 more source
On a complete lattice of retracts of a free monoid generated by three elements [PDF]
Opuscula Mathematica, 2008 We prove that the family of retracts of a free monoid generated by three elements, partially ordered with respect to the inclusion, is a complete lattice.
Wit Foryś
doaj
On subtrees of the representation tree in rational base numeration systems [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Every rational number p/q defines a rational base numeration system in which every integer has a unique finite representation, up to leading zeroes. This work is a contribution to the study of the set of the representations of integers.
Shigeki Akiyama +2 more
doaj +1 more source
About Applications of Distances on Monoids of Strings [PDF]
Computer Science Journal of Moldova, 2016 In this article we show that there are invariant distances on the monoid $L(A)$ of all strings closely related to Levenshtein's distance. We will use a distinct definition of the distance on $L(A)$, based on the Markov -– Graev method, proposed by ...
Mitrofan Choban, Ivan Budanaev
doaj
Every finite system of T1 uniformities comes from a single distance structure
Applied General Topology, 2002 Using the general notion of distance function introduced in an earlier paper, a construction of the finest distance structure which induces a given quasi-uniformity is given.
Jobst Heitzig
doaj +1 more source
Gelfand Models for Diagram Algebras [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 A Gelfand model for a semisimple algebra $\mathsf{A}$ over $\mathbb{C}$ is a complex linear representation that contains each irreducible representation of $\mathsf{A}$ with multiplicity exactly one.
Tom Halverson
doaj +1 more source
Thue-Morse sequence and p-adic topology for the free monoid
Discrete Mathematics, 1989 J. Berstel, M. Crochemore, J. Pin
semanticscholar +2 more sources
On the periodicity of morphisms on free monoids [PDF]
RAIRO - Theoretical Informatics and Applications, 1986 It is shown that for a given endomorphism h on a given finitely generated free monoid there are only finitely many primitive words w for which \(h(w)=w^ n\) for some \(n\geq 2\). Moreover, all such words can be effectively found. Using this result, the D0L periodicity problem is shown to be decidable, that is, it is decidable whether there exist words ...
Tero Harju, Matti Linna
openaire +3 more sources
Linear Algebra and its Applications, 1976 AbstractA matrix characterization is obtained for the epimorphisms in the category of finitely generated free monoids. It follows from our result that it is effectively decidable whether a given morphism is an epimorphism. The corresponding question for monomorphisms has been answered in the algorithm of Sardinas and Patterson.
openaire +2 more sources