We begin by introducing matroids in the context of finite collections of vectors from a vector space over a specified field, where the notion of independence is linear independence. Then we will introduce the concept of a matroid invariant. Specifically, we will look at the Tutte polynomial, which is a well-defined two-variable invariant that can be used to determine differences and similarities between a collection of given matroids. The Tutte polynomial can tell us certain properties of a given matroid (such as the number of bases, independent sets, etc.) without the need to manually solve for them. Although the Tutte polynomial gives us significant information about a matroid, it does not uniquely determine a matroid. This thesis will fo...
Matroids are combinatorial structures that capture various notions of independence. Recently there h...
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recur...
Matroids are combinatorial structures that generalize the properties of linear independence. But not...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
AbstractA matroid is T-unique if it is determined up to isomorphism by its Tutte polynomial. Known T...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
AbstractWe introduce a 4-variable polynomial Q as a natural invariant linking a pair of matroids on ...
AbstractThe main results of the paper unify and generalize several theorems of the literature on Tut...
AbstractMatroids with coefficients have been introduced in [D1]. In this paper we will show that the...
We describe a construction of the Tutte polynomial for both matroids and $q$-matroids based on an ap...
AbstractThe Tutte group of a matroidMis a certain abelian group which controls the representability ...
AbstractFor any matroidMrealizable over Q, we give a combinatorial interpretation of the Tutte polyn...
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recur...
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recur...
Matroids are combinatorial structures that capture various notions of independence. Recently there h...
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recur...
Matroids are combinatorial structures that generalize the properties of linear independence. But not...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
AbstractA matroid is T-unique if it is determined up to isomorphism by its Tutte polynomial. Known T...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
AbstractWe introduce a 4-variable polynomial Q as a natural invariant linking a pair of matroids on ...
AbstractThe main results of the paper unify and generalize several theorems of the literature on Tut...
AbstractMatroids with coefficients have been introduced in [D1]. In this paper we will show that the...
We describe a construction of the Tutte polynomial for both matroids and $q$-matroids based on an ap...
AbstractThe Tutte group of a matroidMis a certain abelian group which controls the representability ...
AbstractFor any matroidMrealizable over Q, we give a combinatorial interpretation of the Tutte polyn...
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recur...
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recur...
Matroids are combinatorial structures that capture various notions of independence. Recently there h...
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recur...
Matroids are combinatorial structures that generalize the properties of linear independence. But not...