Related papers: Linear polygraphs applied to categorification

We provide explicit and unified formulae for the normalized 3-cocycles on arbitrary finite abelian groups. As an application, we compute all the braided monoidal structures on linear Gr-categories.

In this paper, the authors apply a stratification of moduli spaces of complex Lie algebras to analyzing the moduli spaces of nxn matrices under scalar similarity and bilinear forms under the cogredient action. For similar matrices, we give…

We show how to treat families of $\infty$-categories fibered in categorical patterns (e.g., $\infty$-operads and monoidal $\infty$-categories) in terms of fibrations by relativizing the Grothendieck construction. As applications, we…

We construct a categorification of the modular data associated with every family of unipotent characters of the spetsial complex reflection group $G(d,1,n)$. The construction of the category follows the decomposition of the Fourier matrix…

The aim of this article is to explain a philosophy for applying higher dimensional Seifert-van Kampen Theorems, and how the use of groupoids and strict higher groupoids resolves some foundational anomalies in algebraic topology at the…

Based on the matrix expression of general nonlinear numerical analogues presented by the present author, this paper proposes a novel philosophy of nonlinear computation and analysis. The nonlinear problems are considered an ill-posed linear…

We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…

Precategories generalize both the notions of strict $n$-category and sesquicategory: their definition is essentially the same as the one of strict $n$-categories, excepting that we do not require the various interchange laws to hold. Those…

In this short note, we develop a novel idea of a bilinear cryptosystem using the discrete logarithm problem in matrices. These matrices come from a linear representation of a finite $p$-group of class 2. We discuss an example at the end.

We introduce the notion of universal odd generalized Poisson superalgebra associated to an associative algebra A, by generalizing a construction made in [5]. By making use of this notion we give a complete classification of simple linearly…

Reflexive polyhedra encode the combinatorial data for mirror pairs of Calabi-Yau hypersurfaces in toric varieties. We investigate the geometrical structures of circumscribed polytopes with a minimal number of facets and of inscribed…

Several constructive homological methods based on noncommutative Gr\"obner bases are known to compute free resolutions of associative algebras. In particular, these methods relate the Koszul property for an associative algebra to the…

We study matrix factorization and curved module categories for Landau-Ginzburg models (X,W) with X a smooth variety, extending parts of the work of Dyckerhoff. Following Positselski, we equip these categories with model category structures.…

A coherent presentation of an n-category is a presentation by generators, relations and relations among relations. Confluent and terminating rewriting systems generate coherent presentations, whose relations among relations are defined by…

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…

We define the Grothendieck group of an $n$-exangulated category. For $n$ odd, we show that this group shares many properties with the Grothendieck group of an exact or a triangulated category. In particular, we classify dense complete…

We give an introductory account of Khovanov's categorification of the Heisenberg algebra, and construct a combinatorial model for it in a 2-category of spans of groupoids. We also treat a categorification of $U(sl_n)$ in a similar way.…

To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…

We prove that the classification problem for graphs and several types of algebraic lattices (distributive, congruence and modular) up to isomorphism contains the classification problem for pairs of matrices up to simultaneous similarity.

We define a class of monoidal categories whose morphisms are diagrams, and which are enhancements and generalisations of the Brauer category obtained by adjoining infinitesimal braids, "coupons" and poles. Properties of these categories are…