Related papers: Monoidal networks
A matrix network is a family of matrices, with relatedness modeled by a weighted graph. We consider the task of completing a partially observed matrix network. We assume a novel sampling scheme where a fraction of matrices might be…
We use initially regular sequences that consist of linear sums to explore the depth of $R/I^2$, when $I$ is a monomial ideal in a polynomial ring $R$. We give conditions under which these linear sums form regular or initially regular…
The differential Brauer monoid of a differential commutative ring R s defined. Its elements are the isomorphism classes of differential Azumaya R algebras with operation from tensor product subject to the relation that two such algebras are…
A Lie groupoid can be thought of as a generalization of a Lie group in which the multiplication is only defined for certain pairs of elements. From another perspective, Lie groupoids can be regarded as manifolds endowed with a type of…
We describe a method for solving linear systems over the localization of a commutative ring $R$ at a multiplicatively closed subset $S$ that works under the following hypotheses: the ring $R$ is coherent, i.e., we can compute finite…
A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…
We classify simple heteroclinic networks for a $\Gamma$-equivariant system in ${\mathbb R}^4$ with finite $\Gamma \subset {\rm O}(4)$, proceeding as follows: we define a graph associated with a given $\Gamma \subset {\rm O}(n)$ and identify…
This article is devoted to the investigation of the deformation (twisting) of monoidal structures, such as the associativity constraint of the monoidal category and the monoidal structure of monoidal functor. The sets of twistings have a…
Algebraic structures such as monoids, groups, and categories can be formulated within a category using commutative diagrams. In many common categories these reduce to familiar cases. In particular, group objects in Grp are abelian groups,…
One goal of applied category theory is to better understand networks appearing throughout science and engineering. Here we introduce "structured cospans" as a way to study networks with inputs and outputs. Given a functor $L \colon…
Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on…
In many situations one encounters an entity that resembles a monoid. It consists of a carrier and two operations that resemble a unit and a multiplication, subject to three equations that resemble associativity and left and right unital…
This paper leverages linear systems theory to propose a principled measure of complexity for network systems. We focus on a network of first-order scalar linear systems interconnected through a directed graph. By locally filtering out the…
We introduce the normal produoidal category of monoidal contexts over an arbitrary monoidal category. In the same sense that a monoidal morphism represents a process, a monoidal context represents an incomplete process: a piece of a…
A typical complex system should be described by a supernetwork or a network of networks, in which the networks are coupled to some other networks. As the first step to understanding the complex systems on such more systematic level,…
A commutative ring $R$ is stable provided every ideal of $R$ containing a nonzerodivisor is projective as a module over its ring of endomorphisms. The class of stable rings includes the one-dimensional local Cohen-Macaulay rings of…
Let $R$ be a local or positively graded ring with a regular presentation $R \cong Q/I$ where $I$ is a monomial ideal generated by $n$ elements on a regular sequence. In Briggs-Grifo-Pollitz (2025), the authors classify the cohomological…
We introduce monoidal width as a measure of the difficulty of decomposing morphisms in monoidal categories. For graphs, we show that monoidal width and two variations capture existing notions, namely branch width, tree width and path width.…
Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial…
Let $R$ be a commutative ring and $\Gamma(R)$ denote its zero-divisor graph. In this paper, we investigate the genus number of the compact Riemann surface which $\Gamma(R)$ can be embedded and illustrate all finite commutative rings $R$ (up…