Related papers: Star clusters in the Matching, Morse, and Generali…
Reducing a chain complex (whilst preserving its homotopy-type) using algebraic Morse theory gives the same end-result as Gaussian elimination, but AMT does it only on certain rows/columns and with several pivots (in all matrices…
We present a modern machine learning approach for cluster dynamical mass measurements that is a factor of two improvement over using a conventional scaling relation. Different methods are tested against a mock cluster catalog constructed…
Young massive star clusters spanning $\sim 10^4 - 10^8 M_\odot$ in mass have been observed to have similar surface brightness profiles. Recent hydrodynamical simulations of star cluster formation have also produced star clusters with this…
A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type…
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some…
Results on the finiteness of induced crossed modules are proved both algebraically and topologically. Using the Van Kampen type theorem for the fundamental crossed module, applications are given to the 2-types of mapping cones of…
We introduce the notion of a template for discrete Morse theory. Templates provide a memory efficient approach to the computation of homological invariants (e.g., homology, persistent homology, Conley complexes) of cell complexes. We…
Using the apparatus of correlation Gamma-function (``conditional density''), we have analyzed spatial clustering of objects from several different samples of galaxies, clusters and superclusters. On small scales the distribution of objects…
We consider the problem of efficiently computing a discrete Morse complex on simplicial complexes of arbitrary dimension and very large size. Based on a common graph-based formalism, we analyze existing data structures for simplicial…
In this paper, we describe the homotopy type of the homotopy fixed point sets of $S^3$-actions on rational spheres and complex projective spaces, and provide some properties of $S^1$-actions on a general rational complex.
To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…
We describe a framework for encoding cluster combinatorics using categorical methods. We give a definition of an abstract cluster structure, which captures the essence of cluster mutation at a tropical level and show that cluster algebras,…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
We work over an arbitrary ring R. Given two truncated projective resolutions of equal length for the same module we consider their underlying chain complexes. We show they may be stabilized by projective modules to obtain a pair of…
Crossed modules are known to be a model of pointed connected homotopy 2-types; formally, the homotopy category of crossed modules is equivalent to the category of pointed connected homotopy 2-types. In forming the homotopy category of…
We provide a systematic derivation of cluster alphabets of finite types. The construction is based on a geometric realization of the generalized worldsheets by gluing and folding a pair of polygons. The cross ratios of the worldsheet z…
We use a cluster ensemble to determine the number of clusters, k, in a group of data. A consensus similarity matrix is formed from the ensemble using multiple algorithms and several values for k. A random walk is induced on the graph…
A $(G,n)$-complex is an $n$-dimensional CW-complex with fundamental group $G$ and whose universal cover is $(n-1)$-connected. If $G$ has periodic cohomology then, for appropriate $n$, we show that there is a one-to-one correspondence…
Given a diagram of rings, one may consider the category of modules over them. We are interested in the homotopy theory of categories of this type: given a suitable diagram of model categories M(s) (as s runs through the diagram), we…
In this paper we provide concrete combinatorial formal deformation algorithms, namely sequences of elementary collapses and expansions, which relate various previously extensively studied families of combinatorially defined polyhedral…