Related papers: Cluster parking functions
A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…
Every clone of functions comes naturally equipped with a topology---the topology of pointwise convergence. A clone $\mathfrak{C}$ is said to have automatic homeomorphicity with respect to a class $\mathcal{C}$ of clones, if every…
Ehrenborg and Jung recently related the order complex for the lattice of d-divisible partitions with the simplicial complex of pointed ordered set partitions via a homotopy equivalence. The latter has top homology naturally identified as a…
Multi-vehicle interaction behavior classification and analysis offer in-depth knowledge to make an efficient decision for autonomous vehicles. This paper aims to cluster a wide range of driving encounter scenarios based only on…
With the inflation of the data, clustering analysis, as a branch of unsupervised learning, lacks unified understanding and application of its mathematical law. Based on the view of fixed point, this paper restates the model-based clustering…
We study the monoid of so called projection functors $\p{S}$ attached to simple modules $S$ of a finite dimensional algebra, which appear naturally in the study of torsion pairs. We determine defining relations in special cases of path…
We introduce a category of cluster algebras with fixed initial seeds. This category has countable coproducts, which can be constructed combinatorially, but no products. We characterise isomorphisms and monomorphisms in this category and…
Combinatorial characterisations are obtained of symmetric and anti-symmetric infinitesimal rigidity for two-dimensional frameworks with reflectional symmetry in the case of norms where the unit ball is a quadrilateral and where the…
We introduce ordered and unordered configuration spaces of 'clusters' of points in an Euclidean space $\mathbb{R}^d$, where points in each cluster satisfy a 'verticality' condition, depending on a decomposition $d=p+q$. We compute the…
Many clustering schemes are defined by optimizing an objective function defined on the partitions of the underlying set of a finite metric space. In this paper, we construct a framework for studying what happens when we instead impose…
We develop a unified framework based on topological crossed modules for various lifting obstructions for $\Gamma$-kernels. It allows us to identify actions, cocycle actions and $\Gamma$-kernels up to their natural equivalence relations with…
In this paper three results are established: firstly, that the homotopy function complexes of Dwyer and Kan can be defined as certain total right derived functors; secondly, that they functorially compute the homotopy type of the hom-spaces…
We develop a homological generalization of Green hyperbolic operators, called Green hyperbolic complexes, which cover many examples of derived critical loci for gauge-theoretic quadratic action functionals in Lorentzian signature. We define…
For each partition of a data set into a given number of parts there is a partition such that every part is as much as possible a good model (an "algorithmic sufficient statistic") for the data in that part. Since this can be done for every…
The behaviour and functioning of a variety of complex physical and biological systems depend on the spatial organisation of their constituent units, and on the presence and formation of clusters of functionally similar or related…
Let $V$ be a rational, selfdual, $C_2$-cofinite vertex operator algebra of CFT type, and $G$ a finite automorphism group of $V.$ It is proved that the kernel of the representation of the modular group on twisted conformal blocks associated…
The problem of clustering is considered, for the case when each data point is a sample generated by a stationary ergodic process. We propose a very natural asymptotic notion of consistency, and show that simple consistent algorithms exist,…
The problem of clustering is considered, for the case when each data point is a sample generated by a stationary ergodic process. We propose a very natural asymptotic notion of consistency, and show that simple consistent algorithms exist,…
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability distribution with generating function G(s). We consider the following variation of Renyi's parking problem, alternatively called blocking…
Filling functions are asymptotic invariants of finitely presentable groups; the seminal work on the subject is by M.Gromov. They record features of combinatorial homotopy discs (van Kampen diagrams) filling loops in Cayley 2-complexes.…