Related papers: Rewriting modulo isotopies in pivotal linear $(2,2…
We use the category of linear complexes of tilting modules for the BGG category O, associated with a semi-simple complex finite-dimensional Lie algebra g, to reprove in purely algebraic way several known results about O obtained earlier by…
We study the problem of classification of simple transitive 2-representations for the (non-finitary) 2-category of bimodules over the dual numbers. We show that simple transitive 2-representations with finitary apex are necessarily of rank…
We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…
We develop pivotal and spherical versions of graded extension theory. We define the corresponding analogues of Brauer-Picard $2$-categorical groups and realize them as fixed points of natural $\mathbb{Z}$ and $\mathbb{Z}/2\mathbb{Z}$…
We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…
We show how to express intuitionistic Zermelo set theory in deduction modulo (i.e. by replacing its axioms by rewrite rules) in such a way that the corresponding notion of proof enjoys the normalization property. To do so, we first rephrase…
We introduce homotopical methods based on rewriting on higher-dimensional categories to prove coherence results in categories with an algebraic structure. We express the coherence problem for (symmetric) monoidal categories as an…
We study the two-parameter quantized enveloping algebra $U^+_{r,s}(B_2)$ at roots of unity and investigate its structure and representations. We first show that when $r$ and $s$ are roots of unity, the algebra becomes a PI algebra, and we…
In this paper, we use Galois descent techniques to find suitable representatives of the regular simple representations of the species of type $(2,2)$ over $k_n := k[\varepsilon^{1/n}]$, where $n$ is a positive integer and…
We study thick subcategories of the category of 2-term complexes of projective modules over an associative algebra. We show that those thick subcategories that have enough injectives are in explicit bijection with 2-term silting complexes…
In my 1993 paper, "Pappus's Theorem and the Modular Group", I explained how the iteration of Pappus's Theorem gives rise to a $2$-parameter family of representations of the modular group into the group of projective automorphisms. In this…
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…
In this paper, we give a geometric construction of string algebras and of their module categories. Our approach uses dissections of punctured Riemann surfaces with extra data at marked points, called labels. As an application, we give a…
We study the Witt classes of the modular categories $SO(2r)_{2r}$ associated with quantum groups of type $D_r$ at $4r-2$th roots of unity. From these classes we derive infinitely many Witt classes of order 2 that are linearly independent…
We show how decreasing diagrams introduced in the theory of rewriting systems can be used to prove coherence type theorems in category theory. We apply this method to describe a coherent presentation of the $0$-Hecke monoid…
We axiomatically define (pre-)Hilbert categories. The axioms resemble those for monoidal Abelian categories with the addition of an involutive functor. We then prove embedding theorems: any locally small pre-Hilbert category whose monoidal…
How do spaces emerge from pregeometric discrete building blocks governed by computational rules? To address this, we investigate non-deterministic rewriting systems (multiway systems) of the Wolfram model. We express these rewriting systems…
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and…
Benchmarks of molecular machine learning models often treat the molecular representation as a neutral input format, yet the representation defines the syntax of validity, edit operations, and invariances that models implicitly learn. We…
This thesis proposes a framework based on a notion of combinatorial cell complex (cc) whose cells are defined simply as finite sets of vertices. The cells of a cc are subject to four axioms involving a rank function that assigns a rank (or…