Related papers: Certified numerical homotopy tracking
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…
The symmetric homology of a unital algebra $A$ over a commutative ground ring $k$ is defined using derived functors and the symmetric bar construction of Fiedorowicz. For a group ring $A = k[\Gamma]$, the symmetric homology is related to…
We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops around singularities connect points on the same irreducible…
We apply our previous work on the relation between groupoid homology and K-theory to Smale spaces. More precisely, we consider the unstable equivalence relation of a Smale space with totally disconnected stable sets, and prove that the…
Persistent homology is a widely used tool in Topological Data Analysis that encodes multiscale topological information as a multi-set of points in the plane called a persistence diagram. It is difficult to apply statistical theory directly…
This note introduces the $\texttt{LikelihoodGeometry}$ package for the computer algebra system $\textit{Macaulay2}$. This package gives tools to construct the likelihood correspondence of a discrete algebraic statistical model, a variety…
Statistical inference for large data panels is omnipresent in modern economic applications. An important benefit of panel analysis is the possibility to reduce noise and thus to guarantee stable inference by intersectional pooling. However,…
This is a computational study of bottlenecks on algebraic varieties. The bottlenecks of a smooth variety $X \subseteq \mathbb{C}^n$ are the lines in $\mathbb{C}^n$ which are normal to $X$ at two distinct points. The main result is a…
An approximate homotopy symmetry method for nonlinear problems is proposed and applied to the six-order boussinesq equation. We summarize the general formulas for similarity reduction solutions and similarity reduction equations of…
We study the connection between discrete Morse theory and persistent homology in the context of shape reconstruction methods. Specifically, we consider the construction of Wrap complexes, introduced by Edelsbrunner as a subcomplex of the…
A number of modern learning tasks involve estimation from heterogeneous information sources. This includes classification with labeled and unlabeled data as well as other problems with analogous structure such as competitive (game…
Topological data analysis is becoming increasingly relevant to support the analysis of unstructured data sets. A common assumption in data analysis is that the data set is a sample---not necessarily a uniform one---of some high-dimensional…
Persistent homology computes the multiscale topology of a data set by using a sequence of discrete complexes. In this paper, we propose that persistent homology may be a useful tool for studying the structure of the landscape of string…
In homotopy theory, exact sequences and spectral sequences consist of groups and pointed sets, linked by actions. We prove that the theory of such exact and spectral sequences can be established in a categorical setting which is based on…
Exact sequences are a well known notion in homological algebra. We investigate here the more vague properties of 'homotopical exactness', appearing for instance in the fibre or cofibre sequence of a map. Such notions of exactness can be…
We introduce the Macaulay2 package HomologicalShiftIdeals. It allows to compute the homological shift ideals of a monomial ideal, and to check the homological shift properties, including having linear resolution, having linear quotients, or…
In this paper, based on the homotopy continuation method and the interval Newton method, an efficient algorithm is introduced to isolate the real roots of semi-algebraic system. Tests on some random examples and a variety of problems…
Renormalized homotopy continuation on toric varieties is introduced as a tool for solving sparse systems of polynomial equations, or sparse systems of exponential sums. The cost of continuation depends on a renormalized condition length,…
In this paper we examine the use of topological methods for multivariate statistics. Using persistent homology from computational algebraic topology, a random sample is used to construct estimators of persistent homology. This estimation…
We revisit the static coverage control problem for placement of vehicles with simple motion on the real line, under the assumption that the cost is a polynomial function of the locations of the vehicles. The main contribution of this paper…