Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRenormalization group-like proof of the universality of the Tutte polynomial for matroids
211
0
0.0
(
0
)
Added by
Adrian Tanasa
Publication date
2013
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper we give a new proof of the universality of the Tutte polynomial for matroids. This proof uses appropriate characters of Hopf algebra of matroids, algebra introduced by Schmitt (1994). We show that these Hopf algebra characters are solutions of some differential equations which are of the same type as the differential equations used to describe the renormalization group flow in quantum field theory. This approach allows us to also prove, in a different way, a matroid Tutte polynomial convolution formula published by Kook, Reiner and Stanton (1999). This FPSAC contribution is an extended abstract.
rate research
Read More
Identities obtained by elementary finite Fourier analysis are used to derive a variety of evaluations of the Tutte polynomial of a graph G at certain points (a,b) where (a-1)(b-1) equals 2 or 4. These evaluations are expressed in terms of eulerian subgraphs of G and the size of subgraphs modulo 2,3,4 or 6. In particular, a graph is found to have a nowhere-zero 4-flow if and only if there is a correlation between the event that three subgraphs A,B,C chosen uniformly at random have pairwise eulerian symmetric differences and the event that the integer part of (|A| + |B| + |C|) / 3 is even. Some further evaluations of the Tutte polynomial at points (a,b) where (a-1)(b-1) = 3 are also given that illustrate the unifying power of the methods used. The connection between results of Matiyasevich, Alon and Tarsi and Onn is highlighted by indicating how they may all be derived by the techniques adopted in this paper.
In [A polynomial invariant of graphs on orientable surfaces, Proc. Lond. Math. Soc., III Ser. 83, No. 3, 513-531 (2001)] and [A polynomial of graphs on surfaces, Math. Ann. 323, 81-96 (2002)], Bollobas and Riordan generalized the classical Tutte polynomial to graphs cellularly embedded in surfaces, i.e. ribbon graphs, thus encoding topological information not captured by the classical Tutte polynomial. We provide a `recipe theorem for their new topological Tutte polynomial, R(G). We then relate R(G) to the generalized transition polynomial Q(G) via a medial graph construction, thus extending the relation between the classical Tutte polynomial and the Martin, or circuit partition, polynomial to ribbon graphs. We use this relation to prove a duality property for R(G) that holds for both oriented and unoriented ribbon graphs. We conclude by placing the results of Chumutov and Pak [The Kauffman bracket and the Bollobas-Riordan polynomial of ribbon graphs, Moscow Mathematical Journal 7(3) (2007) 409-418] for virtual links in the context of the relation between R(G) and Q(R).
This is a survey on the exact complexity of computing the Tutte polynomial. It is the longer 2017 version of Chapter 25 of the CRC Handbook on the Tutte polynomial and related topics, edited by J. Ellis-Monaghan and I. Moffatt, which is due to appear in the first quarter of 2020. In the version to be published in the Handbook the Sections 5 and 6 are shortened and made into a single section.
We construct a polynomial-time algorithm that given a graph $X$ with $4p$ vertices ($p$ is prime), finds (if any) a Cayley representation of $X$ over the group $C_2times C_2times C_p$. This result, together with the known similar result for circulant graphs, shows that recognising and testing isomorphism of Cayley graphs over an abelian group of order $4p$ can be done in polynomial time.
We introduce and study the notion of the $G$-Tutte polynomial for a list $mathcal{A}$ of elements in a finitely generated abelian group $Gamma$ and an abelian group $G$, which is defined by counting the number of homomorphisms from associated finite abelian groups to $G$. The $G$-Tutte polynomial is a common generalization of the (arithmetic) Tutte polynomial for realizable (arithmetic) matroids, the characteristic quasi-polynomial for integral arrangements, Branden-Mocis arithmetic version of the partition function of an abelian group-valued Potts model, and the modified Tutte-Krushkal-Renhardy polynomial for a finite CW-complex. As in the classical case, $G$-Tutte polynomials carry topological and enumerative information (e.g., the Euler characteristic, point counting and the Poincare polynomial) of abelian Lie group arrangements. We also discuss differences between the arithmetic Tutte and the $G$-Tutte polynomials related to the axioms for arithmetic matroids and the (non-)positivity of coefficients.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
