We define the notion of connectivity set for elements of any finitely generated Coxeter group. Then we define an order related to this new statistic and show that the poset is graded and each interval is a shellable lattice. This implies that any interval is Cohen-Macauley. We also give a Galois connection between intervals in this poset and a boolean poset. This allows us to compute the Mobius function for any interval.
Birational rowmotion is a discrete dynamical system on the set of all positive real-valued functions on a finite poset, which is a birational lift of combinatorial rowmotion on order ideals. It is known that combinatorial rowmotion for a minuscule poset has order equal to the Coxeter number, and exhibits the file homomesy phenomenon for refined order ideal cardinality statistic. In this paper we generalize these results to the birational setting. Moreover, as a generalization of birational promotion on a product of two chains, we introduce birational Coxeter-motion on minuscule posets, and pro…
We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its Möbius function. We show that the weak order on Coxeter groups of type A, B, affine A, and the flag weak order on the wreath product $\mathbb{Z} \_r \wr S\_n$ introduced by Adin, Brenti and Roichman, are special instances of our construction. We conclude by associating a quasi-symmetric function to each element of these posets. In the $A$ and $\widetilde{A}$ cases, this function coincides respectively with the classical Stanley symmetric function, and with Lam's affine…
We study the equivalence relation on the set of acyclic orientations of an undirected graph G generated by source-to-sink conversions. These conversions arise in the contexts of admissible sequences in Coxeter theory, quiver representations, and asynchronous graph dynamical systems. To each equivalence class we associate a poset, characterize combinatorial properties of these posets, and in turn, the admissible sequences. This allows us to construct an explicit bijection from the equivalence classes over G to those over G' and G", the graphs obtained from G by edge deletion and edge contractio…
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 relation of the form $ab=ba$ is said to be a \emph{commutation relation}. Words that are equivalent using only a sequence of commutation relations are said to be in the same \emph{commutation class}. We introduce certain partially ordered sets that we call \emph{word posets} that capture the structure of commutation classes in monoids. The isomorphism class…
We continue the Coxeter spectral analysis of finite connected posets $I$ that are non-negative in the sense that their symmetric Gram matrix $G_I:=\frac{1}{2}(C_I + C_I^{tr})\in\mathbb{M}_{m}(\mathbb{Q})$ is positive semi-definite of rank $n\geq 0$, where $C_I\in\mathbb{M}_m(\mathbb{Z})$ is the incidence matrix of $I$ encoding the relation $\preceq_I$. We extend the results of [Fundam. Inform., 139.4(2015), 347--367] and give a complete Coxeter spectral classification of finite connected posets $I$ of Dynkin type $\mathbb{A}_n$. We show that such posets $I$, with $|I|>1$, yield exactly $\lfloo…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it. We show that this coincidence of expectations holds for Cartesian products of chains, connected minuscule posets, weak Bruhat orders on finite Coxeter groups, certain lower intervals in Young's lattice, and certain lower intervals in the weak Bruhat order below dominant permutations. Our tools involve formulas for counting nearly reduced factorizations in 0-H…
We study the interplay between the discrete geometry of Bruhat poset intervals and subword complexes of finite Coxeter systems. We establish connections between the cones generated by cover labels for Bruhat intervals and of root configurations for subword complexes, culminating in the notion of brick polyhedra for general subword complexes.
As a visualization of Cartier and Foata's "partially commutative monoid" theory, G.X. Viennot introduced "heaps of pieces" in 1986. These are essentially labeled posets satisfying a few additional properties. They naturally arise as models of reduced words in Coxeter groups. In this paper, we introduce a cyclic version, motivated by the idea of taking a heap and wrapping it into a cylinder. We call this object a "toric heap", as we formalize it as a labeled toric poset, which is a cyclic version of an ordinary poset. To define the concept of a toric extension, we develop a morphism in the cate…
Solomon showed that the Poincaré polynomial of a Coxeter group $W$ satisfies a product decomposition depending on the exponents of $W$. This polynomial coincides with the rank-generating function of the poset of regions of the underlying Coxeter arrangement. In this note we determine all instances when the analogous factorization property of the rank-generating function of the poset of regions holds for a restriction of a Coxeter arrangement. It turns out that this is always the case with the exception of some instances in type $E_8$.
We show that any lower Bruhat interval in a Coxeter group is a disjoint union of certain two-sided cosets as a consequence of Lifting Property and Subword Property. Furthermore, we describe these details in terms of Bruhat graphs, graded posets, and two-sided quotients altogether. For this purpose, we introduce some new ideas, quotient lower intervals and quotient Bruhat graphs.
In this article, we investigate the set of $γ$-sortable elements, associated with a Coxeter group $W$ and a Coxeter element $γ\in W$, under Bruhat order, and we denote this poset by $\mathcal{B}_γ$. We show that this poset belongs to the class of SB-lattices recently introduced by Hersh and Mészáros, by proving a more general statement, namely that all join-distributive lattices are SB-lattices. The observation that $\mathcal{B}_γ$ is join-distributive is due to Armstrong. Subsequently, we investigate for which finite Coxeter groups $W$ and which Coxeter elements $γ\in W$ the lattice $\mathcal…
Introduced by Reading, the shard intersection order of a finite Coxeter group $W$ is a lattice structure on the elements of $W$ that contains the poset of noncrossing partitions $NC(W)$ as a sublattice. Building on work of Bancroft in the case of the symmetric group, we provide combinatorial models for shard intersections of all classical types, and use this understanding to prove the shard intersection order is EL-shellable. Further, inspired by work of Simion and Ullman on the lattice of noncrossing partitions, we show that the shard intersection order on the symmetric group admits a symmetr…
Applying a classical theorem of Smith, we show that the poset property of being Gorenstein$^*$ over $\mathbb{Z}_2$ is inherited by the subposet of fixed points under an involutive poset automorphism. As an application, we prove that every interval in the Bruhat order on (twisted) involutions in an arbitrary Coxeter group has this property, and we find the rank function. This implies results conjectured by F. Incitti. We also show that the Bruhat order on the fixed points of an involutive automorphism induced by a Coxeter graph automorphism is isomorphic to the Bruhat order on the fixed subgrou…
We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that the projections on the right parabolic quotients are always order preserving. We also introduce the notion of $k$-Bruhat graph, $k$-absolute length and $k$-absolute order, proposing some related conjectures and problems.
For any finite Coxeter group W, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on W. The construction of the biHecke monoid relies on the usual combinatorial model for the 0-Hecke algebra H_0(W), that is, for the symmetric group, the algebra (or monoid) generated by the elementary bubble sort operators. The authors previously introduced the Hecke group algebra, constructed as the algebra generated simultaneously by the bubble sort and antisort o…
Extended Weak Order for the Rank 3 Universal Coxeter Group
University of Michigan（密歇根大学）；Harvard University（哈佛大学）；University of Oregon（俄勒冈大学）；University of California, Santa Barbara（加州大学圣塔芭芭拉分校）；Kennesaw State University（肯尼索州立大学）
The open intervals in the Bruhat order on twisted involutions in a Coxeter group are shown to be PL spheres. This implies results conjectured by F. Incitti and sharpens the known fact that these posets are Gorenstein* over Z_2. We also introduce a Boolean cell complex which is an analogue for twisted involutions of the Coxeter complex. Several classical Coxeter complex properties are shared by our complex. When the group is finite, it is a shellable sphere, shelling orders being given by the linear extensions of the weak order on twisted involutions. Furthermore, the h-polynomial of the comple…
In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that, for any Coxeter system of rank n, the boolean complex is homotopy equivalent to a wedge of (n-1)-dimensional spheres. The number of such spheres can be computed recursively from the unlabeled Coxeter graph, and defines a new graph invariant called the boolean number. Specific calculations of the boolean number are given for all finite and affine irreducible Co…
For any Coxeter system $(W,S)$ of rank $n$, we introduce an abstract boolean complex (simplicial poset) of dimension $2n-1$ that contains the Coxeter complex as a relative subcomplex. Faces are indexed by triples $(I,w,J)$, where $I$ and $J$ are subsets of the set $S$ of simple generators, and $w$ is a minimal length representative for the parabolic double coset $W_I w W_J$. There is exactly one maximal face for each element of the group $W$. The complex is shellable and thin, which implies the complex is a sphere for the finite Coxeter groups. In this case, a natural refinement of the $h$-pol…
Given a Coxeter system (W,S) equipped with an involutive automorphism T, the set of twisted identities is i(T) = {T(w)^{-1}w : w \in W}. We point out how i(T) shows up in several contexts and prove that if there is no s \in S such that sT(s) is of odd order greater than 1, then the Bruhat order on i(T) is a graded poset with rank function r given by halving the Coxeter length. Under the same condition, it is shown that the order complexes of the open intervals either are PL spheres or acyclic over the integers. In the general case, contractibility is shown for certain classes of intervals. Fur…
We consider three notions of connectivity and their interactions in partially ordered sets coming from reduced factorizations of an element in a generated group. While one form of connectivity essentially reflects the connectivity of the poset diagram, the other two are a bit more involved: Hurwitz-connectivity has its origins in algebraic geometry, and shellability in topology. We propose a framework to study these connectivity properties in a uniform way. Our main tool is a certain linear order of the generators that is compatible with the chosen element.
We define a new class of countable groups, which are defined by its action on the set of monotonic numberings (diagrams) of an arbitrary finite or countable partial ordered set (poset). These groups are generated by the set of involutions? and in the case of finite posets could be considered as generalization of Coxeter's symmetric groups. We discuss the problems concerned to infinite groups jf this type, in particular the problem of the descripton of invariant measures on the space of numberings (central measures)with respect to actions of those groups. The probelms are tightly connected with…
Given a function defined over a parabolic subgroup of a Coxeter group, equidistributed with the length, we give a procedure to construct a function over the entire group, equidistributed with the length. Such a procedure permits to define functions equidistributed with the length in all the finite Coxeter groups. We can establish our results in the general setting of graded posets which satisfy some properties. These results apply to some known functions arising in Coxeter groups as the major index, the negative major index and the D-negative major index defined in type $A$, $B$ and $D$ respec…
This memoir constitutes the author's PhD thesis at Cornell University. It serves both as an expository work and as a description of new research. At the heart of the memoir, we introduce and study a poset $NC^{(k)}(W)$ for each finite Coxeter group $W$ and for each positive integer $k$. When $k=1$, our definition coincides with the generalized noncrossing partitions introduced by Brady-Watt and Bessis. When $W$ is the symmetric group, we obtain the poset of classical $k$-divisible noncrossing partitions, first studied by Edelman. Along the way, we include a comprehensive introduction to relate…
Given a finite irreducible Coxeter group $W$, a positive integer $d$, and types $T_1,T_2,...,T_d$ (in the sense of the classification of finite Coxeter groups), we compute the number of decompositions $c=\si_1\si_2 cdots\si_d$ of a Coxeter element $c$ of $W$, such that $\si_i$ is a Coxeter element in a subgroup of type $T_i$ in $W$, $i=1,2,...,d$, and such that the factorisation is "minimal" in the sense that the sum of the ranks of the $T_i$'s, $i=1,2,...,d$, equals the rank of $W$. For the exceptional types, these decomposition numbers have been computed by the first author. The type $A_n$ d…
The higher Bruhat order is a poset of cubical tilings of a cyclic zonotope whose covering relations are cubical flips. For a 2-dimensional zonotope, the higher Bruhat order is isomorphic to a poset on commutation classes of reduced words for the longest element of a type A Coxeter system. For this case, we prove that the noncontractible intervals are in natural correspondence with the zonogonal tilings of a zonogon. Our proof uses some tools developed by Felsner and Weil to show that the two standard orderings on the rhombic tilings of a zonogon are identical.
We prove that the restriction of Bruhat order to noncrossing partitions in type $A_n$ for the Coxeter element $c=s_1s_2 ...s_n$ forms a distributive lattice isomorphic to the order ideals of the root poset ordered by inclusion. Motivated by the change-of-basis from the graphical basis of the Temperley-Lieb algebra to the image of the simple elements of the dual braid monoid, we extend this bijection to other Coxeter elements using certain canonical factorizations. In particular, we give new bijections---fixing the set of reflections---between noncrossing partitions associated to distinct Coxet…
The way to arrive at formula of zeta matrix for any graded posets with the finite set of minimal elements is delivered following the first reference. This is being achieved via adjacency and zeta matrix description of bipartite digraphs chains, the representatives of graded posets. The bipartite digraphs elements of such chains amalgamate to form corresponding cover relation graded poset digraphs with corresponding adjacency matrices being amalgamated throughout natural join as special adequate database operation. The colligation of reachability and connectivity with the presented description …
We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary (not-necessarily-finite) Coxeter groups $W$, and prove this for the hyperoctahedral groups $B_n$ and all right-angled Coxeter groups. Our proof for $B_n$ (and new proof for $\mathfrak{S}_n$) use a combinatorial insertion map closely related to the well-studied promotion operator on linear extensions; this map may be of independent interest. We also note that the inequalities…
Westwood High School（韦斯特伍德高中）；Cranbrook Kingswood Upper School（克兰布鲁克金伍兹高中部）；Oklahoma State University（俄克拉荷马州立大学）；Texas State University（德克萨斯州立大学）；West Windsor-Plainsboro High School North（西温莎-普莱恩斯伯勒北高中）；Seven Lakes High School（七湖高中）
Let Δbe a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(Δ), whose edges are the pairs of adjacent chambers in Δ, is known to be q-regular for a certain number q=q(Δ). Our main result is that G(Δ) is q-connected in the sense of graph theory. Similar results are proved for the chamber graphs of Coxeter complexes and for order complexes of geometric lattices.
We prove the $K(π,1)$ conjecture for affine Artin groups: the complexified complement of an affine reflection arrangement is a classifying space. This is a long-standing problem, due to Arnol'd, Pham, and Thom. Our proof is based on recent advancements in the theory of dual Coxeter and Artin groups, as well as on several new results and constructions. In particular: we show that all affine noncrossing partition posets are EL-shellable; we use these posets to construct finite classifying spaces for dual affine Artin groups; we introduce new CW models for the orbit configuration spaces associate…
We introduce a natural partial order on the set Cones(d) of rational cones in R^d. The poset NPol(d-1) of normal polytopes in R^{d-1} embeds into Cones(d) via the homogenization map. The order in Cones(d) is conjecturally the inclusion order. We prove this for d=3 and show a stronger version of the connectivity of Cones(d) for all d. Topological aspects of the conjecture are also discussed.
The limit weak order on an affine Weyl group was introduced by Lam and Pylyavskyy in their study of total positivity for loop groups. They showed that in the case of the affine symmetric group the minimal elements of this poset coincide with the infinite fully commutative reduced words and with infinite powers of Coxeter elements. We answer several open problems raised there by classifying minimal elements in all affine types and relating these elements to the classes of fully commutative and Coxeter elements. Interestingly, the infinite fully commutative elements correspond to the minuscule a…
Let W be a finite Coxeter group. We define its Hecke-group algebra by gluing together appropriately its group algebra and its 0-Hecke algebra. We describe in detail this algebra (dimension, several bases, conjectural presentation, combinatorial construction of simple and indecomposable projective modules, Cartan map) and give several alternative equivalent definitions (as symmetry preserving operator algebra, as poset algebra, as commutant algebra, ...). In type A, the Hecke-group algebra can be described as the algebra generated simultaneously by the elementary transpositions and the elementa…
We investigate the ways in which fundamental properties of the weak Bruhat order on a Weyl group can be lifted (or not) to a corresponding highest weight crystal graph, viewed as a partially ordered set; the latter projects to the weak order via the key map. First, a crystal theoretic analogue of the statement that any two reduced expressions for the same Coxeter group element are related by Coxeter moves is proven for all lower intervals in a simply or doubly laced crystal. On the other hand, it is shown that no finite set of moves exists, even in type A, for arbitrary crystal graph intervals…
We prove that the combinatorial concept of a special matching can be used to compute the parabolic Kazhdan-Lusztig polynomials of doubly laced Coxeter groups and of dihedral Coxeter groups. In particular, for this class of groups which includes all Weyl groups, our results generalize to the parabolic setting the main results in [Advances in Math. {202} (2006), 555-601]. As a consequence, the parabolic Kazhdan-Lusztig polynomial indexed by $u$ and $v$ depends only on the poset structure of the Bruhat interval from the identity element to $v$ and on which elements of that interval are minimal co…
In this article we provide a new finite class of elements in any Coxeter system (W,S) called low elements. They are defined from Brink and Howlett's small roots, which are strongly linked to the automatic structure of (W,S). Our first main result is to show that they form a Garside shadow in (W,S), i.e., they contain S and are closed under join (for the right weak order) and by taking suffixes. These low elements are the key to prove that all finitely generated Artin-Tits groups have a finite Garside family. This result was announced in a note with P. Dehornoy (P. Dehornoy, M. Dyer, and C. Hoh…
The absolute order on the hyperoctahedral group $B_n$ is investigated. It is proved that the order ideal of this poset generated by the Coxeter elements is homotopy Cohen-Macaulay and the Möbius number of this ideal is computed. Moreover, it is shown that every closed interval in the absolute order on $B_n$ is shellable and an example of a non-Cohen-Macaulay interval in the absolute order on $D_4$ is given. Finally, the closed intervals in the absolute order on $B_n$ and $D_n$ which are lattices are characterized and some of their important enumerative invariants are computed.
We study the appearance of notable interval structures -- lattices, modular lattices, distributive lattices, and boolean lattices -- in both the Bruhat and weak orders of Coxeter groups. We collect and expand upon known results for principal order ideals, including pattern characterizations and enumerations for the symmetric group. This segues naturally into a similar analysis for arbitrary intervals, although the results are less characterizing for the Bruhat order at this generality. In counterpoint, however, we obtain a full characterization for intervals starting at rank one in the symmetr…
Involution words are variations of reduced words for twisted involutions in Coxeter groups. They arise naturally in the study of the Bruhat order, of certain Iwahori-Hecke algebra modules, and of orbit closures in flag varieties. Specifically, to any twisted involutions $x$, $y$ in a Coxeter group $W$ with automorphism $*$, we associate a set of involution words $\hat{\mathcal{R}}_*(x,y)$. This set is the disjoint union of the reduced words of a set of group elements $\mathcal{A}_*(x,y)$, which we call the atoms of $y$ relative to $x$. The atoms, in turn, are contained in a larger set $\mathca…
