Related papers: Simplification Techniques for Maps in Simplicial T…
Persistent homology is a topological feature used in a variety of applications such as generating features for data analysis and penalizing optimization problems. We develop an approach to accelerate persistent homology computations…
A topology optimization formulation including a model of the layer-by-layer additive manufacturing (AM) process is considered. Defined as a multi-objective minimization problem, the formulation accounts for the performance and cost of both…
Summarizing topological information from datasets and maps defined on them is a central theme in topological data analysis. \textsf{Mapper}, a tool for such summarization, takes as input both a possibly high dimensional dataset and a map…
This paper displays complexity reduction techniques for calculations of path categories (or fundamental categories) P(K) for finite simplicial and cubical complexes K. The central technique involves identifying inclusions of complexes for…
Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on…
We present in this paper a framework which leverages the underlying topology of a data set, in order to produce appropriate coordinate representations. In particular, we show how to construct maps to real and complex projective spaces,…
A new Hardy space Hardy space approach of Dirichlet type problem based on Tikhonov regularization and Reproducing Hilbert kernel space is discussed in this paper, which turns out to be a typical extremal problem located on the upper…
Extracting structured subgraphs inside large graphs - often known as the planted subgraph problem - is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant…
In this paper, we show that contraction operations preserve the homology of $n$D generalized maps, under some conditions. Removal and contraction operations are used to propose an efficient algorithm that compute homology generators of $n$D…
This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…
Topology optimization problems often support multiple local minima due to a lack of convexity. Typically, gradient-based techniques combined with continuation in model parameters are used to promote convergence to more optimal solutions;…
In the literature, the standard approach to finding bases of spaces of modular forms is via modular symbols and the homology of modular curves. By using the Eichler-Shimura isomorphism, a work by Wang shows how one can use a cohomological…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
This paper investigates the cost of solving systems of sparse polynomial equations by homotopy continuation. First, a space of systems of $n$-variate polynomial equations is specified through $n$ monomial bases. The natural locus for the…
Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…
Two simple "simplicial approximation" tricks are invoked to prove basic results involving (co)-homology with local coefficients.
We establish some upper and lower bounds of the rational topological complexity for certain classes of elliptic spaces. Our techniques permit us in particular to show that the rational topological complexity coincides with the dimension of…
In this note we give an algorithm to determine the rational homotopy type of the free and pointed mapping spaces $ map(F(\mathbb R^m,k), S^n)$ and $ map^*(F(\mathbb R^m,k), S^n)$. An explicit description of these spaces is given for $k=3$.…
This is an expository article. It discusses an approach to hypoelliptic Fredholm index theory based on noncommutative methods (groupoids, C*-algebras, K-theory). The paper starts with an explicit index theorem for scalar second order…
We obtain simple quadratic recurrence formulas counting bipartite maps on surfaces with prescribed degrees (in particular, $2k$-angulations), and constellations. These formulas are the fastest known way of computing these numbers. Our work…