Morgan Eichwald
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Morgan Eichwald has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Dana C. Ernst
Department of Mathematics and Statistics, Northern Arizona University, Flagstaff, USA
2 shared publications - Jeffrey Burkert
Harvey Mudd College
2 shared publications - Matthew Macauley
School of Mathematical and Statistical Sciences, Clemson University, Clemson, 29634, SC, USA
2 shared publications - Richard M. Green
Department of Mathematics University of Colorado Boulder Campus Box 395 Boulder CO 80309-0395 U. S. A
2 shared publications - Tomas Boothby
Simon Fraser University, Burnaby, Canada
1 shared publication - Tomas Boothby1 shared publication
Latest Publications
- Open Access
On the Cyclically Fully Commutative Elements of Coxeter Groups
Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is "cyclically fully commutative" (CFC) if every cyclic shift of any reduced expression for w is fully commutative (i.e., avoids long braid relations). These generalize Coxeter elements in that their reduced expressions can be described combinatorially by acyclic directed graphs, and cyclically shifting corresponds to source-to-sink conversions. In this paper, we explore the combinatorics of the CFC elements and enumerate them in all Coxeter groups. Additionally, we characterize precisely which CFC elements have the property that powers of them remain fully commutative, via the presence of a simple combinatorial feature called a "band." This allows us to give necessary and sufficient conditions for a CFC element w to be "logarithmic," that is, l(w^k) = k l(w) for all k > 0, for a large class of Coxeter groups that includes all affine Weyl groups and simply-laced Coxeter groups. Finally, we give a simple non-CFC element that fails to be logarithmic under these conditions.
Open AccessOn the Cyclically Fully Commutative Elements of Coxeter Groups
Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is "cyclically fully commutative" (CFC) if every cyclic shift of any reduced expression for w is fully commutative (i.e., avoids long braid relations). These generalize Coxeter elements in that their reduced expressions can be described combinatorially by acyclic directed graphs, and cyclically shifting corresponds to source-to-sink conversions. In this paper, we explore the combinatorics of the CFC elements and enumerate them in all Coxeter groups. Additionally, we characterize precisely which CFC elements have the property that powers of them remain fully commutative, via the presence of a simple combinatorial feature called a "band." This allows us to give necessary and sufficient conditions for a CFC element w to be "logarithmic," that is, l(w^k) = k l(w) for all k > 0, for a large class of Coxeter groups that includes all affine Weyl groups and simply-laced Coxeter groups. Finally, we give a simple non-CFC element that fails to be logarithmic under these conditions.
- 19 November 2011
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 36 (1) , 123-148
On the cyclically fully commutative elements of Coxeter groups
- 19 November 2011
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 36 (1) , 123-148
On the cyclically fully commutative elements of Coxeter groups