A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting

  title={A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting},
  author={Aris Filos-Ratsikas and Alexandros Hollender and Katerina Sotiraki and Manolis Zampetakis},
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 are not known to have complete problems of a topological nature, which impedes any progress towards settling the complexity of the problem. On the contrary, such problems have been pivotal in obtaining completeness results for PPAD and PPA, for several important problems, such as finding a Nash… 

Figures and Tables from this paper

Square-Cut Pizza Sharing is PPA-complete
The computational complexity of computing solutions for the square-cut pizza sharing problem is studied, and it is shown that finding an approximate solution to this problem is PPA-complete, while finding an exact solution is FIXP-hard and in BU.
Consensus-Halving: Does It Ever Get Easier?
The extent to which the ε-Consensus-Halving problem becomes easy to solve, if one restricts the class of valuation functions is examined, and a strengthening of the PPA-hardness result is obtained and the first hardness result for a generalization of Consensus- Halving, theconsensus-1/k-Division problem, is proved.
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents
This work considers the ε-Consensus-Halving problem, in which a set of heterogeneous agents aim at dividing a continuous resource into two portions that all of them simultaneously consider to be of approximately the same value, and shows that the problem is PPA-complete and admits exponential query complexity lower bounds, even for two agents.
Consensus Halving for Sets of Items
This paper presents a polynomial-time algorithm that computes a consensus halving with at most $n$ cuts, and shows that $ n$ cuts are almost surely necessary when the agents' utilities are drawn from probabilistic distributions.
The complexity of constrained min-max optimization
This result is the first to show an exponential separation between these two fundamental optimization problems in the oracle model, and comes in sharp contrast to minimization problems, where finding approximate local minima in the same setting can be done with Projected Gradient Descent using O(L/ε) many queries.
A Survey of mass partitions
This survey describes recent progress in the area of mass partition problems in addition to its connections to topology, discrete geometry, and computer science.
Fair Division Algorithms for Electricity Distribution
In many developing countries, the total electricity demand is larger than the limited generation capacity of power stations. Many countries adopt the common practice of routine load shedding —
A Fixed-Parameter Algorithm for the Schrijver Problem
The Schrijver graph S ( n , k ) is defined for integers n and k with n ≥ 2 k as the graph whose vertices are all the k -subsets of { 1, 2, . . ., n } that do not include two consecutive elements
A Fixed-Parameter Algorithm for the Kneser Problem
The Kneser graph K ( n , k ) is defined for integers n and k with n ≥ 2 k as the graph whose vertices are all the k -subsets of { 1, 2, . . ., n } where two such sets are adjacent if they are
Consensus Division in an Arbitrary Ratio
We consider the problem of partitioning a line segment into two subsets, so that n finite measures all has the same ratio of values for the subsets. Letting α ∈ [0, 1] denote the desired ratio, this


The Classes PPA-k: Existence from Arguments Modulo k
On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence
Paintshop, odd cycles and necklace splitting
The relative complexity of NP search problems
This work proves several separations which show that in a generic relativized world, the search classes are distinct and there is a standard search problem in each of them that is not computationally equivalent to any decision problem.
On the complexity of modulo-q arguments and the chevalley-warning theorem
The main result is to establish that an explicit version of a search problem associated to the Chevalley-Warning theorem is complete for PPAp for prime p, the first such complete problem for P PAp when p ≥ 3.
Reductions and Propositional Proofs for Total NP Search Problems
This dissertation studies TFNP, the class of total NP search problems, and TFNP², a relativized version of TFNP. Resolving the exact computational complexities of TFNP and its subclasses is closely
PPP-Completeness with Connections to Cryptography
This work identifies the first PPP-complete problem without any circuit or Turing Machine given explicitly in the input, and thus answers a longstanding open question from [Papadimitriou1994].
Some Combinatorial Lemmas in Topology
  • H. Kuhn
  • Mathematics
    IBM J. Res. Dev.
  • 1960
This central result of this paper is a combinatorial proposition, analogous to the Sperner Lemma, and applying to the n-cube, for which subdivision is a trivial operation.
Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry
A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are not
The complexity of splitting necklaces and bisecting ham sandwiches
The computational complexity of two problems known as Necklace Splitting and Discrete Ham Sandwich are resolved, showing that they are PPA-complete, settling the status of PPA as a class that captures the complexity of “natural” problems whose definitions do not incorporate a circuit.