• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 6
  • 4
  • 1
  • 1
  • Tagged with
  • 14
  • 14
  • 8
  • 8
  • 6
  • 4
  • 4
  • 4
  • 4
  • 3
  • 3
  • 3
  • 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

Derived arithmetic Fuchsian groups of genus two

Macasieb, Melissa Lorena 28 August 2008 (has links)
Not available / text
2

Derived arithmetic Fuchsian groups of genus two

Macasieb, Melissa Lorena, January 1900 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2005. / Vita. Includes bibliographical references.
3

Fuchsian groups of signature (0 : 2, ... , 2; 1; 0) with rational hyperbolic fixed points

Norfleet, Mark Alan 23 October 2013 (has links)
We construct Fuchsian groups [Gamma] of signature (0 : 2, ... ,2 ;1;0) so that the set of hyperbolic fixed points of [Gamma] will contain a given finite collection of elements in the boundary of the hyperbolic plane. We use this to establish that there are infinitely many non-commensurable non-cocompact Fuchsian groups [Delta] of finite covolume sitting in PSL₂(Q) so that the set of hyperbolic fixed points of [Delta] will contain a given finite collection of rational boundary points of the hyperbolic plane. We also give a parameterization of Fuchsian groups of signature (0:2,2,2;1;0) and investigate when particular hyperbolic elements have rational fixed points. Moreover, we include a detailed list of the group elements and their killer intervals for the known pseudomodular groups that Long and Reid found; in addition, the list contains a new list of killer intervals for a pseudomodular group not found by Long and Reid. / text
4

Essential spanning forests and electric networks in groups /

Solomyak, Margarita. January 1997 (has links)
Thesis (Ph. D.)--University of Washington, 1997. / Vita. Includes bibliographical references (leaves [51]-52).
5

Spectral Rigidity and Flexibility of Hyperbolic Manifolds

Justin E Katz (16707999) 31 July 2023 (has links)
<pre>In the first part of this thesis we show that, for a given non-arithmetic closed hyperbolic <i>$</i><i>n</i><i>$</i> manifold <i>$</i><i>M</i><i>$</i>, there exist for each positive integer <i>$</i><i>j</i><i>$</i>, a set <i>$</i><i>M_</i><i>1</i><i>,...,M_j</i><i>$</i> of pairwise nonisometric, strongly isospectral, finite covers of <i>$</i><i>M</i><i>$</i>, and such that for each <i>$</i><i>i,i'</i><i>$</i> one has isomorphisms of cohomology groups <i>$</i><i>H^*(M_i,</i><i>\Zbb</i><i>)=H^*(M_{i'},</i><i>\Zbb</i><i>)</i><i>$</i> which are compatible with respect to the natural maps induced by the cover. In the second part, we prove that hyperbolic <i>$</i><i>2</i><i>$</i>- and <i>$</i><i>3</i><i>$</i>-manifolds which arise from principal congruence subgroups of a maixmal order in a quaternion algebra having type number <i>$</i><i>1</i><i>$</i> are absolutely spectrally rigid. One consequence of this is a partial answer to an outstanding question of Alan Reid, concerning the spectral rigidity of Hurwitz surfaces.</pre>
6

Finite quotients of triangle groups

Frankie Chan (11199984) 29 July 2021 (has links)
Extending an explicit result from Bridson–Conder–Reid, this work provides an algorithm for distinguishing finite quotients between cocompact triangle groups Δ ?and lattices Γ of constant curvature symmetric 2-spaces. Much of our attention will be on when these lattices are Fuchsian groups. We prove that it will suffice to take a finite quotient that is Abelian, dihedral, a subgroup of PSL(<i>n</i>,<b>F</b><sub><i>q</i></sub>) (for an odd prime power q), or an Abelian extension of one of these 3 groups. For the latter case, we will require and develop an approach for creating group extensions upon a shared finite quotient of Δ? and Γ which between them have differing degrees of smoothness. Furthermore, on the order of a finite quotient that distinguishes between ?Δ and Γ, we are able to establish an effective upperbound that is superexponential depending on the cone orders appearing in each group.<br>
7

Delaunay triangulations of a family of symmetric hyperbolic surfaces in practice / Triangulations de Delaunay d'une famille de surfaces hyperboliques symétriques en pratique

Iordanov, Iordan 12 March 2019 (has links)
La surface de Bolza est la surface hyperbolique orientable compacte la plus symétrique de genre 2. Pour tout genre supérieur à 2, il existe une surface orientable compacte construite de manière similaire à la surface de Bolza et ayant le même type de symétries. Nous appelons ces surfaces des surfaces hyperboliques symétriques. Cette thèse porte sur le calcul des triangulations de Delaunay (TD) de surfaces hyperboliques symétriques. Les TD de surfaces compactes peuvent être considérées comme des TD périodiques de leur revêtement universel (dans notre cas, le plan hyperbolique). Une TD est pour nous un complexe simplicial. Cependant, les ensembles de points ne définissent pas tous une décomposition simpliciale d'une surface hyperbolique symétrique. Dans la littérature, un algorithme a été proposé pour traiter ce problème avec l'utilisation de points factices : initialement une TD de la surface est construite avec un ensemble de points connu, puis des points d'entrée sont insérés avec le célèbre algorithme incrémental de Bowyer, et enfin les points factices sont supprimés, si la triangulation reste toujours un complexe simplicial. Pour la surface de Bolza, les points factices sont spécifiés. L'algorithme existant calcule une DT de la surface de Bolza comme une DT périodique du plan hyperbolique, ce qui nécessite de travailler dans un sous-ensemble approprié du plan hyperbolique. Nous étudions les propriétés des TD de la surface de Bolza définies par des ensembles de points contenants l'ensemble proposé de points factices, et nous décrivons en détail une implémentation de l'algorithme incrémentiel pour cette surface. Nous commençons par définir un représentant canonique unique qui est contenu dans un sous-ensemble borné du plan hyperbolique pour chaque face d'une TD de la surface. Nous donnons une structure de données pour représenter une TD de la surface de Bolza via les représentants canoniques de ses faces. Nous détaillons les étapes de la construction d'une telle triangulation et les opérations supplémentaires qui permettent de localiser les points et de retirer des sommets. Nous présentons également les résultats sur le degré algébrique des prédicats nécessaires pour toutes les opérations. Nous fournissons une implémentation entièrement dynamique pour la surface de Bolza, en offrant l'insertion de nouveaux points, la suppression des sommets existants, la localisation des points, et la construction d'objets duaux. Notre implémentation est basée sur la bibliothèque CGAL (Computational Geometry Algorithms Library), et est actuellement en cours de révision pour être intégrée dans la bibliothèque. L'intégration de notre code dans CGAL nécessite que tous les objets que nous introduisons soient compatibles avec le cadre existant et conformes aux standards adoptés par la bibliothèque. Nous donnons une description détaillée des classes utilisées pour représenter et traiter les triangulations hyperboliques périodiques et les objets associés. Des analyses comparatives et des tests sont effectués pour évaluer notre implémentation, et une application simple est donnée sous la forme d'une démonstration CGAL. Nous discutons une extension de notre implémentation à des surfaces hyperboliques symétriques de genre supérieur à 2. Nous proposons trois méthodes pour engendrer des ensembles de points factices pour chaque surface et présentons les avantages et les inconvénients de chaque méthode. Nous définissons un représentant canonique contenu dans un sous-ensemble borné du plan hyperbolique pour chaque face d'une TD de la surface. Nous décrivons une structure de données pour représenter une telle triangulation via les représentants canoniques de ses faces, et donnons des algorithmes pour l'initialisation de la triangulation. Enfin, nous discutons une implémentation préliminaire dans laquelle nous examinons les difficultés d'avoir des prédicats exacts efficaces pour la construction de TD de surfaces hyperboliques symétriques / The Bolza surface is the most symmetric compact orientable hyperbolic surface of genus 2. For any genus higher than 2, there exists one compact orientable surface constructed in a similar way as the Bolza surface having the same kind of symmetry. We refer to this family of surfaces as symmetric hyperbolic surfaces. This thesis deals with the computation of Delaunay triangulations of symmetric hyperbolic surfaces. Delaunay triangulations of compact surfaces can be seen as periodic Delaunay triangulations of their universal cover (in our case, the hyperbolic plane). A Delaunay triangulation is for us a simplicial complex. However, not all sets of points define a simplicial decomposition of a symmetric hyperbolic surface. In the literature, an algorithm has been proposed to deal with this issue by using so-called dummy points: initially a triangulation of the surface is constructed with a set of dummy points that defines a Delaunay triangulation of the surface, then input points are inserted with the well-known incremental algorithm by Bowyer, and finally the dummy points are removed, if the triangulation remains a simplicial complex after their removal. For the Bolza surface, the set of dummy points to initialize the triangulation is given. The existing algorithm computes a triangulation of the Bolza surface as a periodic triangulation of the hyperbolic plane and requires to identify a suitable subset of the hyperbolic plane in which to work. We study the properties of Delaunay triangulations of the Bolza surface defined by sets of points containing the proposed set of dummy points, and we describe in detail an implementation of the incremental algorithm for it. We begin by identifying a subset of the hyperbolic plane that contains at least one representative for each face of a Delaunay triangulation of the surface, which enables us to define a unique canonical representative in the hyperbolic plane for each face on the surface. We give a data structure to represent a Delaunay triangulation of the Bolza surface via the canonical representatives of its faces in the hyperbolic plane. We detail the construction of such a triangulation and additional operations that enable the location of points and the removal of vertices. We also report results on the algebraic degree of predicates needed for all operations. We provide a fully dynamic implementation for the Bolza surface, supporting insertion of new points, removal of existing vertices, point location, and construction of dual objects. Our implementation is based on CGAL, the Computational Geometry Algorithms Library, and is currently under revision for integration in the library. To incorporate our code into CGAL, all the objects that we introduce must be compatible with the existing framework and comply with the standards adopted by the library. We give a detailed description of the classes used to represent and handle periodic hyperbolic triangulations and related objects. Benchmarks and tests are performed to evaluate our implementation, and a simple application is given in the form of a CGAL demo. We discuss an extension of our implementation to symmetric hyperbolic surfaces of genus higher than 2. We propose three methods to generate sets of dummy points for each surface and present the advantages and shortcomings of each method. We identify a suitable subset of the hyperbolic plane that contains at least one representative for each face of a Delaunay triangulation of the surface, and we define a canonical representative in the hyperbolic plane for each face on the surface. We describe a data structure to represent such a triangulation via the canonical representatives of its faces, and give algorithms for the initialization of the triangulation with dummy points. Finally, we discuss a preliminary implementation in which we examine the difficulties of having efficient exact predicates for the construction of Delaunay triangulations of symmetric hyperbolic surfaces
8

Análise dos emparelhamentos de arestas de polígonos hiperbólicos para a construção de constelações de sinais geometricamente uniformes / Analysis of the pairing up of hyperbolical polygon sides for the construction of sign constellation geometrical uniform

Alves, Alessandro Ferreira 19 August 2018 (has links)
Orientador: Reginaldo Palazzo Junior / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-19T09:31:01Z (GMT). No. of bitstreams: 1 Alves_AlessandroFerreira_D.pdf: 1080224 bytes, checksum: 0748952c3176e9548151bec7e6d9c71d (MD5) Previous issue date: 2011 / Resumo: Para projetarmos um sistema de comunicação digital em espaços hiperbólicos é necessário estabelecer um procedimento sistemático de construção de reticulados como elemento base para a construção de constelações de sinais. De outra forma, em codificação de canal é de fundamental importância a caracterização das estruturas algébrica e geométrica associadas a canais discretos sem memória. Neste trabalho, apresentamos a caracterização geométrica de superfícies a partir dos possíveis emparelhamentos das arestas do polígono fundamental hiperbólico com 3 ? n ? 8 lados associado 'a superfície. Esse tratamento geométrico apresenta propriedades importantes na determinação dos reticulados hiperbólicos a serem utilizados no processo de construção de constelações de sinais, a partir de grupos fuchsianos aritméticos e da superfície de Riemann associada. Além disso, apresentamos como exemplo o desenvolvimento algébrico para a determinação dos geradores do grupo fuchsiano 'gama'8 associado ao polígono hiperbólico 'P IND. 8' / Abstract: In order to design a digital communication system in hyperbolic spaces is necessary to establish a systematic procedure of constructing lattices as the basic element for the construction of the signal constellations. On the other hand, in channel coding is of fundamental importance to characterize the geometric and algebraic structures associated with discrete memoryless channels. In this work, we present a geometric characterization of surfaces from the edges of the possible pairings of fundamental hyperbolic polygon with 3 ? n ? 8 sides associated with the surface. This treatment has geometric properties important in determining the hyperbolic lattices to be used in the construction of sets of signals derived from arithmetic Fuchsian groups and the associated Riemann surface / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica
9

Sistemas dinâmicos de eventos discretos com aplicação ao fluxo geodésico em superfícies hiperbólicas / Discrete event dynamical systems with application to the geodesic flow on hyperbolic surfaces

Chaves, Daniel Pedro Bezerra 12 May 2011 (has links)
Orientador: Reginaldo Palazzo Júnior / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-19T10:50:06Z (GMT). No. of bitstreams: 1 Chaves_DanielPedroBezerra_D.pdf: 1159929 bytes, checksum: 06894c7e904c6209a690af3080f7cc32 (MD5) Previous issue date: 2011 / Resumo: Neste trabalho apresentamos um método de descrição combinatorial para o fluxo geodesico sobre uma região hiperbólica compacta, tendo como objetivo associar a seqüências de codificação, parâmetros topologicos oriundos destas superfícies. Isto permite conjugar conceitos topologicos e combinatoriais oriundos das superfícies estudadas com conceitos de teoria da informação e codificação. Demonstramos como a propriedade de completude de um sistema dinâmico de eventos discretos invariantes no tempo se reflete na topologia do espaço de trajetórias do sistema, quando especificadas por seqüências bi-infinitas e descritas sobre um alfabeto finito. A mesma estrutura obtida pelo processo de codificação do fluxo geodesico, e a qual passamos a chamar de sistema simbólico fechado (ssf). Identificamos como um ssf pode ser caracterizado globalmente, através do seu conjunto de restrições irredutíveis, ou localmente, por conjuntos de restrições dependentes do contexto. Ambas derivadas de relações de ordem parcial. Disto determinamos métodos de representação do ssf. Através da relação entre os métodos de codificação aritmético e geométrico, propomos processos de codificação sobre superfícies hiperbólicas, determinando como as representações mínimas das seqüências código do fluxo geodesico podem ser construídas a partir das propriedades topológicas e combinatoriais da superfície / Abstract: In this work we present methods for a combinatorial description of the geodesic flow on a hyperbolic compact surface, with the intent of identifying how the topological parameters of the surface may be associated with discrete sequences. This approach allows to conjugate the topological and combinatorial properties of a surface with concepts of information theory and coding. We determine the intrinsic topological property of complete and time-invariant discrete dynamical systems whose trajectories are bi-infinite sequences over a finite alphabet. The same structure generated by the geodesic flow coding methods, that we call shift space. We show how a shift space can be completely characterized by the irreducible forbidden set and locally by the constraint sets, and how both can be obtained through partial order relations. As consequence of these results, some constructions to represent the shift spaces are proposed. Methods for coding source sequences on hyperbolic surfaces are proposed, based on T-piecewise and common-sets relations that exist between these methods. We conclude by specifying a construction procedure for presentations of arithmetic codes that is related with the topological and combinatorial properties of the hyperbolic surface / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica
10

Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups

Larsson, David January 2015 (has links)
The work of mathematical giants, such as Lobachevsky, Gauss, Riemann, Klein and Poincaré, to name a few, lies at the foundation of the study of the highly structured Riemann surfaces, which allow definition of holomorphic maps, corresponding to analytic maps in the theory of complex analysis. A topological result of Poincaré states that every path-connected Riemann surface can be realised by a construction of identifying congruent points in the complex plane, the Riemann sphere or the hyperbolic plane; just three simply connected surfaces that cover the underlying Riemann surface. This requires the discontinuous action of a discrete subgroup of the automorphisms of the corresponding space. In the hyperbolic plane, which is the richest source for Riemann surfaces, these groups are called Fuchsian, and there are several ways to study the action of such groups geometrically by computing fundamental domains. What is accomplished in this thesis is a combination of the methods found by Reidemeister &amp; Schreier, Singerman and Voight, and thus provides a unified way of finding Dirichlet domains for subgroups of cofinite groups with a given index. Several examples are considered in-depth.

Page generated in 0.0568 seconds