Splitting Necklaces, with Constraints

DOI10.1137/20M1331949zbMath1467.05281arXiv1907.09740MaRDI QIDQ4997130

Duško Jojić, Rade T. Živaljević, Gaiane Yu. Panina

Publication date: 28 June 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.09740

zbMATH Keywords

configuration spaceenvy-free divisionnecklace-splitting theoremcollectively unavoidable complexestest map scheme

Mathematics Subject Classification ID

Fixed points and coincidences in algebraic topology (55M20) Discrete geometry (52C99) Simplicial sets and complexes in algebraic topology (55U10) Helly-type theorems and geometric transversal theory (52A35) Combinatorial aspects of simplicial complexes (05E45) Welfare economics (91B15)

Related Items (7)

Generalized chessboard complexes and discrete Morse theory ⋮ Envy-free division of multi-layered cakes ⋮ A survey of mass partitions ⋮ Envy-free division via configuration spaces ⋮ On Fair Division under Heterogeneous Matroid Constraints ⋮ Unavoidable complexes, via an elementary equivariant index theory ⋮ Envy-free division in the presence of a dragon

Cites Work

• Unnamed Item
• Unnamed Item
• Hyperplane mass partitions via relative equivariant obstruction theory
• Computational topology of equipartitions by hyperplanes
• Equilibrium in a discrete exchange economy with money
• On the number of Tverberg partitions in the prime power case
• Splitting necklaces
• Dividing a cake fairly
• Homotopy properties of the poset of nontrivial p-subgroups of a group
• On a topological generalization of the Tverberg theorem
• Note on a conjecture of Sierksma
• Equipartition of mass distributions by hyperplanes
• Combinatorics of unavoidable complexes
• Symmetric multiple chessboard complexes and a new theorem of Tverberg type
• A Tverberg type theorem for collectively unavoidable complexes
• Envy-free cake division without assuming the players prefer nonempty pieces
• WI-posets, graph complexes and \(\mathbb{Z}_2\)-equivalences
• Tverberg plus constraints
• Algorithmic construction of sets for k -restrictions
• How to Cut a Cake Fairly
• Topology of the Grünbaum–Hadwiger–Ramos hyperplane mass partition problem
• Fair Division and Generalizations of Sperner- and KKM-type Results
• Alexander r-tuples and bier complexes
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• ENVY‐FREE DIVISION USING MAPPING DEGREE

This page was built for publication: Splitting Necklaces, with Constraints