arXiv research

Computes fundamental groups of restricted configuration spaces.

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 …

Study shows configuration spaces' homological dimension increases monotonically.

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.

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.

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.

Researchers analyze geodesic complexity in robot paths on tree graphs.

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…

We construct a spectral sequence converging to the Morava $E$-theory of unordered configuration spaces and identify its E$^2$-page as the homology of a Chevalley-Eilenberg-like complex for Hecke Lie algebras. Based on this, we compute the $E$-theory of the weight $p$ summands of iterated loop spaces of spheres (paramet…

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 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 …

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…

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…

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…

We determine explicit formulas for geodesics (in the Euclidean metric) in the configuration space of ordered pairs (x,x') of points in R^n which satisfy d(x,x')>=epsilon. We interpret this as two or three (depending on the parity of n) geodesic motion-planning rules for this configuration space. In the associated unord…

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…

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 answer the question of when a new point can be added in a continuous way to configurations of $n$ distinct points in a closed ball of arbitrary dimension. We show that this is possible given an ordered configuration of $n$ points if and only if $n \neq 1$. On the other hand, when the points are not ordered and the d…

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…

We present a deep generative model that learns disentangled static and dynamic representations of data from unordered input. Our approach exploits regularities in sequential data that exist regardless of the order in which the data is viewed. The result of our factorized graphical model is a well-organized and coherent…

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…

Current approaches for predicting sets from feature vectors ignore the unordered nature of sets and suffer from discontinuity issues as a result. We propose a general model for predicting sets that properly respects the structure of sets and avoids this problem. With a single feature vector as input, we show that our m…

The paper constructs a Poisson algebra bundle for multilocal observables.

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…

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

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

Two triples of triangles having pairwise disjoint outlines in 3-space are called combinatorially isotopic if one triple can be obtained from the other by a continuous motion during which the outlines of the triangles remain pairwise disjoint. We conjecture that it can be algorithmically checked if an (ordered or unorde…

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.

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.

Elliptic curves and braid groups linked through configuration spaces.

We consider the problem of finding the probability that a random triangle is obtuse, which was first raised by Lewis Caroll. Our investigation leads us to a natural correspondence between plane polygons and the Grassmann manifold of 2-planes in real $n$-space proposed by Allen Knutson and Jean-Claude Hausmann. This cor…

In 1981 Masur proved the existence of a dense geodesic in the moduli space for a Teichmüller space. We prove an analogue theorem for reduced Outer Space endowed with the Lipschitz metric. We also prove two results possibly of independent interest: we show Brun's unordered algorithm weakly converges and from this prove …

This paper extends homological stability results for configuration spaces of manifolds.

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…

Representation learning (RL) plays an important role in extracting proper representations from complex medical data for various analyzing tasks, such as patient grouping, clinical endpoint prediction and medication recommendation. Medical data can be divided into two typical categories, outpatient and inpatient, that h…

Extend CPS to non-exchangeable settings with observation-specific permutation weights

We introduce a differential refinement of Cohomotopy cohomology theory, defined on Penrose diagram spacetimes, whose cocycle spaces are unordered configuration spaces of points. First we prove that brane charge quantization in this differential 4-Cohomotopy theory implies intersecting p/(p+2)-brane moduli given by orde…

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…

We improve Gaussian copula models for imputing mixed data types with precise approximations.

The mapping class group $Γ^k(N_g)$ of a non-orientable surface with punctures is studied via classical homotopy theory of configuration spaces. In particular, we obtain a non-orientable version of the Birman exact sequence. In the case of $\mathbb R {\rm P}^2$, we analize the Serre spectral sequence of a fiber bundle $…

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 …

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 calculate the homology of th…