Caoduro–Khodamoradi–Paat–Shepherd's oriented-matroid embracing-distance conjecture

Let MM be an oriented matroid of rank rr, let ee be the distinguished element defining the embracing condition, and let AA and BB be bases of MM. Call them ee-embracing when they satisfy the source's ee-embracing basis condition, and let their ee-embracing exchange distance be the minimum number of exchanges in a sequence of ee-embracing bases joining them. Oriented-matroid embracing-distance conjecture. The ee-embracing exchange distance of two ee-embracing bases of a rank-rr oriented matroid is at most rr. 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.