Related papers: Determining Generic Point Configurations From Unla…
The signature of a $p$-weakly geometric rough path summarises a path up to a generalised notion of reparameterisation. The quotient space of equivalence classes on which the signature is constant yields unparameterised path space. The study…
We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…
We prove that the set of $n$-point configurations for which the solution of the planar Steiner problem is not unique has the Hausdorff dimension at most $2n-1$ (as a subset of $\mathbb{R}^{2n}$). Moreover, we show that the Hausdorff…
It is an elementary fact that if we fix an arbitrary set of $d+1$ affine independent points $\{p_0,\dots p_d\}$ in $\mathbb{R}^d$, then the Euclidean distances $\{|x-p_j|\}_{j=0}^d$ determine the point $x$ in $\mathbb{R}^d$ uniquely. In…
We study Hamiltonian diffeomorphisms on symplectic Euclidean spaces that are equal to non-degenerate linear maps at infinity. Under the assumption that there exists an isolated homologically nontrivial fixed point satisfying the twist…
Shape recognition and classification is a problem with a wide variety of applications. Several recent works have demonstrated that topological descriptors can be used as summaries of shapes and utilized to compute distances. In this…
We study the problem of path planning for unlabeled (indistinguishable) unit-disc robots in a planar environment cluttered with polygonal obstacles. We introduce an algorithm which minimizes the total path length, i.e., the sum of lengths…
Checking whether a system of linear equations is consistent is a basic computational problem with ubiquitous applications. When dealing with inconsistent systems, one may seek an assignment that minimizes the number of unsatisfied…
We construct a continuum of non-homeomorphic compact subspaces of the real line R without singleton components. Thus from the purely topological point of view the real line contains not only more closed sets than open sets but also more…
A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…
This paper is an extension of the author's lecture "Unique Determination of Polyhedral Domains and $p$-Moduli of Path Families" given at the International Conference "Metric Geometry of Surfaces and Polyhedra" dedicated to the 100th…
Given an arbitrary convex symmetric n-dimensional body, we construct a natural and non-trivial continuous map which associates ellipsoids to ellipsoids, such that the Lowner-John ellipsoid of the body is its unique fixed point. A new…
Many bureaucratic and industrial processes involve decision points where an object can be sent to a variety of different stations based on certain preconditions. Consider for example a visa application that has needs to be checked at…
In this work we introduce a topological method for the search of fixed points and periodic points for continuous maps defined on generalized rectangles in finite dimensional Euclidean spaces. We name our technique "Stretching Along the…
The program of understanding Shape Theory layer by layer topologically and geometrically -- proposed in Part I -- is now addressed for 4 points in 1-$d$. Topological shape space graphs are far more complex here, whereas metric shape spaces…
The signature of a path, introduced by K.T. Chen [5] in $1954$, has been extensively studied in recent years. The $2010$ paper [12] of Hambly and Lyons showed that the signature is injective on the space of continuous finite-variation paths…
The signature transform, defined by the formal tensor series of global iterated path integrals, is a homomorphism between the path space and the tensor algebra that has been studied in geometry, control theory, number theory as well as…
Many robotics applications benefit from being able to compute multiple locally optimal paths in a given configuration space. Examples include path planning for of tethered robots with cable-length constraints, systems involving cables,…
Three-way dissimilarities are a generalization of (two-way) dissimilarities which can be used to indicate the lack of homogeneity or resemblance between any three objects. Such maps have applications in cluster analysis, and have been used…
We study fixed point sets for holomorphic automorphisms (and endomorphisms) on complex manifolds. The main object of our interest is to determine the number and configuration of fixed points that forces an automorphism (endomorphism) to be…