skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: On the Reconstruction of Geodesic Subspaces of ℝ^N
We consider the topological and geometric reconstruction of a geodesic subspace of [Formula: see text] both from the Čech and Vietoris-Rips filtrations on a finite, Hausdorff-close, Euclidean sample. Our reconstruction technique leverages the intrinsic length metric induced by the geodesics on the subspace. We consider the distortion and convexity radius as our sampling parameters for the reconstruction problem. For a geodesic subspace with finite distortion and positive convexity radius, we guarantee a correct computation of its homotopy and homology groups from the sample. This technique provides alternative sampling conditions to the existing and commonly used conditions based on weak feature size and [Formula: see text]–reach, and performs better under certain types of perturbations of the geodesic subspace. For geodesic subspaces of [Formula: see text], we also devise an algorithm to output a homotopy equivalent geometric complex that has a very small Hausdorff distance to the unknown underlying space.  more » « less
Award ID(s):
1854336 1664858 2046730
PAR ID:
10357767
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
International Journal of Computational Geometry & Applications
ISSN:
0218-1959
Page Range / eLocation ID:
1 to 27
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Starting with a vertex-weighted pointed graph [Formula: see text], we form the free loop algebra [Formula: see text] defined in Hartglass–Penneys’ article on canonical [Formula: see text]-algebras associated to a planar algebra. Under mild conditions, [Formula: see text] is a non-nuclear simple [Formula: see text]-algebra with unique tracial state. There is a canonical polynomial subalgebra [Formula: see text] together with a Dirac number operator [Formula: see text] such that [Formula: see text] is a spectral triple. We prove the Haagerup-type bound of Ozawa–Rieffel to verify [Formula: see text] yields a compact quantum metric space in the sense of Rieffel. We give a weighted analog of Benjamini–Schramm convergence for vertex-weighted pointed graphs. As our [Formula: see text]-algebras are non-nuclear, we adjust the Lip-norm coming from [Formula: see text] to utilize the finite dimensional filtration of [Formula: see text]. We then prove that convergence of vertex-weighted pointed graphs leads to quantum Gromov–Hausdorff convergence of the associated adjusted compact quantum metric spaces. As an application, we apply our construction to the Guionnet–Jones–Shyakhtenko (GJS) [Formula: see text]-algebra associated to a planar algebra. We conclude that the compact quantum metric spaces coming from the GJS [Formula: see text]-algebras of many infinite families of planar algebras converge in quantum Gromov–Hausdorff distance. 
    more » « less
  2. null (Ed.)
    Let [Formula: see text] be a group acting properly and by isometries on a metric space [Formula: see text]; it follows that the quotient or orbit space [Formula: see text] is also a metric space. We study the Vietoris–Rips and Čech complexes of [Formula: see text]. Whereas (co)homology theories for metric spaces let the scale parameter of a Vietoris–Rips or Čech complex go to zero, and whereas geometric group theory requires the scale parameter to be sufficiently large, we instead consider intermediate scale parameters (neither tending to zero nor to infinity). As a particular case, we study the Vietoris–Rips and Čech thickenings of projective spaces at the first scale parameter where the homotopy type changes. 
    more » « less
  3. For [Formula: see text], the coarse similarity class of A, denoted by [Formula: see text], is the set of all [Formula: see text] such that the symmetric difference of A and B has asymptotic density 0. There is a natural metric [Formula: see text] on the space [Formula: see text] of coarse similarity classes defined by letting [Formula: see text] be the upper density of the symmetric difference of A and B. We study the metric space of coarse similarity classes under this metric, and show in particular that between any two distinct points in this space there are continuum many geodesic paths. We also study subspaces of the form [Formula: see text] where [Formula: see text] is closed under Turing equivalence, and show that there is a tight connection between topological properties of such a space and computability-theoretic properties of [Formula: see text]. We then define a distance between Turing degrees based on Hausdorff distance in the metric space [Formula: see text]. We adapt a proof of Monin to show that the Hausdorff distances between Turing degrees that occur are exactly 0, [Formula: see text], and 1, and study which of these values occur most frequently in the senses of Lebesgue measure and Baire category. We define a degree a to be attractive if the class of all degrees at distance [Formula: see text] from a has measure 1, and dispersive otherwise. In particular, we study the distribution of attractive and dispersive degrees. We also study some properties of the metric space of Turing degrees under this Hausdorff distance, in particular the question of which countable metric spaces are isometrically embeddable in it, giving a graph-theoretic sufficient condition for embeddability. Motivated by a couple of issues arising in the above work, we also study the computability-theoretic and reverse-mathematical aspects of a Ramsey-theoretic theorem due to Mycielski, which in particular implies that there is a perfect set whose elements are mutually 1-random, as well as a perfect set whose elements are mutually 1-generic. Finally, we study the completeness of [Formula: see text] from the perspectives of computability theory and reverse mathematics. 
    more » « less
  4. The goal of this paper is to study limiting behavior of a self-organized continuous flock evolving according to the 1D hydrodynamic Euler Alignment model. We provide a series of quantitative estimates that show how far the density of the limiting flock is from a uniform distribution. The key quantity that controls density distortion is the entropy [Formula: see text], and the measure of deviation from uniformity is given by a well-known conserved quantity [Formula: see text], where [Formula: see text] is velocity and [Formula: see text] is the communication operator with kernel [Formula: see text]. The cases of Lipschitz, singular geometric, and topological kernels are covered in the study. 
    more » « less
  5. Geometric optical distortion is a significant contributor to the astrometric error budget in large telescopes using adaptive optics. To increase astrometric precision, optical distortion calibration is necessary. We investigate using smartphone Organic Light-Emitting Diode (OLED) screens as astrometric calibrators. Smartphones are low-cost, have stable illumination, and can be quickly reconfigured to probe different spatial frequencies of an optical system’s geometric distortion. In this work, we characterize the astrometric accuracy of a Samsung S20 smartphone, with a view towards providing large format, flexible astrometric calibrators for the next generation of astronomical instruments. We find the placement error of the pixels to be 189[Formula: see text]nm ± 15[Formula: see text]nm Root Mean Square (RMS). At this level of error, milliarcsecond astrometric accuracy can be obtained on modern astronomical instruments. 
    more » « less