@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}, }