Related papers: A lattice-ordered monoid on multilayer networks
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…
We introduce semidistrim lattices, a simultaneous generalization of semidistributive and trim lattices that preserves many of their common properties. We prove that the elements of a semidistrim lattice correspond to the independent sets in…
We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…
Multilayer networks have become increasingly ubiquitous across diverse scientific fields, ranging from social sciences and biology to economics and international relations. Despite their broad applications, the inferential theory for…
Let M be a commutative monoid. We provide an explicit first-order formular that defines the variety generated by M in the lattice of commutative semigroup varieties.
Symmetries naturally occur in real-world networks and can significantly influence the observed dynamics. For instance, many synchronization patterns result from the underlying network symmetries, and high symmetries are known to increase…
Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…
In the first part, we develop layered monoidal theories - a generalisation of monoidal theories combining descriptions of a system at several levels. Via their representation as string diagrams, monoidal theories provide a graphical syntax…
Given any finite subset $A$ of order $n$ of a distributive lattice and $k\in\{1,...,n\}$, there is a natural extension of the median operation to $n$ variables which generalizes the notion of the $k$th smallest element of $A$. By applying…
A novel type of self-organized lattice in which chaotic defects are arranged periodically is reported for a coupled map model of open flow. We find that temporally chaotic defects are followed by spatial relaxation to an almost periodic…
Lattice-linear systems allow nodes to execute asynchronously. We introduce eventually lattice-linear algorithms, where lattices are induced only among the states in a subset of the state space. The algorithm guarantees that the system…
The introduction of network science approaches into public transport research has seen great advances in the past 15 years. However, it has become apparent that monolayer networks are often not sufficient to model and analyse real-world…
We generalize the constructions of [17,19] to layered semirings, in order to enrich the structure and provide finite examples for applications in arithmetic (including finite examples). The layered category theory of [19] is extended…
Despite the abundance of bipartite networked systems, their organizing principles are less studied, compared to unipartite networks. Bipartite networks are often analyzed after projecting them onto one of the two sets of nodes. As a result…
Let (L_i : i\in I) be a family of lattices in a nontrivial lattice variety V, and let \phi_i: L_i --> M, for i\in I, be isotone maps (not assumed to be lattice homomorphisms) to a common lattice M (not assumed to lie in V). We show that the…
We investigate the alternate order on a congruence-uniform lattice $\mathcal{L}$ as introduced by N. Reading, which we dub the core label order of $\mathcal{L}$. When $\mathcal{L}$ can be realized as a poset of regions of a simplicial…
A determinant property of the structure of a biological network is the distribution of local connectivity patterns, i.e., network motifs. In this work, a method for creating directed, unweighted networks while promoting a certain…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…
In this article we provide an intrinsic characterization of the famous Howard-Bachmann ordinal in terms of a natural well-partial-ordering by showing that this ordinal can be realized as a maximal order type of a class of generalized trees…
Ferromagnetic ordering in a two-level partially excited system is studied in detail. Magnitudes of magnetization (magnetic order parameter) and lattice ordering (excited level occupation number) are calculated self-consistently. The…