Introduction

  • Over , the OHCP can be solved in polynomial time when the simplicial complex has no relative torsion
    • In such a case, the constraint matrix of an LP model of OHCP is totally unimodular (TU).
  • Generalized version using chains instead of cycles is NP-complete
  • Unexplored weaker conditions: k-balanced matrices and totally dual integral systems

An example, and some intuition

  • No relative torsion is equivalent to having no Mobius strip
  • Intuitively: a complex is NTU neutralized if there is an “odd disk” (disk whose boundary is an odd number of interior edges) providing a shortcut across every relative torsion.
  • Sufficient condition:

Background

  • Recall that , and are all finitely generated abelian groups.
  • By the fundamental theorem of finitely generated abelian groups: any such group can be written as where and with and . We call subgroup the torsion of . If , then is torsion-free*.
  • Given subcomplex of , the quotient group is the group of relative -chains of modulo . Restricting the boundary operator to gives induces the relative boundary homomorphism . Which results in relative cycles, , and relative boundaries, . Thus, we can obtain the relative homology group: .
  • OHCP LP:
  • The constraint matrix is TU, or equivalently, feasible region is integral if and only if the boundary matrix is TU which happens if and only if is torsion free for all pure subcomplexes in of dimensions and respectively.
  • A basic solution is a point in the solution space of dimension where a set of linearly independent constraints are active, i.e., satisfied as equations. If a basic solution is feasible, then it is a vertex.

Characterizations of Basic Solutions of the OHCP LP

  • Denote by the hyperplane given by without the non-negativity bounds.
  • Use to refer to a general element of and call an -entry if and -entry if
  • For any entry , its opposite entry is for , for , for , and for . For simplicity, we denote the opposite entry of by . For a pair of opposite entries and of , if at least one of the two is 0, then is concise in the th entry.
  • Let be a solution to the OHCP LP. Then for any , the th coefficient is . And for any , the th coefficient is .
  • Two solutions are considered equivalent if they have the same - and - coefficients.
  • Every OHCP LP has a unique feasible concise solution where all the -coordinates are 0. We call this solution the identity solution and denote it by .
  • We use to refer to an element of , where is the constraint matrix associated with the OHCP instance.
    • Note implies that is null-homologous in .
  1. For any , can be written as
  2. Given , , then if and only if
  3. Since is rational, for any , there is a scalar such that is integral.

Theorem 3.3

Let . is a basic solution if and only if , .

Question: What makes the middle row in Figure 2 a nonbasic solution? I assume it is because the 1-chains are not homologous? I guess I’m not entirely sure on what Figure 2 is trying to convey to the reader.

Lemma 3.4

Any basic solution of an OHCP LP is concise.

  • Define the matrix
  • The columns of form a basis for .

Lemma 3.7

Let be a basic solution. Let with concise in all -entries. Let , with being concise in all -entries, and for each -coordinate , implies that . Then if and only if there is a -coefficient that is 0 in , but nonzero in .

  • For , Lemma 3.7 is arguing that we can get a basic solution by adding a set of triangles to the input chain such that the set of triangles completely cancel at least one edge.
  • We say a set of vectors if linearly concise if any linear combination of the set is concise.
  • A non-basic solution can be decomposed into a basic solution and an element of :

Theorem 3.9

Let be a basic solution. Let with linearly concise. Let . Then is a basic solution if and only if there do not exist and satisfying the following properties:

  1. is linearly concise
  2. is a basic solution
  3. For each -coordinate ,
  4. For each -coordinate ,
  • Based on Figure 3, I believe Theorem 3.9 is stating that a non-basic solution can be decomposed into , and two null-homologous subcomplexes and .
  • One may transform a non-basic solution to a basic one:

Lemma 3.10

Let be concise. Let where for all . If is a basic solution in , then for each where , there must be two -coordinates and where , and . Furthermore, if and are the OHCP LPs with input chains where the only nonzero coefficients are and , respectively, with these coefficients equaling those in , then is a basic solution to or , where is the solution with linearly concise and equivalent to the identity solution for and , respectively.

Question: No clue what this lemma (3.10) is stating.

Lemma 3.12

is a basic solution if and only if is concise. Any that is concise and equivalent to is also a basic solution.

Fractional Solutions to the OHCP LP, and Elementary Chains