webcal
 Month:  Jun 2018 Jul 2018 Aug 2018 Sep 2018 Oct 2018 Nov 2018 Dec 2018 Jan 2019 Feb 2019 Mar 2019 Apr 2019 May 2019 Jun 2019 Jul 2019 Aug 2019 Sep 2019 Oct 2019 Nov 2019 Dec 2019 Jan 2020 Feb 2020 Mar 2020 Apr 2020 May 2020 Jun 2020 Week:  Nov 5 - Nov 9 Nov 12 - Nov 16 Nov 19 - Nov 23 Nov 26 - Nov 30 Dec 3 - Dec 7 Dec 10 - Dec 14 Dec 17 - Dec 21 Dec 24 - Dec 28 Dec 31 - Jan 4 Jan 7 - Jan 11 Jan 14 - Jan 18 Jan 21 - Jan 25 Jan 28 - Feb 1 Feb 4 - Feb 8 Feb 11 - Feb 15 Year:  2016 2017 2018 2019 2020 2021 2022 2023 Login

G. Arunkumar

 Description: Speaker: G. Arunkumar Date & Time : Monday Feb 26, at 11:30am Venue: Ramanujan Hall Title: Chromatic polynomials and Lie algebras Abstract: In this talk, I will prove a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. I will show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed formula for certain root multiplicities. As an application, using the combinatorics of Lyndon words, we construct a basis for the root spaces corresponding to these roots and determine the Hilbert series in the case when all simple roots are imaginary. In last ten minutes, We will talk about chromatic discriminant of a graph: The absolute value of the coefficient of q in the chromatic polynomial of a graph G is known as the chromatic discriminant of G and is denoted $\alpha(G)$. We start with a brief survey on many interesting algebraic and combinatorial interpretations of $\alpha(G)$. We use two of these interpretations (in terms of acyclic orientations and spanning trees) to give two bijective proofs for a recurrence formula of $\alpha(G)$ which comes from the Peterson recurrence formula for root multiplicities of Kac-Moody algebras. Location: Ramanujan Hall, Department of Mathematics Date: Monday, February 26, 2018 Time: 11:30am IST Access: Public