English

The Redei--Berge symmetric function of a directed graph

Combinatorics 2023-07-13 v1

Abstract

Let D=(V,A)D=\left( V,A\right) be a digraph with nn vertices, where each arc aAa\in A is a pair (u,v)\left( u,v\right) of two vertices. We study the \emph{Redei--Berge symmetric function} UDU_{D}, defined as the quasisymmetric function% LDes(w,D), nQSym. \sum L_{\operatorname*{Des}\left( w,D\right) ,\ n}\in\operatorname*{QSym}. Here, the sum ranges over all lists w=(w1,w2,,wn)w=\left( w_{1},w_{2},\ldots ,w_{n}\right) that contain each vertex of DD exactly once, and the corresponding addend is% LDes(w,D), n:=i1i2in;ip<ip+1 for each p satisfying (wp,wp+1)Axi1xi2xin L_{\operatorname*{Des}\left( w,D\right) ,\ n}:=\sum_{\substack{i_{1}\leq i_{2}\leq\cdots\leq i_{n};\\i_{p}<i_{p+1}\text{ for each }p\text{ satisfying }\left( w_{p},w_{p+1}\right) \in A}}x_{i_{1}}x_{i_{2}}\cdots x_{i_{n}}% (an instance of Gessel's fundamental quasisymmetric functions). While UDU_{D} is a specialization of Chow's path-cycle symmetric function, which has been studied before, we prove some new formulas that express UDU_{D} in terms of the power-sum symmetric functions. We show that UDU_{D} is always pp-integral, and furthermore is pp-positive whenever DD has no 22-cycles. When DD is a tournament, UDU_{D} can be written as a polynomial in p1,2p3,2p5,2p7,p_{1},2p_{3},2p_{5},2p_{7},\ldots 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-44 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

R2 v1 2026-06-28T11:27:36.156Z