English

Classifying the near-equality of ribbon Schur functions

Combinatorics 2020-08-11 v2

Abstract

We consider the problem of determining when the difference of two ribbon Schur functions is a single Schur function. We fully classify the five infinite families of pairs of ribbon Schur functions whose difference is a single Schur function with corresponding partition having at most two parts at least 22. We also prove an identity for differences of ribbon Schur functions and we determine some necessary conditions for such a difference to be Schur-positive, depending on the distribution of 11's and the end row lengths.

Keywords

Cite

@article{arxiv.1810.00533,
  title  = {Classifying the near-equality of ribbon Schur functions},
  author = {Foster Tom},
  journal= {arXiv preprint arXiv:1810.00533},
  year   = {2020}
}

Comments

24 pages