2020/03/26 by Aris Filos-Ratsikas, Alexandros Hollender, Filos-Ratsikas, Aris +5 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topology and Set Theory #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Logic, Reasoning, and Knowledge
paper · pdf · doi:10.48550/arxiv.2003.11974
openalex publication_date 2020/03/26 · openalex created_date 2022/07/26 · openalex updated_date 2026/07/28
The classes PPA-p have attracted attention lately, because they are the main candidates for capturing the complexity of Necklace Splitting with p thieves, for prime p. However, these classes were not known to have complete problems of a topological nature, which impedes any progress towards settling the complexity of the Necklace Splitting problem. On the contrary, topological problems have been pivotal in obtaining completeness results for PPAD and PPA, such as the PPAD-completeness of finding a Nash equilibrium [Daskalakis et al., 2009, Chen et al., 2009b] and the PPA-completeness of Necklace Splitting with 2 thieves [Filos-Ratsikas and Goldberg, 2019]. In this paper, we provide the first topological characterization of the classes PPA-p. First, we show that the computational problem associated with a simple generalization of Tucker's Lemma, termed p-polygon-Tucker, as well as the associated Borsuk-Ulam-type theorem, p-polygon-Borsuk-Ulam, are PPA-p-complete. Then, we show that the computational version of the well-known BSS Theorem [Barany et al., 1981], as well as the associated BSS-Tucker problem are PPA-p-complete. Finally, using a different generalization of Tucker's Lemma (termed ℤp-star-Tucker), which we prove to be PPA-p-complete, we prove that p-thief Necklace Splitting is in PPA-p. This latter result gives a new combinatorial proof for the Necklace Splitting theorem, the only proof of this nature other than that of Meunier [2014]. All of our containment results are obtained through a new combinatorial proof for ℤp-versions of Tucker's lemma that is a natural generalization of the standard combinatorial proof of Tucker's lemma by Freund and Todd [1981]. We believe that this new proof technique is of independent interest.