Caoduro–Khodamoradi–Paat–Shepherd's oriented-matroid embracing-distance conjecture
Caoduro–Khodamoradi–Paat–Shepherd's oriented-matroid embracing-distance conjecture
Let be an oriented matroid of rank , let be the distinguished element defining the embracing condition, and let and be bases of . Call them -embracing when they satisfy the source's -embracing basis condition, and let their -embracing exchange distance be the minimum number of exchanges in a sequence of -embracing bases joining them. Oriented-matroid embracing-distance conjecture. The -embracing exchange distance of two -embracing bases of a rank- oriented matroid is at most . In the abstract oriented-matroid setting, it remains open even whether an exchange sequence satisfying the required embracing condition always exists, regardless of its length.
Sources & referencesView supporting material
Primary source
Kristóf Bérczi and Benedek Nádor, “A note on embracing exchange sequences in oriented matroids”, arXiv:2511.14526 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.