@article{87, abstract = {Using the geodesic distance on the n-dimensional sphere, we study the expected radius function of the Delaunay mosaic of a random set of points. Specifically, we consider the partition of the mosaic into intervals of the radius function and determine the expected number of intervals whose radii are less than or equal to a given threshold. We find that the expectations are essentially the same as for the Poisson–Delaunay mosaic in n-dimensional Euclidean space. Assuming the points are not contained in a hemisphere, the Delaunay mosaic is isomorphic to the boundary complex of the convex hull in Rn+1, so we also get the expected number of faces of a random inscribed polytope. As proved in Antonelli et al. [Adv. in Appl. Probab. 9–12 (1977–1980)], an orthant section of the n-sphere is isometric to the standard n-simplex equipped with the Fisher information metric. It follows that the latter space has similar stochastic properties as the n-dimensional Euclidean space. Our results are therefore relevant in information geometry and in population genetics.}, author = {Edelsbrunner, Herbert and Nikitenko, Anton}, journal = {Annals of Applied Probability}, number = {5}, pages = {3215 -- 3238}, publisher = {Institute of Mathematical Statistics}, title = {{Random inscribed polytopes have similar radius functions as Poisson-Delaunay mosaics}}, doi = {10.1214/18-AAP1389}, volume = {28}, year = {2018}, } @article{6355, abstract = {We prove that any cyclic quadrilateral can be inscribed in any closed convex C1-curve. The smoothness condition is not required if the quadrilateral is a rectangle.}, author = {Akopyan, Arseniy and Avvakumov, Sergey}, issn = {2050-5094}, journal = {Forum of Mathematics, Sigma}, publisher = {Cambridge University Press}, title = {{Any cyclic quadrilateral can be inscribed in any closed convex smooth curve}}, doi = {10.1017/fms.2018.7}, volume = {6}, year = {2018}, } @article{1064, abstract = {In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets.}, author = {Akopyan, Arseniy and Balitskiy, Alexey and Grigorev, Mikhail}, issn = {14320444}, journal = {Discrete & Computational Geometry}, number = {4}, pages = {1001--1009}, publisher = {Springer}, title = {{On the circle covering theorem by A.W. Goodman and R.E. Goodman}}, doi = {10.1007/s00454-017-9883-x}, volume = {59}, year = {2018}, } @unpublished{75, abstract = {We prove that any convex body in the plane can be partitioned into m convex parts of equal areas and perimeters for any integer m≥2; this result was previously known for prime powers m=pk. We also give a higher-dimensional generalization.}, author = {Akopyan, Arseniy and Avvakumov, Sergey and Karasev, Roman}, publisher = {arXiv}, title = {{Convex fair partitions into arbitrary number of pieces}}, doi = {10.48550/arXiv.1804.03057}, year = {2018}, } @article{481, abstract = {We introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist. Using our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings.}, author = {Biedl, Therese and Huber, Stefan and Palfrader, Peter}, journal = {International Journal of Computational Geometry and Applications}, number = {3-4}, pages = {211 -- 229}, publisher = {World Scientific Publishing}, title = {{Planar matchings for weighted straight skeletons}}, doi = {10.1142/S0218195916600050}, volume = {26}, year = {2017}, } @article{521, abstract = {Let X and Y be proper metric spaces. We show that a coarsely n-to-1 map f:X→Y induces an n-to-1 map of Higson coronas. This viewpoint turns out to be successful in showing that the classical dimension raising theorems hold in large scale; that is, if f:X→Y is a coarsely n-to-1 map between proper metric spaces X and Y then asdim(Y)≤asdim(X)+n−1. Furthermore we introduce coarsely open coarsely n-to-1 maps, which include the natural quotient maps via a finite group action, and prove that they preserve the asymptotic dimension.}, author = {Austin, Kyle and Virk, Ziga}, issn = {01668641}, journal = {Topology and its Applications}, pages = {45 -- 57}, publisher = {Elsevier}, title = {{Higson compactification and dimension raising}}, doi = {10.1016/j.topol.2016.10.005}, volume = {215}, year = {2017}, } @article{568, abstract = {We study robust properties of zero sets of continuous maps f: X → ℝn. Formally, we analyze the family Z< r(f) := (g-1(0): ||g - f|| < r) of all zero sets of all continuous maps g closer to f than r in the max-norm. All of these sets are outside A := (x: |f(x)| ≥ r) and we claim that Z< r(f) is fully determined by A and an element of a certain cohomotopy group which (by a recent result) is computable whenever the dimension of X is at most 2n - 3. By considering all r > 0 simultaneously, the pointed cohomotopy groups form a persistence module-a structure leading to persistence diagrams as in the case of persistent homology or well groups. Eventually, we get a descriptor of persistent robust properties of zero sets that has better descriptive power (Theorem A) and better computability status (Theorem B) than the established well diagrams. Moreover, if we endow every point of each zero set with gradients of the perturbation, the robust description of the zero sets by elements of cohomotopy groups is in some sense the best possible (Theorem C).}, author = {Franek, Peter and Krcál, Marek}, issn = {15320073}, journal = {Homology, Homotopy and Applications}, number = {2}, pages = {313 -- 342}, publisher = {International Press}, title = {{Persistence of zero sets}}, doi = {10.4310/HHA.2017.v19.n2.a16}, volume = {19}, year = {2017}, } @inbook{5803, abstract = {Different distance metrics produce Voronoi diagrams with different properties. It is a well-known that on the (real) 2D plane or even on any 3D plane, a Voronoi diagram (VD) based on the Euclidean distance metric produces convex Voronoi regions. In this paper, we first show that this metric produces a persistent VD on the 2D digital plane, as it comprises digitally convex Voronoi regions and hence correctly approximates the corresponding VD on the 2D real plane. Next, we show that on a 3D digital plane D, the Euclidean metric spanning over its voxel set does not guarantee a digital VD which is persistent with the real-space VD. As a solution, we introduce a novel concept of functional-plane-convexity, which is ensured by the Euclidean metric spanning over the pedal set of D. Necessary proofs and some visual result have been provided to adjudge the merit and usefulness of the proposed concept.}, author = {Biswas, Ranita and Bhowmick, Partha}, booktitle = {Combinatorial image analysis}, isbn = {978-3-319-59107-0}, issn = {0302-9743}, location = {Plovdiv, Bulgaria}, pages = {93--104}, publisher = {Springer Nature}, title = {{Construction of persistent Voronoi diagram on 3D digital plane}}, doi = {10.1007/978-3-319-59108-7_8}, volume = {10256}, year = {2017}, } @inproceedings{688, abstract = {We show that the framework of topological data analysis can be extended from metrics to general Bregman divergences, widening the scope of possible applications. Examples are the Kullback - Leibler divergence, which is commonly used for comparing text and images, and the Itakura - Saito divergence, popular for speech and sound. In particular, we prove that appropriately generalized čech and Delaunay (alpha) complexes capture the correct homotopy type, namely that of the corresponding union of Bregman balls. Consequently, their filtrations give the correct persistence diagram, namely the one generated by the uniformly growing Bregman balls. Moreover, we show that unlike the metric setting, the filtration of Vietoris-Rips complexes may fail to approximate the persistence diagram. We propose algorithms to compute the thus generalized čech, Vietoris-Rips and Delaunay complexes and experimentally test their efficiency. Lastly, we explain their surprisingly good performance by making a connection with discrete Morse theory. }, author = {Edelsbrunner, Herbert and Wagner, Hubert}, issn = {18688969}, location = {Brisbane, Australia}, pages = {391--3916}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Topological data analysis with Bregman divergences}}, doi = {10.4230/LIPIcs.SoCG.2017.39}, volume = {77}, year = {2017}, } @article{707, abstract = {We answer a question of M. Gromov on the waist of the unit ball.}, author = {Akopyan, Arseniy and Karasev, Roman}, issn = {00246093}, journal = {Bulletin of the London Mathematical Society}, number = {4}, pages = {690 -- 693}, publisher = {Wiley-Blackwell}, title = {{A tight estimate for the waist of the ball }}, doi = {10.1112/blms.12062}, volume = {49}, year = {2017}, } @article{718, abstract = {Mapping every simplex in the Delaunay mosaic of a discrete point set to the radius of the smallest empty circumsphere gives a generalized discrete Morse function. Choosing the points from a Poisson point process in ℝ n , we study the expected number of simplices in the Delaunay mosaic as well as the expected number of critical simplices and nonsingular intervals in the corresponding generalized discrete gradient. Observing connections with other probabilistic models, we obtain precise expressions for the expected numbers in low dimensions. In particular, we obtain the expected numbers of simplices in the Poisson–Delaunay mosaic in dimensions n ≤ 4.}, author = {Edelsbrunner, Herbert and Nikitenko, Anton and Reitzner, Matthias}, issn = {00018678}, journal = {Advances in Applied Probability}, number = {3}, pages = {745 -- 767}, publisher = {Cambridge University Press}, title = {{Expected sizes of poisson Delaunay mosaics and their discrete Morse functions}}, doi = {10.1017/apr.2017.20}, volume = {49}, year = {2017}, } @phdthesis{6287, abstract = {The main objects considered in the present work are simplicial and CW-complexes with vertices forming a random point cloud. In particular, we consider a Poisson point process in R^n and study Delaunay and Voronoi complexes of the first and higher orders and weighted Delaunay complexes obtained as sections of Delaunay complexes, as well as the Čech complex. Further, we examine theDelaunay complex of a Poisson point process on the sphere S^n, as well as of a uniform point cloud, which is equivalent to the convex hull, providing a connection to the theory of random polytopes. Each of the complexes in question can be endowed with a radius function, which maps its cells to the radii of appropriately chosen circumspheres, called the radius of the cell. Applying and developing discrete Morse theory for these functions, joining it together with probabilistic and sometimes analytic machinery, and developing several integral geometric tools, we aim at getting the distributions of circumradii of typical cells. For all considered complexes, we are able to generalize and obtain up to constants the distribution of radii of typical intervals of all types. In low dimensions the constants can be computed explicitly, thus providing the explicit expressions for the expected numbers of cells. In particular, it allows to find the expected density of simplices of every dimension for a Poisson point process in R^4, whereas the result for R^3 was known already in 1970's.}, author = {Nikitenko, Anton}, issn = {2663-337X}, pages = {86}, publisher = {Institute of Science and Technology Austria}, title = {{Discrete Morse theory for random complexes }}, doi = {10.15479/AT:ISTA:th_873}, year = {2017}, } @article{1433, abstract = {Phat is an open-source C. ++ library for the computation of persistent homology by matrix reduction, targeted towards developers of software for topological data analysis. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. We provide numerous different reduction strategies as well as data types to store and manipulate the boundary matrix. We compare the different combinations through extensive experimental evaluation and identify optimization techniques that work well in practical situations. We also compare our software with various other publicly available libraries for persistent homology.}, author = {Bauer, Ulrich and Kerber, Michael and Reininghaus, Jan and Wagner, Hubert}, issn = { 07477171}, journal = {Journal of Symbolic Computation}, pages = {76 -- 90}, publisher = {Academic Press}, title = {{Phat - Persistent homology algorithms toolbox}}, doi = {10.1016/j.jsc.2016.03.008}, volume = {78}, year = {2017}, } @article{1180, abstract = {In this article we define an algebraic vertex of a generalized polyhedron and show that the set of algebraic vertices is the smallest set of points needed to define the polyhedron. We prove that the indicator function of a generalized polytope P is a linear combination of indicator functions of simplices whose vertices are algebraic vertices of P. We also show that the indicator function of any generalized polyhedron is a linear combination, with integer coefficients, of indicator functions of cones with apices at algebraic vertices and line-cones. The concept of an algebraic vertex is closely related to the Fourier–Laplace transform. We show that a point v is an algebraic vertex of a generalized polyhedron P if and only if the tangent cone of P, at v, has non-zero Fourier–Laplace transform.}, author = {Akopyan, Arseniy and Bárány, Imre and Robins, Sinai}, issn = {00018708}, journal = {Advances in Mathematics}, pages = {627 -- 644}, publisher = {Academic Press}, title = {{Algebraic vertices of non-convex polyhedra}}, doi = {10.1016/j.aim.2016.12.026}, volume = {308}, year = {2017}, } @article{1173, abstract = {We introduce the Voronoi functional of a triangulation of a finite set of points in the Euclidean plane and prove that among all geometric triangulations of the point set, the Delaunay triangulation maximizes the functional. This result neither extends to topological triangulations in the plane nor to geometric triangulations in three and higher dimensions.}, author = {Edelsbrunner, Herbert and Glazyrin, Alexey and Musin, Oleg and Nikitenko, Anton}, issn = {02099683}, journal = {Combinatorica}, number = {5}, pages = {887 -- 910}, publisher = {Springer}, title = {{The Voronoi functional is maximized by the Delaunay triangulation in the plane}}, doi = {10.1007/s00493-016-3308-y}, volume = {37}, year = {2017}, } @article{1072, abstract = {Given a finite set of points in Rn and a radius parameter, we study the Čech, Delaunay–Čech, Delaunay (or alpha), and Wrap complexes in the light of generalized discrete Morse theory. Establishing the Čech and Delaunay complexes as sublevel sets of generalized discrete Morse functions, we prove that the four complexes are simple-homotopy equivalent by a sequence of simplicial collapses, which are explicitly described by a single discrete gradient field.}, author = {Bauer, Ulrich and Edelsbrunner, Herbert}, journal = {Transactions of the American Mathematical Society}, number = {5}, pages = {3741 -- 3762}, publisher = {American Mathematical Society}, title = {{The Morse theory of Čech and delaunay complexes}}, doi = {10.1090/tran/6991}, volume = {369}, year = {2017}, } @article{1065, abstract = {We consider the problem of reachability in pushdown graphs. We study the problem for pushdown graphs with constant treewidth. Even for pushdown graphs with treewidth 1, for the reachability problem we establish the following: (i) the problem is PTIME-complete, and (ii) any subcubic algorithm for the problem would contradict the k-clique conjecture and imply faster combinatorial algorithms for cliques in graphs.}, author = {Chatterjee, Krishnendu and Osang, Georg F}, issn = {00200190}, journal = {Information Processing Letters}, pages = {25 -- 29}, publisher = {Elsevier}, title = {{Pushdown reachability with constant treewidth}}, doi = {10.1016/j.ipl.2017.02.003}, volume = {122}, year = {2017}, } @article{1022, abstract = {We introduce a multiscale topological description of the Megaparsec web-like cosmic matter distribution. Betti numbers and topological persistence offer a powerful means of describing the rich connectivity structure of the cosmic web and of its multiscale arrangement of matter and galaxies. Emanating from algebraic topology and Morse theory, Betti numbers and persistence diagrams represent an extension and deepening of the cosmologically familiar topological genus measure and the related geometric Minkowski functionals. In addition to a description of the mathematical background, this study presents the computational procedure for computing Betti numbers and persistence diagrams for density field filtrations. The field may be computed starting from a discrete spatial distribution of galaxies or simulation particles. The main emphasis of this study concerns an extensive and systematic exploration of the imprint of different web-like morphologies and different levels of multiscale clustering in the corresponding computed Betti numbers and persistence diagrams. To this end, we use Voronoi clustering models as templates for a rich variety of web-like configurations and the fractal-like Soneira-Peebles models exemplify a range of multiscale configurations. We have identified the clear imprint of cluster nodes, filaments, walls, and voids in persistence diagrams, along with that of the nested hierarchy of structures in multiscale point distributions. We conclude by outlining the potential of persistent topology for understanding the connectivity structure of the cosmic web, in large simulations of cosmic structure formation and in the challenging context of the observed galaxy distribution in large galaxy surveys.}, author = {Pranav, Pratyush and Edelsbrunner, Herbert and Van De Weygaert, Rien and Vegter, Gert and Kerber, Michael and Jones, Bernard and Wintraecken, Mathijs}, issn = {00358711}, journal = {Monthly Notices of the Royal Astronomical Society}, number = {4}, pages = {4281 -- 4310}, publisher = {Oxford University Press}, title = {{The topology of the cosmic web in terms of persistent Betti numbers}}, doi = {10.1093/mnras/stw2862}, volume = {465}, year = {2017}, } @article{737, abstract = {We generalize Brazas’ topology on the fundamental group to the whole universal path space X˜ i.e., to the set of homotopy classes of all based paths. We develop basic properties of the new notion and provide a complete comparison of the obtained topology with the established topologies, in particular with the Lasso topology and the CO topology, i.e., the topology that is induced by the compact-open topology. It turns out that the new topology is the finest topology contained in the CO topology, for which the action of the fundamental group on the universal path space is a continuous group action.}, author = {Virk, Ziga and Zastrow, Andreas}, issn = {01668641}, journal = {Topology and its Applications}, pages = {186 -- 196}, publisher = {Elsevier}, title = {{A new topology on the universal path space}}, doi = {10.1016/j.topol.2017.09.015}, volume = {231}, year = {2017}, } @inproceedings{836, abstract = {Recent research has examined how to study the topological features of a continuous self-map by means of the persistence of the eigenspaces, for given eigenvalues, of the endomorphism induced in homology over a field. This raised the question of how to select dynamically significant eigenvalues. The present paper aims to answer this question, giving an algorithm that computes the persistence of eigenspaces for every eigenvalue simultaneously, also expressing said eigenspaces as direct sums of “finite” and “singular” subspaces.}, author = {Ethier, Marc and Jablonski, Grzegorz and Mrozek, Marian}, booktitle = {Special Sessions in Applications of Computer Algebra}, isbn = {978-331956930-7}, location = {Kalamata, Greece}, pages = {119 -- 136}, publisher = {Springer}, title = {{Finding eigenvalues of self-maps with the Kronecker canonical form}}, doi = {10.1007/978-3-319-56932-1_8}, volume = {198}, year = {2017}, } @inproceedings{833, abstract = {We present an efficient algorithm to compute Euler characteristic curves of gray scale images of arbitrary dimension. In various applications the Euler characteristic curve is used as a descriptor of an image. Our algorithm is the first streaming algorithm for Euler characteristic curves. The usage of streaming removes the necessity to store the entire image in RAM. Experiments show that our implementation handles terabyte scale images on commodity hardware. Due to lock-free parallelism, it scales well with the number of processor cores. Additionally, we put the concept of the Euler characteristic curve in the wider context of computational topology. In particular, we explain the connection with persistence diagrams.}, author = {Heiss, Teresa and Wagner, Hubert}, editor = {Felsberg, Michael and Heyden, Anders and Krüger, Norbert}, issn = {03029743}, location = {Ystad, Sweden}, pages = {397 -- 409}, publisher = {Springer}, title = {{Streaming algorithm for Euler characteristic curves of multidimensional images}}, doi = {10.1007/978-3-319-64689-3_32}, volume = {10424}, year = {2017}, } @inbook{84, abstract = {The advent of high-throughput technologies and the concurrent advances in information sciences have led to a data revolution in biology. This revolution is most significant in molecular biology, with an increase in the number and scale of the “omics” projects over the last decade. Genomics projects, for example, have produced impressive advances in our knowledge of the information concealed into genomes, from the many genes that encode for the proteins that are responsible for most if not all cellular functions, to the noncoding regions that are now known to provide regulatory functions. Proteomics initiatives help to decipher the role of post-translation modifications on the protein structures and provide maps of protein-protein interactions, while functional genomics is the field that attempts to make use of the data produced by these projects to understand protein functions. The biggest challenge today is to assimilate the wealth of information provided by these initiatives into a conceptual framework that will help us decipher life. For example, the current views of the relationship between protein structure and function remain fragmented. We know of their sequences, more and more about their structures, we have information on their biological activities, but we have difficulties connecting this dotted line into an informed whole. We lack the experimental and computational tools for directly studying protein structure, function, and dynamics at the molecular and supra-molecular levels. In this chapter, we review some of the current developments in building the computational tools that are needed, focusing on the role that geometry and topology play in these efforts. One of our goals is to raise the general awareness about the importance of geometric methods in elucidating the mysterious foundations of our very existence. Another goal is the broadening of what we consider a geometric algorithm. There is plenty of valuable no-man’s-land between combinatorial and numerical algorithms, and it seems opportune to explore this land with a computational-geometric frame of mind.}, author = {Edelsbrunner, Herbert and Koehl, Patrice}, booktitle = {Handbook of Discrete and Computational Geometry, Third Edition}, editor = {Toth, Csaba and O'Rourke, Joseph and Goodman, Jacob}, pages = {1709 -- 1735}, publisher = {Taylor & Francis}, title = {{Computational topology for structural molecular biology}}, doi = {10.1201/9781315119601}, year = {2017}, } @article{909, abstract = {We study the lengths of curves passing through a fixed number of points on the boundary of a convex shape in the plane. We show that, for any convex shape K, there exist four points on the boundary of K such that the length of any curve passing through these points is at least half of the perimeter of K. It is also shown that the same statement does not remain valid with the additional constraint that the points are extreme points of K. Moreover, the factor &#xbd; cannot be achieved with any fixed number of extreme points. We conclude the paper with a few other inequalities related to the perimeter of a convex shape.}, author = {Akopyan, Arseniy and Vysotsky, Vladislav}, issn = {00029890}, journal = {The American Mathematical Monthly}, number = {7}, pages = {588 -- 596}, publisher = {Mathematical Association of America}, title = {{On the lengths of curves passing through boundary points of a planar convex shape}}, doi = {10.4169/amer.math.monthly.124.7.588}, volume = {124}, year = {2017}, } @article{1149, abstract = {We study the usefulness of two most prominent publicly available rigorous ODE integrators: one provided by the CAPD group (capd.ii.uj.edu.pl), the other based on the COSY Infinity project (cosyinfinity.org). Both integrators are capable of handling entire sets of initial conditions and provide tight rigorous outer enclosures of the images under a time-T map. We conduct extensive benchmark computations using the well-known Lorenz system, and compare the computation time against the final accuracy achieved. We also discuss the effect of a few technical parameters, such as the order of the numerical integration method, the value of T, and the phase space resolution. We conclude that COSY may provide more precise results due to its ability of avoiding the variable dependency problem. However, the overall cost of computations conducted using CAPD is typically lower, especially when intervals of parameters are involved. Moreover, access to COSY is limited (registration required) and the rigorous ODE integrators are not publicly available, while CAPD is an open source free software project. Therefore, we recommend the latter integrator for this kind of computations. Nevertheless, proper choice of the various integration parameters turns out to be of even greater importance than the choice of the integrator itself. © 2016 IMACS. Published by Elsevier B.V. All rights reserved.}, author = {Miyaji, Tomoyuki and Pilarczyk, Pawel and Gameiro, Marcio and Kokubu, Hiroshi and Mischaikow, Konstantin}, journal = {Applied Numerical Mathematics}, pages = {34 -- 47}, publisher = {Elsevier}, title = {{A study of rigorous ODE integrators for multi scale set oriented computations}}, doi = {10.1016/j.apnum.2016.04.005}, volume = {107}, year = {2016}, } @article{1216, abstract = {A framework fo r extracting features in 2D transient flows, based on the acceleration field to ensure Galilean invariance is proposed in this paper. The minima of the acceleration magnitude (a superset of acceleration zeros) are extracted and discriminated into vortices and saddle points, based on the spectral properties of the velocity Jacobian. The extraction of topological features is performed with purely combinatorial algorithms from discrete computational topology. The feature points are prioritized with persistence, as a physically meaningful importance measure. These feature points are tracked in time with a robust algorithm for tracking features. Thus, a space-time hierarchy of the minima is built and vortex merging events are detected. We apply the acceleration feature extraction strategy to three two-dimensional shear flows: (1) an incompressible periodic cylinder wake, (2) an incompressible planar mixing layer and (3) a weakly compressible planar jet. The vortex-like acceleration feature points are shown to be well aligned with acceleration zeros, maxima of the vorticity magnitude, minima of the pressure field and minima of λ2.}, author = {Kasten, Jens and Reininghaus, Jan and Hotz, Ingrid and Hege, Hans and Noack, Bernd and Daviller, Guillaume and Morzyński, Marek}, journal = {Archives of Mechanics}, number = {1}, pages = {55 -- 80}, publisher = {Polish Academy of Sciences Publishing House}, title = {{Acceleration feature points of unsteady shear flows}}, volume = {68}, year = {2016}, } @article{1222, abstract = {We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason—the problem of “super resolution of images.” We have found optimal arrangements for N=6, 7 and 8 circles. Surprisingly, for the case N=7 there are three different optimal arrangements. Our proof is based on a computer enumeration of toroidal irreducible contact graphs.}, author = {Musin, Oleg and Nikitenko, Anton}, journal = {Discrete & Computational Geometry}, number = {1}, pages = {1 -- 20}, publisher = {Springer}, title = {{Optimal packings of congruent circles on a square flat torus}}, doi = {10.1007/s00454-015-9742-6}, volume = {55}, year = {2016}, } @inproceedings{1237, abstract = {Bitmap images of arbitrary dimension may be formally perceived as unions of m-dimensional boxes aligned with respect to a rectangular grid in ℝm. Cohomology and homology groups are well known topological invariants of such sets. Cohomological operations, such as the cup product, provide higher-order algebraic topological invariants, especially important for digital images of dimension higher than 3. If such an operation is determined at the level of simplicial chains [see e.g. González-Díaz, Real, Homology, Homotopy Appl, 2003, 83-93], then it is effectively computable. However, decomposing a cubical complex into a simplicial one deleteriously affects the efficiency of such an approach. In order to avoid this overhead, a direct cubical approach was applied in [Pilarczyk, Real, Adv. Comput. Math., 2015, 253-275] for the cup product in cohomology, and implemented in the ChainCon software package [http://www.pawelpilarczyk.com/chaincon/]. We establish a formula for the Steenrod square operations [see Steenrod, Annals of Mathematics. Second Series, 1947, 290-320] directly at the level of cubical chains, and we prove the correctness of this formula. An implementation of this formula is programmed in C++ within the ChainCon software framework. We provide a few examples and discuss the effectiveness of this approach. One specific application follows from the fact that Steenrod squares yield tests for the topological extension problem: Can a given map A → Sd to a sphere Sd be extended to a given super-complex X of A? In particular, the ROB-SAT problem, which is to decide for a given function f: X → ℝm and a value r > 0 whether every g: X → ℝm with ∥g - f ∥∞ ≤ r has a root, reduces to the extension problem.}, author = {Krcál, Marek and Pilarczyk, Pawel}, location = {Marseille, France}, pages = {140 -- 151}, publisher = {Springer}, title = {{Computation of cubical Steenrod squares}}, doi = {10.1007/978-3-319-39441-1_13}, volume = {9667}, year = {2016}, } @article{1252, abstract = {We study the homomorphism induced in homology by a closed correspondence between topological spaces, using projections from the graph of the correspondence to its domain and codomain. We provide assumptions under which the homomorphism induced by an outer approximation of a continuous map coincides with the homomorphism induced in homology by the map. In contrast to more classical results we do not require that the projection to the domain have acyclic preimages. Moreover, we show that it is possible to retrieve correct homological information from a correspondence even if some data is missing or perturbed. Finally, we describe an application to combinatorial maps that are either outer approximations of continuous maps or reconstructions of such maps from a finite set of data points.}, author = {Harker, Shaun and Kokubu, Hiroshi and Mischaikow, Konstantin and Pilarczyk, Pawel}, issn = {1088-6826}, journal = {Proceedings of the American Mathematical Society}, number = {4}, pages = {1787 -- 1801}, publisher = {American Mathematical Society}, title = {{Inducing a map on homology from a correspondence}}, doi = {10.1090/proc/12812}, volume = {144}, year = {2016}, } @article{1254, abstract = {We use rigorous numerical techniques to compute a lower bound for the exponent of expansivity outside a neighborhood of the critical point for thousands of intervals of parameter values in the quadratic family. We first compute a radius of the critical neighborhood outside which the map is uniformly expanding. This radius is taken as small as possible, yet large enough for our numerical procedure to succeed in proving that the expansivity exponent outside this neighborhood is positive. Then, for each of the intervals, we compute a lower bound for this expansivity exponent, valid for all the parameters in that interval. We illustrate and study the distribution of the radii and the expansivity exponents. The results of our computations are mathematically rigorous. The source code of the software and the results of the computations are made publicly available at http://www.pawelpilarczyk.com/quadratic/.}, author = {Golmakani, Ali and Luzzatto, Stefano and Pilarczyk, Pawel}, journal = {Experimental Mathematics}, number = {2}, pages = {116 -- 124}, publisher = {Taylor and Francis}, title = {{Uniform expansivity outside a critical neighborhood in the quadratic family}}, doi = {10.1080/10586458.2015.1048011}, volume = {25}, year = {2016}, } @article{1272, abstract = {We study different means to extend offsetting based on skeletal structures beyond the well-known constant-radius and mitered offsets supported by Voronoi diagrams and straight skeletons, for which the orthogonal distance of offset elements to their respective input elements is constant and uniform over all input elements. Our main contribution is a new geometric structure, called variable-radius Voronoi diagram, which supports the computation of variable-radius offsets, i.e., offsets whose distance to the input is allowed to vary along the input. We discuss properties of this structure and sketch a prototype implementation that supports the computation of variable-radius offsets based on this new variant of Voronoi diagrams.}, author = {Held, Martin and Huber, Stefan and Palfrader, Peter}, journal = {Computer-Aided Design and Applications}, number = {5}, pages = {712 -- 721}, publisher = {Taylor and Francis}, title = {{Generalized offsetting of planar structures using skeletons}}, doi = {10.1080/16864360.2016.1150718}, volume = {13}, year = {2016}, } @article{1295, abstract = {Voronoi diagrams and Delaunay triangulations have been extensively used to represent and compute geometric features of point configurations. We introduce a generalization to poset diagrams and poset complexes, which contain order-k and degree-k Voronoi diagrams and their duals as special cases. Extending a result of Aurenhammer from 1990, we show how to construct poset diagrams as weighted Voronoi diagrams of average balls.}, author = {Edelsbrunner, Herbert and Iglesias Ham, Mabel}, journal = {Electronic Notes in Discrete Mathematics}, pages = {169 -- 174}, publisher = {Elsevier}, title = {{Multiple covers with balls II: Weighted averages}}, doi = {10.1016/j.endm.2016.09.030}, volume = {54}, year = {2016}, } @article{1292, abstract = {We give explicit formulas and algorithms for the computation of the Thurston–Bennequin invariant of a nullhomologous Legendrian knot on a page of a contact open book and on Heegaard surfaces in convex position. Furthermore, we extend the results to rationally nullhomologous knots in arbitrary 3-manifolds.}, author = {Durst, Sebastian and Kegel, Marc and Klukas, Mirko D}, journal = {Acta Mathematica Hungarica}, number = {2}, pages = {441 -- 455}, publisher = {Springer}, title = {{Computing the Thurston–Bennequin invariant in open books}}, doi = {10.1007/s10474-016-0648-4}, volume = {150}, year = {2016}, } @article{1330, abstract = {In this paper we investigate the existence of closed billiard trajectories in not necessarily smooth convex bodies. In particular, we show that if a body K ⊂ Rd has the property that the tangent cone of every non-smooth point q ∉ ∂K is acute (in a certain sense), then there is a closed billiard trajectory in K.}, author = {Akopyan, Arseniy and Balitskiy, Alexey}, journal = {Israel Journal of Mathematics}, number = {2}, pages = {833 -- 845}, publisher = {Springer}, title = {{Billiards in convex bodies with acute angles}}, doi = {10.1007/s11856-016-1429-z}, volume = {216}, year = {2016}, } @article{1360, abstract = {We apply the technique of Károly Bezdek and Daniel Bezdek to study billiard trajectories in convex bodies, when the length is measured with a (possibly asymmetric) norm. We prove a lower bound for the length of the shortest closed billiard trajectory, related to the non-symmetric Mahler problem. With this technique we are able to give short and elementary proofs to some known results. }, author = {Akopyan, Arseniy and Balitskiy, Alexey and Karasev, Roman and Sharipova, Anastasia}, journal = {Proceedings of the American Mathematical Society}, number = {10}, pages = {4501 -- 4513}, publisher = {American Mathematical Society}, title = {{Elementary approach to closed billiard trajectories in asymmetric normed spaces}}, doi = {10.1090/proc/13062}, volume = {144}, year = {2016}, } @article{1408, abstract = {The concept of well group in a special but important case captures homological properties of the zero set of a continuous map (Formula presented.) on a compact space K that are invariant with respect to perturbations of f. The perturbations are arbitrary continuous maps within (Formula presented.) distance r from f for a given (Formula presented.). The main drawback of the approach is that the computability of well groups was shown only when (Formula presented.) or (Formula presented.). Our contribution to the theory of well groups is twofold: on the one hand we improve on the computability issue, but on the other hand we present a range of examples where the well groups are incomplete invariants, that is, fail to capture certain important robust properties of the zero set. For the first part, we identify a computable subgroup of the well group that is obtained by cap product with the pullback of the orientation of (Formula presented.) by f. In other words, well groups can be algorithmically approximated from below. When f is smooth and (Formula presented.), our approximation of the (Formula presented.)th well group is exact. For the second part, we find examples of maps (Formula presented.) with all well groups isomorphic but whose perturbations have different zero sets. We discuss on a possible replacement of the well groups of vector valued maps by an invariant of a better descriptive power and computability status.}, author = {Franek, Peter and Krcál, Marek}, journal = {Discrete & Computational Geometry}, number = {1}, pages = {126 -- 164}, publisher = {Springer}, title = {{On computability and triviality of well groups}}, doi = {10.1007/s00454-016-9794-2}, volume = {56}, year = {2016}, } @article{1289, abstract = {Aiming at the automatic diagnosis of tumors using narrow band imaging (NBI) magnifying endoscopic (ME) images of the stomach, we combine methods from image processing, topology, geometry, and machine learning to classify patterns into three classes: oval, tubular and irregular. Training the algorithm on a small number of images of each type, we achieve a high rate of correct classifications. The analysis of the learning algorithm reveals that a handful of geometric and topological features are responsible for the overwhelming majority of decisions.}, author = {Dunaeva, Olga and Edelsbrunner, Herbert and Lukyanov, Anton and Machin, Michael and Malkova, Daria and Kuvaev, Roman and Kashin, Sergey}, journal = {Pattern Recognition Letters}, number = {1}, pages = {13 -- 22}, publisher = {Elsevier}, title = {{The classification of endoscopy images with persistent homology}}, doi = {10.1016/j.patrec.2015.12.012}, volume = {83}, year = {2016}, } @article{1617, abstract = {We study the discrepancy of jittered sampling sets: such a set P⊂ [0,1]d is generated for fixed m∈ℕ by partitioning [0,1]d into md axis aligned cubes of equal measure and placing a random point inside each of the N=md cubes. We prove that, for N sufficiently large, 1/10 d/N1/2+1/2d ≤EDN∗(P)≤ √d(log N) 1/2/N1/2+1/2d, where the upper bound with an unspecified constant Cd was proven earlier by Beck. Our proof makes crucial use of the sharp Dvoretzky-Kiefer-Wolfowitz inequality and a suitably taylored Bernstein inequality; we have reasons to believe that the upper bound has the sharp scaling in N. Additional heuristics suggest that jittered sampling should be able to improve known bounds on the inverse of the star-discrepancy in the regime N≳dd. We also prove a partition principle showing that every partition of [0,1]d combined with a jittered sampling construction gives rise to a set whose expected squared L2-discrepancy is smaller than that of purely random points.}, author = {Pausinger, Florian and Steinerberger, Stefan}, journal = {Journal of Complexity}, pages = {199 -- 216}, publisher = {Academic Press}, title = {{On the discrepancy of jittered sampling}}, doi = {10.1016/j.jco.2015.11.003}, volume = {33}, year = {2016}, } @inproceedings{5806, abstract = {Although the concept of functional plane for naive plane is studied and reported in the literature in great detail, no similar study is yet found for naive sphere. This article exposes the first study in this line, opening up further prospects of analyzing the topological properties of sphere in the discrete space. We show that each quadraginta octant Q of a naive sphere forms a bijection with its projected pixel set on a unique coordinate plane, which thereby serves as the functional plane of Q, and hence gives rise to merely mono-jumps during back projection. The other two coordinate planes serve as para-functional and dia-functional planes for Q, as the former is ‘mono-jumping’ but not bijective, whereas the latter holds neither of the two. Owing to this, the quadraginta octants form symmetry groups and subgroups with equivalent jump conditions. We also show a potential application in generating a special class of discrete 3D circles based on back projection and jump bridging by Steiner voxels. A circle in this class possesses 4-symmetry, uniqueness, and bounded distance from the underlying real sphere and real plane.}, author = {Biswas, Ranita and Bhowmick, Partha}, booktitle = {Discrete Geometry for Computer Imagery}, isbn = {978-3-319-32359-6}, issn = {0302-9743}, location = {Nantes, France}, pages = {256--267}, publisher = {Springer Nature}, title = {{On functionality of quadraginta octants of naive sphere with application to circle drawing}}, doi = {10.1007/978-3-319-32360-2_20}, volume = {9647}, year = {2016}, } @inbook{5805, abstract = {Discretization of sphere in the integer space follows a particular discretization scheme, which, in principle, conforms to some topological model. This eventually gives rise to interesting topological properties of a discrete spherical surface, which need to be investigated for its analytical characterization. This paper presents some novel results on the local topological properties of the naive model of discrete sphere. They follow from the bijection of each quadraginta octant of naive sphere with its projection map called f -map on the corresponding functional plane and from the characterization of certain jumps in the f-map. As an application, we have shown how these properties can be used in designing an efficient reconstruction algorithm for a naive spherical surface from an input voxel set when it is sparse or noisy.}, author = {Sen, Nabhasmita and Biswas, Ranita and Bhowmick, Partha}, booktitle = {Computational Topology in Image Context}, isbn = {978-3-319-39440-4}, issn = {1611-3349}, location = {Marseille, France}, pages = {253--264}, publisher = {Springer Nature}, title = {{On some local topological properties of naive discrete sphere}}, doi = {10.1007/978-3-319-39441-1_23}, volume = {9667}, year = {2016}, } @inbook{5809, abstract = {A discrete spherical circle is a topologically well-connected 3D circle in the integer space, which belongs to a discrete sphere as well as a discrete plane. It is one of the most important 3D geometric primitives, but has not possibly yet been studied up to its merit. This paper is a maiden exposition of some of its elementary properties, which indicates a sense of its profound theoretical prospects in the framework of digital geometry. We have shown how different types of discretization can lead to forbidden and admissible classes, when one attempts to define the discretization of a spherical circle in terms of intersection between a discrete sphere and a discrete plane. Several fundamental theoretical results have been presented, the algorithm for construction of discrete spherical circles has been discussed, and some test results have been furnished to demonstrate its practicality and usefulness.}, author = {Biswas, Ranita and Bhowmick, Partha and Brimkov, Valentin E.}, booktitle = {Combinatorial image analysis}, isbn = {978-3-319-26144-7}, issn = {1611-3349}, location = {Kolkata, India}, pages = {86--100}, publisher = {Springer Nature}, title = {{On the connectivity and smoothness of discrete spherical circles}}, doi = {10.1007/978-3-319-26145-4_7}, volume = {9448}, year = {2016}, } @article{1662, abstract = {We introduce a modification of the classic notion of intrinsic volume using persistence moments of height functions. Evaluating the modified first intrinsic volume on digital approximations of a compact body with smoothly embedded boundary in Rn, we prove convergence to the first intrinsic volume of the body as the resolution of the approximation improves. We have weaker results for the other modified intrinsic volumes, proving they converge to the corresponding intrinsic volumes of the n-dimensional unit ball.}, author = {Edelsbrunner, Herbert and Pausinger, Florian}, journal = {Advances in Mathematics}, pages = {674 -- 703}, publisher = {Academic Press}, title = {{Approximation and convergence of the intrinsic volume}}, doi = {10.1016/j.aim.2015.10.004}, volume = {287}, year = {2016}, } @inproceedings{1424, abstract = {We consider the problem of statistical computations with persistence diagrams, a summary representation of topological features in data. These diagrams encode persistent homology, a widely used invariant in topological data analysis. While several avenues towards a statistical treatment of the diagrams have been explored recently, we follow an alternative route that is motivated by the success of methods based on the embedding of probability measures into reproducing kernel Hilbert spaces. In fact, a positive definite kernel on persistence diagrams has recently been proposed, connecting persistent homology to popular kernel-based learning techniques such as support vector machines. However, important properties of that kernel enabling a principled use in the context of probability measure embeddings remain to be explored. Our contribution is to close this gap by proving universality of a variant of the original kernel, and to demonstrate its effective use in twosample hypothesis testing on synthetic as well as real-world data.}, author = {Kwitt, Roland and Huber, Stefan and Niethammer, Marc and Lin, Weili and Bauer, Ulrich}, location = {Montreal, Canada}, pages = {3070 -- 3078}, publisher = {Neural Information Processing Systems}, title = {{Statistical topological data analysis-A kernel perspective}}, volume = {28}, year = {2015}, } @inproceedings{1483, abstract = {Topological data analysis offers a rich source of valuable information to study vision problems. Yet, so far we lack a theoretically sound connection to popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In this work, we establish such a connection by designing a multi-scale kernel for persistence diagrams, a stable summary representation of topological features in data. We show that this kernel is positive definite and prove its stability with respect to the 1-Wasserstein distance. Experiments on two benchmark datasets for 3D shape classification/retrieval and texture recognition show considerable performance gains of the proposed method compared to an alternative approach that is based on the recently introduced persistence landscapes.}, author = {Reininghaus, Jan and Huber, Stefan and Bauer, Ulrich and Kwitt, Roland}, location = {Boston, MA, USA}, pages = {4741 -- 4748}, publisher = {IEEE}, title = {{A stable multi-scale kernel for topological machine learning}}, doi = {10.1109/CVPR.2015.7299106}, year = {2015}, } @inproceedings{1495, abstract = {Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the regular hexagonal grid gives the maximum among lattice configurations. }, author = {Edelsbrunner, Herbert and Iglesias Ham, Mabel and Kurlin, Vitaliy}, booktitle = {Proceedings of the 27th Canadian Conference on Computational Geometry}, location = {Ontario, Canada}, pages = {128--135}, publisher = {Queen's University}, title = {{Relaxed disk packing}}, volume = {2015-August}, year = {2015}, } @inproceedings{1510, abstract = {The concept of well group in a special but important case captures homological properties of the zero set of a continuous map f from K to R^n on a compact space K that are invariant with respect to perturbations of f. The perturbations are arbitrary continuous maps within L_infty distance r from f for a given r > 0. The main drawback of the approach is that the computability of well groups was shown only when dim K = n or n = 1. Our contribution to the theory of well groups is twofold: on the one hand we improve on the computability issue, but on the other hand we present a range of examples where the well groups are incomplete invariants, that is, fail to capture certain important robust properties of the zero set. For the first part, we identify a computable subgroup of the well group that is obtained by cap product with the pullback of the orientation of R^n by f. In other words, well groups can be algorithmically approximated from below. When f is smooth and dim K < 2n-2, our approximation of the (dim K-n)th well group is exact. For the second part, we find examples of maps f, f' from K to R^n with all well groups isomorphic but whose perturbations have different zero sets. We discuss on a possible replacement of the well groups of vector valued maps by an invariant of a better descriptive power and computability status. }, author = {Franek, Peter and Krcál, Marek}, location = {Eindhoven, Netherlands}, pages = {842 -- 856}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{On computability and triviality of well groups}}, doi = {10.4230/LIPIcs.SOCG.2015.842}, volume = {34}, year = {2015}, } @inbook{1531, abstract = {The Heat Kernel Signature (HKS) is a scalar quantity which is derived from the heat kernel of a given shape. Due to its robustness, isometry invariance, and multiscale nature, it has been successfully applied in many geometric applications. From a more general point of view, the HKS can be considered as a descriptor of the metric of a Riemannian manifold. Given a symmetric positive definite tensor field we may interpret it as the metric of some Riemannian manifold and thereby apply the HKS to visualize and analyze the given tensor data. In this paper, we propose a generalization of this approach that enables the treatment of indefinite tensor fields, like the stress tensor, by interpreting them as a generator of a positive definite tensor field. To investigate the usefulness of this approach we consider the stress tensor from the two-point-load model example and from a mechanical work piece.}, author = {Zobel, Valentin and Reininghaus, Jan and Hotz, Ingrid}, booktitle = {Visualization and Processing of Higher Order Descriptors for Multi-Valued Data}, editor = {Hotz, Ingrid and Schultz, Thomas}, isbn = {978-3-319-15089-5}, pages = {257 -- 267}, publisher = {Springer}, title = {{Visualizing symmetric indefinite 2D tensor fields using The Heat Kernel Signature}}, doi = {10.1007/978-3-319-15090-1_13}, volume = {40}, year = {2015}, } @article{1555, abstract = {We show that incorporating spatial dispersal of individuals into a simple vaccination epidemic model may give rise to a model that exhibits rich dynamical behavior. Using an SIVS (susceptible-infected-vaccinated-susceptible) model as a basis, we describe the spread of an infectious disease in a population split into two regions. In each subpopulation, both forward and backward bifurcations can occur. This implies that for disconnected regions the two-patch system may admit several steady states. We consider traveling between the regions and investigate the impact of spatial dispersal of individuals on the model dynamics. We establish conditions for the existence of multiple nontrivial steady states in the system, and we study the structure of the equilibria. The mathematical analysis reveals an unusually rich dynamical behavior, not normally found in the simple epidemic models. In addition to the disease-free equilibrium, eight endemic equilibria emerge from backward transcritical and saddle-node bifurcation points, forming an interesting bifurcation diagram. Stability of steady states, their bifurcations, and the global dynamics are investigated with analytical tools, numerical simulations, and rigorous set-oriented numerical computations.}, author = {Knipl, Diána and Pilarczyk, Pawel and Röst, Gergely}, issn = {1536-0040}, journal = {SIAM Journal on Applied Dynamical Systems}, number = {2}, pages = {980 -- 1017}, publisher = {Society for Industrial and Applied Mathematics }, title = {{Rich bifurcation structure in a two patch vaccination model}}, doi = {10.1137/140993934}, volume = {14}, year = {2015}, } @inproceedings{1568, abstract = {Aiming at the automatic diagnosis of tumors from narrow band imaging (NBI) magnifying endoscopy (ME) images of the stomach, we combine methods from image processing, computational topology, and machine learning to classify patterns into normal, tubular, vessel. Training the algorithm on a small number of images of each type, we achieve a high rate of correct classifications. The analysis of the learning algorithm reveals that a handful of geometric and topological features are responsible for the overwhelming majority of decisions.}, author = {Dunaeva, Olga and Edelsbrunner, Herbert and Lukyanov, Anton and Machin, Michael and Malkova, Daria}, booktitle = {Proceedings - 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing}, location = {Timisoara, Romania}, pages = {7034731}, publisher = {IEEE}, title = {{The classification of endoscopy images with persistent homology}}, doi = {10.1109/SYNASC.2014.81}, year = {2015}, } @inproceedings{1567, abstract = {My personal journey to the fascinating world of geometric forms started more than 30 years ago with the invention of alpha shapes in the plane. It took about 10 years before we generalized the concept to higher dimensions, we produced working software with a graphics interface for the three-dimensional case. At the same time, we added homology to the computations. Needless to say that this foreshadowed the inception of persistent homology, because it suggested the study of filtrations to capture the scale of a shape or data set. Importantly, this method has fast algorithms. The arguably most useful result on persistent homology is the stability of its diagrams under perturbations.}, author = {Edelsbrunner, Herbert}, booktitle = {23rd International Symposium}, location = {Los Angeles, CA, United States}, publisher = {Springer Nature}, title = {{Shape, homology, persistence, and stability}}, volume = {9411}, year = {2015}, } @article{1563, abstract = {For a given self-map $f$ of $M$, a closed smooth connected and simply-connected manifold of dimension $m\geq 4$, we provide an algorithm for estimating the values of the topological invariant $D^m_r[f]$, which equals the minimal number of $r$-periodic points in the smooth homotopy class of $f$. Our results are based on the combinatorial scheme for computing $D^m_r[f]$ introduced by G. Graff and J. Jezierski [J. Fixed Point Theory Appl. 13 (2013), 63-84]. An open-source implementation of the algorithm programmed in C++ is publicly available at {\tt http://www.pawelpilarczyk.com/combtop/}.}, author = {Graff, Grzegorz and Pilarczyk, Pawel}, journal = {Topological Methods in Nonlinear Analysis}, number = {1}, pages = {273 -- 286}, publisher = {Juliusz Schauder Center for Nonlinear Studies}, title = {{An algorithmic approach to estimating the minimal number of periodic points for smooth self-maps of simply-connected manifolds}}, doi = {10.12775/TMNA.2015.014}, volume = {45}, year = {2015}, }