Related papers: Decreasing diagrams and coherent presentations
A combinatorial theory of associative $n$-categories has recently been proposed, with strictly associative and unital composition in all dimensions, and the weak structure arising as a combinatorial notion of homotopy with a natural…
This paper investigates the use of symmetric monoidal closed (SMC) structure for representing syntax with variable binding, in particular for languages with linear aspects. In our setting, one first specifies an SMC theory T, which may…
Whereas string diagrams for strict monoidal categories are well understood, and have found application in several fields of Computer Science, graphical formalisms for non-strict monoidal categories are far less studied. In this paper, we…
Symmetric monoidal theories (SMTs) generalise algebraic theories in a way that make them suitable to express resource-sensitive systems, in which variables cannot be copied or discarded at will. In SMTs, traditional tree-like terms are…
We introduce loop spaces (in the sense of derived algebraic geometry) into the representation theory of reductive groups. In particular, we apply the theory developed in our previous paper arXiv:1002.3636 to flag varieties, and obtain new…
Ideas from Hodge theory have found important applications in representation theory. We give a survey of joint work with Ben Elias which uncovers Hodge theoretic structure in the Hecke category ("Soergel bimodules"). We also outline…
This note presents a procedure to determine the reduction of the irreducible and the induced characters of the symmetric group in terms of the irreducible and induced characters of the hyperoctahedral group Key Words: Symmetric Group,…
String diagrams are a powerful and intuitive graphical syntax, originated in the study of symmetric monoidal categories. In the last few years, they have found application in the modelling of various computational structures, in fields as…
We introduce a notion of harmonic chain for chain complexes over fields of positive characteristic. A list of conditions for when a Hodge decomposition theorem holds in this setting is given and we apply this theory to finite CW complexes.…
In recent years, diagrammatic languages have been shown to be a powerful and expressive tool for reasoning about physical, logical, and semantic processes represented as morphisms in a monoidal category. In particular, categorical quantum…
Aiming for a revival of the theory of crystallographic complex reflection groups, we compute (minimal) Coxeter-like reflection presentations for the infinite families of those non-genuine groups which satisfy Steinberg's fixed point…
Diagram chasing is not an easy task. The coherence holds in a generalized sense if we have a mechanical method to judge whether given two morphisms are equal to each other. A simple way to this end is to reform a concerned category into a…
String diagrams provide a convenient graphical framework which may be used for equational reasoning about morphisms of monoidal categories. However, unlike term rewriting, rewriting string diagrams results in shorter equational proofs,…
We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie algebra such as termination and confluence. Littelmann described this presentation using L-S paths generators. Thanks to the shapes of…
Kazhdan and Lusztig identified the affine Hecke algebra $\mathcal{H}$ with an equivariant $K$-group of the Steinberg variety, and applied this to prove the Deligne-Langlands conjecture, i.e., the local Langlands parametrization of…
We verify a confluence result for the rewriting calculus of the linear category introduced in our previous paper. Together with the termination result proved therein, the generalized coherence theorem for linear category is established.…
Let $W$ be an affine Weyl group, and let $\Bbbk$ be a field of characteristic $p>0$. The diagrammatic Hecke category $\mathcal{D}$ for $W$ over $\Bbbk$ is a categorification of the Hecke algebra for $W$ with rich connections to modular…
We introduce a graphical language for closed symmetric monoidal categories based on an extension of string diagrams with special bracket wires representing internal homs. These bracket wires make the structure of the internal hom functor…
Deduction systems and graph rewriting systems are compared within a common categorical framework. This leads to an improved deduction method in diagrammatic logics.
We define term rewriting systems on the vertices and faces of nestohedra, and show that the former are confluent and terminating. While the associated posets on vertices generalize Barnard--McConville's flip order for graph-associahedra,…