Ladder generalization of the cusp irreducibility criterion
Statement
Let be a ladder multisegment, let , and let , , , and denote the combinatorial and irreducibility conditions in Proposition~. For the one-segment multisegment , that proposition identifies with and with .
Ladder generalization conjecture. The same equivalences remain true when is replaced by any ladder .
This would extend the known criterion from a single segment to arbitrary ladders. The source gives no resolution status.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.