arXiv research

Adding a point to configurations in closed balls depends on the number of points and their ordering.

We prove homological stability for sequences of "oriented configuration spaces" as the number of points in the configuration goes to infinity. These are spaces of configurations of n points in a connected manifold M of dimension at least 2 which 'admits a boundary', with labels in a path-connected space X, and with an …

We describe the fundamental groups of ordered and unordered $k-$point sets in the n-dimensional complex space $C^n$ generating an affine subspace of fixed dimension.

Computes fundamental groups of restricted configuration spaces.

We describe the fundamental groups of ordered and unordered k point sets in complex projective space of dimension n generating a projective subspace of dimension i. We apply these to study connectivity of more complicated configurations of points.

Researchers analyze geodesic complexity in robot paths on tree graphs.

We compute the Betti numbers and describe the cohomology algebras of the ordered and unordered configuration spaces of three points in complex projective spaces, including the infinite dimensional case. We also compute these invariants for the configuration spaces of three collinear and non-collinear points.

In this paper we determine the topological complexity of configuration spaces of graphs which are not necessarily trees, which is a crucial assumption in previous results. We do this for two very different classes of graphs: fully articulated graphs and banana graphs. We also complete the computation in the case of tre…

Item response theory (IRT) models for categorical response data are widely used in the analysis of educational data, computerized adaptive testing, and psychological surveys. However, most IRT models rely on both the assumption that categories are strictly ordered and the assumption that this ordering is known a priori…

Study shows configuration spaces' homological dimension increases monotonically.

Geodesics in R^n configuration spaces for points apart by epsilon.

Unordered feature sets are a nonstandard data structure that traditional neural networks are incapable of addressing in a principled manner. Providing a concatenation of features in an arbitrary order may lead to the learning of spurious patterns or biases that do not actually exist. Another complication is introduced …

We provide an upper bound on the number of ordered Reidemeister moves required to pass between two diagrams of the same link. This bound is in terms of the number of unordered Reidemeister moves required.

Model learns disentangled static and dynamic data representations.

The study finds a subgroup of graph braid groups that is a direct product of non-abelian free groups.

We consider two families of algebraic varieties $Y_n$ indexed by natural numbers $n$: the configuration space of unordered $n$-tuples of distinct points on $\mathbb{C}$, and the space of unordered $n$-tuples of linearly independent lines in $\mathbb{C}^n$. Let $W_n$ be any sequence of virtual $S_n$-representations give…

The purpose of this article is to \begin{enumerate} \item define $M(t,k)$ the $t$-fold center of mass arrangement for $k$ points in the plane, \item give elementary properties of $M(t,k)$ and \item give consequences concerning the space $M(2,k)$ of $k$ distinct points in the plane, no four of which are the vertices of …

While Multiple Instance (MI) data are point patterns -- sets or multi-sets of unordered points -- appropriate statistical point pattern models have not been used in MI learning. This article proposes a framework for model-based MI learning using point process theory. Likelihood functions for point pattern data derived …

The paper explores isotopic triples of triangles in 3D space.

Develops deep neural network techniques for sets as input and output.

We construct a one-dimensional deformation retract of the unordered k-point configuration space of a star S. This retract suggests an explicit set of free generators Beta_k for the corresponding braid group of the star B_k and shows that the natural map from B_k-1 to B_k sends Beta_k-1 to Beta_k injectively.

Every smooth cubic plane curve has 9 inflection points, 27 sextatic points, and 72 ``points of type nine". Motivated by these classical algebro-geometric constructions, we study the following topological question: Is it possible to continuously choose $n$ distinct unordered points on each smooth cubic plane curve for a…

Constructs spectral sequences for Morava E-theory of configuration spaces.

Point patterns are sets or multi-sets of unordered elements that can be found in numerous data sources. However, in data analysis tasks such as classification and novelty detection, appropriate statistical models for point pattern data have not received much attention. This paper proposes the modelling of point pattern…

Given a graded $E_1$-module over an $E_2$-algebra in spaces, we construct an augmented semi-simplicial space up to higher coherent homotopy over it, called its canonical resolution, whose graded connectivity yields homological stability for the graded pieces of the module with respect to constant and abelian coefficien…

The kernel method is a potential approach to analyzing structured data such as sequences, trees, and graphs; however, unordered trees have not been investigated extensively. Kimura et al. (2011) proposed a kernel function for unordered trees on the basis of their subpaths, which are vertical substructures of trees resp…

The braid groups B_n can be defined as the mapping class group of the n-punctured disc. The Lawrence-Krammer representation of the braid group B_n is the induced action on a certain twisted second homology of the space of unordered pairs of points in the n-punctured disc. Recently, Daan Krammer showed that this is a fa…

Let C_n(M) be the configuration space of n distinct ordered points in M. We prove that if M is any connected orientable manifold (closed or open), the homology groups H_i(C_n(M); Q) are representation stable in the sense of [Church-Farb]. Applying this to the trivial representation, we obtain as a corollary that the un…

The paper constructs a Poisson algebra bundle for multilocal observables.

GENESIS-V2 infers unordered object representations without iterative refinement.

Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. Clustering algorithms have been used in a plethora of applications across several scientific fields. However, there has been limited research in the clustering of point patterns - sets or multi-sets of unordered elemen…

OrderNet learns to sort sequences from training data.

The kth finite subset space of a topological space X is the space exp_k X of non-empty finite subsets of X of size at most k, topologised as a quotient of X^k. The construction is a homotopy functor and may be regarded as a union of configuration spaces of distinct unordered points in X. We show that the finite subset …

Graph braid groups' complexity stabilizes for most graphs.

Paper proposes an alternative to set losses for predicting unordered variables without imposing structure.

Proposes SOVR loss to improve adversarial robustness by increasing logit margins.

Differential Cohomotopy theory predicts brane interactions via chord diagrams.

Surveying topological complexity of graph configurations, unifying traditional and modern approaches.

ExNODE uses ODE to model sets with permutation equivariance.

Kernel interpolation improved with continuous volume sampling.

All rational homology groups of unordered configuration spaces of the Moebius strip and the projective plane are calculated

New model predicts sets from feature vectors without discontinuity issues.

We give a new definition of the Jones polynomial. Let L be an oriented knot or link obtained as the plat closure of a braid beta in B_{2n}. We define a covering space tilde{C} of the space of unordered n-tuples of distinct points in the 2n-punctured disk. We then describe two n-manifolds tilde{S} and tilde{T} in tilde{…

The paper addresses how to add points to existing configurations on surfaces without disrupting continuity.

The paper is concerned with defining a topology on the set of ideals of codimension d of the algebra C^\infty(M,R) with M being a compact smooth manifold. Its main property is that it is compact Hausdorff and it contains as a subspace the configuration space of d distinct unordered points in M and therefore provides a …

The paper classifies when certain graph braid groups are 3-manifold groups.

Boosting strategies for merging vs. ensembling studies analyzed.

Elliptic curves and braid groups linked through configuration spaces.