Linear-order conjecture for reduced cycle graphs
Statement
Let be a group generated as a monoid by a conjugation-closed subset , let , and let be the generators appearing in reduced -factorizations of . Let be the factorization poset, let be a -compatible order of , and let denote the reduced cycle graph associated with the subposet at . Reduced-cycle-graph conjecture. If is totally chain-connected and admits a -compatible order , then for every , the reduced cycle graph induces a linear order. By the preceding proposition, this would imply the conjectured total well-coveredness property.
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.