OpenFrontiers
← Back to the index
OP-9602Status unassessedCombinatorics

Tableaux problem 43

Tableaux problem 43

Inferred from the community field; finer classification has not been reviewed.

Specialist source · status unassessedAs of 2026-09-10Source & evidence ↓

Problem statement

43.A central point of [LiangSag2024a]*Th. 3.1 is that for any partition λ=(λ1,λ2,…λℓ(λ))\lambda=(\lambda_{1},\lambda_{2},\ldots\lambda_{\ell(\lambda)}) with λ1≥λ2≥⋯≥λℓ(λ)>0\lambda_{1}\geq\lambda_{2}\geq\cdots\geq\lambda_{\ell(\lambda)}>0, if we define λ+i=(λ1+i,λ2+i,…,λℓ(λ)+i)\lambda+i=(\lambda_{1}+i,\lambda_{2}+i,\ldots,\lambda_{\ell(\lambda)}+i), then the set of partitions (λ+i)i≥0(\lambda+i)_{i\geq 0} has the property that for every nn, the set of intervals in the partition lattice {[λ+n,λ+(n+k)] ∣ k≥0}\{[\lambda+n,\lambda+(n+k)]\,|\,k\geq 0\} are all isomorphic. This series of elements allows their Order Ideal Lemma (Lem. 1.1) to be applied.

Similar series of elements can be found in other distributive Fomin lattices, the lattice of strict partitions, the lattice of kk-row partitions, and the cylindric partitions. This is surprising since this property does not seem to be forced by the hypotheses of distributive Fomin lattices.

Can this observation be extended to the Young–Fibonacci lattices? That is, are there sequences of elements in YFr\mathbb{YF}_{r}, (pi)i≥0(p_{i})_{i\geq 0} for which for every nn, the set of intervals {[pn,pn+k] ∣ k≥0}\{[p_{n},p_{n+k}]\,|\,k\geq 0\} are all isomorphic? If there are, can they be used to prove an analog of their Th. 3.1? If so, does this provide a clue to a “semi-distributive” property of YFr\mathbb{YF}_{r}?

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

Source snapshot inspected on 10 September 2026. Subsequent research status and the accuracy of source formalizations have not been independently certified.

Dale R. Worley, version 3 (5 April 2026). Source citation keys are retained even where the arXiv HTML does not resolve its bibliography.

CC BY 4.0; Dale R. Worley. HTML converted to Markdown with attribution and source links.

References
  1. [1]Tableaux — A notebook of open problems — Tableaux problem 43 link
  2. [2]Creative Commons Attribution 4.0 International link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.