Let w be the element of maximal length in a finite irreducible Coxeter system （W, S）. In the present paper, we get the length of w when （W, S） is of type An, Bn/Cn or Dn.
Hyperbolic Coxeter polytopes are defined precisely by combinatorial type. Polytopes in hyperbolic n-space with n + p faces that have the combinatorial type of a pyramid over a product of simplices were classified by T...Hyperbolic Coxeter polytopes are defined precisely by combinatorial type. Polytopes in hyperbolic n-space with n + p faces that have the combinatorial type of a pyramid over a product of simplices were classified by Tumarkin for small p. In this article we generalise Tumarkin’s methods and find the remaining hyperbolic Coxeter pyramids.展开更多
In 1986, G.X. Viennot introduced the theory of heaps of pieces as a visualization of Cartier and Foata’s “partially commutative monoids”. These are essentially labeled posets satisfying a few additional properties,...In 1986, G.X. Viennot introduced the theory of heaps of pieces as a visualization of Cartier and Foata’s “partially commutative monoids”. These are essentially labeled posets satisfying a few additional properties, and one natural setting where they arise is as models of reduced words in Coxeter groups. In this paper, we introduce a cyclic version of a heap, which loosely speaking, can be thought of as taking a heap and wrapping it into a cylinder. We call this object a toric heap, because we formalize it as a labeled toric poset, which is a cyclic version of an ordinary poset. Defining the category of toric heaps leads to the notion of certain morphisms such as toric extensions. We study toric heaps in Coxeter theory, because a cyclic shift of a reduced word is simply a conjugate by an initial or terminal generator. As such, we formalize and study a framework that we call cyclic reducibility in Coxeter theory, which is closely related to conjugacy. We introduce what it means for elements to be torically reduced, which is a stronger condition than simply being cyclically reduced. Along the way, we encounter a new class of elements that we call torically fully commutative (TFC), which are those that have a unique cyclic commutativity class, and comprise a strictly bigger class than the cyclically fully commutative (CFC) elements. We prove several cyclic analogues of results on fully commutative (FC) elements due to Stembridge. We conclude with how this framework fits into recent work in Coxeter groups, and we correct a minor flaw in a few recently published theorems.展开更多
文摘Let w be the element of maximal length in a finite irreducible Coxeter system （W, S）. In the present paper, we get the length of w when （W, S） is of type An, Bn/Cn or Dn.
文摘Hyperbolic Coxeter polytopes are defined precisely by combinatorial type. Polytopes in hyperbolic n-space with n + p faces that have the combinatorial type of a pyramid over a product of simplices were classified by Tumarkin for small p. In this article we generalise Tumarkin’s methods and find the remaining hyperbolic Coxeter pyramids.
文摘In 1986, G.X. Viennot introduced the theory of heaps of pieces as a visualization of Cartier and Foata’s “partially commutative monoids”. These are essentially labeled posets satisfying a few additional properties, and one natural setting where they arise is as models of reduced words in Coxeter groups. In this paper, we introduce a cyclic version of a heap, which loosely speaking, can be thought of as taking a heap and wrapping it into a cylinder. We call this object a toric heap, because we formalize it as a labeled toric poset, which is a cyclic version of an ordinary poset. Defining the category of toric heaps leads to the notion of certain morphisms such as toric extensions. We study toric heaps in Coxeter theory, because a cyclic shift of a reduced word is simply a conjugate by an initial or terminal generator. As such, we formalize and study a framework that we call cyclic reducibility in Coxeter theory, which is closely related to conjugacy. We introduce what it means for elements to be torically reduced, which is a stronger condition than simply being cyclically reduced. Along the way, we encounter a new class of elements that we call torically fully commutative (TFC), which are those that have a unique cyclic commutativity class, and comprise a strictly bigger class than the cyclically fully commutative (CFC) elements. We prove several cyclic analogues of results on fully commutative (FC) elements due to Stembridge. We conclude with how this framework fits into recent work in Coxeter groups, and we correct a minor flaw in a few recently published theorems.
