The absolute order of a permutation representation of a Coxeter group
Combinatorics
2013-03-08 v2 Group Theory
Abstract
A permutation representation of a Coxeter group naturally defines an absolute order. This family of partial orders (which includes the absolute order on ) is introduced and studied in this paper. Conditions under which the associated rank generating polynomial divides the rank generating polynomial of the absolute order on are investigated when is finite. Several examples, including a symmetric group action on perfect matchings, are discussed. As an application, a well-behaved absolute order on the alternating subgroup of is defined.
Keywords
Cite
@article{arxiv.1112.0856,
title = {The absolute order of a permutation representation of a Coxeter group},
author = {Christos A. Athanasiadis and Yuval Roichman},
journal= {arXiv preprint arXiv:1112.0856},
year = {2013}
}
Comments
23 pages, 1 figure, revised version to be published in J. Algebraic Combinatorics