ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r≥3r \geq 3 and let S⊂Π(n,d,r)\mathscr{S} \subset \Pi(n,d,r) denote the collection of set partitions that can be made noncrossing by applying at most r−3r-3 adjacent transpositions. For each set partition γ∈S\gamma \in \mathscr{S}, order its blocks in any way to obtain a corresponding ordered set partition πγ\pi_\gamma. Web-basis conjecture. The set

{[πγ]r:γ∈S}\{[\pi_\gamma]_r: \gamma \in \mathscr{S}\}

is linearly independent. The claim extends the preceding linear-independence theorem: for r=3r=3, the relevant set consists of the noncrossing partitions and the result is already known, while the conjecture has been verified computationally for some higher values of rr.

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.