• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4
  • 2
  • 1
  • Tagged with
  • 8
  • 8
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Some Descriptions Of The Envelopes Of Holomorphy Of Domains in Cn

Gupta, Purvi 03 1900 (has links) (PDF)
It is well known that there exist domains Ω in Cn,n ≥ 2, such that all holomorphic functions in Ω continue analytically beyond the boundary. We wish to study this remarkable phenomenon. The first chapter seeks to motivate this theme by offering some well-known extension results on domains in Cn having many symmetries. One important result, in this regard, is Hartogs’ theorem on the extension of functions holomorphic in a certain neighbourhood of (D x {0} U (∂D x D), D being the open unit disc in C. To understand the nature of analytic continuation in greater detail, in Chapter 2, we make rigorous the notions of ‘extensions’ and ‘envelopes of holomorphy’ of a domain. For this, we use methods similar to those used in univariate complex analysis to construct the natural domains of definitions of functions like the logarithm. Further, to comprehend the geometry of these abstractly-defined extensions, we again try to deal with some explicit domains in Cn; but this time we allow our domains to have fewer symmetries. The subject of Chapter 3 is a folk result generalizing Hartogs’ theorem to the extension of functions holomorphic in a neighbourhood of S U (∂D x D), where S is the graph of a D-valued function Φ, continuous in D and holomorphic in D. This problem can be posed in higher dimensions and we give its proof in this generality. In Chapter 4, we study Chirka and Rosay’s proof of Chirka’s generalization (in C2) of the above-mentioned result. Here, Φ is merely a continuous function from D to itself. Chapter 5 — a departure from our theme of Hartogs-Chirka type of configurations — is a summary of the key ideas behind a ‘non-standard’ proof of the so-called Hartogs phenomenon (i.e., holomorphic functions in any connected neighbourhood of the boundary of a domain Ω Cn , n ≥ 2, extend to the whole of Ω). This proof, given by Merker and Porten, uses tools from Morse theory to tame the boundary geometry of Ω, hence making it possible to use analytic discs to achieve analytic continuation locally. We return to Chirka’s extension theorem, but this time in higher dimensions, in Chapter 6. We see one possible generalization (by Bharali) of this result involving Φ where is a subclass of C (D; Dn), n ≥ 2. Finally, in Chapter 7, we consider Hartogs-Chirka type configurations involving graphs of multifunctions given by “Weierstrass pseudopolynomials”. We will consider pseudopolynomials with coefficients belonging to two different subclasses of C(D; C), and show that functions holomorphic around these new configurations extend holomorphically to D2 .
2

Equivalence of Classical and Quantum Codes

Pllaha, Tefjol 01 January 2019 (has links)
In classical and quantum information theory there are different types of error-correcting codes being used. We study the equivalence of codes via a classification of their isometries. The isometries of various codes over Frobenius alphabets endowed with various weights typically have a rich and predictable structure. On the other hand, when the alphabet is not Frobenius the isometry group behaves unpredictably. We use character theory to develop a duality theory of partitions over Frobenius bimodules, which is then used to study the equivalence of codes. We also consider instances of codes over non-Frobenius alphabets and establish their isometry groups. Secondly, we focus on quantum stabilizer codes over local Frobenius rings. We estimate their minimum distance and conjecture that they do not underperform quantum stabilizer codes over fields. We introduce symplectic isometries. Isometry groups of binary quantum stabilizer codes are established and then applied to the LU-LC conjecture.
3

The Oka-Weil Theorem

Karlsson, Jesper January 2017 (has links)
We give a proof of the Oka-Weil theorem which states that on compact, polynomially convex subsets of Cn, holomorphic functions can be approximated uniformly by holomorphic polynomials. / Vi ger ett bevis av Oka-Weil sats som säger att på kompakta och polynomkonvexa delmängder av Cn kan holomorfa funktioner approximeras likformigt med holomorfa polynom.
4

Vector Bundles Over Hypersurfaces Of Projective Varieties

Tripathi, Amit 07 1900 (has links) (PDF)
In this thesis we study some questions related to vector bundles over hypersurfaces. More precisely, for hypersurfaces of dimension ≥ 2, we study the extension problem of vector bundles. We find some cohomological conditions under which a vector bundle over an ample divisor of non-singular projective variety, extends as a vector bundle to an open set containing that ample divisor. Our method is to follow the general Groethendieck-Lefschetz theory by showing that a vector bundle extension exists over various thickenings of the ample divisor. For vector bundles of rank > 1, we find two separate cohomological conditions on vector bundles which shows the extension to an open set containing the ample divisor. For the case of line bundles, our method unifies and recovers the generalized Noether-Lefschetz theorems by Joshi and Ravindra-Srinivas. In the last part of the thesis, we make a specific study of vector bundles over elliptic curve.
5

Généralisations du Théorème d'Extension de MacWilliams / Generalizations of the MacWilliams Extension Theorem

Dyshko, Serhii 15 December 2016 (has links)
Le fameux Théorème d’Extension de MacWilliams affirme que, pour les codes classiques, toute isométrie deHamming linéaire d'un code linéaire se prolonge en une application monomiale. Cependant, pour les codeslinéaires sur les alphabets de module, l'existence d'un analogue du théorème d'extension n'est pas garantie.Autrement dit, il existe des codes linéaires sur certains alphabets de module dont les isométries de Hammingne sont pas toujours extensibles. Il en est de même pour un contexte plus général d'un alphabet de module munid'une fonction de poids arbitraire. Dans la présente thèse, nous prouvons des analogues du théorèmed'extension pour des codes construits sur des alphabets et fonctions de poids arbitraires. La propriétéd'extension est analysée notamment pour les codes de petite longueur sur un alphabet de module de matrices,les codes MDS généraux, ou encore les codes sur un alphabet de module muni de la composition de poidssymétrisée. Indépendamment de ce sujet, une classification des deux groupes des isométries des codescombinatoires est donnée. Les techniques développées dans la thèse sont prolongées aux cas des codesstabilisateurs quantiques et aux codes de Gabidulin dans le cadre de la métrique rang. / The famous MacWilliams Extension Theorem states that for classical codes each linear Hamming isometry ofa linear code extends to a monomial map. However, for linear codes over module alphabets an analogue of theextension theorem does not always exist. That is, there may exists a linear code over a module alphabet with anunextendable Hamming isometry. The same holds in a more general context of a module alphabet equippedwith a general weight function. Analogues of the extension theorem for different classes of codes, alphabetsand weights are proven in the present thesis. For instance, extension properties of the following codes arestudied: short codes over a matrix module alphabet, maximum distance separable codes, codes over a modulealphabet equipped with the symmetrized weight composition. As a separate result, a classification of twoisometry groups of combinatorial codes is given. The thesis also contains applications of the developedtechniques to quantum stabilizer codes and Gabidulin codes.
6

Théorèmes d'extension et métriques de Kähler-Einstein généralisées / Extension theorems and Kahler-Einstein matrics

Yi, Li 10 December 2012 (has links)
Cette thèse comporte deux parties: - Dans la première partie, nous traitons d'abord une version kahlérienne du célèbre théorème d'extension d'Ohsawa-Takegoshi, puis, un problème de prolongement des courants positifs fermés. Notre motivation provient de la conjecture de Siu sur l'invariance des plurigenres dans le cas d'une famille kahlérienne. En effet, dans la preuve du célèbre théorème d'invariance des plurigenres de Siu, le théorème d'extension d'Ohsawa-Takegoshi joue un rôle important. Il est donc naturel de penser que la preuve de la conjecture fera également intervenir un théorème d'extension de type Ohsawa-Takegoshi dans le cas kahlérien. Suite aux difficultés techniques qui proviennent de la régularisation des fonctions quasi-psh sur les variétés kahlériennes compactes, nous obtenons seulement deux cas particuliers du résultat espéré. Pour ce qui est du prolongement des courants positifs fermés, notre résultat est un cas particulier de la conjecture qui prédit que tout courant positif fermé défini sur le fibré central d'une classe de cohomologie kahlérienne tordue par la classe de Chern du fibré canonique admet un prolongement. - Dans la deuxième partie, nous nous intéressons à l'unicité des solutions des équations de type Monge-Ampère généralisées. Il s'agit d'une généralisation d'un théorème de Bando-Mabuchi concernant les métriques de Kahler-Einstein sur les variétés de Fano. Nous suivons la méthode introduite par Berndtsson et généralisons son résultat en travaillant avec un courant positif fermé à la place d'une paire klt dans son contexte. Les propriétés de convexité des métriques de Bergman jouent un rôle important dans cette partie / This thesis consists in two parts: -In the first part, we first deal with a Kahler version of the famous Ohsawa-Takegoshi extension theorem; then, a problem of extending the closed positive currents. Our motivation comes from the Siu's conjecture on the invariance of plurigenera over a Kahler family. Indeed, in the proof of his famous theorem, the Ohsawa-Takegoshi theorem plays an important role. It is, therefore, natural to think that the proof for the conjecture involves an extension theorem of Ohsawa-Takegoshi type in the Kahler case. Because of the technical difficulties coming from the regularization process of quasi-psh functions over the compact Kahler manifolds, we only obtain two special cases of the hoped result. As for the extension of closed positive currents, our result is a special case of the conjecture which predicts that every closed positive current defined over the central fiber in a Kahler cohomology class twisted by the first Chern class of the canonical bundle admits an extension. -In the second part, we are interested in the uniqueness of the solutions of the equations of generalized Monge-Ampère type, a generalized Bando-Mabuchi theorem concerning the Kahler-Einstein metrics over Fano manifolds. We follow the method introduced by Berndtsson and generalize his result by working with a closed positive current in place of a klt pair in his context. The properties of the convexity of the Bergman metrics play an important role in this part
7

[en] ASPECTS OF TOPOLOGY AND FIXED POINT THEORY / [pt] ASPECTOS DA TOPOLOGIA E DA TEORIA DOS PONTOS FIXOS

LEONARDO HENRIQUE CALDEIRA PIRES FERRARI 17 August 2017 (has links)
[pt] Esse trabalho tem como objetivo reunir os teoremas topológicos de ponto fixo clássicos e seus corolários, além de teoremas de ponto fixo provenientes da teoria do grau e algumas importantes aplicações desses teoremas a variadas áreas - desde as clássicas aplicações à teoria de EDOs e EDPs à uma aplicação à teoria dos jogos. Um exemplo é o Teorema do Ponto Fixo de Schauder-Tychonoff, para aplicações compactas em convexos de espaços localmente convexos, do qual segue como corolário que todo compacto convexo de um espaço vetorial normado (não necessariamente de dimensão finita) possui a propriedade do ponto fixo. No que se refere à teoria dos jogos em particular, foi deduzido o Teorema de Nash, que determina condições sobre as quais certos jogos possuem equilíbrios nos seus espaços das estratégias. Toda a topologia geral necessária nas demonstrações foi desenvolvida extensiva e detalhadamente a partir de topologia elementar, seguindo algumas das referências bibliográficas. O Teorema de Extensão de Dugundji - uma extensão do Teorema de Extensão de Tietze a fechados de espaços métricos sobre espaços localmente convexos -, por exemplo, é demonstrado com detalhes e usado diversas vezes ao longo da dissertação. / [en] The goal of the present work is to gather the classical fixed-point theorems and their corollaries, as well as other fixed-point theorems arising from degree theory, and some important applications to diverse fields - from the classical applications to ODEs and PDEs to an application to the game theory. An example is the Schauder-Tychonoff Fixed-Point Theorem, 1 concerning compact mappings in convex subsets of locally convex spaces, from which it follows as a corollary that every compact convex subset of a normed vector space is a fixed-point space. In regard to game theory in particular, we obtained Nash s theorem, 2 which ascertains conditions over which certain games have equilibria in their strategy spaces. All general topology necessary in the proofs was developed extensively and in details from a basic topology starting point, following some of the bibliographic references. Dugundji s Extension Theorem 3 - an extension of Tietze s Extension Theorem 4 for closed subsets of metric spaces into locally convex spaces-, for instance, is obtained with detais and used throughout the dissertation.
8

Advanced Stochastic Signal Processing and Computational Methods: Theories and Applications

Robaei, Mohammadreza 08 1900 (has links)
Compressed sensing has been proposed as a computationally efficient method to estimate the finite-dimensional signals. The idea is to develop an undersampling operator that can sample the large but finite-dimensional sparse signals with a rate much below the required Nyquist rate. In other words, considering the sparsity level of the signal, the compressed sensing samples the signal with a rate proportional to the amount of information hidden in the signal. In this dissertation, first, we employ compressed sensing for physical layer signal processing of directional millimeter-wave communication. Second, we go through the theoretical aspect of compressed sensing by running a comprehensive theoretical analysis of compressed sensing to address two main unsolved problems, (1) continuous-extension compressed sensing in locally convex space and (2) computing the optimum subspace and its dimension using the idea of equivalent topologies using Köthe sequence. In the first part of this thesis, we employ compressed sensing to address various problems in directional millimeter-wave communication. In particular, we are focusing on stochastic characteristics of the underlying channel to characterize, detect, estimate, and track angular parameters of doubly directional millimeter-wave communication. For this purpose, we employ compressed sensing in combination with other stochastic methods such as Correlation Matrix Distance (CMD), spectral overlap, autoregressive process, and Fuzzy entropy to (1) study the (non) stationary behavior of the channel and (2) estimate and track channel parameters. This class of applications is finite-dimensional signals. Compressed sensing demonstrates great capability in sampling finite-dimensional signals. Nevertheless, it does not show the same performance sampling the semi-infinite and infinite-dimensional signals. The second part of the thesis is more theoretical works on compressed sensing toward application. In chapter 4, we leverage the group Fourier theory and the stochastical nature of the directional communication to introduce families of the linear and quadratic family of displacement operators that track the join-distribution signals by mapping the old coordinates to the predicted new coordinates. We have shown that the continuous linear time-variant millimeter-wave channel can be represented as the product of channel Wigner distribution and doubly directional channel. We notice that the localization operators in the given model are non-associative structures. The structure of the linear and quadratic localization operator considering group and quasi-group are studied thoroughly. In the last two chapters, we propose continuous compressed sensing to address infinite-dimensional signals and apply the developed methods to a variety of applications. In chapter 5, we extend Hilbert-Schmidt integral operator to the Compressed Sensing Hilbert-Schmidt integral operator through the Kolmogorov conditional extension theorem. Two solutions for the Compressed Sensing Hilbert Schmidt integral operator have been proposed, (1) through Mercer's theorem and (2) through Green's theorem. We call the solution space the Compressed Sensing Karhunen-Loéve Expansion (CS-KLE) because of its deep relation to the conventional Karhunen-Loéve Expansion (KLE). The closed relation between CS-KLE and KLE is studied in the Hilbert space, with some additional structures inherited from the Banach space. We examine CS-KLE through a variety of finite-dimensional and infinite-dimensional compressible vector spaces. Chapter 6 proposes a theoretical framework to study the uniform convergence of a compressible vector space by formulating the compressed sensing in locally convex Hausdorff space, also known as Fréchet space. We examine the existence of an optimum subspace comprehensively and propose a method to compute the optimum subspace of both finite-dimensional and infinite-dimensional compressible topological vector spaces. To the author's best knowledge, we are the first group that proposes continuous compressed sensing that does not require any information about the local infinite-dimensional fluctuations of the signal.

Page generated in 0.1014 seconds