Related papers: Coherence for plactic monoids via rewriting theory…
The paper is motivated by an analogy between cluster algebras and Kac-Moody algebras: both theories share the same classification of finite type objects by familiar Cartan-Killing types. However the underlying combinatorics beyond the two…
Let g = n^- + h + n^+ be a symmetrizable Kac-Moody algebra. Let B(\infty) be the Kashiwara crystal of U_q(n^-), let \lambda be a dominant integral weight, let T_\lambda = {t_\lambda} be the crystal with one element of weight \lambda, and…
Young tableaux carry an associative product, described by the Schensted algorithm. They thus form a monoid $\mathbf{Pl}$, called \emph{plactic}. It is central in numerous combinatorial and algebraic applications. In this paper, the tableaux…
The Kashiwara $B(\infty)$ crystal pertains to a Verma module for a Kac- Moody Lie algebra. Ostensibly it provides only a parametrisation of the global/canonical basis for the latter. Yet it is much more having a rich combinatorial structure…
The weight multiplicities of finite dimensional simple Lie algebras can be computed individually using various methods. Still, it is hard to derive explicit closed formulas. Similarly, explicit closed formulas for the multiplicities of…
Crystal graphs are powerful combinatorial tools for working with the plactic monoid and symmetric functions. Quasi-crystal graphs are an analogous concept for the hypoplactic monoid and quasi-symmetric functions. This paper makes a…
The crystals for a finite-dimensional complex reductive Lie algebra $\mathfrak{g}$ encode the structure of its representations, yet can also reveal surprising new structure of their own. We study the cactus group $C_{\mathfrak{g}}$,…
A monoid $S$ is right coherent if every finitely generated subact of every finitely presented right $S$-act itself has a finite presentation; it is weakly right coherent if every finitely generated right ideal of $S$ has a finite…
The twisted partition monoid $\mathcal{P}_n^\Phi$ is an infinite monoid obtained from the classical finite partition monoid $\mathcal{P}_n$ by taking into account the number of floating components when multiplying partitions. The main…
Crystalline materials are a fundamental component in next-generation technologies, yet modeling their distribution presents unique computational challenges. Of the plausible arrangements of atoms in a periodic lattice only a vanishingly…
The cyclic shift graph of a monoid is the graph whose vertices are elements of the monoid and whose edges link elements that differ by a cyclic shift. This paper examines the cyclic shift graphs of `plactic-like' monoids, whose elements can…
The theory of presentations of enriched monads was developed by Kelly, Power, and Lack, following classic work of Lawvere, and has been generalized to apply to subcategories of arities in recent work of Bourke-Garner and the authors. We…
Colored planar rook algebra is a semigroup algebra in which the basis element has a diagrammatic description. The category of finite dimensional modules over this algebra is completely reducible and suitable functors are defined on this…
The new approach to the theory of complex representrations of the finite symmetric groups which based on the notions of Coxeter generators., Gelfand-Zetlin algebras, Hecke algebra, Young-Jucys-Murphi generators and which hardly used…
A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for…
An effective way to design structured coherent wave interference patterns that builds on the theory of coherent lattices, is presented. The technique combines prime number factorization in the complex plane with moir\'e theory to provide a…
This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and sylvester monoids. For Chinese monoids, we first give new…
We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear…
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…
We present a reconstruction of finite-dimensional quantum theory where all of the postulates are stated in diagrammatic terms, making them intuitive. Equivalently, they are stated in category-theoretic terms, making them mathematically…