A negative Schur coefficient for products of two chains
Kai Zhang
Abstract
We prove that the product of chains m×n is not Schur positive whenever n4 and m3n-1. Writing m=n+k, we exhibit a negative coefficient indexed by (2n+k-1,2n+k-3,…,k+5,k,k,4) and evaluate it explicitly as (n-2)! times a polynomial of degree three in k. Our argument refines the chain-partition method of Li, Qiu, Yang, and Zhang: rank capacity forces n-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 n3, m n+5, and for n=2, m8.
Create a lesson
Related papers
Generic solutions to symmetric linear equations
Bryce Frederickson, Liana Yepremyan
On Colorful Kruskal--Katona Theorems
Ting-Wei Chao, Maya Sankar, Hung-Hsun Hans Yu
An optimal constant for vector balancing with permutations
Jonathan Niles-Weed, Shay Sadovsky, Jacob Shkrob
Typical intersecting families at n=2k+1 and n=2k+2
Lina Li
Linear arboricity conjecture for infinite graphs
Leandro Aurichi, Rodrigo Santos Monteiro, Caio Fernando Rodrigues
Linear circumference in vertex-transitive graphs
Jie Ma, Ziyuan Zhao