ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG) be a path graph with nn vertices, and for 1≤h≤⌊n/2⌋1\leq h\leq \left\lfloor n/2\right\rfloor let ζ(h)=12⋯(n−h)n(n−1)⋯(n−h+1)\zeta^{(h)}=12\cdots(n-h)n(n-1)\cdots(n-h+1). For a permutation π=π1⋯πn∈Sn\pi=\pi_1\cdots\pi_n\in S_n, write

TPro⁡π=τπnτπn−1⋯τπ1 ⁣:ΛG→ΛG.\operatorname{TPro}_\pi=\tau_{\pi_n}\tau_{\pi_{n-1}}\cdots\tau_{\pi_1}\colon\Lambda_G\to\Lambda_G.

Toric promotion order conjecture. If GG is a path graph with nn vertices and 1≤h≤⌊n/2⌋1\leq h\leq \left\lfloor n/2\right\rfloor, then the operator TPro⁡ζ(h) ⁣:ΛG→ΛG\operatorname{TPro}_{\zeta^{(h)}}\colon\Lambda_G\to\Lambda_G has order h(n−h)h(n-h). This generalizes the known h=1h=1 case, which follows from the forest theorem mentioned in the source. The conjecture concerns the orbit structure of toric promotion operators for path graphs.

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.