Parity Problems in Planar Graphs

We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the modular setting. We exhibit the problem to be complete for Logspace when the modulus is 2k, for constant k. On the other hand, we show that for any other modulus and in the non-modular case, our problem is as hard in the planar case as for the case of arbitrary graphs. This completely settles the question regarding the complexity of modular computation of the number of spanning trees in planar graphs. The techniques used rely heavily on algebraic-topology. In the spirit of counting problems modulo 2k, we also exhibit a highly parallel oplusL algorithm for finding the value of a Permanent modulo 2k. Previously, the best known result in this direction was Valiant's result that this problem lies in P.

[1]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[2]  Eric Allender,et al.  Uniform constant-depth threshold circuits for division and iterated multiplication , 2002, J. Comput. Syst. Sci..

[3]  Ira M. Gessel,et al.  Determinants, Paths, and Plane Partitions , 1989 .

[4]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[5]  Stefan Friedrich,et al.  Topology , 2019, Arch. Formal Proofs.

[6]  Christoph Meinel,et al.  Structure and Importance of Logspace-MOD-Classes , 1991, STACS.

[7]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[8]  David Eppstein.  On the Parity of Graph Spanning Tree Numbers , 2001 .

[9]  Wayne Eberly,et al.  Efficient parallel independent subsets and matrix factorizations , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[10]  W. Greub.  Linear Algebra , 1981 .

[11]  H. Shank,et al.  The theory of left-right paths , 1975 .

[12]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[13]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[14]  Jim Hefferon,et al.  Linear Algebra , 2012 .

[15]  William Fulton.  Algebraic Topology: A First Course , 1995 .

[16]  R. Ho.  Algebraic Topology , 2022 .

[17]  M. Fisher,et al.  Dimer problem in statistical mechanics-an exact result , 1961 .

[18]  Stephen A. Cook,et al.  Problems Complete for Deterministic Logarithmic Space , 1987, J. Algorithms.