Indexed metadata

A negative Schur coefficient for products of two chains

Kai Zhang

Source record

Source: arXiv

Published: Oct 1, 2026

arXiv: 2610.01617

Open original source ↗

Source abstract

We prove that the product of chains m×n\mathbf{m}\times\mathbf{n} is not Schur positive whenever n≥4n\ge4 and m≥3n−1m\ge3n-1. Writing m=n+km=n+k, we exhibit a negative coefficient indexed by (2n+k−1,2n+k−3,…,k+5,k,k,4)(2n+k-1,2n+k-3,\ldots,k+5,k,k,4) and evaluate it explicitly as (n−2)!(n-2)! times a polynomial of degree three in kk. Our argument refines the chain-partition method of Li, Qiu, Yang, and Zhang: rank capacity forces n−2n-2 long chains, and the remaining three chains are counted by separating a middle interval with fixed row coordinates from two bounded boundary regions. Together with their theorem and the known cases of widths two and three, this shows that these products are not Schur positive for n≥3n\ge3, m≥n+5m\ge n+5, and for n=2n=2, m≥8m\ge8.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A negative Schur coefficient for products of two chains — Mathematical Frontier Network