Related papers: Simplicial Complexes Obtained from Qualitative Pro…
A simplex-based network is referred to as a higher-order network, in which describe that the interactions can include more than two nodes. Many multicomponent interactions can be grasped through simplicial complexes, which have recently…
We deal with stability theory for ``reasonable'' non-elementary classes without any remanents of compactness (like: above Hanf number or definable by L_{omega_1, omega}).
A novel, information-based classification of elementary cellular automata is proposed that circumvents the problems associated with isolating whether complexity is in fact intrinsic to a dynamical rule, or if it arises merely as a product…
While chain complexes are equipped with a differential $d$ satisfying $d^2 = 0$, their generalizations called $N$-complexes have a differential $d$ satisfying $d^N = 0$. In this paper we show that the lax nerve of the category of chain…
A weighted simplicial complex is a simplicial complex with values (called weights) on the vertices. In this paper, we consider weighted simplicial complexes with $\mathbb{R}^2$-valued weights. We study the weighted homology and the weighted…
Sampling formulas describe probability laws of exchangeable combinatorial structures like partitions and compositions. We give a brief account of two known parametric families of sampling formulas and add a new family to the list.
Complex quantum trajectories, which were first obtained from a modified de Broglie-Bohm quantum mechanics, demonstrate that Born's probability axiom in quantum mechanics originates from dynamics itself. We show that a normalisable…
Complex information-processing systems, for example quantum circuits, cryptographic protocols, or multi-player games, are naturally described as networks composed of more basic information-processing systems. A modular analysis of such…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…
We develop a new formalism for constructing probabilities associated to the causal ordering of events in quantum theory, where by an event we mean the emergence of a measurement record on a detector. We start with constructing probabilities…
Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…
We study the simplicial complex that arises from non-attacking rook placements on a subclass of Ferrers boards that have $a_i$ rows of length $i$ where $a_i>0$ and $i\leq n$ for some positive integer $n$. In particular, we will investigate…
The paper is devoted to an approach to the bounded cohomology theory based on the theories of simplicial sets and Postnikov systems. In particular, the main results of the bounded cohomology theory of topological spaces are extended to…
A set of general physical principles is proposed as the structural basis for the theory of complex systems. First the concept of harmony is analyzed and its different aspects are uncovered. Then the concept of reflection is defined and…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
We propose a simple, geometrically-motivated construction of smooth random paths in the plane. The construction is such that, with probability one, the paths have finite curvature everywhere (and the realizations are visually pleasing when…
Well ordered covers of square-free monomial ideals are subsets of the minimal generating set ordered in a certain way that give rise to a Lyubeznik resolution for the ideal, and have guaranteed nonvanishing Betti numbers in certain degrees.…
Tame abstract elementary classes are a broad nonelementary framework for model theory that encompasses several examples of interest. In recent years, progress toward developing a classification theory for them have been made. Abstract…
A simple mechanism for the emergence of complexity in cellular automata out of predictable dynamics is described. This leads to unfold the concept of conditional predictability for systems whose trajectory can only be piecewise known. The…