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 514 for “"Generalizations"”.
-
Some generalizations of injectivity
… of injectivity and some of its well-known generalizations are stated. Chapter 2 is concerned with two generalizations of injectivity, namely near and essential injectivity. These concepts, together with the notion of the exchange property, prove to be a key tool in obtaining …
-
Generalizations Of The Segal Conjecture
The main result of this thesis may be described in the following manner: Let G be a finite group and let {dollar}pi{dollar} be a compact Lie group. Define A(G,{dollar}pi{dollar}) to be the free abelian group generated by equivalence classes of subhomomorphisms (G {dollar}supset{dollar} H …
-
Distance-Regular Graphs and Generalizations
A distance-transitive graph (GAMMA) is an undirected, locally finite graph where for any vertices u,v,x,y, (PAR-DIFF)(u,v) = (PAR-DIFF)(x,y) implies (sigma)u = x and (sigma)v = y for some automorphism (sigma) of (GAMMA). Distance-transitive graphs have certain combinatorial properties, which can be …
-
Generalizations of permutation source codes
Permutation source codes are a class of structured vector quantizers with a computationally- simple encoding procedure. In this thesis, we provide two extensions that preserve the computational simplicity but yield improved operational rate-distortion performance. In the first approach, the new …
-
Generalizations of Kempe's universality theorem
In 1876, A. B. Kempe presented a flawed proof of what is now called Kempe's Universality Theorem: that the intersection of a closed disk with any curve in R2 defined by a polynomial equation can be drawn by a linkage. Kapovich and Millson published the first correct proof of this claim in 2002, but …
-
Generalizations and Variations on Graph Pebbling
Graph pebbling involves determining the minimum number of pebbles needed so that regardless of the initial arrangement of pebbles on a graph, a pebble can be moved to any vertex using specified ``pebbling moves.'' This minimum number of pebbles is the pebbling number of a graph. We begin by making …
-
Noncommutative Prüfer rings and some generalizations
… and Dubrovin, and introduce three natural generalizations, semi-Prfifer rings, right w-semi-Prfifer rings, and right w-Prfifer rings. We study the relations between the four concepts, and present the various properties that characterize them. We formulate and prove the basic facts for those …
-
Generalizations and Applications of Border Bases
This doctoral thesis is devoted to generalize border bases to the module setting and to apply them in various ways. First, we generalize the theory of border bases to finitely generated modules over a polynomial ring. We characterize these generalized border bases and show that we can compute them. …
-
Generalizations of the projective reconstruction theorem
We present generalizations of the classic theorem of projective reconstruction as a tool for the design and analysis of the projective reconstruction algorithms. Our main focus is algorithms such as bundle adjustment and factorization-based techniques, which try to solve the projective equations …
-
Generalizations of the projective reconstruction theorem
We present generalizations of the classic theorem of projective reconstruction as a tool for the design and analysis of the projective reconstruction algorithms. Our main focus is algorithms such as bundle adjustment and factorization-based techniques, which try to solve the projective equations …
-
Generalizations of Golod -Shafarevich and Applications
Let Nq(g) be the maximal number of rational points a global function field of genus g with constant field Fq can have. Let A(q) = lim sup g→infinity Nqg g . As an application of our results, we improve the best known lower bound for A(2) from A(2) > 0.255 to A(2) > 0.3.
-
Generalizations of no k-equal spaces
We consider generalizations of no $k$-equal spaces as well as their relations to other concepts. For any topological space $X$, the $n^{th}$ no $k$-equal space of $X$ is the space of $n$ points from $X$ such that no $k$ are the same. First, we consider a generalization where each of the points is …
-
Syllable-based generalizations in English phonology.
Thesis. 1976. Ph.D.--Massachusetts Institute of Technology. Dept. of Foreign Literatures and Linguistics.
-
Symmetric function generalizations of graph polynomials
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.
-
Generalizations of Threshold Graph Dynamical Systems
Dynamics of social processes in populations, such as the spread of emotions, influence, language, mass movements, and warfare (often referred to individually and collectively as contagions), are increasingly studied because of their social, political, and economic impacts. Discrete dynamical …
-
Generalizations of Certain Results on Continued Fraction
In this thesis we study generalizations of the Rogers-Ramanujan continued fraction. The Rogers-Ramanujan continued fraction arises from a three-term q-difference equation. We consider (m + 1)-term q-difference equations and also a generalization of the continued fraction algorithm called a …
-
Generalizations of quasiconvexity for finitely generated groups
… a finitely generated group, there are two recent generalizations of the notion of a quasiconvex subgroup of a word-hyperbolic group, a “stable” subgroup and a “Morse” subgroup. Durham and Taylor [33] defined stability and proved stability is equivalent to convex cocompactness in mapping class …
Page 1 of 26