Related papers: Certified numerical homotopy tracking
We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a…
We introduce the \verb|Macaulay2| package \verb|RepHomology| for the computations of representation homology of certain spaces. The main methods implement computing the representation homology of surfaces (with group coefficients, and…
We provide a unified method to study the adjacency matrices of regular graphs (including infinite ones) using holomorphic functional calculus. By applying this calculus on a specific ellipse that contains the spectrum, we derive an…
These pages contain a short overview on the state of the art of efficient numerical analysis methods that solve systems of multivariate polynomial equations. We focus on the work of Steve Smale who initiated this research framework, and on…
Synthesis problems for linkages in kinematics often yield large structured parameterized polynomial systems which generically have far fewer solutions than traditional upper bounds would suggest. This paper describes statistical models for…
In this paper we propose an approach for computing multiple high-quality near-isometric dense correspondences between a pair of 3D shapes. Our method is fully automatic and does not rely on user-provided landmarks or descriptors. This…
Homotopy optimization is a traditional method to deal with a complicated optimization problem by solving a sequence of easy-to-hard surrogate subproblems. However, this method can be very sensitive to the continuation schedule design and…
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…
We describe the homotopy classes of 2 by 2 periodic simple (=non-degenerate) matrices with various symmetries. This turns out to be an elementary exercise in the homotopy of closed curves in three dimensions. The matrices represent gapped…
Recently, the influence of potentially present symmetries has begun to be studied in complex networks. A typical way of studying symmetries is via the automorphism group of the corresponding graph. Since complex networks are often subject…
We establish the continuous functoriality of wrapped Fukaya categories with respect to Liouville automorphisms, yielding a way to probe the homotopy type of the automorphism group of a Liouville sector. These methods prove Liouville and…
We adapt the quasi-monotone method from [2] for composite convex minimization in the stochastic setting. For the proposed numerical scheme we derive the optimal convergence rate in terms of the last iterate, rather than on average as it is…
In this paper, we study the problem of computing a homotopy from a planar curve $C$ to a point that minimizes the area swept. The existence of such a minimum homotopy is a direct result of the solution of Plateau's problem. Chambers and…
This paper focuses on developing an efficient algorithm for analyzing a directed network (graph) from a topological viewpoint. A prevalent technique for such topological analysis involves computation of homology groups and their…
Sparse signal restoration is usually formulated as the minimization of a quadratic cost function $\|y-Ax\|_2^2$, where A is a dictionary and x is an unknown sparse vector. It is well-known that imposing an $\ell_0$ constraint leads to an…
We show that every continuous map from one translationally finite tiling space to another can be approximated by a local map. If two local maps are homotopic, then the homotopy can be chosen so that every interpolating map is also local.
We establish connectedness criteria for graphs associated to monomials in certain quotients of the mod 2 dual Steenrod algebra. We also investigate questions about trees and Hamilton cycles in the context of these graphs. Finally, we…
A topological mating is a map defined by gluing together the filled Julia sets of two quadratic polynomials. The identifications are visualized and understood by pinching ray-equivalence classes of the formal mating. For postcritically…
A central challenge in topological data analysis is the interpretation of barcodes. The classical algebraic-topological approach to interpreting homology classes is to build maps to spaces whose homology carries semantics we understand and…
This survey gives an overview of several fundamental algebraic constructions which arise in the study of splines. Splines play a key role in approximation theory, geometric modeling, and numerical analysis, their properties depend on…