11 citations · 13 across the 4 of their papers we have counts for
4 papers · 1 filter
Berge Sorting
Antoine Deza, William Hua
In 1966, Claude Berge proposed the following sorting problem. Given a string of alternating white and black pegs on a one-dimensional board consisting of an unlimited number of…
A counterexample to a conjecture of Laurent and Poljak
Antoine Deza, Gabriel Indik
The metric polytope m(n) is the polyhedron associated with all semimetrics on n nodes. In 1992 Monique Laurent and Svatopluk Poljak conjectured that every fractional vertex of the…
The Colourful Feasibility Problem
Antoine Deza, Sui Huang, Tamon Stephen +1
We study a colourful generalization of the linear programming feasibility problem, comparing the algorithms introduced by Barany and Onn with new methods. We perform benchmarking o…
Colourful Simplicial Depth
Antoine Deza, Sui Huang, Tamon Stephen +1
Inspired by Barany's colourful Caratheodory theorem, we introduce a colourful generalization of Liu's simplicial depth. We prove a parity property and conjecture that the minimum c…