The Redei--Berge symmetric function of a directed graph

Abstract

Let D=( V,A) be a digraph with n vertices, where each arc a∈ A is a pair ( u,v) of two vertices. We study the Redei--Berge symmetric function UD, defined as the quasisymmetric function% \[ Σ L*Des( w,D) ,\ n∈*QSym. \] Here, the sum ranges over all lists w=( w1,w2,… ,wn) that contain each vertex of D exactly once, and the corresponding addend is% \[ L*Des( w,D) ,\ n:=Σi1≤ i2≤·s≤ in;\p<ip+1 for each p satisfying ( wp,wp+1) ∈ Axi1xi2·s xin% \] (an instance of Gessel's fundamental quasisymmetric functions). While UD is a specialization of Chow's path-cycle symmetric function, which has been studied before, we prove some new formulas that express UD in terms of the power-sum symmetric functions. We show that UD is always p-integral, and furthermore is p-positive whenever D has no 2-cycles. When D is a tournament, UD can be written as a polynomial in p1,2p3,2p5,2p7,… 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-4 refinement of Redei's theorem.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…