57,649 research outputs found
Quasi-Minuscule Quotients and Reduced Words for Reflections
We study the reduced expressions for reflections in Coxeter groups, with particular emphasis on finite Weyl groups. For example, the number of reduced expressions for any reflection can be expressed as the sum of the squares of the number of reduced expressions for certain elements naturally associated to the reflection. In the case of the longest reflection in a Weyl group, we use a theorem of Dale Peterson to provide an explicit formula for the number of reduced expressions. We also show that the reduced expressions for any Weyl group reflection are in bijection with the linear extensions of a natural partial ordering of a subset of the positive roots or co-roots.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46149/1/10801_2004_Article_333190.pd
A scattering of orders
A linear ordering is scattered if it does not contain a copy of the rationals. Hausdorff characterised the class of scattered linear orderings as the least family of linear orderings that includes the class of well-orderings and reversed well-orderings, and is closed under lexicographic sums with index set in . More generally, we say that a partial ordering is -scattered if it does not contain a copy of any -dense linear ordering. We prove analogues of Hausdorff's result for -scattered linear orderings, and for -scattered partial orderings satisfying the finite antichain condition. We also study the -scattered partial orderings, where is the saturated linear ordering of cardinality , and a partial ordering is -scattered when it embeds no copy of . We classify the -scattered partial orderings with the finite antichain condition relative to the -scattered linear orderings. We show that in general the property of being a -scattered linear ordering is not absolute, and argue that this makes a classification theorem for such orderings hard to achieve without extra set-theoretic assumptions
- âŠ