The Arithmetic of Kleinian Groups April 20, 2016
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Lecture Notes in Galois Theory
Lecture Notes in Galois Theory Lectures by Dr Sheng-Chi Liu Throughout these notes, signifies end proof, and N signifies end of example. Table of Contents Table of Contents i Lecture 1 Review of Group Theory 1 1.1 Groups . 1 1.2 Structure of cyclic groups . 2 1.3 Permutation groups . 2 1.4 Finitely generated abelian groups . 3 1.5 Group actions . 3 Lecture 2 Group Actions and Sylow Theorems 5 2.1 p-Groups . 5 2.2 Sylow theorems . 6 Lecture 3 Review of Ring Theory 7 3.1 Rings . 7 3.2 Solutions to algebraic equations . 10 Lecture 4 Field Extensions 12 4.1 Algebraic and transcendental numbers . 12 4.2 Algebraic extensions . 13 Lecture 5 Algebraic Field Extensions 14 5.1 Minimal polynomials . 14 5.2 Composites of fields . 16 5.3 Algebraic closure . 16 Lecture 6 Algebraic Closure 17 6.1 Existence of algebraic closure . 17 Lecture 7 Field Embeddings 19 7.1 Uniqueness of algebraic closure . 19 Lecture 8 Splitting Fields 22 8.1 Lifts are not unique . 22 Notes by Jakob Streipel. Last updated December 6, 2019. i TABLE OF CONTENTS ii Lecture 9 Normal Extensions 23 9.1 Splitting fields and normal extensions . 23 Lecture 10 Separable Extension 26 10.1 Separable degree . 26 Lecture 11 Simple Extensions 26 11.1 Separable extensions . 26 11.2 Simple extensions . 29 Lecture 12 Simple Extensions, continued 30 12.1 Primitive element theorem, continued . 30 Lecture 13 Normal and Separable Closures 30 13.1 Normal closure . 31 13.2 Separable closure . 31 13.3 Finite fields . -
A Brief Survey of the Deformation Theory of Kleinian Groups 1
ISSN 1464-8997 (on line) 1464-8989 (printed) 23 Geometry & Topology Monographs Volume 1: The Epstein birthday schrift Pages 23–49 A brief survey of the deformation theory of Kleinian groups James W Anderson Abstract We give a brief overview of the current state of the study of the deformation theory of Kleinian groups. The topics covered include the definition of the deformation space of a Kleinian group and of several im- portant subspaces; a discussion of the parametrization by topological data of the components of the closure of the deformation space; the relationship between algebraic and geometric limits of sequences of Kleinian groups; and the behavior of several geometrically and analytically interesting functions on the deformation space. AMS Classification 30F40; 57M50 Keywords Kleinian group, deformation space, hyperbolic manifold, alge- braic limits, geometric limits, strong limits Dedicated to David Epstein on the occasion of his 60th birthday 1 Introduction Kleinian groups, which are the discrete groups of orientation preserving isome- tries of hyperbolic space, have been studied for a number of years, and have been of particular interest since the work of Thurston in the late 1970s on the geometrization of compact 3–manifolds. A Kleinian group can be viewed either as an isolated, single group, or as one of a member of a family or continuum of groups. In this note, we concentrate our attention on the latter scenario, which is the deformation theory of the title, and attempt to give a description of various of the more common families of Kleinian groups which are considered when doing deformation theory. -
MRD Codes: Constructions and Connections
MRD Codes: Constructions and Connections John Sheekey April 12, 2019 This preprint is of a chapter to appear in Combinatorics and finite fields: Difference sets, polynomials, pseudorandomness and applications. Radon Series on Computational and Applied Mathematics, K.-U. Schmidt and A. Winterhof (eds.). The tables on clas- sifications will be periodically updated (in blue) when further results arise. If you have any data that you would like to share, please contact the author. Abstract Rank-metric codes are codes consisting of matrices with entries in a finite field, with the distance between two matrices being the rank of their difference. Codes with maximum size for a fixed minimum distance are called Maximum Rank Distance (MRD) codes. Such codes were constructed and studied independently by Delsarte (1978), Gabidulin (1985), Roth (1991), and Cooperstein (1998). Rank-metric codes have seen renewed interest in recent years due to their applications in random linear network coding. MRD codes also have interesting connections to other topics such as semifields (finite nonassociative division algebras), finite geometry, linearized polynomials, and cryptography. In this chapter we will survey the known constructions and applications of MRD codes, and present some open problems. arXiv:1904.05813v1 [math.CO] 11 Apr 2019 1 Definitions and Preliminaries 1.1 Rank-metric codes Coding theory is the branch of mathematics concerned with the efficient and accurate transfer of information. Error-correcting codes are used when communication is over a channel in which errors may occur. This requires a set equipped with a distance function, and a subset of allowed codewords; if errors are assumed to be small, then a received message is decoded to the nearest valid codeword. -
Handlebody Orbifolds and Schottky Uniformizations of Hyperbolic 2-Orbifolds
proceedings of the american mathematical society Volume 123, Number 12, December 1995 HANDLEBODY ORBIFOLDS AND SCHOTTKY UNIFORMIZATIONS OF HYPERBOLIC 2-ORBIFOLDS MARCO RENI AND BRUNO ZIMMERMANN (Communicated by Ronald J. Stern) Abstract. The retrosection theorem says that any hyperbolic or Riemann sur- face can be uniformized by a Schottky group. We generalize this theorem to the case of hyperbolic 2-orbifolds by giving necessary and sufficient conditions for a hyperbolic 2-orbifold, in terms of its signature, to admit a uniformization by a Kleinian group which is a finite extension of a Schottky group. Equiva- lent^, the conditions characterize those hyperbolic 2-orbifolds which occur as the boundary of a handlebody orbifold, that is, the quotient of a handlebody by a finite group action. 1. Introduction Let F be a Fuchsian group, that is a discrete group of Möbius transforma- tions—or equivalently, hyperbolic isometries—acting on the upper half space or the interior of the unit disk H2 (Poincaré model of the hyperbolic plane). We shall always assume that F has compact quotient tf = H2/F which is a hyperbolic 2-orbifold with signature (g;nx,...,nr); here g denotes the genus of the quotient which is a closed orientable surface, and nx, ... , nr are the orders of the branch points (the singular set of the orbifold) of the branched covering H2 -» H2/F. Then also F has signature (g;nx,... , nr), and (2 - 2g - £-=1(l - 1/«/)) < 0 (see [12] resp. [15] for information about orbifolds resp. Fuchsian groups). In case r — 0, or equivalently, if the Fuch- sian group F is without torsion, the quotient H2/F is a hyperbolic or Riemann surface without branch points. -
Counting and Effective Rigidity in Algebra and Geometry
COUNTING AND EFFECTIVE RIGIDITY IN ALGEBRA AND GEOMETRY BENJAMIN LINOWITZ, D. B. MCREYNOLDS, PAUL POLLACK, AND LOLA THOMPSON ABSTRACT. The purpose of this article is to produce effective versions of some rigidity results in algebra and geometry. On the geometric side, we focus on the spectrum of primitive geodesic lengths (resp., complex lengths) for arithmetic hyperbolic 2–manifolds (resp., 3–manifolds). By work of Reid, this spectrum determines the commensurability class of the 2–manifold (resp., 3–manifold). We establish effective versions of these rigidity results by ensuring that, for two incommensurable arithmetic manifolds of bounded volume, the length sets (resp., the complex length sets) must disagree for a length that can be explicitly bounded as a function of volume. We also prove an effective version of a similar rigidity result established by the second author with Reid on a surface analog of the length spectrum for hyperbolic 3–manifolds. These effective results have corresponding algebraic analogs involving maximal subfields and quaternion subalgebras of quaternion algebras. To prove these effective rigidity results, we establish results on the asymptotic behavior of certain algebraic and geometric counting functions which are of independent interest. 1. INTRODUCTION 1.1. Inverse problems. 1.1.1. Algebraic problems. Given a degree d central division algebra D over a field k, the set of isomorphism classes of maximal subfields MF(D) of D is a basic and well studied invariant of D. Question 1. Do there exist non-isomorphic, central division algebras D1;D2=k with MF(D1) = MF(D2)? Restricting to the class of number fields k, by a well-known consequence of class field theory, when D=k is a quaternion algebra, MF(D) = MF(D0) if and only if D =∼ D0 as k–algebras. -
Computing Fundamental Domains for Arithmetic Kleinian Groups
Computing fundamental domains for arithmetic Kleinian groups Aurel Page 2010 A thesis submitted in partial fulfilment of the requirements of the degree of Master 2 Math´ematiques Fondamentales Universit´eParis 7 - Diderot Committee: John Voight Marc Hindry A fundamental domain for PSL Z √ 5 2 − The pictures contained in this thesis were realized with Maple code exported in EPS format, or pstricks code produced by LaTeXDraw. Acknowledgements I am very grateful to my thesis advisor John Voight, for introducing the wonder- ful world of quaternion algebras to me, providing me a very exciting problem, patiently answering my countless questions and guiding me during this work. I would like to thank Henri Darmon for welcoming me in Montreal, at the McGill University and at the CRM during the special semester; it was a very rewarding experience. I would also like to thank Samuel Baumard for his careful reading of the early versions of this thesis. Finally, I would like to give my sincerest gratitude to N´eph´eli, my family and my friends for their love and support. Contents I Kleinian groups and arithmetic 1 1 HyperbolicgeometryandKleiniangroups 1 1.1 Theupperhalf-space......................... 1 1.2 ThePoincar´eextension ....................... 2 1.3 Classification of elements . 3 1.4 Kleiniangroups............................ 4 1.5 Fundamentaldomains ........................ 5 2 QuaternionalgebrasandKleiniangroups 9 2.1 Quaternionalgebras ......................... 9 2.2 Splitting................................ 11 2.3 Orders................................. 12 2.4 Arithmetic Kleinian groups and covolumes . 15 II Algorithms for Kleinian groups 16 3 Algorithmsforhyperbolicgeometry 16 3.1 The unit ball model and explicit formulas . 16 3.2 Geometriccomputations . 22 3.3 Computinganexteriordomain . -
THREE DIMENSIONAL MANIFOLDS, KLEINIAN GROUPS and HYPERBOLIC GEOMETRY 1. a Conjectural Picture of 3-Manifolds. a Major Thrust Of
BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 6, Number 3, May 1982 THREE DIMENSIONAL MANIFOLDS, KLEINIAN GROUPS AND HYPERBOLIC GEOMETRY BY WILLIAM P. THURSTON 1. A conjectural picture of 3-manifolds. A major thrust of mathematics in the late 19th century, in which Poincaré had a large role, was the uniformization theory for Riemann surfaces: that every conformai structure on a closed oriented surface is represented by a Riemannian metric of constant curvature. For the typical case of negative Euler characteristic (genus greater than 1) such a metric gives a hyperbolic structure: any small neighborhood in the surface is isometric to a neighborhood in the hyperbolic plane, and the surface itself is the quotient of the hyperbolic plane by a discrete group of motions. The exceptional cases, the sphere and the torus, have spherical and Euclidean structures. Three-manifolds are greatly more complicated than surfaces, and I think it is fair to say that until recently there was little reason to expect any analogous theory for manifolds of dimension 3 (or more)—except perhaps for the fact that so many 3-manifolds are beautiful. The situation has changed, so that I feel fairly confident in proposing the 1.1. CONJECTURE. The interior of every compact ^-manifold has a canonical decomposition into pieces which have geometric structures. In §2, I will describe some theorems which support the conjecture, but first some explanation of its meaning is in order. For the purpose of conservation of words, we will henceforth discuss only oriented 3-manifolds. The general case is quite similar to the orientable case. -
The Geometry and Arithmetic of Kleinian Groups
The Geometry and Arithmetic of Kleinian Groups To the memory of Fred Gehring and Colin Maclachlan Gaven J. Martin∗ Institute for Advanced Study Massey University, Auckland New Zealand email: [email protected] Abstract. In this article we survey and describe various aspects of the geometry and arithmetic of Kleinian groups - discrete nonelementary groups of isometries of hyperbolic 3-space. In particular we make a detailed study of two-generator groups and discuss the classification of the arithmetic generalised triangle groups (and their near relatives). This work is mainly based around my collaborations over the last two decades with Fred Gehring and Colin Maclachlan, both of whom passed away in 2012. There are many others involved as well. Over the last few decades the theory of Kleinian groups has flourished because of its intimate connections with low dimensional topology and geometry. We give little of the general theory and its connections with 3-manifold theory here, but focus on two main problems: Siegel's problem of identifying the minimal covolume hyperbolic lattice and the Margulis constant problem. These are both \universal constraints" on Kleinian groups { a feature of discrete isometry groups in negative curvature and include results such as Jørgensen’s inequality, the higher dimensional version of Hurwitz's 84g − 84 theorem and a number of other things. We will see that big part of the work necessary to obtain these results is in getting concrete descriptions of various analytic spaces of two-generator Kleinian groups, somewhat akin to the Riley slice. 2000 Mathematics Subject Classification: 30F40, 30D50, 51M20, 20H10 Keywords: Kleinian group, hyperbolic geometry, discrete group. -
Arxiv:2103.09350V1 [Math.DS] 16 Mar 2021 Nti Ae Esuytegopo Iainltransformatio Birational Vue
BIRATIONAL KLEINIAN GROUPS SHENGYUAN ZHAO ABSTRACT. In this paper we initiate the study of birational Kleinian groups, i.e. groups of birational transformations of complex projective varieties acting in a free, properly dis- continuous and cocompact way on an open subset of the variety with respect to the usual topology. We obtain a classification in dimension two. CONTENTS 1. Introduction 1 2. Varietiesofnon-negativeKodairadimension 6 3. Complex projective Kleinian groups 8 4. Preliminaries on groups of birational transformations ofsurfaces 10 5. BirationalKleiniangroupsareelementary 13 6. Foliated surfaces 19 7. Invariant rational fibration I 22 8. InvariantrationalfibrationII:ellipticbase 29 9. InvariantrationalfibrationIII:rationalbase 31 10. Classification and proof 43 References 47 1. INTRODUCTION 1.1. Birational Kleinian groups. 1.1.1. Definitions. According to Klein’s 1872 Erlangen program a geometry is a space with a nice group of transformations. One of the implementations of this idea is Ehres- arXiv:2103.09350v1 [math.DS] 16 Mar 2021 mann’s notion of geometric structures ([Ehr36]) which models a space locally on a geom- etry in the sense of Klein. In his Erlangen program, Klein conceived a geometry modeled upon birational transformations: Of such a geometry of rational transformations as must result on the basis of the transformations of the first kind, only a beginning has so far been made... ([Kle72], [Kle93]8.1) In this paper we study the group of birational transformations of a variety from Klein and Ehresmann’s point of vue. Let Y be a smooth complex projective variety and U ⊂ Y a connected open set in the usual topology. Let Γ ⊂ Bir(Y ) be an infinite group of birational transformations. -
Computing Isomorphisms and Embeddings of Finite
Computing isomorphisms and embeddings of finite fields Ludovic Brieulle, Luca De Feo, Javad Doliskani, Jean-Pierre Flori and Eric´ Schost May 4, 2017 Abstract Let Fq be a finite field. Given two irreducible polynomials f; g over Fq, with deg f dividing deg g, the finite field embedding problem asks to compute an explicit descrip- tion of a field embedding of Fq[X]=f(X) into Fq[Y ]=g(Y ). When deg f = deg g, this is also known as the isomorphism problem. This problem, a special instance of polynomial factorization, plays a central role in computer algebra software. We review previous algorithms, due to Lenstra, Allombert, Rains, and Narayanan, and propose improvements and generalizations. Our detailed complexity analysis shows that our newly proposed variants are at least as efficient as previously known algorithms, and in many cases significantly better. We also implement most of the presented algorithms, compare them with the state of the art computer algebra software, and make the code available as open source. Our experiments show that our new variants consistently outperform available software. Contents 1 Introduction2 2 Preliminaries4 2.1 Fundamental algorithms and complexity . .4 2.2 The Embedding Description problem . 11 arXiv:1705.01221v1 [cs.SC] 3 May 2017 3 Kummer-type algorithms 12 3.1 Allombert's algorithm . 13 3.2 The Artin{Schreier case . 18 3.3 High-degree prime powers . 20 4 Rains' algorithm 21 4.1 Uniquely defined orbits from Gaussian periods . 22 4.2 Rains' cyclotomic algorithm . 23 5 Elliptic Rains' algorithm 24 5.1 Uniquely defined orbits from elliptic periods . -
Mor04, Mor12], Provides a Foundational Tool for 1 Solving Problems in A1-Enumerative Geometry
THE TRACE OF THE LOCAL A1-DEGREE THOMAS BRAZELTON, ROBERT BURKLUND, STEPHEN MCKEAN, MICHAEL MONTORO, AND MORGAN OPIE Abstract. We prove that the local A1-degree of a polynomial function at an isolated zero with finite separable residue field is given by the trace of the local A1-degree over the residue field. This fact was originally suggested by Morel's work on motivic transfers, and by Kass and Wickelgren's work on the Scheja{Storch bilinear form. As a corollary, we generalize a result of Kass and Wickelgren relating the Scheja{Storch form and the local A1-degree. 1. Introduction The A1-degree, first defined by Morel [Mor04, Mor12], provides a foundational tool for 1 solving problems in A1-enumerative geometry. In contrast to classical notions of degree, 1 n n the local A -degree is not integer valued: given a polynomial function f : Ak ! Ak with 1 1 A isolated zero p, the local A -degree of f at p, denoted by degp (f), is defined to be an element of the Grothendieck{Witt group of the ground field. Definition 1.1. Let k be a field. The Grothendieck{Witt group GW(k) is defined to be the group completion of the monoid of isomorphism classes of symmetric non-degenerate bilinear forms over k. The group operation is the direct sum of bilinear forms. We may also give GW(k) a ring structure by taking tensor products of bilinear forms for our multiplication. The local A1-degree, which will be defined in Definition 2.9, can be related to other important invariants at rational points. -
Hidden Number Problems
Hidden Number Problems Barak Shani A thesis submitted in fulfillment of the requirements for the degree of Doctor of Philosophy in Mathematics The University of Auckland 2017 Abstract The hidden number problem is the problem of recovering an unknown group element (the \hidden number") given evaluations of some function on products of the hidden number with known elements in the group. This problem enjoys a vast variety of applications, and provides cross-fertilisation among different areas of mathematics. Bit security is a research field in mathematical cryptology that studies leakage of in- formation in cryptographic systems. Of particular interest are public-key cryptosystems, where the study revolves around the information about the private keys that the public keys leak. Ideally no information is leaked, or more precisely extraction of partial in- formation about the secret keys is (polynomially) equivalent to extraction of the entire keys. Accordingly, studies in this field focus on reducing the problem of recovering the private key to the problem of recovering some information about it. This is done by designing algorithms that use the partial information to extract the keys. The hidden number problem was originated to study reductions of this kind. This thesis studies the hidden number problem in different groups, where the functions are taken to output partial information on the binary representation of the input. A spe- cial focus is directed towards the bit security of Diffie–Hellman key exchange. The study presented here provides new results on the hardness of extracting partial information about Diffie–Hellman keys. Contents 1 Introduction 1 1.1 Summary of Contributions .