Fourientations and the Tutte polynomial
نویسندگان
چکیده
منابع مشابه
Fourientations and the Tutte polynomial
for α, γ ∈ {0, 1, 2} and β , δ ∈ {0, 1}. We introduce an intersection lattice of 64 cut–cycle fourientation classes enumerated by generalized Tutte polynomial evaluations of this form. We prove these enumerations using a single deletion–contraction argument and classify axiomatically the set of fourientation classes to which our deletion–contraction argument applies. This work unifies and exten...
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملThe Tutte polynomial
This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence of randomized approximation schemes. © 1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 210–...
متن کاملThe multivariate arithmetic Tutte polynomial
We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, and a quasi-polynomial that interpolates between the two. We provide a generalized Fortuin-Kasteleyn representation for representable arithmetic matroids, with applications to arithmetic colorings and flows. We give a new proof of the positivity of the coefficients of the arithmetic Tutte polynomi...
متن کاملThe Tutte Polynomial and Linear Codes
A linear code of length n and dimension k is called a [n, k]-code. If G is a r × n matrix over GF (q), whose rows form a basis for C, then G is a generator matrix for C. As with every matrix, there is an associated matroid, which in this case depends only on C. Hence the matroid is M(C). The dual code, C∗, of C, is defined by C∗ = {v ∈ GF (q)n|v · w = 0 ∀w ∈ C}. If C is a [n, k]-code, then C∗ i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in the Mathematical Sciences
سال: 2017
ISSN: 2197-9847
DOI: 10.1186/s40687-017-0107-z