ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a group generated as a monoid by a conjugation-closed subset AA, let c∈G\mathfrak{c}\in G, and let AcA_{\mathfrak{c}} be the generators appearing in reduced AA-factorizations of c\mathfrak{c}. Let Pc(G,A)\mathcal{P}_{\mathfrak{c}}(G,A) be the factorization poset, let ≺\prec be a c\mathfrak{c}-compatible order of AcA_{\mathfrak{c}}, and let Γ≺(Pg)\Gamma_{\prec}(\mathcal{P}_{g}) denote the reduced cycle graph associated with the subposet at gg. Reduced-cycle-graph conjecture. If Pc(G,A)\mathcal{P}_{\mathfrak{c}}(G,A) is totally chain-connected and admits a c\mathfrak{c}-compatible order ≺\prec, then for every g∈Pc(G,A)g\in\mathcal{P}_{\mathfrak{c}}(G,A), the reduced cycle graph Γ≺(Pg)\Gamma_{\prec}(\mathcal{P}_{g}) 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.