77 research outputs found

    On Computing Homological Hitting Sets

    Get PDF
    Cut problems form one of the most fundamental classes of problems in algorithmic graph theory. In this paper, we initiate the algorithmic study of a high-dimensional cut problem. The problem we study, namely, Homological Hitting Set (HHS), is defined as follows: Given a nontrivial r-cycle z in a simplicial complex, find a set ? of r-dimensional simplices of minimum cardinality so that ? meets every cycle homologous to z. Our first result is that HHS admits a polynomial-time solution on triangulations of closed surfaces. Interestingly, the minimal solution is given in terms of the cocycles of the surface. Next, we provide an example of a 2-complex for which the (unique) minimal hitting set is not a cocycle. Furthermore, for general complexes, we show that HHS is W[1]-hard with respect to the solution size p. In contrast, on the positive side, we show that HHS admits an FPT algorithm with respect to p+?, where ? is the maximum degree of the Hasse graph of the complex ?

    Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm

    Get PDF

    Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations

    Get PDF
    This paper considers a particular case of the Optimal Homologous Chain Problem (OHCP) for integer modulo 2 coefficients, where optimality is meant as a minimal lexicographic order on chains induced by a total order on simplices. The matrix reduction algorithm used for persistent homology is used to derive polynomial algorithms solving this problem instance, whereas OHCP is NP-hard in the general case. The complexity is further improved to a quasilinear algorithm by leveraging a dual graph minimum cut formulation when the simplicial complex is a pseudomanifold. We then show how this particular instance of the problem is relevant, by providing an application in the context of point cloud triangulation

    Flat Norm Decomposition of Integral Currents

    Full text link
    Currents represent generalized surfaces studied in geometric measure theory. They range from relatively tame integral currents representing oriented compact manifolds with boundary and integer multiplicities, to arbitrary elements of the dual space of differential forms. The flat norm provides a natural distance in the space of currents, and works by decomposing a dd-dimensional current into dd- and (the boundary of) (d+1)(d+1)-dimensional pieces in an optimal way. Given an integral current, can we expect its flat norm decomposition to be integral as well? This is not known in general, except in the case of dd-currents that are boundaries of (d+1)(d+1)-currents in Rd+1\mathbb{R}^{d+1} (following results from a corresponding problem on the L1L^1 total variation (L1L^1TV) of functionals). On the other hand, for a discretized flat norm on a finite simplicial complex, the analogous statement holds even when the inputs are not boundaries. This simplicial version relies on the total unimodularity of the boundary matrix of the simplicial complex -- a result distinct from the L1L^1TV approach. We develop an analysis framework that extends the result in the simplicial setting to one for dd-currents in Rd+1\mathbb{R}^{d+1}, provided a suitable triangulation result holds. In R2\mathbb{R}^2, we use a triangulation result of Shewchuk (bounding both the size and location of small angles), and apply the framework to show that the discrete result implies the continuous result for 11-currents in R2\mathbb{R}^2.Comment: 17 pages, adds some related work and application
    • …
    corecore