Date: 21 November 2026. Research issue: #180.
Status: complete proposed proof of the intended monomial-product assertion in Conjecture 5.7, with two internal mathematical reviews and a documented public-source priority audit. Section 6 also proves the hook-coefficient formula stated immediately after that conjecture. These notes remain unrefereed. This note does not prove the separate Schur-positivity conjecture, Conjecture 5.4.
1. Source and indexing
The primary source is J.-C. Novelli and J.-Y. Thibon, Noncommutative chromatic quasi-symmetric functions, Macdonald polynomials, and the Yang–Baxter equation, arXiv:2502.09072v2, 4 November 2025; published in Journal of Combinatorial Theory, Series A 220 (2026), 106130, DOI 10.1016/j.jcta.2025.106130.
For partitions , write the Schur coefficient of the multi- modified Macdonald function as
Let count standard tableaux of shape in French notation in which 2 is above 1. Put . The intended conjecture is
Here . Equivalently the monomial inside parentheses is the product of over cells in column , row , counting rows from the bottom.
There is an indexing error in the source's equation (88): its exponent and the following tableau shape are printed as and . They must be and , where indexes the Schur coefficient. This is forced by the source's own example immediately afterward: the coefficient of in has monomial product , with , whereas . It is also forced by the coefficient of , which is 1. We prove the full intended identity (2); we do not use the typographical error as a conjecture disproof.
The signed multiplicities can be treated as integers in a formal Laurent monomial product. No assertion that they are all nonnegative is used. Thus the proof is independent of Conjecture 5.4.
2. A single comparison identity
For , let
be Gessel's fundamental quasisymmetric function. In particular,
where words have positive integer entries, and equal entries are standardized from left to right. Formula (3) follows directly by placing the entries in the order of increasing -label: they are weakly increasing, with a strict increase whenever the next label occurs earlier in the word.
For every pair of positions ,
Indeed, left-to-right standardization gives for . The other letters are unrestricted. Therefore the left side equals
Also . These statements can be read in any finite alphabet; hence they hold as symmetric-function identities.
3. The exact filling formula for the source's modified function
We derive the needed formula from the source's Definition 5.3, equation (57), rather than assume that its untilded and modified conventions agree.
The graph conventions are those of Haglund and Wilson, Macdonald polynomials and chromatic quasisymmetric functions, EJC 27(3) (2020), P3.37, Definitions 1–3 and 14, pages 3–4 and 7, DOI 10.37236/9011. Draw in French notation, with row lengths . Number its cells by reading rows from top to bottom, and within each row from left to right. Let be the attacking graph. Its edges join:
- two cells in the same row;
- an upper cell to a cell in the immediately lower row strictly to its left.
All edges are written in reading order. Let be the cells outside the bottom row. For , let be the cell immediately below it; precedes in reading order. Define
and
The required expansion is
Here is an explicit derivation. In the source, adds the vertical edges to , and Lemma 4.2, equation (35), expands
The commutative image of is . For one optional vertical edge, the sum of the included and excluded contributions in Definition 5.3 is
After division by , this is exactly
The global prefactor in (57) is , where
Thus multiplying (6) over and canceling gives (5). This establishes the modified convention directly and removes the apparent ambiguity between equations (31), (32), and (50) in the source.
4. First derivatives at the unit parameter point
Write for , and let
The attacking graph has same-row edges. For every row , a cell in column attacks cells in the next row below, so the cross-row count is
Hence . Differentiate (5), then apply (4) separately to every graph edge and every vertical edge. This gives
For the -derivative, each column of height contributes exactly once when , because the leg labels of its nonbottom cells are . There are columns of height at least . Consequently,
Equations (9)–(10), together with , give the stronger first-order identity
where . Only finitely many parameters occur for fixed .
5. Extracting Schur coefficients
Repeated multiplication by adds one cell at each step by the one-cell Pieri rule. Since ,
Explicitly, a chain from the vertical two-cell shape to records the positions of entries of a standard tableau whose entries 1 and 2 initially occupy the bottom-left cell and the cell above it. This is a bijection with the tableaux defining .
Taking -coefficients in (9) and (10) gives
The exponent of in the left side of (2) is the first sum in (13), and the exponent of is the second. Thus every exponent agrees and (2) follows. For , both sides are 1, so the boundary case also holds.
This proves the intended Conjecture 5.7 for every pair of partitions and all independent parameters. No restriction on the number of rows, columns, or partition size is present.
6. The source's hook-coefficient formula
The final sentence following Conjecture 5.7 proposes a second identity. Let
The symbol removes one copy of the weight 1 belonging to the bottom-left cell. For every , the proposed formula is
We prove the stronger plethystic evaluation
Here is a difference of alphabets: . Theorem 3.2, equation (20), of Novelli–Thibon gives the Carlsson–Mellit evaluation, with incoming degree . After the inversion of in the source's modified LLT function, its commutative image satisfies
The first equality uses for a homogeneous symmetric function of degree . The second uses the cited evaluation and . Thus the incoming, rather than outgoing, degree convention is explicit.
Apply (16) to each optional-edge term of Definition 5.3. A vertical edge from to the cell immediately below it changes only the incoming degree of . Write , , and . Its local sum is
Each cell is the lower endpoint of at most one optional edge, so these local sums multiply independently. The factors cancel the global .
Suppose is in column and the row immediately above has length . The incoming attacking edges consist of the earlier cells in its own row and the upper cells strictly to its right. Therefore , while the arm of is ; hence . If has no cell above it, its incoming degree is simply .
In a column of height , the lower cell in row receives the label ; the top cell receives no optional factor, which is represented by . The labels over the column are therefore . Reversing them in the product gives exactly , while is constant in that column. This proves (15).
Finally, the Schur specialization vanishes unless is a hook, and
The bottom-left cell supplies the factor on the right side of (15). Dividing by it and comparing powers of proves (14) for every partition, including . This supplement is part of the same named package and is not counted separately.
7. Scope and audit record
Conjecture 5.7 is about first moments of exponent vectors. Its proof permits signed coefficients and therefore does not settle Conjecture 5.4. The supplement gives individual Schur coefficients only for hook shapes. No general claim is made about every Yang–Baxter trace mentioned before Conjecture 5.7; the displayed conjecture's defined family is .
The argument uses the source's existing Definition 5.3, Lemma 4.2 and Theorem 3.2 with full attribution. The deductions are the universal first-order identity (11), its consequence (2), and the plethystic evaluation (15) giving (14). A separate source-audit document records the prior searches. Exact finite checks are included only to detect convention mistakes; the proof is the all-size argument (3)–(17).