Saved in:
Bibliographic Details
Main Author: Marmor, Avichai
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2307.09894
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911701584052224
author Marmor, Avichai
author_facet Marmor, Avichai
contents We prove that the set of matchings with a fixed number of unmatched vertices is Schur-positive with respect to the set of short chords. Two proofs are presented. The first proof applies a new combinatorial criterion for Schur-positivity, while the second is bijective. The coefficients in the Schur expansion are derived, and interpreted in terms of Bessel polynomials. We present a Knuth-like equivalence relation on matchings, and show that every equivalence class corresponds to an irreducible representation. We proceed to find various refined Schur-positive sets, including the set of matchings with a prescribed crossing number and the set of matchings with a given number of pairs of intersecting chords. Finally, we characterize all the matchings $m$ such that the set of matchings avoiding $m$ is Schur-positive.
format Preprint
id arxiv_https___arxiv_org_abs_2307_09894
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Schur-Positivity of Short Chords in Matchings
Marmor, Avichai
Combinatorics
We prove that the set of matchings with a fixed number of unmatched vertices is Schur-positive with respect to the set of short chords. Two proofs are presented. The first proof applies a new combinatorial criterion for Schur-positivity, while the second is bijective. The coefficients in the Schur expansion are derived, and interpreted in terms of Bessel polynomials. We present a Knuth-like equivalence relation on matchings, and show that every equivalence class corresponds to an irreducible representation. We proceed to find various refined Schur-positive sets, including the set of matchings with a prescribed crossing number and the set of matchings with a given number of pairs of intersecting chords. Finally, we characterize all the matchings $m$ such that the set of matchings avoiding $m$ is Schur-positive.
title Schur-Positivity of Short Chords in Matchings
topic Combinatorics
url https://arxiv.org/abs/2307.09894