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 1433 for “"Invariants."”.
-
On Jones knot invariants and Vassiliev invariants
The main objective of this thesis is to study invariants of knots and links. First, a minimal system is associated to each link diagram D. This minimal system is an “an tichain” in the partially ordered set of all possible functions from the crossings of D to {—1, 1}. Such a system is then shown to …
-
Approximation of knot invariants by Vassiliev invariants
… by a sequence of Vassiliev (finite-type) invariants. This partially answers the question: can an arbitrary knot invariant be approximated by Vassiliev invariants? A knot invariant, which is additive under connected sum, is approximated by a sequence of Vassiliev invariants if and only if …
-
Separating Invariants
… algebra is a subalgebra of the ring of invariants whose elements distinguish between any two orbits that can be distinguished using invariants. In this thesis, we introduce the notion of a geometric separating algebra, a more geometric notion of a separating algebra. We find two …
-
Invariants of graphs
… an infinite class of graphs. We then define new invariants for this infinite class of graphs. First we define a longitude $l\sb{c}$ of a cycle $c$ in $G$. In contrast to the situation of a knot, for a graph it is quite difficult to canonically select an isotopy class of longitudes, since the …
-
Invariants of graphs
We define an infinite sequence of invariants $\bar\mu\sb{K}$ of connected, finite graphs K. These invariants detect whether or not a "longitude" associated to a cycle in K lies in the $n\sp{th}$ term of the lower central series of $\pi\sb1(S\sp3-K,p)$. In certain cases, these invariants can be …
-
Connections between Floer-type invariants and Morse-type invariants of Legendrian knots.
We investigate existing Legendrian knot invariants and discover new connections between the theory of generating families, normal rulings and the Chekanov-Eliashberg differential graded algebra: CE-DGA). Given a Legendrian knot $\sK$ with generic front projection $\sfront$, we define a …
-
Alexander invariants of links
… use surgery techniques to characterize Alexander invariants of links of two components in terms of their presentation matrices. We then use this to show that the Torres conditions characterize link polynomials when the linking number of the two components is zero or both components are unknotted …
-
Subdivisions and secondary invariants
Combinatorial transgressions are secondary invariants of a triangulable space analogous to transgressive forms such as those arising in Chern-Weil theory. Unlike combinatorial characteristic classes, combinatorial transgressions have not been previously studied. I characterize transgressions that …
-
Invariants of D-modules
… [5], with particular attention to module invariants, and focusing on the 1-dimensional disc X = SpK〈 x〉 as a base space. Highlights of these investigations are to provide tools for calculating lengths of 1-related modules, and to introduce a type of characteristic variety for coadmissible …
-
New Invariants for Groups
… 4, we derive some properties of these module invariants and their equivalents for groups, including the connexion of these new invariants with the integral homology of a group. In Chapter 5, we consider the classes of modules and of groups whose En-ideals are simple in a certain sense, the …
-
Invariants of Legendrian products
… Legendrian product. We investigate and compute invariants for these Legendrian submanifolds, including the Thurston-Bennequin invariant and Maslov class; Legendrian contact homology for the product of two Legendrian knots; and generating family homology.
-
Computing homomorphic program invariants
<p>Program invariants are properties that are true at a particular program point or points. Program invariants are often undocumented assertions made by a programmer that hold the key to reasoning correctly about a software verification task. Unlike the contemporary research in which program …
-
Flat Knots and Invariants
… knots and their properties. We study various invariants of flat knots, such as the crossing number, the u-polynomial, the flat arrow polynomial, the flat Jones-Krushkal polynomial, the based matrices, and the φ-invariant. We also examine the behavior of these invariants under connected sum and …
-
Spacetime invariants and invariant spacetimes.
… describe gravitation with Scalar Polynomial Invariants. First, the algebraic structure of the Levi-Civita spacetimes were investigated and characterized by the use of Scalar Polynomial Coordinate Invariants. Initially the motivation was to enable intuitive graphical interpretations of the …
-
Inferring and asserting distributed invariants
… LOC and are widely used. Dinv derived useful invariants for these systems, including invari- ants that capture the correctness of distributed routing strategies, leadership, and key hash distribution. We also used Dinv to assert correctness of the inferred etcd Raft invariants at runtime, …
-
Computing motivic Donaldson-Thomas invariants
… reduction) to compute motivic Donaldson--Thomas invariants. The method is then employed to compute these invariants in several different cases. Given a moduli scheme with a symmetric obstruction theory a Donaldson--Thomas type invariant can be defined by integrating Behrend's function over the …
-
Multiplicative Invariants of Root Lattices
… formally for the past 35 years. Multiplicative invariants arise naturally in a variety of settings, notably as representation rings of Lie algebras, centers of group algebras, and actions on algebraic tori. In this thesis we calculate the multiplicative invariants for lattices associated to root …
Page 1 of 72