Related papers: The Category of Factorization
Abstract. This article determines relations between two notions concerning monoids: factorability structure, introduced to simplify the bar complex; and quadratic normalisation, introduced to generalise quadratic rewriting systems and…
For a positive real number $\alpha$, let $\mathbb{N}_0[\alpha,\alpha^{-1}]$ be the semiring of all real numbers $f(\alpha)$ for $f(x)$ lying in $\mathbb{N}_0[x,x^{-1}]$, which is the semiring of all Laurent polynomials over the set of…
A subset $S$ of an integral domain $R$ is called a semidomain provided that the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities. The study of factorizations in integral domains was initiated by Anderson, Anderson, and…
This paper develops an approach to categorical deformation quantization via factorization homology. We show that a quantization of the local coefficients for factorization homology is equivalent to consistent quantizations of its value on…
In this paper we study grouplike monoids, these are monoids that contain a group to which we add an ordered set of idempotents. We classify finite categories with two objects having grouplike endomorphism monoids, and we give a count of…
We introduce categories of weak factorization algebras and factorization spaces, and prove that they are equivalent to the categories of ordinary factorization algebras and spaces, respectively. This allows us to define the pullback of a…
We show that in a locally lambda-presentable category, every lambda(m)-injectivity class (i.e., the class of all the objects injective with respect to some class of lambda-presentable morphisms) is a weakly reflective subcategory determined…
A factorization of a permutation into transpositions is called "primitive" if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously…
An atomic monoid $M$ is called length-factorial if for every non-invertible element $x \in M$, no two distinct factorizations of $x$ into irreducibles have the same length (i.e., number of irreducible factors, counting repetitions). The…
Every monoidal functor G: C --> M has a canonical factorization through the category of bimodules over some monoid R in M such that the factor U: C -->_R M_R is strongly unital. Using this result and the characterization of the forgetful…
It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to…
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…
We study categories of matrix factorizations. These categories are defined for any regular function on a suitable regular scheme. Our paper has two parts. In the first part we develop the foundations; for example we discuss derived direct…
Using full images of accessible functors, we prove some results about combinatorial and accessible model categories. In particular, we give an example of a weak factorization system on a locally presentable category which is not accessible.
We prove that the unitary Drinfeld center of a unitary tensor category is equivalente to the category of unitary bimodules for the canonical W*-algebra object, generalizing M\"uger's result to the non-fusion case. This is then used to…
A differential modality is a comonad on an additive symmetric monoidal category $(\mathsf{C},\otimes,I)$, whose underlying functor we denote $!\colon\mathsf{C} \rightarrow \mathsf{C}$, together with some additional structure including a…
Let $M$ be a monoid, $\mathscr{C}$ a category with pullbacks and $X$ an object of $\mathscr{C}$. We introduce the notion of a partial action $\alpha$ of $M$ on $X$ and study the globalization question for $\alpha$. If $\alpha$ admits a…
This paper is concentrated on the classification of permutation matrix with the permutation similarity relation, mainly about the canonical form of a permutational similar equivalence class, the cycle matrix decomposition of a permutation…
Given a join semilattice $S$ with a minimum $\hat{0}$, the quarks (also called atoms in order theory) are the elements that cover $\hat{0}$, and for each $x \in S \setminus \{\hat{0}\}$ a factorization (into quarks) of $x$ is a minimal set…
Recently, Boehm and Stefan constructed duplicial (paracyclic) objects from distributive laws between (co)monads. Here we define the category of factorisations of a distributive law, show that it acts on this construction, and give some…