YoVDO

The Redei-Berge Symmetric Function of a Directed Graph

Offered By: Institut des Hautes Etudes Scientifiques (IHES) via YouTube

Tags

Graph Theory Courses Combinatorics Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the fascinating world of graph theory and symmetric functions in this 44-minute lecture by Darij Grinberg from the Department of Mathematics at Drexel University. Delve into the intriguing property of tournaments observed by Laszlo Redei in 1934, where each tournament has an odd number of Hamiltonian paths. Examine Chow's path-cycle symmetric function of directed graphs, introduced in 1996, and its applications in rook theory. Investigate new nontrivial expansions of this function in terms of the power-sum basis when the y-variables are set to 0. Discover the p-positivity of the function for directed graphs without 2-cycles. Learn how these expansions lead to a reproof of Redei's theorem and its refinement to a mod-4 congruence. Gain insights into this joint work with Richard P. Stanley, presented at the Institut des Hautes Etudes Scientifiques (IHES).

Syllabus

Darij Grinberg - The Redei–Berge symmetric function of a directed graph


Taught by

Institut des Hautes Etudes Scientifiques (IHES)

Related Courses

Analytic Combinatorics, Part I
Princeton University via Coursera
Analytic Combinatorics, Part II
Princeton University via Coursera
Analytic Combinatorics
Princeton University via Coursera
Principles of Computing (Part 1)
Rice University via Coursera
Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera