Related papers: Consistency of Relations over Monoids
A relational structure is homomorphism-homogeneous if every homomorphism between finite substructures extends to an endomorphism of the structure. This notion was introduced recently by Cameron and Ne\v{s}et\v{r}il. In this paper we…
Why are large, complex ecosystems stable? Both theory and simulations of current models predict the onset of instability with growing size and complexity, so for decades it has been conjectured that ecosystems must have some unidentified…
Candidates for random network media include, e.g., systems consisting of long, flexible macromolecules cross-linked (i.e., permanently bonded) together at random to form the network. Owing to the random architecture, the characteristics of…
In this paper we present a new proof of the homological stability of the moduli space of closed surfaces in a simply connected background space $K$, which we denote by $S_g (K)$. The homology stability of surfaces in $K$ with an arbitrary…
The literature provides dichotomies involving homomorphisms (like the G 0 dichotomy) or reductions (like the characterization of sets potentially in a Wadge class of Borel sets, which holds on a subset of a product). However, part of the…
Bell non-local correlations cannot be naturally explained in a fixed causal structure. This serves as a motivation for considering models where no global assumption is made beyond logical consistency. The assumption of a fixed causal order…
It is well known that, for mass-action systems, complex-balanced equilibria are asymptotically stable. For generalized mass-action systems, even if there exists a unique complex-balanced equilibrium (in every stoichiometric class and for…
In the past few years, the discoveries of small-world and scale-free properties of many natural and artificial complex networks have stimulated significant advances in better understanding the relationship between the topology and the…
We give a new proof of the universal property of $KK^G$-theory with respect to stability, homotopy invariance and split-exactness for $G$ a locally compact group, or a locally compact (not necessarily Hausdorff) groupoid, or a countable…
Graph products of monoids provide a common framework for direct and free products, and graph monoids (also known as free partially commutative monoids). If the monoids in question are groups, then any graph product is, of course, a group.…
Controlling complex reaction networks is a fundamental challenge in the fields of physics, biology, and systems engineering. Here, we prove a general principle for catalytic reaction systems with kinetics where the reaction order and the…
Structural causal models (SCMs), also known as (nonparametric) structural equation models (SEMs), are widely used for causal modeling purposes. In particular, acyclic SCMs, also known as recursive SEMs, form a well-studied subclass of SCMs…
The regularized theories are non-local at the scale of the cutoff, leading so to the usual difficulties of non-local theories. In this work the conservation laws and causality are investigated for classical field theories with multi-cluster…
In this follow-up paper we show that smooth Hodge-proper stacks over $\mathcal O_K$ are $\mathbb Q_p$-locally acyclic: namely the natural map between \'etale $\mathbb Q_p$-cohomology of the algebraic and Raynaud generic fibers is an…
Dynamical locality is a condition on a locally covariant physical theory, asserting that kinematic and dynamical notions of local physics agree. This condition was introduced in [arXiv:1106.4785], where it was shown to be closely related to…
We study the homology of simplicial and cubical sets with symmetries. These are simplicial and cubical sets with additional maps expressing the symmetries of simplices and cubes. We consider the chain complex computing the homology groups…
Clonal microbes can switch between different phenotypes and recent theoretical work has shown that stochastic switching between these subpopulations can stabilize microbial communities. This phenotypic switching need not be stochastic,…
Suppose we are given a graph and want to show a property for all its cycles (closed chains). Induction on the length of cycles does not work since sub-chains of a cycle are not necessarily closed. This paper derives a principle reminiscent…
Parametricity is a key metatheoretic property of type systems, which implies strong uniformity & modularity properties of the structure of types within systems possessing it. In recent years, various systems of dependent type theory have…
Directed acyclic graphical models, or DAG models, are widely used to represent complex causal systems. Since the basic task of learning such a model from data is NP-hard, a standard approach is greedy search over the space of directed…