Add to ORKGIn this thesis, I will discuss the relations and differences between EL-shellable and CL-shellable posets. I will present examples of EL-shellable posets that are previously known to be CL-shellable, including rank-selected subposets of EL- shellable posets such as the Smirnov words posets, and comodernistic lattices. I will show that EL-shellability is equivalent to root-independent recursive atom ordering, and present two examples of CL-shellable posets that are not EL- shellable, one of which is a graded poset and the other is ungraded. In the end, I will briefly discuss how I think might fully characterize CL-shellable posets that are not EL-shellable
AbstractIt is shown that any finite, rank-connected, dismantlable lattice is lexicographically shell...
28 Pages This research was supported by the EPSRC Grant EP/M027147/1.Peer reviewedPublisher PD
AbstractThe posetBm, n, which consists of the naturally ordered subwords of the cyclic word on lengt...
We present a simple example of a regular CW complex which is not shellable (in a sense defined by Bj...
The concept of shellability of complexes is generalized by deleting the requirement of purity (i.e.,...
AbstractIt is shown that the coset lattice of a finite group has shellable order complex if and only...
The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the ...
The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the ...
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable i...
DoctorIn this dissertation, we investigate the MacWilliams identity on poset codes. A result of Kim ...
One question relating to partially ordered sets (posets) is that of partitioning or dividing the pos...
A word p, over the alphabet of variables E, is a pattern of a word w over A if there exists a non-er...
Nous étudions dans cette thèse des structures généralisant la notion classique de mot. Elles sont co...
The reconstruction conjecture for posets is the following : every finite poset P of more than three ...
This dissertation deals with the typology and analysis of several types of ellipsis that have receiv...
AbstractIt is shown that any finite, rank-connected, dismantlable lattice is lexicographically shell...
28 Pages This research was supported by the EPSRC Grant EP/M027147/1.Peer reviewedPublisher PD
AbstractThe posetBm, n, which consists of the naturally ordered subwords of the cyclic word on lengt...
We present a simple example of a regular CW complex which is not shellable (in a sense defined by Bj...
The concept of shellability of complexes is generalized by deleting the requirement of purity (i.e.,...
AbstractIt is shown that the coset lattice of a finite group has shellable order complex if and only...
The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the ...
The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the ...
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable i...
DoctorIn this dissertation, we investigate the MacWilliams identity on poset codes. A result of Kim ...
One question relating to partially ordered sets (posets) is that of partitioning or dividing the pos...
A word p, over the alphabet of variables E, is a pattern of a word w over A if there exists a non-er...
Nous étudions dans cette thèse des structures généralisant la notion classique de mot. Elles sont co...
The reconstruction conjecture for posets is the following : every finite poset P of more than three ...
This dissertation deals with the typology and analysis of several types of ellipsis that have receiv...
AbstractIt is shown that any finite, rank-connected, dismantlable lattice is lexicographically shell...
28 Pages This research was supported by the EPSRC Grant EP/M027147/1.Peer reviewedPublisher PD
AbstractThe posetBm, n, which consists of the naturally ordered subwords of the cyclic word on lengt...
