Related papers: On classification of modular categories by rank

We classify all modular categories of dimension $4m$, where $m$ is an odd square-free integer, and all ranks $6$ and $7$ weakly integral modular categories. This completes the classification of weakly integral modular categories through…

The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…

Categorical aspects of the theory of modules over trusses are studied. Tensor product of modules over trusses is defined and its existence established. In particular, it is shown that bimodules over trusses form a monoidal category. Truss…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…

We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…

In this paper we develope a categorical theory of relations and use this formulation to define the notion of quantization for relations. Categories of relations are defined in the context of symmetric monoidal categories. They are shown to…

For a finite tensor category $\mathcal C$ and a Hopf monad $T:\mathcal C\to \mathcal C$ satisfying certain conditions we describe exact indecomposable left $\mathcal C^T$-module categories in terms of left $\mathcal C$-module categories and…

We study concrete sheaf models for a call-by-value higher-order language with recursion. Our family of sheaf models is a generalization of many examples from the literature, such as models for probabilistic and differentiable programming,…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

In this paper we introduce a strict monoidal subcategory of the category of matrices, suitable to address a higher representation theoretic analogue of radicals (non-semisimplicity) in ordinary representation theory. We show the extent to…

In this paper, we develop general machinery for computing the classifying ring $L^A$ of one-dimensional formal $A$-modules, for various commutative rings $A$. We then apply the machinery to obtain calculations of $L^A$ for various number…

In many classification tasks there is a requirement of monotonicity. Concretely, if all else remains constant, increasing (resp. decreasing) the value of one or more features must not decrease (resp. increase) the value of the prediction.…

A subunit in a monoidal category is a subobject of the monoidal unit for which a canonical morphism is invertible. They correspond to open subsets of a base topological space in categories such as those of sheaves or Hilbert modules. We…

Let $\Lambda=\Bbb Z[t,t^{-1}]$ be the ring of Laurent polynomials over $\Bbb Z$. We classify all $\Lambda$-modules $M$ with $|M|=p^n$, where $p$ is a primes and $n\le 4$. Consequently, we have a classification of Alexander quandles of order…

We present an infinite family of recursive formulas that count binary integer partitions satisfying natural divisibility conditions and show that these counts are interrelated via partial sums. Moreover, we interpret the partitions we study…

To any model category $\mathcal{M}$, we associate a modular model category, a functor of points $\mathcal{M}[-]:$ Cat $\rightarrow$ Cat, that associates to any small category $\mathcal{C}$ a functor category $\mathcal{M}[\mathcal{C}] =…

This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…

In this paper, we show that there are infinitely many semisimple tensor (or monoidal) categories of rank two over an algebraically closed field $\mathbb F$.

Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…