相关论文: Representations of Cyclic Diagram Monoids

We introduce nominal string diagrams as, string diagrams internal in the category of nominal sets. This requires us to take nominal sets as a monoidal category, not with the cartesian product, but with the separated product. To this end, we…

Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…

Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…

The aim of this paper is to develop a theory of finite transformation monoids and in particular to study primitive transformation monoids. We introduce the notion of orbitals and orbital digraphs for transformation monoids and prove a…

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

We study permutations on n elements preserving orientation (parity) of every subset of size k. We describe all groups of these permutations. Unexpectedly, these groups (except for some special cases) are either trivial, cyclic or dihedral.…

I present an algorithm that, given a number $n \geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic…

The bulk macroscopic response of a system of particles or inclusions with field-induced forces is studied. The susceptibilities and transport coefficients in such a system are expressed as averages of a multiple scattering expansion. A…

Cycloids are particular Petri nets for modelling processes of actions or events. They belong to the fundaments of Petri's general systems theory and have very different interpretations, ranging from Einstein's relativity theory and…

Monoidal width was recently introduced by the authors as a measure of the complexity of decomposing morphisms in monoidal categories. We have shown that in a monoidal category of cospans of graphs, monoidal width and its variants can be…

This note contributes to the structure theory of abstract rigidity matroids in general dimension. In the spirit of classical matroid theory, we prove several cryptomorphic characterizations of abstract rigidity matroids (in terms of…

Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…

Subspace codes and particularly constant dimension codes have attracted much attention in recent years due to their applications in random network coding. As a particular subclass of subspace codes, cyclic subspace codes have additional…

Recurrence is a fundamental characteristic of dynamical systems with complicated behavior. Understanding the inner structure of recurrence is challenging, especially if the system has many degrees of freedom and is subject to noise. We…

Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce…

This paper aims to use topological methods to compute $\mathrm{Ext}$ between an irreducible representation of a finite monoid inflated from its group completion and one inflated from its group of units, or more generally coinduced from a…

Tape diagrams provide a graphical representation for arrows of rig categories, namely categories equipped with two monoidal structures, $\oplus$ and $\otimes$, where $\otimes$ distributes over $\oplus$. However, their applicability is…

One generalization of ordinary matroids is symplectic matroids. While symplectic matroids were initially defined by their collections of bases, there has been no cryptomorphic definition of symplectic matroids in terms of circuits. We give…

We introduce a new type of diagrams and prove the existence of a particular one, the "central tuned diagram", with some optimal features, for finitely generated modules of certain categories. This is achieved by getting to the idea of "the…

We treat the problem of characterizing in a systematic way the qualitative features of two-dimensional dynamical systems. To that end, we construct a representation of the topological features of phase portraits by means of diagrams that…