Related papers: Restricted configuration spaces
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
We develop sampling formulas for high-dimensional functions in reproducing kernel Hilbert spaces, where we rely on irregular samples that are taken at determining sequences of data points. We place particular emphasis on sampling formulas…
The paper contains two natural constructions of extreme hyperspace selections generated by special ordinal decompositions of the underlying space. These constructions are very efficient not only in simplifying arguments but also in…
We study configuration spaces of hard spheres in a bounded region. We develop a general Morse-theoretic framework, and show that mechanically balanced configurations play the role of critical points. As an application, we find the precise…
Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…
We define a partition of a reductive group into finitely many subsets, refining the partition of the group into strata. We state some conjectural properties of these subsets (called substrata) and verify them in some examples.
Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…
We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…
We start by introducing the basics of configurations of points and lines, and then move into discussing symmetry groups of these configurations. Specifically, we explore how we might classify the symmetries of $(9_3)$ and $(10_3)$ geometric…
We define the manifold of configurations to be the quotient set of $k$ points in Euclidean space identified under congruence, and prove that compact subsets of $\mathbb{R}^d, d \geq 2$, of large Hausdorff dimension have a non-null set of…
Unsupervised classification called clustering is a process of organizing objects into groups whose members are similar in some way. Clustering of uncertain data objects is a challenge in spatial data bases. In this paper we use Probability…
The general intractability of the constraint satisfaction problem has motivated the study of restrictions on this problem that permit polynomial-time solvability. One major line of work has focused on structural restrictions, which arise…
We find sharp upper bounds on the order of the automorphism group of a hypersurface in complex projective space in every dimension and degree. In each case, we prove that the hypersurface realizing the upper bound is unique up to…
We express the rational cohomology of the unordered configuration space of a compact oriented manifold as a representation of its mapping class group in terms of a weight-decomposition of the rational cohomology of the mapping space from…
A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…
We construct a tower of fibrations approximating the derived mapping space between two simplicially enriched operads subject to mild conditions. The n-th stage of the tower is obtained by neglecting operations with more than n inputs. The…
In this paper we compute in some new cases the cardinalities of the fibers of certain natural fibrations that appear in the analysis of the configuration space of the Heisenberg ring. This is done by means of certain cyclic group actions on…
By using two different invariants for the Rubik's Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually…
Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…
Using techniques in logarithmic geometry, we construct a logarithmic analogue of the Fulton--MacPherson configuration spaces. We similarly construct a logarithmically smooth degeneration of the Fulton--MacPherson configuration spaces. Both…