Related papers: Lattice bijections for string modules, snake graph…
In this article, we propose to initiate the general study of involution systems. An {\em involution system}, that is, a group $W$ generated by a set of involutions $S$, is naturally endowed with a {\em weak order} arising from orienting the…
We study the structure algebra $\mathcal{Z}$ of the stable moment graph for the case of the affine root system $A_{1}$. The structure algebra $\mathcal{Z}$ is an algebra over a symmetric algebra and in particular, it is a module over a…
Let $G$ be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of $G$ is a finite abelian group whose cardinality equals the number of spanning trees of $G$. The Jacobian group admits a canonical simply…
In this paper, we establish a bijection between the infinite reduced words of an affine Weyl group and certain biclosed sets of its positive system and determine all finitely generated biclosed sets in the positive system of an affine Weyl…
This paper studies the combinatorics of lattice congruences of the weak order on a finite Weyl group $W$, using representation theory of the corresponding preprojective algebra $\Pi$. Natural bijections are constructed between important…
Consider 2n points on the unit circle and a reference dissection D of the convex hull of the odd points. The accordion complex of D is the simplicial complex of subsets of pairwise noncrossing diagonals with even endpoints that cross a…
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…
For a finite Coxeter group, a subword complex is a simplicial complex associated with a pair (Q, \pi), where Q is a word in the alphabet of simple reflections, $\pi$ is a group element. We discuss the transformations of such a complex…
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
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…
Recently, the bunkbed conjecture has been shown to be false, which naturally prompts questions on how to classify the graphs that still satisfy the conjecture. We distinguish between a weak version of the bunkbed conjecture where all the…
We extend the recently-introduced weak Bruhat interval modules of the type A $0$-Hecke algebra to all finite Coxeter types. We determine, in a type-independent manner, structural properties for certain general families of these modules,…
We prove that the grades of simple modules indexed by boolean permutations, over the incidence algebra of the symmetric group with respect to the Bruhat order, are given by Lusztig's a-function. Our arguments are combinatorial, and include…
The modular decomposition of a graph $G$ is a natural construction to capture key features of $G$ in terms of a labeled tree $(T,t)$ whose vertices are labeled as "series" ($1$), "parallel" ($0$) or "prime". However, full information of $G$…
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…
The simplest string theory compactifications to 3D with 16 supercharges -- the heterotic string on $T^7$, and type II strings on $K3 \times T^3$ -- are related by U-duality, and share a moduli space of vacua parametrized by $O(8,24;…
We define an extension of the affine Brauer algebra, the type B/C affine Brauer algebra. This new algebra contains the hyperoctahedral group and it naturally acts on $END_K(X \otimes V^{\otimes k})$ for Orthogonal and Symplectic groups.…
In this paper we will derive an explicit description of the genuine projective representations of the symmetric group $S_n$ using Dirac cohomology and the branching graph for the irreducible genuine projective representations of $S_n$. In…
Motivated by the geometry of certain hyperplane arrangements, Manin and Schechtman defined for each positive integer n a hierarchy of finite partially ordered sets B(n, k), indexed by positive integers k, called the higher Bruhat orders.…
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.…