Let $P$ be a poset and let $P^*$ be the set of all finite length words over $P$. Generalized subword order is the partial order on $P^*$ obtained by letting $u≤ w$ if and only if there is a subword $u'$ of $w$ having the same length as $u$ such that each element of $u$ is less than or equal to the corresponding element of $u'$ in the partial order on $P$. Classical subword order arises when $P$ is an antichain, while letting $P$ be a chain gives an order on compositions. For any finite poset $P$, we give a simple formula for the Möbius function of $P^*$ in terms of the Möbius function of $P$. This permits us to rederive in an easy and uniform manner previous results of Björner, Sagan and Vatter, and Tomie. We are also able to determine the...
AbstractWe show that the set of finite posets is a well-quasi-ordering with respect to a certain rel...
We present a two term formula for the Möbius function of intervals in the poset of all permutations,...
AbstractWe show that the set of finite posets is a well-quasi-ordering with respect to a certain rel...
International audienceLet $P$ be a poset and let $P^*$ be the set of all finite length words over $P...
Let P be a poset and let P⁎ be the set of all finite length words over P. Generalized subword order ...
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...
AbstractThe posetBm, n, which consists of the naturally ordered subwords of the cyclic word on lengt...
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then use...
28 Pages This research was supported by the EPSRC Grant EP/M027147/1.Peer reviewedPublisher PD
A word p, over the alphabet of variables E, is a pattern of a word w over A if there exists a non-er...
A word p, over the alphabet of variables E, is a pattern of a word w over A if there exists a non-er...
AbstractA word p, over the alphabet of variables E, is a pattern of a word w over A if there exists ...
Given a finite, graded partially ordered set P, there is an associated simplicial complex of \ud ch...
Various authors have studied a natural operation (under various names) on the order ideals (equivale...
AbstractWe show that the set of finite posets is a well-quasi-ordering with respect to a certain rel...
We present a two term formula for the Möbius function of intervals in the poset of all permutations,...
AbstractWe show that the set of finite posets is a well-quasi-ordering with respect to a certain rel...
International audienceLet $P$ be a poset and let $P^*$ be the set of all finite length words over $P...
Let P be a poset and let P⁎ be the set of all finite length words over P. Generalized subword order ...
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...
AbstractThe posetBm, n, which consists of the naturally ordered subwords of the cyclic word on lengt...
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then use...
28 Pages This research was supported by the EPSRC Grant EP/M027147/1.Peer reviewedPublisher PD
A word p, over the alphabet of variables E, is a pattern of a word w over A if there exists a non-er...
A word p, over the alphabet of variables E, is a pattern of a word w over A if there exists a non-er...
AbstractA word p, over the alphabet of variables E, is a pattern of a word w over A if there exists ...
Given a finite, graded partially ordered set P, there is an associated simplicial complex of \ud ch...
Various authors have studied a natural operation (under various names) on the order ideals (equivale...
AbstractWe show that the set of finite posets is a well-quasi-ordering with respect to a certain rel...
We present a two term formula for the Möbius function of intervals in the poset of all permutations,...
AbstractWe show that the set of finite posets is a well-quasi-ordering with respect to a certain rel...