Related papers: Simplicial Complexes Obtained from Qualitative Pro…
Given a chain complex with the only modification that each cell of the complex has a probability distribution assigned. We will call this complex - a random complex and what should be understood in practice, is that we have a classical…
We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…
We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…
We define two different simplicial complexes, the common divisor simplicial complex and the prime divisor simplicial complex, from a set of integers, and explore their similarities. We will define a map between the two simplicial complexes,…
In this paper, we introduce a new category of simplicial effects that extends the categories of effect algebras and their multi-object counterpart, effect algebroids. Our approach is based on relaxing the associativity condition satisfied…
In this paper we introduce the class of ordered homomorphism ideals and prove that these ideals admit minimal cellular resolutions constructed as homomorphism complexes. As a key ingredient of our work, we introduce the class of cointerval…
We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…
We consider a multi-parameter model for randomly constructing simplicial complexes. This model interpolates between random clique complexes and Linial-Meshulam random $k$-dimensional complexes, two models that have been extensively studied.…
We revisit the notion of initial sets by Xu and Cayrol, i.e., non-empty minimal admissible sets in abstract argumentation frameworks. Initial sets are a simple concept for analysing conflicts in an abstract argumentation framework and to…
{\tt AbstractSimplicialComplexes.m2} is a computer algebra package written for the computer algebra system {\tt Macaulay2} \cite{M2}. It provides new infrastructure to work with abstract simplicial complexes and related homological…
In distributed systems, knowledge of the network structure of the connections among the unitary components is often a requirement for an accurate prediction of the emerging collective dynamics. However, in many real-world situations, one…
Starting from a locally gentle bound quiver, we define on the one hand a simplicial complex, called the non-kissing complex. On the other hand, we construct a punctured, marked, oriented surface with boundary, endowed with a pair of dual…
The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…
We study the orthogonal quantum groups satisfying the ``easiness'' assumption axiomatized in our previous paper, with the construction of some new examples, and with some partial classification results. The conjectural conclusion is that…
We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…
We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the…
Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…
Imposing a strong condition on the linear order of shellable complexes, we introduce strong shellability. Basic properties, including the existence of dimension-decreasing strong shelling orders, are developed with respect to nonpure…
Exponential random graph models have attracted significant research attention over the past decades. These models are maximum-entropy ensembles under the constraints that the expected values of a set of graph observables are equal to given…
Given a shifted order ideal $U$, we associate to it a family of simplicial complexes $(\Delta_t(U))_{t\geq 0}$ that we call squeezed complexes. In a special case, our construction gives squeezed balls that were defined and used by Kalai to…