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 4566 for “"Homology"”.
-
Representation homology and knot contact homology
… part, we introduce and study representation homology of topological spaces, which is a higher homological extension of representation varieties of fundamental groups. We give an elementary construction of representation homology in terms of classical (abelian) homological algebra. Our …
-
Microlocal homology
… Z/X], which refines Nadler’s microlocal homology of singular spaces in the case when Z is presented as the derived zero fiber of a regular function on X. Using the canonical inclusion T [superscript ∗] [−1]Z⊂N [∨ over subscript Z/X], we show that µ [subscript Z/X] is in fact equivalent to …
-
Morse homology
Morse homology were developed during the rst half of the twentieth century. The underlying idea and various in nite dimensional versions, such as Floer homology, continue to be of interest to researchers in mathematics and theoretical physics today. In the rst chapter of this thesis, we brie y …
-
Simplicial Homology
The purpose of this thesis is to construct the homology groups of a complex over an R-module. The thesis begins with hyperplanes in Euclidean n-space. Simplexes and complexes are defined, and orientations are given to each simplex of a complex. The chains of a complex are defined, and each chain is …
-
Floer homology for connected sums of homology 3-spheres
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1992
-
Tropical matroid homology
… of independent projects on tropical matroid homology, graph recognition algorithms, and matroid classification. The first part provides an affirmative answer to a 2016 conjecture regarding matroid homology as well as sufficient conditions under which the results can be generalized. …
-
WEIGHTED CUBICAL HOMOLOGY
… After this concept, the weighted cubical homology is generated by weighted cubical complex. Some examples are also given to show the difference between general cubical homology and weighted cubical homology. Then we prove an important theorem named Mayer-Vietories sequence for weighted …
-
MOTIVIC HOCHSCHILD HOMOLOGY
… in SH(S); we define the motivic Hochschild homology of R via the derived tensor product: MHH(R)=R ∧_{R ∧ R^{op}} R. This spectrum can be considered the motivic analogue of topological Hochschild homology. The purpose of the first part of this thesis is to investigate the homotopy structure …
-
O-minimal homology
The purpose of this dissertation is to define homology functors for the category of definable sets and definable continuous maps in an o-minimal expansion of an ordered field. Both simplicial and singular homology functors are defined, and they are shown to satisfy the Eilenberg-Steenrod axioms. …
-
More homology flows
Flows and cuts have been the topic of much study since Ford and Fulkerson's original paper. The problem we look at is the computation of flows on some generalizations of planar graphs. In particular, the input graph can be embedded on a surface of genus g, and has the source and sink on the same …
-
Applications of Computational Homology
Homology is a field of topology that classifies objects based on the number of n- dimensional holes (cuts, tunnels, voids, etc.) they possess. The number of its real life ap- plications is quickly growing, which requires development of modern computational meth- ods. In my thesis, I will present …
-
Twisting bordered Khovanov homology
… a bordered version of totally twisted Khovanov homology. We first twist Roberts's type D structure by adding a vertical type D structure which generalizes the vertical map in twisted tangle homology. One of the distinct advantages of our type D structure is that it is homotopy equivalent to a …
-
The homology of groupnets
… groupnets (Brandt groupoids) to investigate the homology of mapping cylinder groupnets; that is, groupnets G which are the homotopy colimits of diagrams (V, A) of groupnets. When the edge morphisms of (V, A) are all monomorphisms, G is known as a graph product. The principal result of the thesis …
-
Combinatorial Knot Floer Homology
Knot Floer Homology HFK(K) of a knot K in S^3 was defined by Peter Ozsváth and Zoltan Szabó in 2003. It has since become powerful invariant for the study of properties of knots. The definition of the Knot Floer Homology groups initially involved counting holomorphic disks in symmetric products of …
-
Probabilistic protein homology modeling
… expensive and time consuming. Fully automatic homology modeling refers to building a 3D model for a query sequence from an alignment to related homologous proteins with known structure (templates) by a computer. Current prediction servers can provide accurate models within a few hours to days. …
-
The homology of data
… increasing frequency and success. Persistent homology (PH) is a method that uses homology — a tool in topology that gives a measure of the number of holes of a space — to study qualitative features of data across different values of a parameter, which one can think of as scales of resolution, …
-
Homology Based Motif Generation
Generating motifs from known active sites and matching those motifs to an uncharacterized protein is a classic way of determining protein function. Until now, the generation of motifs has been based purely on enzymatic function. This approach does not account for situations where highly different …
-
Generalizations of persistent homology
Persistent homology typically starts with a filtered chain complex and produces an invariant called the persistence diagram. This invariant summarizes where holes are born and die in the filtration. In the traditional setting the filtered chain complex is a chain complex of vector spaces filtered …
-
Hypermap-Homology Quantum Codes
… CSS quantum error correcting code based on the homology of hypermaps. Sparse quantum error correcting codes are of interest in the building of quantum computers due to their ease of implementation and the possibility of developing fast decoders for them. Codes based on the homology of embeddings …
Page 1 of 229