Related papers: Poset functor cocalculus and applications to topol…
In this paper, we show that for reduced homotopy endofunctors of spaces, F, and for all $n \geq 1$ there are adjoint functors $R_n, L_n$ with $T_n F \simeq R_n F L_n$, where $P_n F$ is the $n$-excisive approximation to $F$, constructed by…
We provide a simple and novel algorithmic design technique, for which we call iterative partial rounding, that gives a tight rounding-based approximation for vertex cover with hard capacities (VC-HC). In particular, we obtain an…
A theory of modules over posets is developed to define computationally feasible, topologically interpretable data structures, in terms of birth and death of homology classes, for persistent homology with multiple real parameters. To replace…
We study two log-concave sampling problems: constrained sampling and composite sampling. First, we consider sampling from a target distribution with density proportional to $\exp(-f(x))$ supported on a convex set $K \subset \mathbb{R}^d$,…
Best rank-one approximation is one of the most fundamental tasks in tensor computation. In order to fully exploit modern multi-core parallel computers, it is necessary to develop decoupling algorithms for computing the best rank-one…
Computation of the simplicial complexes of a large point cloud often relies on extracting a sample, to reduce the associated computational burden. The study considers sampling critical points of a Morse function associated to a point cloud,…
This work is concerned with approximating a trivariate function defined on a tensor-product domain via function evaluations. Combining tensorized Chebyshev interpolation with a Tucker decomposition of low multilinear rank yields function…
Many practical applications in topological data analysis arise from data in the form of point clouds, which then yield simplicial complexes. The combinatorial structure of simplicial complexes captures the topological relationships between…
Given a functor from any category into the category of topological spaces, one obtains a linear representation of the category by post-composing the given functor with a homology functor with field coefficients. This construction is…
We study the persistent homology of both functional data on compact topological spaces and structural data presented as compact metric measure spaces. One of our goals is to define persistent homology so as to capture primarily properties…
We establish a precise relationship between functor calculus and the projective dimension of multipersistence modules. Specifically, we develop a new notion of functor calculus for functors from posets, which detects vanishing total fibers…
Motivated by problems in which data are given over covering generating families, we suggest a new cohomology theory for diffeological spaces, called diffeological \v{C}ech cohomology, which is an exact $ \partial $-functor of the section…
Coquand's cubical set model for homotopy type theory provides the basis for a computational interpretation of the univalence axiom and some higher inductive types, as implemented in the cubical proof assistant. This paper contributes to the…
We consider the problem of computing persistent homology (PH) for large-scale Euclidean point cloud data, aimed at downstream machine learning tasks, where the exponential growth of the most widely-used Vietoris-Rips complex imposes serious…
In this paper, we identify low-dimensional models for dense core subsets in the space of $3\times 3$ high-contrast optical flow patches sampled from the Sintel dataset. In particular, we leverage the theory of approximate and discrete…
In this paper, we study the discrete differential calculus on hypergraphs by using the Kouzul complexes. We define the constrained (co)homology for hypergraphs and give the corresponding Mayer-Vietoris sequences. We prove the functoriality…
In this work, a novel sequential Monte Carlo filter is introduced which aims at efficient sampling of high-dimensional state spaces with a limited number of particles. Particles are pushed forward from the prior to the posterior density…
We introduce the concept of weighted persistence diagrams and develop a functorial pipeline for constructing them from finite metric measure spaces. This builds upon an existing functorial framework for generating classical persistence…
With the emergence of graph databases, the task of frequent subgraph discovery has been extensively addressed. Although the proposed approaches in the literature have made this task feasible, the number of discovered frequent subgraphs is…
We study a Floer-theoretic approach to harmonic maps from the two-torus into non-flat K\"ahler manifolds. Building on the complex-regularized polysymplectic (CRPS) formalism of [BF24], which provides a Hamiltonian description of harmonic…