Chromatic Symmetric Functions and Polynomial Invariants of Trees
Statement
If , are and necessarily related by switching?
Context
Candidate 1 of the open problems stated in "Chromatic Symmetric Functions and Polynomial Invariants of Trees", extracted for the Scalable Mathematical Discovery run.
People
Attempts
No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
NEW
Problem: For finite compositions , with defined by
does imply that are related by switching of irreducible factors under the Billera–Thomas–van Willigenburg composition operation ?
Result: No. A counterexample is
Let . For a composition , the coefficient of in is
where is the number of ends of not touching an end of . This follows by summing over all coarsenings in which appears as one block.
For both and , the nonzero coefficients are:
and all other coefficients vanish. Hence .
They are not related by switching. Indeed, switching preserves the -polynomial
But in , the coarsening
contributes the monomial
No coarsening of contributes this monomial: the two blocks of sum would have to be the two singleton 's in positions and , forcing the intervening to be a singleton block, which is impossible for this monomial. Thus , so are not related by switching.
Verification audit: the compositions are ordinary nonempty positive compositions, the equality is equality in the rational function ring generated by , and the conclusion directly refutes Question 1.
Citation: The question is Aliste-Prieto–Martin–Wagner–Zamora, “Chromatic symmetric functions and polynomial invariants of trees,” arXiv:2402.10333v2, Question 1. The switching/-polynomial characterization is from Billera–Thomas–van Willigenburg, Adv. Math. 204 (2006), and Aliste-Prieto–Zamora, Discrete Math. 315 (2014).
Reviews
1 machine checkNo person has reviewed this attempt. 1 machine check below — a machine check is not human verification.
Machine check · not human verification
machine: correctscope Full solution as submitted; SMD novelty classification TYPE1
PASS
The proposed counterexample attacks the exact Question 1. The formula for the coefficient of in is correct: summing over coarsenings in which a fixed contiguous interval appears as a block gives . The listed coefficient table is consistent for both
so .
The non-switching argument is also valid: switching preserves the -polynomial, while the monomial occurs in and cannot occur in , since the two blocks would force the intervening in to be a singleton block. Thus , so they are not related by switching.
I found no indication in the cited paper’s current version that this specific converse has already been resolved.
Novelty assessment
TYPE1
Classification rationale: The counterexample appears genuinely new, but it is a small finite counterexample to a narrow technical question in a recent paper. The proof is essentially an explicit coefficient check plus a short obstruction to switching. It is useful and worth communicating to the authors, but by itself likely does not support a standalone standard-journal paper unless expanded with a conceptual construction, minimality proof, or infinite family.
Literature check: I found no public source containing this counterexample or another resolution of Question 1. The current arXiv v2 of the source paper still lists Question 1 in §7.3 and states only that the answer is affirmative computationally up to 18 vertices. The arXiv note that “one open question” was resolved by Michael Tang concerns the different GDP-vs-HDP strictness question in §7.2, not the ζ/switching converse. Searches for the exact compositions, the exact prefix-sum sets, “ζ(alpha)=ζ(beta)” with switching/compositions/caterpillars, and related L-polynomial/restricted-U-polynomial terminology did not reveal a prior reference.
Citation: No prior citation found for the counterexample. Source question: Aliste-Prieto, Martin, Wagner, Zamora, “Chromatic symmetric functions and polynomial invariants of trees,” arXiv:2402.10333v2, §7.3, Question 1.
No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.