The forbidden-subdiagram characterization conjecture for k-terminal-minimality
The forbidden-subdiagram characterization conjecture for k-terminal-minimality
A chord diagram is -terminal-minimal if it is -terminal and minimal with respect to that property under the reduction considered in the paper. The forbidden-subdiagram characterization conjecture. There is a nice infinite forbidden-subdiagram characterization of -terminal-minimality. The source presents this as a preliminary expectation and gives no precise forbidden family or proof, so the conjecture remains open.
Sources & referencesView supporting material
Primary source
Lukas Nabergall, “The combinatorics of a tree-like functional equation for connected chord diagrams”, arXiv:2104.02296 (2021).
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.