Spelling suggestions: "subject:"embeddings."" "subject:"imbeddings.""
21 |
Finite metric subsets of Banach spacesKilbane, James January 2019 (has links)
The central idea in this thesis is the introduction of a new isometric invariant of a Banach space. This is Property AI-I. A Banach space has Property AI-I if whenever a finite metric space almost-isometrically embeds into the space, it isometrically embeds. To study this property we introduce two further properties that can be thought of as finite metric variants of Dvoretzky's Theorem and Krivine's Theorem. We say that a Banach space satisfies the Finite Isometric Dvoretzky Property (FIDP) if it contains every finite subset of $\ell_2$ isometrically. We say that a Banach space has the Finite Isometric Krivine Property (FIKP) if whenever $\ell_p$ is finitely representable in the space then it contains every subset of $\ell_p$ isometrically. We show that every infinite-dimensional Banach space \emph{nearly} has FIDP and every Banach space nearly has FIKP. We then use convexity arguments to demonstrate that not every Banach space has FIKP, and thus we can exhibit classes of Banach spaces that fail to have Property AI-I. The methods used break down when one attempts to prove that there is a Banach space without FIDP and we conjecture that every infinite-dimensional Banach space has Property FIDP.
|
22 |
Canonical embeddings from noncompact Riemannian symmetric spaces to their compact duals. / Canonical embeddings from noncompact R.S.S. to their compact dualsJanuary 2010 (has links)
Chen, Yunxia. / "August 2010." / Thesis (M.Phil.)--Chinese University of Hong Kong, 2010. / Includes bibliographical references (leaves 54-56). / Abstracts in English and Chinese. / Chapter 1 --- Embedding in Hermitian case --- p.8 / Chapter 1.1 --- Basics on Riemannian symmetric spaces --- p.8 / Chapter 1.2 --- Embedding in Hermitian case --- p.11 / Chapter 1.2.1 --- Borel embedding theorem --- p.11 / Chapter 1.2.2 --- Harish-Chandra embedding theorem --- p.12 / Chapter 1.2.3 --- Hermann convexity theorem --- p.14 / Chapter 2 --- Embedding in generalized Grassmannian case --- p.15 / Chapter 2.1 --- Compact symmetric spaces as Grassmannians --- p.15 / Chapter 2.1.1 --- Preliminaries --- p.15 / Chapter 2.1.2 --- "Grassmannians, Lagrangian Grassmannians and Double Lagrangian Grassmannians" --- p.16 / Chapter 2.1.3 --- Compact simple Lie groups --- p.20 / Chapter 2.2 --- Embedding in generalized Grassmannian case --- p.23 / Chapter 2.2.1 --- Space-like Grassmannian --- p.23 / Chapter 2.2.2 --- Graph-like Grassmannian --- p.26 / Chapter 2.2.3 --- Convexity property --- p.27 / Chapter 3 --- Cut locus of Compact symmetric spaces --- p.29 / Chapter 3.1 --- Cut locus --- p.29 / Chapter 3.1.1 --- Cut locus of Riemannian manifold --- p.29 / Chapter 3.1.2 --- Lie algebra of compact symmetric space --- p.31 / Chapter 3.1.3 --- Tangent cut locus of compact symmetric spaces --- p.32 / Chapter 3.2 --- Hermitian case and generalized Grassmannian case --- p.36 / Chapter 3.2.1 --- The Hermitian case --- p.36 / Chapter 3.2.2 --- The generalized Grassmannian case --- p.38 / Chapter 4 --- Construction of the explicit embedding --- p.42 / Chapter 4.1 --- Regular symmetric spaces --- p.42 / Chapter 4.2 --- Embedding in Regular case --- p.45 / Chapter 4.2.1 --- Construction of the embedding --- p.45 / Chapter 4.2.2 --- The properties of the explicit embedding --- p.47 / Chapter 4.3 --- Generalization of the embedding --- p.51 / Bibliography --- p.54
|
23 |
Polytopal digraphs and non-polytopal facet graphs /Mihalisin, James Edward. January 2001 (has links)
Thesis (Ph. D.)--University of Washington, 2001. / Vita. Includes bibliographical references (p. 69-73).
|
24 |
Symplectic Rational Blow-Up and Embeddings of Rational Homology BallsKhodorovskiy, Tatyana 21 June 2013 (has links)
We define the symplectic rational blow-up operation, for a family of rational homology balls \(B_n\), which appeared in Fintushel and Stern's rational blow-down construction. We do this by exhibiting a symplectic structure on a rational homology ball \(B_n\) as a standard symplectic neighborhood of a certain 2-dimensional Lagrangian cell complex. We also study the obstructions to symplectically rationally blowing up a symplectic 4-manifold, i.e. the obstructions to symplectically embedding the rational homology balls \(B_n\) into a symplectic 4-manifold. First, we present a couple of results which illustrate the relative ease with which these rational homology balls can be smoothly embedded into a smooth 4-manifold. Second, we prove a theorem and give additional examples which suggest that in order to symplectically embed the rational homology balls \(B_n\), for high \(n\), a symplectic 4-manifold must at least have a high enough \(c^2_1\) as well. / Mathematics
|
25 |
Global embeddings of pseudo-Riemannian spaces.Moodley, Jothi. January 2007 (has links)
Motivated by various higher dimensional theories in high-energy-physics and cosmology, we consider the local and global isometric embeddings of pseudo-Riemannian manifolds into manifolds of higher dimensions. We provide the necessary background in general relativity, topology and differential geometry, and present the technique for local isometric embeddings. Since an understanding of the local results is key to the development of global embeddings, we review some local existence theorems for general pseudo-Riemannian embedding spaces. In order to gain insight we recapitulate the formalism required to embed static spherically symmetric space-times into fivedimensional Einstein spaces, and explicitly treat some special cases, obtaining local and isometric embeddings for the Reissner-Nordstr¨om space-time, as well as the null geometry of the global monopole metric. We also comment on existence theorems for Euclidean embedding spaces. In a recent result, it is claimed (Katzourakis 2005a) that any analytic n-dimensional space M may be globally embedded into an Einstein space M × F (F an analytic real-valued one-dimensional field). As a corollary, it is claimed that all product spaces are Einsteinian. We demonstrate that this construction for the embedding space is in fact limited to particular types of embedded spaces. We analyze this particular construction for global embeddings into Einstein spaces, uncovering a crucial misunderstanding with regard to the form of the local embedding. We elucidate the impact of this misapprehension on the subsequent proof, and amend the given construction so that it applies to all embedded spaces as well as to embedding spaces of arbitrary curvature. This study is presented as new theorems. / Thesis (M.Sc.)-University of KwaZulu-Natal, Westville, 2007.
|
26 |
On the universal embeddings of the binary symplectic and unitary dual polar spaces /Li, Paul. January 2001 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Mathematics, June 2001. / Includes bibliographical references. Also available on the Internet.
|
27 |
Partial graph design embeddings and related problems /Jenkins, Peter. January 2005 (has links) (PDF)
Thesis (Ph.D.) - University of Queensland, 2005. / Includes bibliography.
|
28 |
Geometric gradient flow in the space of smooth embeddingsGold, Dara 09 November 2015 (has links)
Given an embedding of a closed k-dimensional manifold M into N-dimensional Euclidean space R^N, we aim to perform negative gradient
flow of a penalty function P that acts on the space of all smooth embeddings of M into R^N to find an ideal manifold embedding. We study the computation
of the gradient for a penalty function that contains both a curvature and distance term. We also find a lower bound for how long an embedding will remain in the space of embeddings when moving in a fixed, normal gradient direction. Finally, we study the distance penalty function in a special case in which we can prove short time existence of the negative gradient flow using the Cauchy-Kovalevskaya Theorem.
|
29 |
Embedding r-Factorizations of Complete Uniform Hypergraphs into s-FactorizationsDeschênes-Larose, Maxime 26 September 2023 (has links)
The problem we study in this thesis asks under which conditions an r-factorization of Kₘʰ can be embedded into an s-factorization of Kₙʰ. This problem is a generalization of a problem posed by Peter Cameron which asks under which conditions a 1-factorization of Kₘʰ can be embedded into a 1-factorization of Kₙʰ. This was solved by Häggkvist and Hellgren. We study sufficient conditions in the case where s = h and m divides n. To that end, we take inspiration from a paper by Amin Bahmanian and Mike Newman and simplify the problem to the construction of an "acceptable" partition. We introduce the notion of irreducible sums and link them to the main obstacles in constructing acceptable partitions before providing different methods for circumventing these obstacles. Finally, we discuss a series of open problems related to this case.
|
30 |
Detecting Lexical Semantic Change Using Probabilistic Gaussian Word EmbeddingsMoss, Adam January 2020 (has links)
In this work, we test two novel methods of using word embeddings to detect lexical semantic change, attempting to overcome limitations associated with conventional approaches to this problem. Using a diachronic corpus spanning over a hundred years, we generate word embeddings for each decade with the intention of evaluating how meaning changes are represented in embeddings for the same word across time. Our approach differs from previous works in this field in that we encode words as probabilistic Gaussian distributions and bimodal probabilistic Gaussian mixtures, rather than conventional word vectors. We provide a discussion and analysis of our results, comparing the approaches we implemented with those used in previous works. We also conducted further analysis on whether additional information regarding the nature of semantic change could be discerned from particular qualities of the embeddings we generated for our experiments. In our results, we find that encoding words as probabilistic Gaussian embeddings can provide an enhanced degree of reliability with regard to detecting lexical semantic change. Furthermore, we are able to represent additional information regarding the nature of such changes through the variance of these embeddings. Encoding words as bimodal Gaussian mixtures however is generally unsuccessful for this task, proving to be not reliable enough at distinguishing between discrete senses to effectively detect and measure such changes. We provide potential explanations for the results we observe, and propose improvements that can be made to our approach to potentially improve performance.
|
Page generated in 0.0672 seconds