Related papers: Certified numerical homotopy tracking
A polynomial homotopy is a family of polynomial systems, where the systems in the family depend on one parameter. If for one value of the parameter we know a regular solution, then what is the nearest value of the parameter for which the…
Persistent homology is a multiscale method for analyzing the shape of sets and functions from point cloud data arising from an unknown distribution supported on those sets. When the size of the sample is large, direct computation of the…
In this paper we propose a primal-dual homotopy method for $\ell_1$-minimization problems with infinity norm constraints in the context of sparse reconstruction. The natural homotopy parameter is the value of the bound for the constraints…
In this paper we study the Linial-Meshulam model of random two-dimensional complexes. We prove that a random 2-complex is homotopically one dimensional, with probability tending to one as n tends to infitnity, assuming that the probability…
Persistent homology is a popular computational tool for analyzing the topology of point clouds, such as the presence of loops or voids. However, many real-world datasets with low intrinsic dimensionality reside in an ambient space of much…
We show that a uniform probability measure supported on a specific set of piecewise linear loops in a non-trivial free homotopy class in a multi-punctured plane is overwhelmingly concentrated around loops of minimal lengths. Our approach is…
We address the homotopy theory of 2-crossed modules of commutative algebras. In particular, we define the concept of a 2-fold homotopy between a pair of 1-fold homotopies connecting 2-crossed module maps $\A \to \A'$. We also prove that if…
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network…
We construct a log algebraic version of the homotopy sequence for a quasi-projective normal crossing log variety over a log point of characteristic zero and prove some exactness properties of it. Our proofs are purely algebraic.
Finding vacua for the four dimensional effective theories for supergravity which descend from flux compactifications and analyzing them according to their stability is one of the central problems in string phenomenology. Except for some…
Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…
In this article we provide a combinatorial sufficient (and conjecturally, necessary) condition (called $\alpha$-symmetry) for the mating of two postcritically finite polynomials in $\mathcal{S}_1$ to be obstructed. To do this, we study the…
In topological data analysis, persistent homology is used to study the "shape of data". Persistent homology computations are completely characterized by a set of intervals called a bar code. It is often said that the long intervals…
In this paper, the author establishes the existence of positive entire solutions to a general class of semilinear poly-harmonic systems, which includes equations and systems of the weighted Hardy--Littlewood--Sobolev type. The novel method…
We use proof mining techniques to obtain a uniform rate of asymptotic regularity for the instance of the parallel algorithm used by L\'opez-Acedo and Xu to find common fixed points of finite families of $k$-strict pseudocontractive…
We study the homology groups of the complement of a complexified real line arrangement with coefficients in complex rank-one local systems. Using Borel--Moore homology, we establish an algorithm computing their dimensions via the real…
Topological data analysis can extract effective information from higher-dimensional data. Its mathematical basis is persistent homology. The persistent homology can calculate topological features at different spatiotemporal scales of the…
The exact computation of the matching distance for multi-parameter persistence modules is an active area of research in computational topology. Achieving an easily obtainable exact computation of this distance would permit multi-parameter…
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…
An important problem in computational topology is to calculate the homology of a space from samples. In this work, we develop a statistical approach to this problem by calculating the expected rank of an induced map on homology from a…