Document Open Access Logo

Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces

Authors Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi



PDF
Thumbnail PDF

File

LIPIcs.ICALP.2018.74.pdf
  • Filesize: 473 kB
  • 14 pages

Document Identifiers

Author Details

Rohit Gurjar
  • California Institute of Technology, USA
Thomas Thierauf
  • Aalen University, Germany
Nisheeth K. Vishnoi
  • École Polytechnique Fédérale de Lausanne (EPFL), Switzerland

Cite AsGet BibTex

Rohit Gurjar, Thomas Thierauf, and Nisheeth K. Vishnoi. Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 74:1-74:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.ICALP.2018.74

Abstract

We present a geometric approach towards derandomizing the {Isolation Lemma} by Mulmuley, Vazirani, and Vazirani. In particular, our approach produces a quasi-polynomial family of weights, where each weight is an integer and quasi-polynomially bounded, that can isolate a vertex in any 0/1 polytope for which each face lies in an affine space defined by a totally unimodular matrix. This includes the polytopes given by totally unimodular constraints and generalizes the recent derandomization of the Isolation Lemma for {bipartite perfect matching} and {matroid intersection}. We prove our result by associating a {lattice} to each face of the polytope and showing that if there is a totally unimodular kernel matrix for this lattice, then the number of vectors of length within 3/2 of the shortest vector in it is polynomially bounded. The proof of this latter geometric fact is combinatorial and follows from a polynomial bound on the number of circuits of size within 3/2 of the shortest circuit in a regular matroid. This is the technical core of the paper and relies on a variant of Seymour's decomposition theorem for regular matroids. It generalizes an influential result by Karger on the number of minimum cuts in a graph to regular matroids.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Combinatorial optimization
  • Mathematics of computing → Matroids and greedoids
  • Theory of computation → Pseudorandomness and derandomization
Keywords
  • Derandomization
  • Isolation Lemma
  • Total unimodularity
  • Near-shortest vectors in Lattices
  • Regular matroids

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Manindra Agrawal, Thanh Minh Hoang, and Thomas Thierauf. The polynomially bounded perfect matching problem is in NC². In 24th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 4393 of Lecture Notes in Computer Science, pages 489-499. Springer Berlin Heidelberg, 2007. URL: http://dx.doi.org/10.1007/978-3-540-70918-3_42.
  2. Vikraman Arvind and Partha Mukhopadhyay. Derandomizing the isolation lemma and lower bounds for circuit size. In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX, and 12th International Workshop, RANDOM, pages 276-289, 2008. URL: http://dx.doi.org/10.1007/978-3-540-85363-3_23.
  3. Andreas Björklund and Thore Husfeldt. Shortest two disjoint paths in polynomial time. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I, pages 211-222, 2014. URL: http://dx.doi.org/10.1007/978-3-662-43948-7_18.
  4. C. Bourke, R. Tewari, and N. V. Vinodchandran. Directed planar reachability is in unambiguous log-space. ACM Trans. Comput. Theory, 1:4:1-4:17, February 2009. URL: http://dx.doi.org/10.1145/1490270.1490274.
  5. Elias Dahlhaus and Marek Karpinski. Matching and multidimensional matching in chordal and strongly chordal graphs. Discrete Applied Mathematics, 84(1–3):79-91, 1998. URL: http://dx.doi.org/10.1016/S0166-218X(98)00006-7.
  6. Samir Datta, Raghav Kulkarni, and Sambuddha Roy. Deterministically isolating a perfect matching in bipartite planar graphs. Theory of Computing Systems, 47:737-757, 2010. URL: http://dx.doi.org/10.1007/s00224-009-9204-8.
  7. Stephen A. Fenner, Rohit Gurjar, and Thomas Thierauf. Bipartite perfect matching is in quasi-NC. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pages 754-763, 2016. URL: http://dx.doi.org/10.1145/2897518.2897564.
  8. Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984. URL: http://dx.doi.org/10.1145/828.1884.
  9. Dima Grigoriev and Marek Karpinski. The matching problem for bipartite graphs with polynomially bounded permanents is in NC (extended abstract). In 28th Annual Symposium on Foundations of Computer Science (FOCS), pages 166-172, 1987. URL: http://dx.doi.org/10.1109/SFCS.1987.56.
  10. Rohit Gurjar and Thomas Thierauf. Linear matroid intersection is in quasi-NC. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pages 821-830, New York, NY, USA, 2017. ACM. URL: http://dx.doi.org/10.1145/3055399.3055440.
  11. Rohit Gurjar, Thomas Thierauf, and Nisheeth K. Vishnoi. Isolating a vertex via lattices: Polytopes with totally unimodular faces. ArXiv e-prints, abs/1708.02222, August 2017. URL: http://arxiv.org/abs/1708.02222.
  12. Vivek Anand T. Kallampally and Raghunath Tewari. Trading determinism for time in space bounded computations. In 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland, pages 10:1-10:13, 2016. URL: http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.10.
  13. David R. Karger. Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '93, pages 21-30, Philadelphia, PA, USA, 1993. Society for Industrial and Applied Mathematics. URL: http://dl.acm.org/citation.cfm?id=313559.313605.
  14. Ketan Mulmuley, Umesh V. Vazirani, and Vijay V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7:105-113, 1987. URL: http://dx.doi.org/10.1007/BF02579206.
  15. H. Narayanan, Huzur Saran, and Vijay V. Vazirani. Randomized parallel algorithms for matroid union and intersection, with applications to arboresences and edge-disjoint spanning trees. SIAM J. Comput., 23(2):387-397, 1994. URL: http://dx.doi.org/10.1137/S0097539791195245.
  16. S. Onn. Nonlinear Discrete Optimization: An Algorithmic Theory. Zurich lectures in advanced mathematics. European Mathematical Society Publishing House, 2010. URL: https://books.google.co.il/books?id=wzAGMQAACAAJ.
  17. Klaus Reinhardt and Eric Allender. Making nondeterminism unambiguous. SIAM Journal on Computing, 29(4):1118-1131, 2000. URL: http://dx.doi.org/10.1137/S0097539798339041.
  18. Alexander Schrijver. Theory of Linear and Integer Programming. John Wiley &Sons, Inc., New York, NY, USA, 1986. Google Scholar
  19. Alexander Schrijver. Combinatorial optimization: polyhedra and efficiency. Vol. A. , Paths, flows, matchings. Algorithms and combinatorics. Springer-Verlag, Berlin, Heidelberg, New York, 2003. Google Scholar
  20. Alexander Schrijver. Combinatorial optimization: polyhedra and efficiency. Vol. B. , Matroids, trees, stable sets. Algorithms and combinatorics. Springer-Verlag, Berlin, Heidelberg, New York, N.Y., et al., 2003. Google Scholar
  21. Paul D. Seymour. Decomposition of regular matroids. J. Comb. Theory, Ser. B, 28(3):305-359, 1980. URL: http://dx.doi.org/10.1016/0095-8956(80)90075-1.
  22. Mohit Singh and Nisheeth K. Vishnoi. Entropy, optimization and counting. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pages 50-59. ACM, 2014. Google Scholar
  23. Damian Straszak and Nisheeth K. Vishnoi. Computing Maximum Entropy Distributions Everywhere. ArXiv e-prints, 2017. URL: http://arxiv.org/abs/1711.02036.
  24. Ashok Subramanian. A polynomial bound on the number of light cycles in an undirected graph. Information Processing Letters, 53(4):173-176, 1995. URL: http://dx.doi.org/10.1016/0020-0190(94)00202-A.
  25. Ola Svensson and Jakub Tarnawski. The matching problem in general graphs is in quasi-NC. In 58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017, 15-17 October, 2017, Berkeley, California, USA, 2017. Google Scholar
  26. C. P. Teo and K. M. Koh. The number of shortest cycles and the chromatic uniqueness of a graph. Journal of Graph Theory, 16(1):7-15, 1992. Google Scholar
  27. Klaus Truemper. Matroid Decomposition. Leibniz, Plano, Texas (USA), 1998. Google Scholar
  28. Dieter van Melkebeek and Gautam Prakriya. Derandomizing isolation in space-bounded settings. In 32nd Computational Complexity Conference, CCC 2017, July 6-9, 2017, Riga, Latvia, pages 5:1-5:32, 2017. URL: http://dx.doi.org/10.4230/LIPIcs.CCC.2017.5.
  29. Avi Wigderson. NL/poly ⊆ ⊕ L/poly. In Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pages 59-62, 1994. URL: http://dx.doi.org/10.1109/SCT.1994.315817.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail