ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let λ\lambda be a partition, and let Skeleton(λ)Skeleton(\lambda) be the skeleton whose vertices are standard tableaux of shape λ\lambda. For each positive integer ss, let HsH_s be the induced subgraph whose vertices are the standard tableaux with descent compositions having ss parts. The fixed-descent skeleton conjecture. Each HsH_s is either a disjoint union of singleton vertices, a disjoint union of chains, or a disjoint union of even cycles, with or without two extra attached vertices giving the sources and sinks. Multiple edges occur only between induced subgraphs associated to different descent-composition lengths. This predicts a restricted and structured form for the parts of the skeleton obtained by fixing the number of descents.

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.