Related papers: Stirling complexes
We study numerically the cluster structure of random ensembles of two NP-hard optimization problems originating in computational complexity, the vertex-cover problem and the number partitioning problem. We use branch-and-bound type…
We describe those complete linearly ordered topological spaces $X$ which are homogeneous (=CHLOTS). That is, $X$ is order isomorphic with any nonempty open interval in $X$. Using countable tail-like ordinals as indices, we build towers of…
We present a graph theoretical approach to the configurational statistics of random tree-like objects, such as randomly branching polymers. In particular, for ideal trees we show that Pr\"ufer labelling provides: (i) direct access to the…
Consider the space of continuous functions on a geometric tree $X$ whose persistent homology gives rise to a finite generic barcode $D$. We show that there are exactly as many path connected components in this space as there are merge trees…
Highly dynamic networks are characterized by frequent changes in the availability of communication links. These networks are often partitioned into several components, which split and merge unpredictably. We present a distributed algorithm…
It is a classical result that configuration spaces of labelled particles in $\mathbb{R}^d$ are free $E_d$-algebras and that their $d$-fold bar construction is equivalent to the $d$-fold suspension of the labelling space. In this paper, we…
In this paper, we propose an efficient clustering technique to solve the problem of clustering in the presence of obstacles. The proposed algorithm divides the spatial area into rectangular cells. Each cell is associated with statistical…
We consider the space of all configurations of finitely many (potentially nested) circles in the plane. We prove that this space is aspherical, and compute the fundamental group of each of its connected components. It turns out these…
Given a finite group G and a natural number n, we study the structure of the complex of nested sets of the associated Dowling lattice Q(G) and of its subposet of the G-symmetric partitions Q_G which was recently introduced by Hultman…
We face a need of discovering a pattern in locations of a great number of points in a high-dimensional space. Goal is to group the close points together. We are interested in a hierarchical structure, like a B-tree. B-Trees are…
We present a complete classification of the deterministic distributed time complexity for a family of graph problems: binary labeling problems in trees. These are locally checkable problems that can be encoded with an alphabet of size two…
In this paper we define a family of topological spaces, which contains and vastly generalizes the higher-dimensional Dunce hats. Our definition is purely combinatorial, and is phrased in terms of identifications of boundary simplices of…
Consider any locally checkable labeling problem $\Pi$ in rooted regular trees: there is a finite set of labels $\Sigma$, and for each label $x \in \Sigma$ we specify what are permitted label combinations of the children for an internal node…
We classify homotopes of classical symmetric spaces (studied in Part I of this work). Our classification uses the fibered structure of homotopes: they are fibered as symmetric spaces, with flat fibers, over a non-degenerate base; the base…
In [1] we introduced the concept of structured space, which is a topological space that locally resembles some algebraic structures. In [2] we proceeded the study of these spaces, developing two cohomology theories. The aim of this paper is…
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…
We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
We propose a flexible and multi-scale method for organizing, visualizing, and understanding datasets sampled from or near stratified spaces. The first part of the algorithm produces a cover tree using adaptive thresholds based on a…
In the theory of configuration spaces, "splitting" usually refers to the phenomenon that the configuration spaces on a manifold and those on its punctured version are closely related cohomologically. We prove a splitting theorem that is…