Related papers: Lattice bijections for string modules, snake graph…
In recent work the author investigates perfect matchings of a bipartite graph obtained from a knot diagram and demonstrates that these correspond to discrete Morse functions on a 2-complex for the 2-sphere. This relationship is expounded…
Tasks that model the relation between pairs of tokens in a string are a vital part of understanding natural language. Such tasks, in general, require exhaustive pair-wise comparisons of tokens, thus having a quadratic runtime complexity in…
We investigate certain categories, associated by Fiebig with the geometric representation of a Coxeter system, via sheaves on Bruhat graphs. We modify Fiebig's definition of translation functors in order to extend it to the singular setting…
Associated to every complex reflection group, we construct a lattice of quotients of its braid monoid-algebra, which we term nil-Hecke algebras, and which are obtained by killing all braid words that are "sufficiently long", as well as some…
In this article, we give a short algebraic proof that all closed intervals in a $\gamma$-Cambrian semilattice $\mathcal{C}_{\gamma}$ are trim for any Coxeter group $W$ and any Coxeter element $\gamma\in W$. This means that if such an…
We study Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over $\cE = \ZZ[e^{2 \pi i/3}]$: there are only four such lattices,…
Let W be a Coxeter group. In this paper, we establish that, up to going to some finite index normal subgroup W_0 of W, any two cyclically reduced expressions of conjugate elements of W_0 only differ by a sequence of braid relations and…
The purpose of this paper is to provide a unified method for dealing with various 0-Hecke modules constructed using tableaux so far. To do this, we assign a $0$-Hecke module to each left weak Bruhat interval, called a weak Bruhat interval…
We extend the weak Bruhat order of a finite Coxeter group to the set of its coclasses, modulo parabolic standard subgroups. We use this order to describe associative algebra structures on the vector spaces spanned by the faces of…
We introduce two order relations on finite Coxeter groups which refine the absolute and the Bruhat order, and establish some of their main properties. In particular we study the restriction of these orders to noncrossing partitions and show…
This paper is a sequel to our previous work in which we found a combinatorial realization of continued fractions as quotients of the number of perfect matchings of snake graphs. We show how this realization reflects the convergents of the…
In this note we construct a poset map from a Boolean algebra to the Bruhat order which unveils an interesting connection between subword complexes, sorting orders, and certain totally nonnegative spaces. This relationship gives a new proof…
Let $\mathbf{k}$ be an algebraically closed field. In this article, inspired by the description of indecomposable objects in the derived category of a gentle algebra obtained by V. Bekkert and H. A. Merklen, we define string complexes for a…
In this paper we relate umbral moonshine to the Niemeier lattices: the 23 even unimodular positive-definite lattices of rank 24 with non-trivial root systems. To each Niemeier lattice we attach a finite group by considering a naturally…
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,…
We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…
The shard intersection order is a new lattice structure on a finite Coxeter group W which encodes the geometry of the reflection arrangement and the lattice theory of the weak order. In the case where W is the symmetric group, we…
The set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet $\Sigma = \{ x, y, z, ... \}$, where each letter has a…
We construct explicit tableau-level maps between indecomposable projective modules for the type A 0-Hecke algebra that assemble into canonical split short exact sequences lifting the basic ribbon product rule in NSym via concatenation and…
Given an idempotent complete additive category, we show the there is an explicitly constructed topological space such that the lattice of exact substructures is anti-isomorphic to the lattice of closed subsets. In the special case that the…