Related papers: Linear polygraphs applied to categorification

We establish a cluster theoretical interpretation of the isomorphisms of [F.-H.-O.-O., J. Reine Angew. Math., 2022] among quantum Grothendieck rings of representations of quantum loop algebras. Consequently, we obtain a quantization of the…

In this paper, we first propose a general interpolation algorithm in a free module of a linearized polynomial ring, and then apply this algorithm to decode several important families of codes, Gabidulin codes, KK codes and MV codes. Our…

We treat the problem of lifting bicategories into double categories through categories of vertical morphisms. We make use of a specific instance of the Grothendieck construction to provide, for every bicategory equipped with a possible…

The linear decomposition attack provides a serious obstacle to direct applications of noncommutative groups and monoids (or semigroups) in cryptography. To overcome this issue we propose to look at monoids with only big representations, in…

Path calculus, or graphical linear algebra, is a string diagram calculus for the category of matrices over a base ring. It is the usual string diagram calculus for a symmetric monoidal category, where the monoidal product is the direct sum…

In recent years, there has been great interest in the study of categorification, specifically as it applies to the theory of quantum groups. In this thesis, we would like to provide a new approach to this problem by looking at Hall…

For any finite dimensional basic associative algebra, we study the presentation spaces and their relation with the representation spaces. We prove two propositions about a general presentation, one on its subrepresentations and the other on…

The paper studies the Karoubi envelope of a one-dimensional topological theory with defects and inner endpoints, defined over a field. It turns out that the Karoubi envelope is determined by a symmetric Frobenius algebra K associated to the…

We categorify Lusztig's version of the quantized enveloping algebra for sl(2). Using a graphical calculus a 2-category is constructed whose split Grothendieck ring is isomorphic to Lusztig's algebra. The indecomposable morphisms of this…

We propose a classification of polyhedra (planar, $3$-connected graphs) according to their type i.e., their set of quantities of common neighbours for each pair of distinct vertices. For every (finite) set of non-negative integers, we…

Let C be the category of finite-dimensional representations of a quantum affine algebra of simply-laced type. We introduce certain monoidal subcategories C_l (l integer) of C and we study their Grothendieck rings using cluster algebras.

A well-known theorem of Blind and Mani says that every simple polytope is uniquely determined by its graph. Kalai gave a very short and elegant proof of this result using the concept of acyclic orientations. As it turns out, Kalai's proof…

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…

Using the braided version of Lawvere's algebraic theories and Mac Lane's PROPs, we introduce polynomial identities for arbitrary algebraic structures in a braided monoidal category C as well as their codimensions in the case when C is…

This book is a continuation of the book n-linear algebra of type I and its applications. Most of the properties that could not be derived or defined for n-linear algebra of type I is made possible in this new structure: n-linear algebra of…

Two Lie algebroids are presented that are linked to the construction of the linearizing output of an affine in the input nonlinear system. The algorithmic construction of the linearizing output proceeds inductively, and each stage has two…

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

In previous work, we demonstrated how decoding of a non-binary linear code could be formulated as a linear-programming problem. In this paper, we study different polytopes for use with linear-programming decoding, and show that for many…

A problem list in singularity theory. Most of these problems are related with the algorithmic enumeration of possible topological types of non-discriminant Morsifications of real function singularities, and/or with the Picard--Lefschetz…