Bubble-up and missing-rim conjecture for wheels of neural codes

Let C\mathcal{C} be a neural code, let Δ(C)\Delta(\mathcal{C}) be its simplicial complex, and let W=(σ1,σ2,σ3,τ)\mathcal{W}=(\sigma_1,\sigma_2,\sigma_3,\tau) be a wheel of C\mathcal{C}. A face of Δ(C)\Delta(\mathcal{C}) is a max-intersection face if it is the intersection of two or more facets of Δ(C)\Delta(\mathcal{C}). Bubble-up and missing-rim conjecture. (i) If W\mathcal{W} is a wheel of C\mathcal{C}, then τC\tau\notin\mathcal{C}. (ii) If C\mathcal{C} has a wheel, then it has a wheel W=(σ1,σ2,σ3,τ)\mathcal{W}=(\sigma_1,\sigma_2,\sigma_3,\tau) in which τ\tau is a max-intersection face of Δ(C)\Delta(\mathcal{C}). The preceding results establish these properties for sprockets, wire wheels, and wheel frames; the conjecture asserts both the missing-rim and bubble-up properties for arbitrary wheels.

Sources & referencesView supporting material

Primary source

Laura Matusevich, Alexander Ruys de Perez and Anne Shiu, “Wheels: A New Criterion for Non-convexity of Neural Codes”, arXiv:2108.04995 (2023).

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.