Related papers: Additive monotones for resource theories of parall…
We present a unified framework for categorical systems theory which packages a collection of open systems, their interactions, and their maps into a symmetric monoidal loose right module of systems over a symmetric monoidal double category…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
For classical dynamical systems, the polynomial entropy serves as a refined invariant of the topological entropy. In the setting of categorical dynamical systems, that is, triangulated categories endowed with an endofunctor, we develop the…
This paper presents an in-depth analysis of a parametrized version of the resolvent composition, an operation that combines a set-valued operator and a linear operator. We provide new properties and examples, and show that resolvent…
We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…
We present a general strategy that allows a more flexible method for the construction of fully additive multipartite entanglement monotones than the ones so far reported in the literature of axiomatic entanglement measures. Within this…
Partial orders may be used for modeling and summarising ranking data when the underlying order relations are less strict than a total order. They are a natural choice when the data are lists recording individuals' positions in queues in…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…
We introduce a new method to construct a Grothendieck category from a given colored quiver. This is a variant of the construction used to prove that every partially ordered set arises as the atom spectrum of a Grothendieck category. Using…
Inspired by Morse theory, we introduce a topological stack Broken, which we refer to as the moduli stack of broken lines. We show that Broken can be presented as a Lie groupoid with corners and provide a combinatorial description of sheaves…
An (additive) commutative monoid is called atomic if every given non-invertible element can be written as a sum of atoms (i.e., irreducible elements), in which case, such a sum is called a factorization of the given element. The number of…
We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of…
A commutative monoid $M$ is called a linearly orderable monoid if there exists a total order on $M$ that is compatible with the monoid operation. The finitary power monoid of a commutative monoid $M$ is the monoid consisting of all nonempty…
In this paper, in addition to the earlier introduced involutive divisions, we consider a new class of divisions induced by admissible monomial orderings. We prove that these divisions are noetherian and constructive. Thereby each of them…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
We introduce a penalty term-based splitting algorithm with inertial effects designed for solving monotone inclusion problems involving the sum of maximally monotone operators and the convex normal cone to the (nonempty) set of zeros of a…
Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…
We consider a finite collection of reinforced stochastic processes with a general network-based interaction among them. We provide sufficient and necessary conditions in order to have some form of almost sure asymptotic synchronization,…
Stochastic monotonicity is a well known partial order relation between probability measures defined on the same partially ordered set. Strassen Theorem establishes equivalence between stochastic monotonicity and the existence of a coupling…