The Redei--Berge symmetric function of a directed graph
Abstract
Let be a digraph with vertices, where each arc is a pair of two vertices. We study the \emph{Redei--Berge symmetric function} , defined as the quasisymmetric function% Here, the sum ranges over all lists that contain each vertex of exactly once, and the corresponding addend is% (an instance of Gessel's fundamental quasisymmetric functions). While is a specialization of Chow's path-cycle symmetric function, which has been studied before, we prove some new formulas that express in terms of the power-sum symmetric functions. We show that is always -integral, and furthermore is -positive whenever has no -cycles. When is a tournament, can be written as a polynomial in with nonnegative integer coefficients. By specializing these results, we obtain the famous theorems of Redei and Berge on the number of Hamiltonian paths in digraphs and tournaments, as well as a modulo- refinement of Redei's theorem.
Keywords
Cite
@article{arxiv.2307.05569,
title = {The Redei--Berge symmetric function of a directed graph},
author = {Darij Grinberg and Richard P. Stanley},
journal= {arXiv preprint arXiv:2307.05569},
year = {2023}
}
Comments
66 pages. Draft (proofs in Sections 3-8 are still somewhat of an outline), posted for reference. Detailed version (for Section 2) as ancillary file