Graph polynomials and Tutte-Grothendieck invariants: an application of elementary finite Fourier analysis

Simple item page
dc.creatorGoodall, Andrew
dc.date2008-06-30
dc.date.accessioned2026-07-07T09:47:26Z
dc.date.available2026-07-07T09:47:26Z
dc.descriptionThis paper is based on a series of talks given at the Patejdlovka Enumeration Workshop held in the Czech Republic in November 2007. The topics covered are as follows. The graph polynomial, Tutte-Grothendieck invariants, an overview of relevant elementary finite Fourier analysis, the Tutte polynomial of a graph as a Hamming weight enumerator of its set of tensions (or flows), and a description of a family of polynomials containing the graph polynomial which yield Tutte-Grothendieck invariants in a similar way.
dc.description18 pages, based on talks given at the Patejdlovka Enumeration Workshop (19-23 November 2007)
dc.identifierhttps://arxiv.org/abs/0806.4848
dc.identifierhttp://arxiv.org/abs/0806.4848
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/163876
dc.subjectCombinatorics
dc.subject05C99
dc.titleGraph polynomials and Tutte-Grothendieck invariants: an application of elementary finite Fourier analysis
dc.typetext

Files

Collections

arXiv