Room 201, School of Arts and Sciences
Central Campus
ABSTRACT: Let A be an n × n matrix over a commutative ring K with characteristic polynomial pA(λ) = λn + d1λn−1 + ⋯ + dₙ. The Trace Cayley–Hamilton theorem states that, for every integer r ≥ 1, we have Tr(Ar) + Tr(Ar−1)d1 + ⋯ + Tr(Ar−(n−1))dₙ₋₁+ Tr(Ar−n)dₙ = 0, if r > n, otherwise, we have Tr(Ar) + Tr(Ar−1)d₁ + ⋯ + Tr(A1)dᵣ₋₁ + r dᵣ = 0, if 1 ≤ r ≤ n.
For r ≥ n, this follows from the classical Cayley–Hamilton theorem by multiplying pA(A) = O by Ar−n and taking traces. For r < n, however, the identity does not follow in this way.
In this talk we give a combinatorial proof that covers all r at once. To A we associate a weighted digraph (A). In this graph, Tr(Ak) is the total weight of the closed walks of length k, and each coefficient dₖ is a signed sum over the linear subdigraphs (collections of vertex-disjoint cycles) of length k. The theorem then becomes a statement about signed pairs (c, γ), where c is a closed walk and γ is a linear subdigraph. We construct an explicit sign-reversing involution on these pairs. No prior knowledge beyond basic linear algebra is needed.
Sudip Bera is an Assistant Professor in the Faculty of Mathematics at Dhirubhai Ambani University, Gandhinagar, a position he has held since January 2023. He received his PhD from Visva-Bharati University for a thesis on algebraic properties of power graphs. He then held a postdoctoral fellowship at the Indian Institute of Science, Bangalore (2019–2022), followed by a visiting fellowship at TIFR Mumbai and a postdoctoral fellowship at the Harish-Chandra Research Institute, Prayagraj. His research interests lie in combinatorics—especially algebraic and bijective combinatorics and combinatorial matrix theory—and in algebraic and structural graph theory.