Related papers: Toric heaps, cyclic reducibility, and conjugacy in…
Toric posets are cyclic analogues of finite posets. They can be viewed combinatorially as equivalence classes of acyclic orientations generated by converting sources into sinks, or geometrically as chambers of toric graphic hyperplane…
A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…
We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…
In this thesis, we study the combinatorics of cyclically fully commutative elements in Coxeter groups of type $A$ as it relates to conjugacy. In particular, we introduce the notion of cylindrical heaps and ring equivalence in order to state…
Motivated by work of Stembridge, we study rank functions for Viennot's heaps of pieces. We produce a simple and sufficient criterion for a heap to be a ranked poset and apply the results to the heaps arising from fully commutative words in…
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…
Let $W$ be a Coxeter group. We provide a precise description of the conjugacy classes in $W$, in the spirit of Matsumoto's theorem. This extends to all Coxeter groups an important result on finite Coxeter groups by M. Geck and G. Pfeiffer…
An element of a Coxeter group W is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. An element of a Coxeter group W is cyclically fully commutative if any…
An element of a Coxeter group $W$ is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. In the present work, we focus on fully commutative involutions,…
Heaps of pieces were introduced by Viennot and have applications to algebraic combinatorics, theoretical computer science and statistical physics. In this paper, we how certain combinatorial properties of heaps studied by Fan and by…
A heap is a set with a certain ternary operation that is self-distributive (TSD) and exemplified by a group with the operation $(x,y,z)\mapsto xy^{-1}z$. We introduce and investigate framed link invariants using heaps. In analogy with the…
In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…
Given a pure, full-dimensional, locally strongly connected polyhedral complex C with convex support, we characterize, by a local codimension-2 condition, polyhedral complexes that coarsen C. The proof of the characterization draws upon a…
We give an interpretation of the map $\pi^c$ defined by Reading, which is a map from the elements of a Coxeter group to the $c$-sortable elements, in terms of the representation theory of preprojective algebras. Moreover, we study a close…
The aim of this note is to show that the cycle decomposition of elements of the symmetric group admits a quite natural formulation in the framework of dual Coxeter theory, yielding a generalization of it to the family of so-called parabolic…
An element of a Coxeter group $W$ is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. These elements were extensively studied by Stembridge, in particular…
Given a finite poset, Greene introduced a rational function obtained by summing certain rational functions over the linear extensions of the poset. This function has interesting interpretations, and for certain families of posets, it…
In this paper, we study the generating function of cyclically fully commutative elements in Coxeter groups, which are elements such that any cyclic shift of theirs reduced decompositions remains a reduced expression of a fully commutative…
This paper explores the orbit structure and homomesy (constant averages over orbits) properties of certain actions of toggle groups on the collection of independent sets of a path graph. In particular we prove a generalization of a homomesy…
An element of a Coxeter group $W$ is called fully commutative if any two of its reduced decompositions can be related by a series of transpositions of adjacent commuting generators. In the preprint "Fully commutative elements in finite and…