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 252 for “"homomorphisms"”.
-
Hurewicz homomorphisms
Theorem : Let X be simply connected . H[sub q](X) be finitely generated for each q. π[sub q](X) be finite for each q < n. n>> 1. Then , H[sub q] , π[sub q](X) --> H[sub q](X) has finite kernel for q < 2n has finite cokernel for q < 2n+l ker h[sub 2n+1] Q = ker u where , u is the cup product or the …
-
Homomorphisms of Graphs
… pertaining to independent sets, colorings, and homomorphisms. Another method of describing the structure of a graph is through the concept of a role assignment. A role assignment is a mapping r from a graph G to a graph GR, i.e., r:G → GR, by a surjective labeling of the vertices of G with the …
-
Closed frame homomorphisms
… thesis is a systematic study of closed frame homomorphisms, which can be viewed as a natural generalization of the classical closed continuous mappings of topological spaces. Following the features of frame theory, we attempt to prove our results constructively. Various aspects of closed …
-
The complexity of digraph homomorphisms: Local tournaments, injective homomorphisms and polymorphisms
… two case. We nonetheless classify all injective homomorphisms to irreflexive tournaments as either being a problem in P or a problem in the class of NP-complete problems. We also discuss some upper bounds on the injective oriented irreflexive (reflexive) chromatic number.
-
Complexity of frugal homomorphisms
… with the complexity of frugal colourings and homomorphisms of graphs and digraphs. We first consider t-frugal proper colourings. A colouring is proper if adjacent vertices must be assigned different colours. The proper t-frugal chromatic number of a graph is the minimum number of colours …
-
Weak homomorphisms of coalgebras
… that our weak version induces the proper level homomorphisms between mathematical structures.;Based on this appropriate relaxation of the concept of coalgebra homomorphism, we demonstrate the finite completeness and non-cocompleteness of the category of locally finite graphs (including loops) …
-
Homomorphisms of planar nearrings
… nearring which is useful to have when studying homomorphisms. After defining and describing partite nearrings we look at ideals and homomorphisms. We see that homomorphisms defined on partite nearrings always have "associated homomorphisms." We also look at several theorems that tell us when a …
-
Extension of Riesz homomorphisms
Contains fulltext : mmubn000001_027528235.pdf (Publisher’s version ) (Open Access)
-
Approximate Diagonalization of Homomorphisms
… the approximate diagonalization of unital homomorphisms between C*-algebras. In particular, we prove that unital homomorphisms from commutative C*-algebras into simple separable unital C*-algebras with tracial rank at most one are approximately diagonalizable. This is equivalent to the …
-
Regular transformation groups and homomorphisms
Electronic Thesis or Dissertation
-
Local Rings and Golod Homomorphisms
… series. The idea was generalized to Golod homomorphisms by Levin in 1975. In this paper we prove two homomorphisms are Golod. The first is a class of ideals such that the natural projection to the quotient ring is a Golod homomorphism. The second deals with Golod homomorphisms between …
-
Graph Homomorphisms and Vector Colorings
A graph vertex coloring is an assignment of labels, which are referred to as colors, such that no two adjacent vertices receive the same color. The vertex coloring problem is NP-Complete [8], and so no polynomial time algorithm is believed to exist. The notion of a graph vector coloring was …
-
Homomorphisms between bubble algebra modules
… the bubble algebras. We focus on determining the homomorphisms between cell modules for these algebras. We show that the bubble algebras are cellular, and form a tower of recollement. By decomposing Gram matrices we are able to determine homomorphisms in the one arc case. We determine a generating …
-
Moduli of homomorphisms of sheaves
… This thesis studies moduli problems for homomorphisms of sheaves over a fixed projective variety X indexed by a quiver; that is, we are looking at representations of a quiver in the category of coherent sheaves over X where the sheaves indexed by the vertices of the quiver are fixed and …
-
The topology of graph homomorphisms
… thesis we consider topological aspects of graph homomorphisms. Our main object of study is the Hom complex of graphs, a space first introduced by Lovasz to obtain lower bounds on chromatic number, and more recently studied by Babson and Kozlov and others in a series of papers. We prove structural …
-
Spaces of homomorphisms and group cohomology
In this work we study the space of group homomorphisms Hom(Γ,G) from a geometric and simplicial point of view. The case in which the source group is a free abelian group of rank n is studied in more detail since this space can be identified with the space of commuting n-tuples of elements from G. …
-
Variations on a Theme: Graph Homomorphisms
… investigates three areas of the theory of graph homomorphisms: cores of graphs, the homomorphism order, and quantum homomorphisms. A core of a graph X is a vertex minimal subgraph to which X admits a homomorphism. Hahn and Tardif have shown that, for vertex transitive graphs, the size of the core …
-
Homomorphisms of (j, k)-mixed graphs
A mixed graph is a simple graph in which a subset of the edges have been assigned directions to form arcs. For non-negative integers j and k, a (j, k)−mixed graph is a mixed graph with j types of arcs and k types of edges. The collection of (j, k)−mixed graphs contains simple graphs ((0,1)−mixed …
-
Counting, modular counting and graph homomorphisms
… science can be represented naturally as graph homomorphisms and as weighted sums of graph homomorphisms. In this thesis we study the complexity of various problems related to graph homomorphisms.</p> <p>We first study the problem #<sub>k</sub>HomsTo<em>H</em> of counting the homomorphisms from …
-
VALUATION PAIRS AND MAXIMAL PARTIAL HOMOMORPHISMS
Abstract not available
Page 1 of 13