AbstractLet T(Lm,n;x,y) be the Tutte polynomial of the square lattice Lm,n, for integers m,n∈Z>0. Using a family of Tutte polynomial inequalities established by the author in a previous work, we study the analytical properties of the sequences (T(Lm,n;x,y)1/mn:n∈Z>0) for a fixed m∈Z>0, and (T(Ln,n;x,y)1/n2:n∈Z>0), in the region x,y⩾1. We show that these sequences are monotonically increasing when (x−1)(y−1)>1. We also compute lower bounds for these limits when (x−1)(y−1)>1, and upper bounds when (x−1)(y−1)<1. At the point (x=2, y=1), where the Tutte polynomial is known to count the number of forests, we compute limn→∞T(Ln,n;2,1)1/n2⩽3.705603, which improves upon the previous best upper bound of 3.74101 obtained by Calkin, Merino, Noble and ...
It is known that evaluating the Tutte polynomial, T(G; x, y), of a graph, G, is #P-hard at all but e...
Let M be a matroid and let t(M; ξ, η) be the Tutte polynomial of M. The lower and upper bound of t(M...
AbstractWe prove that the Tutte polynomial of a coloopless paving matroid is convex along the portio...
AbstractLet T(Lm,n;x,y) be the Tutte polynomial of the square lattice Lm,n, for integers m,n∈Z>0. Us...
International audienceLet M be a matroid without loops or coloops and let T (M ; x, y) be its Tutte ...
International audienceLet M be a matroid without loops or coloops and let T (M ; x, y) be its Tutte ...
In a recent paper Merino and Welsh (1999) studied several counting problems on the square lattice $L...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
We prove that if a matroid M contains two disjoint bases (or, dually, if its ground set is the union...
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings b...
AbstractWe prove that the Tutte polynomial of a coloopless paving matroid is convex along the portio...
AbstractLet k be a fixed, positive integer. We give an algorithm which computes the Tutte polynomial...
We prove that if a matroid M contains two disjoint bases (or, du-ally, if its ground set is the unio...
Let $T(G;X,Y)$ be the Tutte polynomial for graphs. We study the sequence$t_{a,b}(n) = T(K_n;a,b)$ wh...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
It is known that evaluating the Tutte polynomial, T(G; x, y), of a graph, G, is #P-hard at all but e...
Let M be a matroid and let t(M; ξ, η) be the Tutte polynomial of M. The lower and upper bound of t(M...
AbstractWe prove that the Tutte polynomial of a coloopless paving matroid is convex along the portio...
AbstractLet T(Lm,n;x,y) be the Tutte polynomial of the square lattice Lm,n, for integers m,n∈Z>0. Us...
International audienceLet M be a matroid without loops or coloops and let T (M ; x, y) be its Tutte ...
International audienceLet M be a matroid without loops or coloops and let T (M ; x, y) be its Tutte ...
In a recent paper Merino and Welsh (1999) studied several counting problems on the square lattice $L...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
We prove that if a matroid M contains two disjoint bases (or, dually, if its ground set is the union...
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings b...
AbstractWe prove that the Tutte polynomial of a coloopless paving matroid is convex along the portio...
AbstractLet k be a fixed, positive integer. We give an algorithm which computes the Tutte polynomial...
We prove that if a matroid M contains two disjoint bases (or, du-ally, if its ground set is the unio...
Let $T(G;X,Y)$ be the Tutte polynomial for graphs. We study the sequence$t_{a,b}(n) = T(K_n;a,b)$ wh...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
It is known that evaluating the Tutte polynomial, T(G; x, y), of a graph, G, is #P-hard at all but e...
Let M be a matroid and let t(M; ξ, η) be the Tutte polynomial of M. The lower and upper bound of t(M...
AbstractWe prove that the Tutte polynomial of a coloopless paving matroid is convex along the portio...