Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 25 for “"tutte polynomial"”.
-
Tutte polynomial in knot theory
This thesis reviews the history of knot theory with an emphasis on the diagrammatic approach to studying knots. Also covered are the basic concepts and notions of graph theory and how these two fields are related with an example of a knot diagram and how to associate it to a graph.
-
Tutte polynomial in knot theory
This thesis reviews the history of knot theory with an emphasis on the diagrammatic approach to studying knots. Also covered are the basic concepts and notions of graph theory and how these two fields are related with an example of a knot diagram and how to associate it to a graph.
-
Computing the Tutte Polynomial of hyperplane arrangements
We are studying the Tutte Polynomial of hyperplane arrangements. We discuss some previous work done to compute these polynomials. Then we explain our method to calculate the Tutte Polynomial of some arrangements more efficiently. We next discuss the details of the program used to do the …
-
Extensions of the Tutte Polynomial and Results on the Interlace Polynomial
In graph theory, graph polynomials are an important tool to encode information from a graph. The Tutte polynomial, first introduced in 1947, is one of the most important graph polynomials due to its universality. Here, we present three classic definitions of the Tutte polynomial via a …
-
Chip-firing on Graphs: Stability, the Dollar Game, and the Tutte Polynomial
No abstract prepared.
-
Quantum Algorithms For: Quantum Phase Estimation, Approximation Of The Tutte Polynomial And Black-box Structures
… discuss the quantum complexity of evaluating the Tutte polynomial of a planar graph. Furthermore, we devise a new quantum algorithm for approximating the phase of a unitary matrix. Finally, we provide quantum tools that can be utilized to extract the structure of black-box modules and algebras. …
-
Tutte-Equivalent Matroids
… 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 …
-
The complexity of counting problems
… theory, all of which are related directly to the Tutte polynomial. The Tutte polynomial contains as specialisations many fundamental quantities. Among these are the partition function of the Ising and Potts models on the graph and the reliability probability as well as basic combinatorial …
-
The complexity of graph polynomials
<p>This thesis examines graph polynomials and particularly their complexity. We give short proofs of two results from Gessel and Sagan (1996) which present new evaluations of the Tutte polynomial concerning orientations. A theorem of Massey et al (1997) gives an expression concerning the average …
-
Aspects of the Jones polynomial
A knot invariant called the Jones polynomial will be defined in two ways, as the Kauffman Bracket polynomial and the Tutte polynomial. Three properties of the Jones polynomial are discussed. We also see how mutant knots share the same Jones polynomial.
-
Aspects of the Jones polynomial
A knot invariant called the Jones polynomial will be defined in two ways, as the Kauffman Bracket polynomial and the Tutte polynomial. Three properties of the Jones polynomial are discussed. We also see how mutant knots share the same Jones polynomial.
-
Quotients Of Spheres By Linear Actions Of Abelian Groups
… spaces and singular sets in terms of the Tutte polynomial of the matroid(s). For finite groups, an algorithm for computing the Zp -homology of the quotient space is given.
-
Circuits and enumeration problems for matroids
… and other distinguished sets in a matroid. The Tutte polynomial, recognized as the universal deletion-contraction invariant in matroid and graph theory, is a natural starting point when considering enumeration problems for matroids. The main result in Chapter 2 generalizes a theorem of Dean …
-
Some problems in combinatorial geometry
… G sum to the number of vertices of G.</p> <p>The Tutte polynomial of a graph is known to be related to the bond percolation model on the graph. In Chapter 5 we introduce a basic abstraction of classical percolation theory, namely percolation on clutters. We give new and simpler proofs of several …
-
Algebraic geometry for tensor networks, matrix multiplication, and flag matroids
… We review a geometric interpretation of the Tutte polynomial in terms of the equivariant K-theory of the Grassmannian. By generalizing Grassmannians to partial flag varieties, we obtain a new invariant of flag matroids: the flag-geometric Tutte polynomial. We study this invariant in detail, …
-
Sandpile Groups for Cones Over Trees
… μ(G) for K(G) the sandpile group, and the Tutte polynomial evaluation TG (1,). To this end we study sandpile groups for graphs Cone(T) obtained by attaching a cone vertex to a tree T. We also answer one of the questions posed by Reiner and Smith by exhibiting a family of trees Tₙ whose …
-
Polynomials associated with graph coloring and orientations
… a graph invariant generalizing the chromatic polynomial for which we prove some theorems analogous to well-known theorems about the chromatic polynomial. Secondly, we examine graphs and graph colorings in the context of the combinatorial Hopf algebras of Aguiar, Bergeron and Sottile. By doing …
-
Dimer models for knot polynomials
… a knot diagram is given to obtain the Alexander polynomial. This is further extended to a more complicated graph to obtain the twisted Alexander polynomial, which involved "twisting" by a representation. The space of all representations of a given knot complement into the general linear group of …
Page 1 of 2