@article{9157,
  abstract     = {Representing an atom by a solid sphere in 3-dimensional Euclidean space, we get the space-filling diagram of a molecule by taking the union. Molecular dynamics simulates its motion subject to bonds and other forces, including the solvation free energy. The morphometric approach [12, 17] writes the latter as a linear combination of weighted versions of the volume, area, mean curvature, and Gaussian curvature of the space-filling diagram. We give a formula for the derivative of the weighted mean curvature. Together with the derivatives of the weighted volume in [7], the weighted area in [3], and the weighted Gaussian curvature [1], this yields the derivative of the morphometric expression of the solvation free energy.},
  author       = {Akopyan, Arseniy and Edelsbrunner, Herbert},
  issn         = {2544-7297},
  journal      = {Computational and Mathematical Biophysics},
  number       = {1},
  pages        = {51--67},
  publisher    = {De Gruyter},
  title        = {{The weighted mean curvature derivative of a space-filling diagram}},
  doi          = {10.1515/cmb-2020-0100},
  volume       = {8},
  year         = {2020},
}

@article{9249,
  abstract     = {Rhombic dodecahedron is a space filling polyhedron which represents the close packing of spheres in 3D space and the Voronoi structures of the face centered cubic (FCC) lattice. In this paper, we describe a new coordinate system where every 3-integer coordinates grid point corresponds to a rhombic dodecahedron centroid. In order to illustrate the interest of the new coordinate system, we propose the characterization of 3D digital plane with its topological features, such as the interrelation between the thickness of the digital plane and the separability constraint we aim to obtain. We also present the characterization of 3D digital lines and study it as the intersection of multiple digital planes. Characterization of 3D digital sphere with relevant topological features is proposed as well along with the 48-symmetry appearing in the new coordinate system.},
  author       = {Biswas, Ranita and Largeteau-Skapin, Gaëlle and Zrour, Rita and Andres, Eric},
  issn         = {2353-3390},
  journal      = {Mathematical Morphology - Theory and Applications},
  number       = {1},
  pages        = {143--158},
  publisher    = {De Gruyter},
  title        = {{Digital objects in rhombic dodecahedron grid}},
  doi          = {10.1515/mathm-2020-0106},
  volume       = {4},
  year         = {2020},
}

@inproceedings{9299,
  abstract     = {We call a multigraph non-homotopic if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can be shrunk to its end-vertex in the same way. It is easy to see that a non-homotopic multigraph on   n>1  vertices can have arbitrarily many edges. We prove that the number of crossings between the edges of a non-homotopic multigraph with n vertices and   m>4n  edges is larger than   cm2n  for some constant   c>0 , and that this bound is tight up to a polylogarithmic factor. We also show that the lower bound is not asymptotically sharp as n is fixed and   m⟶∞ .},
  author       = {Pach, János and Tardos, Gábor and Tóth, Géza},
  booktitle    = {28th International Symposium on Graph Drawing and Network Visualization},
  isbn         = {9783030687656},
  issn         = {1611-3349},
  location     = {Virtual, Online},
  pages        = {359--371},
  publisher    = {Springer Nature},
  title        = {{Crossings between non-homotopic edges}},
  doi          = {10.1007/978-3-030-68766-3_28},
  volume       = {12590},
  year         = {2020},
}

@inbook{74,
  abstract     = {We study the Gromov waist in the sense of t-neighborhoods for measures in the Euclidean  space,  motivated  by  the  famous  theorem  of  Gromov  about  the  waist  of  radially symmetric Gaussian measures.  In particular, it turns our possible to extend Gromov’s original result  to  the  case  of  not  necessarily  radially  symmetric  Gaussian  measure.   We  also  provide examples of measures having no t-neighborhood waist property, including a rather wide class
of compactly supported radially symmetric measures and their maps into the Euclidean space of dimension at least 2.
We  use  a  simpler  form  of  Gromov’s  pancake  argument  to  produce  some  estimates  of t-neighborhoods of (weighted) volume-critical submanifolds in the spirit of the waist theorems, including neighborhoods of algebraic manifolds in the complex projective space. In the appendix of this paper we provide for reader’s convenience a more detailed explanation of the Caffarelli theorem that we use to handle not necessarily radially symmetric Gaussian
measures.},
  author       = {Akopyan, Arseniy and Karasev, Roman},
  booktitle    = {Geometric Aspects of Functional Analysis},
  editor       = {Klartag, Bo'az and Milman, Emanuel},
  isbn         = {9783030360191},
  issn         = {1617-9692},
  pages        = {1--27},
  publisher    = {Springer Nature},
  title        = {{Gromov's waist of non-radial Gaussian measures and radial non-Gaussian measures}},
  doi          = {10.1007/978-3-030-36020-7_1},
  volume       = {2256},
  year         = {2020},
}

@article{7554,
  abstract     = {Slicing a Voronoi tessellation in ${R}^n$ with a $k$-plane gives a $k$-dimensional weighted Voronoi tessellation, also known as a power diagram or Laguerre tessellation. Mapping every simplex of the dual weighted Delaunay mosaic to the radius of the smallest empty circumscribed sphere whose center lies in the $k$-plane gives a generalized discrete Morse function. Assuming the Voronoi tessellation is generated by a Poisson point process in ${R}^n$, we study the expected number of simplices in the $k$-dimensional weighted Delaunay mosaic as well as the expected number of intervals of the Morse function, both as functions of a radius threshold. As a by-product, we obtain a new proof for the expected number of connected components (clumps) in a line section of a circular Boolean model in ${R}^n$.},
  author       = {Edelsbrunner, Herbert and Nikitenko, Anton},
  issn         = {1095-7219},
  journal      = {Theory of Probability and its Applications},
  number       = {4},
  pages        = {595--614},
  publisher    = {SIAM},
  title        = {{Weighted Poisson–Delaunay mosaics}},
  doi          = {10.1137/S0040585X97T989726},
  volume       = {64},
  year         = {2020},
}

@article{7567,
  abstract     = {Coxeter triangulations are triangulations of Euclidean space based on a single simplex. By this we mean that given an individual simplex we can recover the entire triangulation of Euclidean space by inductively reflecting in the faces of the simplex. In this paper we establish that the quality of the simplices in all Coxeter triangulations is O(1/d−−√) of the quality of regular simplex. We further investigate the Delaunay property for these triangulations. Moreover, we consider an extension of the Delaunay property, namely protection, which is a measure of non-degeneracy of a Delaunay triangulation. In particular, one family of Coxeter triangulations achieves the protection O(1/d2). We conjecture that both bounds are optimal for triangulations in Euclidean space.},
  author       = {Choudhary, Aruni and Kachanovich, Siargey and Wintraecken, Mathijs},
  issn         = {1661-8289},
  journal      = {Mathematics in Computer Science},
  pages        = {141--176},
  publisher    = {Springer Nature},
  title        = {{Coxeter triangulations have good quality}},
  doi          = {10.1007/s11786-020-00461-5},
  volume       = {14},
  year         = {2020},
}

@article{9630,
  abstract     = {Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms.  Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory needed for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context.},
  author       = {Edelsbrunner, Herbert and Virk, Ziga and Wagner, Hubert},
  issn         = {1920-180X},
  journal      = {Journal of Computational Geometry},
  number       = {2},
  pages        = {162--182},
  publisher    = {Carleton University},
  title        = {{Topological data analysis in information space}},
  doi          = {10.20382/jocg.v11i2a7},
  volume       = {11},
  year         = {2020},
}

@inproceedings{8135,
  abstract     = {Discrete Morse theory has recently lead to new developments in the theory of random geometric complexes. This article surveys the methods and results obtained with this new approach, and discusses some of its shortcomings. It uses simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics.},
  author       = {Edelsbrunner, Herbert and Nikitenko, Anton and Ölsböck, Katharina and Synak, Peter},
  booktitle    = {Topological Data Analysis},
  isbn         = {9783030434076},
  issn         = {2197-8549},
  pages        = {181--218},
  publisher    = {Springer Nature},
  title        = {{Radius functions on Poisson–Delaunay mosaics and related complexes experimentally}},
  doi          = {10.1007/978-3-030-43408-3_8},
  volume       = {15},
  year         = {2020},
}

@inproceedings{8703,
  abstract     = {Even though Delaunay originally introduced his famous triangulations in the case of infinite point sets with translational periodicity, a software that computes such triangulations in the general case is not yet available, to the best of our knowledge. Combining and generalizing previous work, we present a practical algorithm for computing such triangulations. The algorithm has been implemented and experiments show that its performance is as good as the one of the CGAL package, which is restricted to cubic periodicity. },
  author       = {Osang, Georg F and Rouxel-Labbé, Mael and Teillaud, Monique},
  booktitle    = {28th Annual European Symposium on Algorithms},
  isbn         = {9783959771627},
  issn         = {1868-8969},
  location     = {Virtual, Online; Pisa, Italy},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Generalizing CGAL periodic Delaunay triangulations}},
  doi          = {10.4230/LIPIcs.ESA.2020.75},
  volume       = {173},
  year         = {2020},
}

@phdthesis{7944,
  abstract     = {This thesis considers two examples of reconfiguration problems: flipping edges in edge-labelled triangulations of planar point sets and swapping labelled tokens placed on vertices of a graph. In both cases the studied structures – all the triangulations of a given point set or all token placements on a given graph – can be thought of as vertices of the so-called reconfiguration graph, in which two vertices are adjacent if the corresponding structures differ by a single elementary operation – by a flip of a diagonal in a triangulation or by a swap of tokens on adjacent vertices, respectively. We study the reconfiguration of one instance of a structure into another via (shortest) paths in the reconfiguration graph.

For triangulations of point sets in which each edge has a unique label and a flip transfers the label from the removed edge to the new edge, we prove a polynomial-time testable condition, called the Orbit Theorem, that characterizes when two triangulations of the same point set lie in the same connected component of the reconfiguration graph. The condition was first conjectured by Bose, Lubiw, Pathak and Verdonschot. We additionally provide a polynomial time algorithm that computes a reconfiguring flip sequence, if it exists. Our proof of the Orbit Theorem uses topological properties of a certain high-dimensional cell complex that has the usual reconfiguration graph as its 1-skeleton.

In the context of token swapping on a tree graph, we make partial progress on the problem of finding shortest reconfiguration sequences. We disprove the so-called Happy Leaf Conjecture and demonstrate the importance of swapping tokens that are already placed at the correct vertices. We also prove that a generalization of the problem to weighted coloured token swapping is NP-hard on trees but solvable in polynomial time on paths and stars.},
  author       = {Masárová, Zuzana},
  isbn         = {978-3-99078-005-3},
  issn         = {2663-337X},
  keywords     = {reconfiguration, reconfiguration graph, triangulations, flip, constrained triangulations, shellability, piecewise-linear balls, token swapping, trees, coloured weighted token swapping},
  pages        = {160},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{Reconfiguration problems}},
  doi          = {10.15479/AT:ISTA:7944},
  year         = {2020},
}

@phdthesis{7460,
  abstract     = {Many methods for the reconstruction of shapes from sets of points produce ordered simplicial complexes, which are collections of vertices, edges, triangles, and their higher-dimensional analogues, called simplices, in which every simplex gets assigned a real value measuring its size. This thesis studies ordered simplicial complexes, with a focus on their topology, which reflects the connectedness of the represented shapes and the presence of holes. We are interested both in understanding better the structure of these complexes, as well as in developing algorithms for applications.

For the Delaunay triangulation, the most popular measure for a simplex is the radius of the smallest empty circumsphere. Based on it, we revisit Alpha and Wrap complexes and experimentally determine their probabilistic properties for random data. Also, we prove the existence of tri-partitions, propose algorithms to open and close holes, and extend the concepts from Euclidean to Bregman geometries.},
  author       = {Ölsböck, Katharina},
  issn         = {2663-337X},
  keywords     = {shape reconstruction, hole manipulation, ordered complexes, Alpha complex, Wrap complex, computational topology, Bregman geometry},
  pages        = {155},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{The hole system of triangulated shapes}},
  doi          = {10.15479/AT:ISTA:7460},
  year         = {2020},
}

@article{6050,
  abstract     = {We answer a question of David Hilbert: given two circles it is not possible in general to construct their centers using only a straightedge. On the other hand, we give infinitely many families of pairs of circles for which such construction is possible. },
  author       = {Akopyan, Arseniy and Fedorov, Roman},
  journal      = {Proceedings of the American Mathematical Society},
  pages        = {91--102},
  publisher    = {AMS},
  title        = {{Two circles and only a straightedge}},
  doi          = {10.1090/proc/14240},
  volume       = {147},
  year         = {2019},
}

@article{6515,
  abstract     = {We give non-degeneracy criteria for Riemannian simplices based on simplices in spaces of constant sectional curvature. It extends previous work on Riemannian simplices, where we developed Riemannian simplices with respect to Euclidean reference simplices. The criteria we give in this article are in terms of quality measures for spaces of constant curvature that we develop here. We see that simplices in spaces that have nearly constant curvature, are already non-degenerate under very weak quality demands. This is of importance because it allows for sampling of Riemannian manifolds based on anisotropy of the manifold and not (absolute) curvature.},
  author       = {Dyer, Ramsay and Vegter, Gert and Wintraecken, Mathijs},
  issn         = {1920-180X},
  journal      = {Journal of Computational Geometry },
  number       = {1},
  pages        = {223–256},
  publisher    = {Carleton University},
  title        = {{Simplices modelled on spaces of constant curvature}},
  doi          = {10.20382/jocg.v10i1a9},
  volume       = {10},
  year         = {2019},
}

@inproceedings{6628,
  abstract     = {Fejes Tóth [5] and Schneider [9] studied approximations of smooth convex hypersurfaces in Euclidean space by piecewise  flat  triangular  meshes  with  a  given  number of  vertices  on  the  hypersurface  that  are  optimal  with respect  to  Hausdorff  distance.   They  proved  that  this Hausdorff distance decreases inversely proportional with m 2/(d−1),  where m is  the  number  of  vertices  and d is the  dimension  of  Euclidean  space.   Moreover  the  pro-portionality constant can be expressed in terms of the Gaussian curvature, an intrinsic quantity.  In this short note, we prove the extrinsic nature of this constant for manifolds of sufficiently high codimension.  We do so by constructing an family of isometric embeddings of the flat torus in Euclidean space.},
  author       = {Vegter, Gert and Wintraecken, Mathijs},
  booktitle    = {The 31st Canadian Conference in Computational Geometry},
  location     = {Edmonton, Canada},
  pages        = {275--279},
  title        = {{The extrinsic nature of the Hausdorff distance of optimal triangulations of manifolds}},
  year         = {2019},
}

@article{6634,
  abstract     = {In this paper we prove several new results around Gromov's waist theorem. We give a simple proof of Vaaler's theorem on sections of the unit cube using the Borsuk-Ulam-Crofton technique, consider waists of real and complex projective spaces, flat tori, convex bodies in Euclidean space; and establish waist-type results in terms of the Hausdorff measure.},
  author       = {Akopyan, Arseniy and Hubard, Alfredo and Karasev, Roman},
  journal      = {Topological Methods in Nonlinear Analysis},
  number       = {2},
  pages        = {457--490},
  publisher    = {Akademicka Platforma Czasopism},
  title        = {{Lower and upper bounds for the waists of different spaces}},
  doi          = {10.12775/TMNA.2019.008},
  volume       = {53},
  year         = {2019},
}

@inproceedings{6648,
  abstract     = {Various kinds of data are routinely represented as discrete probability distributions. Examples include text documents summarized by histograms of word occurrences and images represented as histograms of oriented gradients. Viewing a discrete probability distribution as a point in the standard simplex of the appropriate dimension, we can understand collections of such objects in geometric and topological terms. Importantly, instead of using the standard Euclidean distance, we look into dissimilarity measures with information-theoretic justification, and we develop the theory
needed for applying topological data analysis in this setting. In doing so, we emphasize constructions that enable the usage of existing computational topology software in this context.},
  author       = {Edelsbrunner, Herbert and Virk, Ziga and Wagner, Hubert},
  booktitle    = {35th International Symposium on Computational Geometry},
  isbn         = {9783959771047},
  location     = {Portland, OR, United States},
  pages        = {31:1--31:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Topological data analysis in information space}},
  doi          = {10.4230/LIPICS.SOCG.2019.31},
  volume       = {129},
  year         = {2019},
}

@article{6671,
  abstract     = {In this paper we discuss three results. The first two concern general sets of positive reach: we first characterize the reach of a closed set by means of a bound on the metric distortion between the distance measured in the ambient Euclidean space and the shortest path distance measured in the set. Secondly, we prove that the intersection of a ball with radius less than the reach with the set is geodesically convex, meaning that the shortest path between any two points in the intersection lies itself in the intersection. For our third result we focus on manifolds with positive reach and give a bound on the angle between tangent spaces at two different points in terms of the reach and the distance between the two points.},
  author       = {Boissonnat, Jean-Daniel and Lieutier, André and Wintraecken, Mathijs},
  issn         = {2367-1734},
  journal      = {Journal of Applied and Computational Topology},
  number       = {1-2},
  pages        = {29–58},
  publisher    = {Springer Nature},
  title        = {{The reach, metric distortion, geodesic convexity and the variation of tangent spaces}},
  doi          = {10.1007/s41468-019-00029-8},
  volume       = {3},
  year         = {2019},
}

@article{6756,
  abstract     = {We study the topology generated by the temperature fluctuations of the cosmic microwave background (CMB) radiation, as quantified by the number of components and holes, formally given by the Betti numbers, in the growing excursion sets. We compare CMB maps observed by the Planck satellite with a thousand simulated maps generated according to the ΛCDM paradigm with Gaussian distributed fluctuations. The comparison is multi-scale, being performed on a sequence of degraded maps with mean pixel separation ranging from 0.05 to 7.33°. The survey of the CMB over 𝕊2 is incomplete due to obfuscation effects by bright point sources and other extended foreground objects like our own galaxy. To deal with such situations, where analysis in the presence of “masks” is of importance, we introduce the concept of relative homology. The parametric χ2-test shows differences between observations and simulations, yielding p-values at percent to less than permil levels roughly between 2 and 7°, with the difference in the number of components and holes peaking at more than 3σ sporadically at these scales. The highest observed deviation between the observations and simulations for b0 and b1 is approximately between 3σ and 4σ at scales of 3–7°. There are reports of mildly unusual behaviour of the Euler characteristic at 3.66° in the literature, computed from independent measurements of the CMB temperature fluctuations by Planck’s predecessor, the Wilkinson Microwave Anisotropy Probe (WMAP) satellite. The mildly anomalous behaviour of the Euler characteristic is phenomenologically related to the strongly anomalous behaviour of components and holes, or the zeroth and first Betti numbers, respectively. Further, since these topological descriptors show consistent anomalous behaviour over independent measurements of Planck and WMAP, instrumental and systematic errors may be an unlikely source. These are also the scales at which the observed maps exhibit low variance compared to the simulations, and approximately the range of scales at which the power spectrum exhibits a dip with respect to the theoretical model. Non-parametric tests show even stronger differences at almost all scales. Crucially, Gaussian simulations based on power-spectrum matching the characteristics of the observed dipped power spectrum are not able to resolve the anomaly. Understanding the origin of the anomalies in the CMB, whether cosmological in nature or arising due to late-time effects, is an extremely challenging task. Regardless, beyond the trivial possibility that this may still be a manifestation of an extreme Gaussian case, these observations, along with the super-horizon scales involved, may motivate the study of primordial non-Gaussianity. Alternative scenarios worth exploring may be models with non-trivial topology, including topological defect models.},
  author       = {Pranav, Pratyush and Adler, Robert J. and Buchert, Thomas and Edelsbrunner, Herbert and Jones, Bernard J.T. and Schwartzman, Armin and Wagner, Hubert and Van De Weygaert, Rien},
  issn         = {1432-0746},
  journal      = {Astronomy and Astrophysics},
  publisher    = {EDP Sciences},
  title        = {{Unexpected topology of the temperature fluctuations in the cosmic microwave background}},
  doi          = {10.1051/0004-6361/201834916},
  volume       = {627},
  year         = {2019},
}

@article{6793,
  abstract     = {The Regge symmetry is a set of remarkable relations between two tetrahedra whose edge lengths are related in a simple fashion. It was first discovered as a consequence of an asymptotic formula in mathematical physics. Here, we give a simple geometric proof of Regge symmetries in Euclidean, spherical, and hyperbolic geometry.},
  author       = {Akopyan, Arseniy and Izmestiev, Ivan},
  issn         = {1469-2120},
  journal      = {Bulletin of the London Mathematical Society},
  number       = {5},
  pages        = {765--775},
  publisher    = {London Mathematical Society},
  title        = {{The Regge symmetry, confocal conics, and the Schläfli formula}},
  doi          = {10.1112/blms.12276},
  volume       = {51},
  year         = {2019},
}

@article{6828,
  abstract     = {In this paper we construct a family of exact functors from the category of Whittaker modules of the simple complex Lie algebra of type  to the category of finite-dimensional modules of the graded affine Hecke algebra of type . Using results of Backelin [2] and of Arakawa-Suzuki [1], we prove that these functors map standard modules to standard modules (or zero) and simple modules to simple modules (or zero). Moreover, we show that each simple module of the graded affine Hecke algebra appears as the image of a simple Whittaker module. Since the Whittaker category contains the BGG category  as a full subcategory, our results generalize results of Arakawa-Suzuki [1], which in turn generalize Schur-Weyl duality between finite-dimensional representations of  and representations of the symmetric group .},
  author       = {Brown, Adam},
  issn         = {0021-8693},
  journal      = {Journal of Algebra},
  pages        = {261--289},
  publisher    = {Elsevier},
  title        = {{Arakawa-Suzuki functors for Whittaker modules}},
  doi          = {10.1016/j.jalgebra.2019.07.027},
  volume       = {538},
  year         = {2019},
}

