• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 6
  • 2
  • 1
  • Tagged with
  • 11
  • 5
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 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

Ultrametric Fewnomial Theory

Ibrahim Abdelhalim, Ashraf 2009 December 1900 (has links)
An ultrametric field is a field that is locally compact as a metric space with respect to a non-archimedean absolute value. The main topic of this dissertation is to study roots of polynomials over such fields. If we have a univariate polynomial with coefficients in an ultrametric field and non-vanishing discriminant, then there is a bijection between the set of roots of the polynomial and classes of roots of the same polynomial in a finite ring. As a consequence, there is a ball in the polynomial space where all polynomials in it have the same number of roots. If a univariate polynomial satisfies certain generic conditions, then we can efficiently compute the exact number of roots in the field. We do that by using Hensel's lemma and some properties of Newton's polygon. In the multivariate case, if we have a square system of polynomials, we consider the tropical set which is the intersection of the tropical varieties of its polynomials. The tropical set contains the set of valuations of the roots, and for every point in the tropical set, there is a corresponding system of lower polynomials. If the system satisfies some generic conditions, then for each point w in the tropical set the number of roots of valuation w equals the number roots of valuation w of the lower system. The last result enables us to compute the exact number of roots of a polynomial system where the tropical set is finite and the lower system consists of binomials. This algorithmic method can be performed in polynomial-time if we fix the number of variables. We conclude the dissertation with a discussion of the feasibility problem. We consider the problem of the p-adic feasibility of polynomials with integral coefficients with the prime number p as a part of the input. We prove this problem can be solved in nondeterministic polynomial-time. Furthermore, we show that any problem, which can be solved in nondeterministic polynomial-time, can be reduced to this feasibility problem in randomized polynomial-time.
2

On the convergence and analytical properties of power series on non-Archimedean field extensions of the real numbers

Grafton, William 19 September 2016 (has links)
n this thesis the analytic properties of power series over a class of non-Archimedean field extensions of the real numbers, a representative of which will be denoted by F, are investigated. In Chapter 1 we motivate the interest in said fields by recalling work done by K. Shamseddine and M. Berz . We first review some properties of well-ordered subsets of the rational numbers which are used in the construction of such a field F. Then, we define operations + and * which make F a field. Then we define an order under which F is non-Archimedean with infinitely small and infinitely large elements. We embed the real numbers as a subfield; and the embedding is compatible with the order. Then, in Chapter 2, we define an ultrametric on F which induces the same topology as the order on the field. This topology will allow us to define continuity and differentiability of functions on F which we shall show are insufficient conditions to ensure intermediate values, extreme values, et cetera. We shall study convergence of sequences and series and then study the analytical properties of power series, showing they have the same smoothness properties as real power series; in particular they satisfy the intermediate value theorem, the extreme value theorem and the mean value theorem on any closed interval within their domain of convergence. / October 2016
3

Approximation Algorithms for Constructing Evolutionary Trees

Huang, Chia-Mao 10 August 2001 (has links)
In this thesis, we shall propose heuristic algorithms to construct evolutionary trees under the distance base model. For a distance matrix of any type, the problem of constructing a minimum ultrametric tree (MUT), whose scoring function is the minimum tree size, is NP-hard. Furthermore, the problem of constructing an approximate ultrametric tree with approximation error ratio within $n^{epsilon}, epsilon > 0$, is also NP-hard. When the distance matrix is metric, the problem is called the triangle minimum ultrametric tree problem ($ riangle$MUT). For the $ riangle$MUT, there is a previous approximation algorithm, with error ratio $leq 1.5 ( lceil log n ceil + 1 )$. And we shall propose an improvement, with error ratio $leq lceil log_{alpha} n ceil + 1 cong 1.44 lceil log n ceil + 1$, where $alpha = frac{sqrt{5}+1}{2}$ for solving the $ riangle$MUT problem. We shall also propose a heuristic algorithm to obtain a good leaf node circular order. The heuristic algorithm is based on the clustering scheme. And then we shall design a dynamic programming algorithm to construct the optimal ultrametric tree with some fixed leaf node circular order. The time complexity of the dynamic programming is $O(n^3)$, if the scoring function is the minimum tree size or $L^1$-min increment.
4

Urysohn ultrametric spaces and isometry groups.

Shao, Chuang 05 1900 (has links)
In this dissertation we study a special sub-collection of Polish metric spaces: complete separable ultrametric spaces. Polish metric spaces have been studied for quite a long while, and a lot of results have been obtained. Motivated by some of earlier research, we work on the following two main parts in this dissertation. In the first part, we show the existence of Urysohn Polish R-ultrametric spaces, for an arbitrary countable set R of non-negative numbers, including 0. Then we give point-by-point construction of a countable R-ultra-Urysohn space. We also obtain a complete characterization for the set R which corresponding to a R-Urysohn metric space. From this characterization we conclude that there exist R-Urysohn spaces for a wide family of countable R. Moreover, we determine the complexity of the classification of all Polish ultrametric spaces. In the second part, we investigate the isometry groups of Polish ultrametric spaces. We prove that isometry group of an Urysohn Polish R-ultrametric space is universal among isometry groups of Polish R-ultrametric spaces. We completely characterize the isometry groups of finite ultrametric spaces and the isometry groups of countable compact ultrametric spaces. Moreover, we give some necessary conditions for finite groups to be isomorphic to some isometry groups of finite ultrametric spaces.
5

Distances within and between Metric Spaces: Metric Geometry, Optimal Transport and Applications to Data Analysis

Wan, Zhengchao January 2021 (has links)
No description available.
6

The Persistent Topology of Geometric Filtrations

Wang, Qingsong 06 September 2022 (has links)
No description available.
7

Quantum mechanics on profinite groups and partial order

Vourdas, Apostolos January 2013 (has links)
no / Inverse limits and profinite groups are used in a quantum mechanical context. Two cases are considered: a quantum system with positions in the profinite group Z(p) and momenta in the group Q(p)/Z(p), and a quantum system with positions in the profinite group (Z) over cap and momenta in the group Q/Z. The corresponding Schwatz-Bruhat spaces of wavefunctions and the Heisenberg-Weyl groups are discussed. The sets of subsystems of these systems are studied from the point of view of partial order theory. It is shown that they are directed-complete partial orders. It is also shown that they are topological spaces with T-0-topologies, and this is used to define continuity of various physical quantities. The physical meaning of profinite groups, non-Archimedean metrics, partial orders and T-0-topologies, in a quantum mechanical context, is discussed.
8

Modélisation surfacique et volumique de la peau : classification et analyse couleur / Skin surface and volume modeling : clustering and color analysis

Breugnot, Josselin 27 June 2011 (has links)
Grâce aux innovations technologiques récentes, l’exploration cutanée est devenue de plus en plus facile et précise. Le relevé topographique de la surface de peau par projection de franges ainsi que l’exploration des structures intradermiques par microscopie confocale in-vivo en sont des exemples parfaits. La mise en place de ces techniques et les développements sont présentés dans cette thèse. L’apport de l’imagerie est évident tant pour le traitement des acquisitions de ces appareils que pour l’évaluation de paramètres cutanés à partir de photographie par exemple. L’extension du modèle LIP niveaux de gris à la couleur a été réalisée pour apporter une évaluation proche de celle d’un expert grâce aux fondements logarithmiques du modèle, proches de la vision humaine. Enfin, la classification de données dans une image, sujet omniprésent dans le traitement d’images, a été abordée par les classifications hiérarchiques ascendantes, utilisant un cadre mathématique rigoureux grâce aux métriques ultramétriques / Thanks to recent developments, skin evaluation has become easier and more accurate. Topographical evaluation of skin surface by fringes projection as intra-dermal structures and exploration by in-vivo laser confocal microscopy are some examples. The use and development of these tools are developed in this thesis. Image processing contribution is obvious, as much for the treatment of these tools acquisitions, as for cutaneous parameters evaluation, based on digital camera acquisitions for example. Grey level LIP model extension to color has been realized in order to bring way of analysis near to the expert one, thanks to logarithmic bases of this model, very close to the human vision. At least, data clustering in images, a redundant topic in image analysis, has been approached by ascending hierarchical clustering, using rigorous mathematical properties thanks to the ultrametric distances
9

Etude des Espaces Lipschitz-libres / Study of Lipschitz-free spaces

Dalet, Aude 16 June 2015 (has links)
Godefroy et Ozawa ont montré qu’il existe un espace compact dont l’espace libre n’a pas la propriété d’approximation. Il est donc naturel de se demander quels sont les espaces métriques dont l’espace libre à la propriété d’approximation bornée. Grothendieck a montré qu’un dual séparable ayant la propriété d’approximation a la propriété d’approximation métrique. Ce résultat justifie l’utilité de savoir si un espace libre est un dual. Le premier chapitre est consacré à la dualité. Pour commencer nous présentons un théorème permettant de montrer qu’un espace de Banach séparable est le dual d’un sous-espace de son dual, sous conditions. Nous expliquons ensuite comment appliquer ce théorème dans le cadre des espaces libres. Dans la suite du chapitre nous l’appliquons aux espaces propres dénombrables ou ultramétriques. Dans le deuxième chapitre nous nous intéressons à la propriété d’approximation métrique sur l’espace libre des espaces propres dénombrables. Nous énonçons tout d’abord un résultat dû à Kalton puis nous l’utilisons pour montrer que sous ces hypothèses, l’espace libre a la propriété d’approximation métrique. Le troisième chapitre est dédié à l’étude des espaces libres sur les espaces ultramétriques. Nous montrons dans un premier temps que lorsque l’espace ultramétrique est propre, son espace libre a la propriété d’approximation métrique et est isomorphe à l1, de plus il admet un prédualisomorphe à c0. Enfin, en collaboration avec P. Kaufmann et A. Prochàzka, nous montrons que l’espace libre sur un espace ultramétrique n’est jamais isométrique à un espace l1 et nous généralisons ce résultat à certains sous-ensembles des arbres réels séparables. / Godefroy and Ozawa have proved that there exists a compact space with a free space failing the approximation property. Then it is natural to ask what are the metric spaces whose freespace has the bounded approximation property. Grothendieck has proved that a separable Banach space with the approximation property has the metric approximation property. This result justifies why it is interesting to know whether a free space is a dual space. The first chapter is dedicated to duality. First we introduce a result to prove that a Banach space is a dual space, under some conditions. Then we explain how to use it in the context offree spaces and finally we apply it to countable or ultrametric proper metric spaces.In the second chapter, we study the metric approximation property of free spaces overcountable proper metric spaces.In the third chapter, ultrametric spaces are investigated. We prove first that the free spaceover a proper ultrametric space has the metric approximation property, is isomorphic to l1 andadmits a predual isomorphic to c0. Finally, in collaboration with P. Kaufmann et A. Proch`azka,we prove that the free space over a ultrametric space is never isometric to l1 and we generalizethis result to some subsets of separable R-trees.
10

Ramification of polynomials

Strikic, Ana January 2021 (has links)
In this research,we study iterations of non-pleasantly ramified polynomials over fields of positive characteristic and subsequently, their lower ramification numbers. Of particular interest for this thesis are polynomials for which both the multiplicity and  the degree of its iterates grow exponentially. Specifically we consider the family  of polynomials such that given a positive integer k the family is given by P(z) = z(1 + z (3^k-1)/2 + z3^k-1). The cubic polynomial z + z2 + z3 is a special case of this family and is particularly interesting.

Page generated in 0.0626 seconds