Publication date
March 1988
DOI Publisher
Published by Elsevier Inc. ISSN
0097-3165 Citation count (estimate)
19Abstract
AbstractWe study properties of a lattice order defined on shuffles of subwords of a pair of fixed words
AbstractWe study properties of a lattice order defined on shuffles of subwords of a pair of fixed words
AbstractWe study posets defined by Stanley as a multiset generalization of Greene's posets of shuffl...
Let P be a poset and let P ∗ be the set of all finite length words over P. Gener-alized subword orde...
AbstractThe posetBm, n, which consists of the naturally ordered subwords of the cyclic word on lengt...
C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted m,n. In...
AbstractWe study posets defined by Stanley as a multiset generalization of Greene's posets of shuffl...
By assigning a distinct positive integer to each join-irreducible of a lattice, with each element of...
AbstractThe posetBm, n, which consists of the naturally ordered subwords of the cyclic word on lengt...
AbstractC. Greene (J. Combin. Theory Ser. A 47 (1988), 126–131) studied a family of lattices denoted...
Given a set I of words, the set L⊢ I ∈ of all words obtained by the shuffle of (copies of) words of ...
Given a set I of words, the set L⊢Iε{lunate} of all words obtained by the shuffle of (copies of) wor...
AbstractGiven a set I of words, the set L⊢Iϵ of all words obtained by the shuffle of (copies of) wor...
AbstractGiven a set I of words, the set L⊢Iϵ of all words obtained by the shuffle of (copies of) wor...
AbstractThe free monoid generated by two letters is a poset for the relation “u is a subword of v.” ...
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then use...
Let $P$ be a poset and let $P^*$ be the set of all finite length words over $P$. Generalized subword...
AbstractWe study posets defined by Stanley as a multiset generalization of Greene's posets of shuffl...
Let P be a poset and let P ∗ be the set of all finite length words over P. Gener-alized subword orde...
AbstractThe posetBm, n, which consists of the naturally ordered subwords of the cyclic word on lengt...
C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted m,n. In...
AbstractWe study posets defined by Stanley as a multiset generalization of Greene's posets of shuffl...
By assigning a distinct positive integer to each join-irreducible of a lattice, with each element of...
AbstractThe posetBm, n, which consists of the naturally ordered subwords of the cyclic word on lengt...
AbstractC. Greene (J. Combin. Theory Ser. A 47 (1988), 126–131) studied a family of lattices denoted...
Given a set I of words, the set L⊢ I ∈ of all words obtained by the shuffle of (copies of) words of ...
Given a set I of words, the set L⊢Iε{lunate} of all words obtained by the shuffle of (copies of) wor...
AbstractGiven a set I of words, the set L⊢Iϵ of all words obtained by the shuffle of (copies of) wor...
AbstractGiven a set I of words, the set L⊢Iϵ of all words obtained by the shuffle of (copies of) wor...
AbstractThe free monoid generated by two letters is a poset for the relation “u is a subword of v.” ...
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then use...
Let $P$ be a poset and let $P^*$ be the set of all finite length words over $P$. Generalized subword...
AbstractWe study posets defined by Stanley as a multiset generalization of Greene's posets of shuffl...
Let P be a poset and let P ∗ be the set of all finite length words over P. Gener-alized subword orde...
AbstractThe posetBm, n, which consists of the naturally ordered subwords of the cyclic word on lengt...
Add to ORKG