Computational And Algorithmic Problems In Finite Fields

Author by : Igor Shparlinski
Languange : en
Publisher by : Springer Science & Business Media
Format Available : PDF, ePub, Mobi
Total Read : 15
Total Download : 882
File Size : 40,9 Mb
GET BOOK

Description : This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other araes of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc.) The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presuppose only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.


Finite Fields Theory And Computation

Author by : Igor Shparlinski
Languange : en
Publisher by : Springer
Format Available : PDF, ePub, Mobi
Total Read : 82
Total Download : 680
File Size : 48,7 Mb
GET BOOK

Description : This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields to other areas of mathematics. For completeness we in clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener ators, modular arithmetic, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR.


Finite Fields

Author by : Gary L. Mullen
Languange : en
Publisher by : American Mathematical Soc.
Format Available : PDF, ePub, Mobi
Total Read : 30
Total Download : 351
File Size : 48,5 Mb
GET BOOK

Description : Because of their applications in so many diverse areas, finite fields continue to play increasingly important roles in various branches of modern mathematics, including number theory, algebra, and algebraic geometry, as well as in computer science, information theory, statistics, and engineering. Computational and algorithmic aspects of finite field problems also continue to grow in importance. This volume contains the refereed proceedings of a conference entitled Finite Fields: Theory, Applications and Algorithms, held in August 1993 at the University of Nevada at Las Vegas. Among the topics treated are theoretical aspects of finite fields, coding theory, cryptology, combinatorial design theory, and algorithms related to finite fields. Also included is a list of open problems and conjectures. This volume is an excellent reference for applied and research mathematicians as well as specialists and graduate students in information theory, computer science, and electrical engineering.


Finite Fields And Applications

Author by : Gary L. Mullen
Languange : en
Publisher by : American Mathematical Soc.
Format Available : PDF, ePub, Mobi
Total Read : 58
Total Download : 263
File Size : 48,7 Mb
GET BOOK

Description : This volume contains the proceedings of the Eighth International Conference on Finite Fields and Applications, held in Melbourne, Australia, July 9-13, 2007. It contains 5 invited survey papers as well as original research articles covering various theoretical and applied areas related to finite fields. Finite fields, and the computational and algorithmic aspects of finite field problems, continue to grow in importance and interest in the mathematical and computer science communities because of their applications in so many diverse areas. In particular, finite fields now play very important roles in number theory, algebra, and algebraic geometry, as well as in computer science, statistics, and engineering. Areas of application include algebraic coding theory, cryptology, and combinatorial design theory.


Finite Fields Theory And Computation

Author by : Igor Shparlinski
Languange : en
Publisher by : Springer Science & Business Media
Format Available : PDF, ePub, Mobi
Total Read : 53
Total Download : 574
File Size : 50,7 Mb
GET BOOK

Description : This book is mainly devoted to some computational and algorithmic problems in finite fields such as, for example, polynomial factorization, finding irreducible and primitive polynomials, the distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types and new applications of finite fields to other areas of mathematics. For completeness we in clude two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number gener ators, modular arithmetic, etc.) and computational number theory (primality testing, factoring integers, computation in algebraic number theory, etc.). The problems considered here have many applications in Computer Science, Cod ing Theory, Cryptography, Numerical Methods, and so on. There are a few books devoted to more general questions, but the results contained in this book have not till now been collected under one cover. In the present work the author has attempted to point out new links among different areas of the theory of finite fields. It contains many very important results which previously could be found only in widely scattered and hardly available conference proceedings and journals. In particular, we extensively review results which originally appeared only in Russian, and are not well known to mathematicians outside the former USSR.


Handbook Of Finite Fields

Author by : Gary L. Mullen
Languange : en
Publisher by : CRC Press
Format Available : PDF, ePub, Mobi
Total Read : 67
Total Download : 605
File Size : 53,5 Mb
GET BOOK

Description : Poised to become the leading reference in the field, the Handbook of Finite Fields is exclusively devoted to the theory and applications of finite fields. More than 80 international contributors compile state-of-the-art research in this definitive handbook. Edited by two renowned researchers, the book uses a uniform style and format throughout and


Algorithms And Computation

Author by : Ding-Zhu Du
Languange : en
Publisher by : Springer Science & Business Media
Format Available : PDF, ePub, Mobi
Total Read : 34
Total Download : 192
File Size : 55,7 Mb
GET BOOK

Description : This volume is the proceedings of the fifth International Symposium on Algorithms and Computation, ISAAC '94, held in Beijing, China in August 1994. The 79 papers accepted for inclusion in the volume after a careful reviewing process were selected from a total of almost 200 submissions. Besides many internationally renowned experts, a number of excellent Chinese researchers present their results to the international scientific community for the first time here. The volume covers all relevant theoretical and many applicational aspects of algorithms and computation.


Finite Fields Theory Applications And Algorithms

Author by : Ronald Cleveland Mullin
Languange : en
Publisher by : American Mathematical Soc.
Format Available : PDF, ePub, Mobi
Total Read : 12
Total Download : 497
File Size : 44,8 Mb
GET BOOK

Description : The Fourth International Conference on Finite Fields: Theory, Applications, and Algorithms was held at the University of Waterloo in August 1997. This volume presents the refereed proceedings. Because of its applications in so many diverse areas, finite fields continues to grow in importance in modern mathematics. Finite fields now play particularly important roles in number theory, algebra, and algebraic geometry. They also play a crucial role in computer science, statistics, and engineering. Areas of application include but are not limited to algebraic coding theory, cryptology, and combinatorial design theory. Computational and algorithmic aspects of finite field problems are also growing in significance. The conference drew workers in theoretical, applied, and algorithmic finite field theory. All papers were refereed. They are loosely classified as theoretical and applied and are listed under these general headings. The work contains up-to-date results from leading experts in the field.


Finite Fields And Their Applications

Author by : Pascale Charpin
Languange : en
Publisher by : Walter de Gruyter
Format Available : PDF, ePub, Mobi
Total Read : 38
Total Download : 647
File Size : 52,6 Mb
GET BOOK

Description : This book is based on the invited talks of the "RICAM-Workshop on Finite Fields and Their Applications: Character Sums and Polynomials" held at the Federal Institute for Adult Education (BIfEB) in Strobl, Austria, from September 2-7, 2012. Finite fields play important roles in many application areas such as coding theory, cryptography, Monte Carlo and quasi-Monte Carlo methods, pseudorandom number generation, quantum computing, and wireless communication. In this book we will focus on sequences, character sums, and polynomials over finite fields in view of the above mentioned application areas: Chapters 1 and 2 deal with sequences mainly constructed via characters and analyzed using bounds on character sums. Chapters 3, 5, and 6 deal with polynomials over finite fields. Chapters 4 and 9 consider problems related to coding theory studied via finite geometry and additive combinatorics, respectively. Chapter 7 deals with quasirandom points in view of applications to numerical integration using quasi-Monte Carlo methods and simulation. Chapter 8 studies aspects of iterations of rational functions from which pseudorandom numbers for Monte Carlo methods can be derived. The goal of this book is giving an overview of several recent research directions as well as stimulating research in sequences and polynomials under the unified framework of character theory.


Introduction To Finite Fields And Their Applications

Author by : Rudolf Lidl
Languange : en
Publisher by : Cambridge University Press
Format Available : PDF, ePub, Mobi
Total Read : 93
Total Download : 519
File Size : 46,8 Mb
GET BOOK

Description : Presents an introduction to the theory of finite fields and some of its most important applications.


Finite Fields

Author by : Dirk Hachenberger
Languange : en
Publisher by : Springer Science & Business Media
Format Available : PDF, ePub, Mobi
Total Read : 55
Total Download : 392
File Size : 42,5 Mb
GET BOOK

Description : Finite Fields are fundamental structures of Discrete Mathematics. They serve as basic data structures in pure disciplines like Finite Geometries and Combinatorics, and also have aroused much interest in applied disciplines like Coding Theory and Cryptography. A look at the topics of the proceed ings volume of the Third International Conference on Finite Fields and Their Applications (Glasgow, 1995) (see [18]), or at the list of references in I. E. Shparlinski's book [47] (a recent extensive survey on the Theory of Finite Fields with particular emphasis on computational aspects), shows that the area of Finite Fields goes through a tremendous development. The central topic of the present text is the famous Normal Basis Theo rem, a classical result from field theory, stating that in every finite dimen sional Galois extension E over F there exists an element w whose conjugates under the Galois group of E over F form an F-basis of E (i. e. , a normal basis of E over F; w is called free in E over F). For finite fields, the Nor mal Basis Theorem has first been proved by K. Hensel [19] in 1888. Since normal bases in finite fields in the last two decades have been proved to be very useful for doing arithmetic computations, at present, the algorithmic and explicit construction of (particular) such bases has become one of the major research topics in Finite Field Theory.


Cryptography And Computational Number Theory

Author by : Kwok Y. Lam
Languange : en
Publisher by : Birkhäuser
Format Available : PDF, ePub, Mobi
Total Read : 43
Total Download : 744
File Size : 42,6 Mb
GET BOOK

Description : This volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT'99, which has been held in Singapore during the week of November 22-26, 1999. The workshop was organized by the Centre for Systems Security of the Na tional University of Singapore. We gratefully acknowledge the financial support from the Singapore National Science and Technology Board under the grant num ber RP960668/M. The idea for this workshop grew out of the recognition of the recent, rapid development in various areas of cryptography and computational number the ory. The event followed the concept of the research programs at such well-known research institutions as the Newton Institute (UK), Oberwolfach and Dagstuhl (Germany), and Luminy (France). Accordingly, there were only invited lectures at the workshop with plenty of time for informal discussions. It was hoped and successfully achieved that the meeting would encourage and stimulate further research in information and computer security as well as in the design and implementation of number theoretic cryptosystems and other related areas. Another goal of the meeting was to stimulate collaboration and more active interaction between mathematicians, computer scientists, practical cryptographers and engineers in academia, industry and government.


Modern Computer Algebra

Author by : Joachim von zur Gathen
Languange : en
Publisher by : Cambridge University Press
Format Available : PDF, ePub, Mobi
Total Read : 69
Total Download : 928
File Size : 52,5 Mb
GET BOOK

Description : Now in its third edition, this highly successful textbook is widely regarded as the 'bible of computer algebra'.


Handbook Of Algebra

Author by : Anonim
Languange : en
Publisher by : Elsevier
Format Available : PDF, ePub, Mobi
Total Read : 70
Total Download : 707
File Size : 51,9 Mb
GET BOOK

Description : Handbook of Algebra defines algebra as consisting of many different ideas, concepts and results. Even the nonspecialist is likely to encounter most of these, either somewhere in the literature, disguised as a definition or a theorem or to hear about them and feel the need for more information. Each chapter of the book combines some of the features of both a graduate-level textbook and a research-level survey. This book is divided into eight sections. Section 1A focuses on linear algebra and discusses such concepts as matrix functions and equations and random matrices. Section 1B cover linear dependence and discusses matroids. Section 1D focuses on fields, Galois Theory, and algebraic number theory. Section 1F tackles generalizations of fields and related objects. Section 2A focuses on category theory, including the topos theory and categorical structures. Section 2B discusses homological algebra, cohomology, and cohomological methods in algebra. Section 3A focuses on commutative rings and algebras. Finally, Section 3B focuses on associative rings and algebras. This book will be of interest to mathematicians, logicians, and computer scientists.


Algorithms And Computations

Author by : John Staples
Languange : en
Publisher by : Springer Science & Business Media
Format Available : PDF, ePub, Mobi
Total Read : 31
Total Download : 931
File Size : 52,5 Mb
GET BOOK

Description : This book presents the refereed proceedings of the 6th International Symposium on Algorithms and Computation, ISAAC '95, held in Cairns, Australia, in December 1995. The 45 revised full papers presented together with the abstracts of three invited talks were selected from a total of 130 submissions. The papers address many current aspects of research and advanced applications of algorithms and computations; among the topics covered are graph theory and graph algorithms, computational geometry, computational logics, searching and sorting, approximation and optimization, algebraic manipulation, and coding.


Polynomial And Matrix Computations

Author by : Dario Bini
Languange : en
Publisher by : Springer Science & Business Media
Format Available : PDF, ePub, Mobi
Total Read : 9
Total Download : 319
File Size : 51,5 Mb
GET BOOK

Description : Our Subjects and Objectives. This book is about algebraic and symbolic computation and numerical computing (with matrices and polynomials). It greatly extends the study of these topics presented in the celebrated books of the seventies, [AHU] and [BM] (these topics have been under-represented in [CLR], which is a highly successful extension and updating of [AHU] otherwise). Compared to [AHU] and [BM] our volume adds extensive material on parallel com putations with general matrices and polynomials, on the bit-complexity of arithmetic computations (including some recent techniques of data compres sion and the study of numerical approximation properties of polynomial and matrix algorithms), and on computations with Toeplitz matrices and other dense structured matrices. The latter subject should attract people working in numerous areas of application (in particular, coding, signal processing, control, algebraic computing and partial differential equations). The au thors' teaching experience at the Graduate Center of the City University of New York and at the University of Pisa suggests that the book may serve as a text for advanced graduate students in mathematics and computer science who have some knowledge of algorithm design and wish to enter the exciting area of algebraic and numerical computing. The potential readership may also include algorithm and software designers and researchers specializing in the design and analysis of algorithms, computational complexity, alge braic and symbolic computing, and numerical computation.


Public Key Cryptography

Author by : Abhijit Das
Languange : en
Publisher by : Pearson Education India
Format Available : PDF, ePub, Mobi
Total Read : 94
Total Download : 215
File Size : 46,8 Mb
GET BOOK

Description : Public-key Cryptography provides a comprehensive coverage of the mathematical tools required for understanding the techniques of public-key cryptography and cryptanalysis. Key topics covered in the book include common cryptographic primitives and symmetric techniques, quantum cryptography, complexity theory, and practical cryptanalytic techniques such as side-channel attacks and backdoor attacks.Organized into eight chapters and supplemented with four appendices, this book is designed to be a self-sufficient resource for all students, teachers and researchers interested in the field of cryptography.


Embedded Cryptographic Hardware

Author by : Nadia Nedjah
Languange : en
Publisher by : Nova Publishers
Format Available : PDF, ePub, Mobi
Total Read : 57
Total Download : 646
File Size : 40,5 Mb
GET BOOK

Description : Data security is an important requirement for almost all, if not all, information-oriented applications such as e-commerce, digital signature, secure Internet, etc. All these services use encrypted data. Cryptography is a milliner science that was the key to the secret of ancient Rome and a fundamental piece in the Second World War. Today, it is a star in the computation world. Several operating systems, data base systems or simple filling systems provide the user with cryptographic functions that allow controlled data scrambling. Modern cryptology, which is the basis of information security techniques, started in the late 1970's and developed in the 1980's. As communication networks were spreading deep into society, the need for secure communication greatly promoted cryptographic research. The need for fast but secure cryptographic systems is growing bigger. Therefore, dedicated hardware for cryptography is becoming a key issue for designers. With the spread of reconfigurable hardware such as FPGAs, hardware implementations of cryptographic algorithms became cost-effective. The focus of this book is on all aspects of cryptographic hardware and embedded systems. This includes design, implementation and security of such systems. The content of this book is divided into four main parts, each of which is organised in three chapters, with the exception of the last one.


Handbook Of Computational Group Theory

Author by : Derek F. Holt
Languange : en
Publisher by : CRC Press
Format Available : PDF, ePub, Mobi
Total Read : 82
Total Download : 428
File Size : 50,6 Mb
GET BOOK

Description : The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics. The Handbook of Computational Group Theory offers the first complete treatment of all the fundame


Applied Abstract Algebra

Author by : Rudolf Lidl
Languange : en
Publisher by : Springer Science & Business Media
Format Available : PDF, ePub, Mobi
Total Read : 73
Total Download : 610
File Size : 54,9 Mb
GET BOOK

Description : Accessible to junior and senior undergraduate students, this survey contains many examples, solved exercises, sets of problems, and parts of abstract algebra of use in many other areas of discrete mathematics. Although this is a mathematics book, the authors have made great efforts to address the needs of users employing the techniques discussed. Fully worked out computational examples are backed by more than 500 exercises throughout the 40 sections. This new edition includes a new chapter on cryptology, and an enlarged chapter on applications of groups, while an extensive chapter has been added to survey other applications not included in the first edition. The book assumes knowledge of the material covered in a course on linear algebra and, preferably, a first course in (abstract) algebra covering the basics of groups, rings, and fields.


Fast Software Encryption

Author by : Eli Biham
Languange : en
Publisher by : Springer
Format Available : PDF, ePub, Mobi
Total Read : 34
Total Download : 883
File Size : 40,6 Mb
GET BOOK

Description : This volume constitutes the strictly refereed post-workshop proceedings of the Fourth International Workshop on Fast Software Encryption, FSE'97, held in Haifa, Israel, in January 1997. The 23 full papers presented were carefully selected from 44 submissions and revised for inclusion in the book. Also contained is a summary of a panel discussion. The papers are organized in sections on cryptanalysis, blockciphers, stream ciphers, message authentication codes, modes of operation, and fast software encryption. Particular emphasis is placed on applicability and implementation issues of fast cryptography.


Computer Algebra In Scientific Computing

Author by : Vladimir P. Gerdt
Languange : en
Publisher by : Springer
Format Available : PDF, ePub, Mobi
Total Read : 48
Total Download : 921
File Size : 50,5 Mb
GET BOOK

Description : This book constitutes the proceedings of the 20th International Workshop on Computer Algebra in Scientific Computing, CASC 2018, held in Lille, France, in September 2018. The 24 full papers of this volume presented with an abstract of an invited talk and one paper corresponding to another invited talk were carefully reviewed and selected from 29 submissions. They deal with cutting-edge research in all major disciplines of computer algebra in sciences such as physics, chemistry, life sciences, and engineering. Chapter “Positive Solutions of Systems of Signed Parametric Polynomial Inequalities” is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.


Graph Algebras And Automata

Author by : Andrei Kelarev
Languange : en
Publisher by : CRC Press
Format Available : PDF, ePub, Mobi
Total Read : 33
Total Download : 962
File Size : 41,7 Mb
GET BOOK

Description : Graph algebras possess the capacity to relate fundamental concepts of computer science, combinatorics, graph theory, operations research, and universal algebra. They are used to identify nontrivial connections across notions, expose conceptual properties, and mediate the application of methods from one area toward questions of the other four. After a concentrated review of the prerequisite mathematical background, Graph Algebras and Automata defines graph algebras and reveals their applicability to automata theory. It proceeds to explore assorted monoids, semigroups, rings, codes, and other algebraic structures and to outline theorems and algorithms for finite state automata and grammars.


Computer Algebra Handbook

Author by : Johannes Grabmeier
Languange : en
Publisher by : Springer Science & Business Media
Format Available : PDF, ePub, Mobi
Total Read : 51
Total Download : 950
File Size : 45,7 Mb
GET BOOK

Description : This Handbook gives a comprehensive snapshot of a field at the intersection of mathematics and computer science with applications in physics, engineering and education. Reviews 67 software systems and offers 100 pages on applications in physics, mathematics, computer science, engineering chemistry and education.


Arithmetic Of Finite Fields

Author by : Lilya Budaghyan
Languange : en
Publisher by : Springer
Format Available : PDF, ePub, Mobi
Total Read : 46
Total Download : 513
File Size : 52,7 Mb
GET BOOK

Description : This book constitutes the thoroughly refereed post-workshop proceedings of the 7th International Workshop on the Arithmetic of Finite Field, WAIFI 2018, held in Bergen, Norway, in June 2018. The 14 revised full papers and six invited talks presented were carefully reviewed and selected from 26 submissions. The papers are organized in topical sections on invited talks; elliptic curves; hardware implementations; arithmetic and applications of finite fields and cryptography.


Encyclopaedia Of Mathematics Supplement Iii

Author by : Michiel Hazewinkel
Languange : en
Publisher by : Springer Science & Business Media
Format Available : PDF, ePub, Mobi
Total Read : 9
Total Download : 506
File Size : 42,8 Mb
GET BOOK

Description : This is the third supplementary volume to Kluwer's highly acclaimed twelve-volume Encyclopaedia of Mathematics. This additional volume contains nearly 500 new entries written by experts and covers developments and topics not included in the previous volumes. These entries are arranged alphabetically throughout and a detailed index is included. This supplementary volume enhances the existing twelve volumes, and together, these thirteen volumes represent the most authoritative, comprehensive and up-to-date Encyclopaedia of Mathematics available.


Covering Codes

Author by : G. Cohen
Languange : en
Publisher by : Elsevier
Format Available : PDF, ePub, Mobi
Total Read : 97
Total Download : 925
File Size : 44,8 Mb
GET BOOK

Description : The problems of constructing covering codes and of estimating their parameters are the main concern of this book. It provides a unified account of the most recent theory of covering codes and shows how a number of mathematical and engineering issues are related to covering problems. Scientists involved in discrete mathematics, combinatorics, computer science, information theory, geometry, algebra or number theory will find the book of particular significance. It is designed both as an introductory textbook for the beginner and as a reference book for the expert mathematician and engineer. A number of unsolved problems suitable for research projects are also discussed.


Topics In Number Theory

Author by : Scott D. Ahlgren
Languange : en
Publisher by : Springer Science & Business Media
Format Available : PDF, ePub, Mobi
Total Read : 26
Total Download : 777
File Size : 47,5 Mb
GET BOOK

Description : From July 31 through August 3,1997, the Pennsylvania State University hosted the Topics in Number Theory Conference. The conference was organized by Ken Ono and myself. By writing the preface, I am afforded the opportunity to express my gratitude to Ken for beng the inspiring and driving force behind the whole conference. Without his energy, enthusiasm and skill the entire event would never have occurred. We are extremely grateful to the sponsors of the conference: The National Sci ence Foundation, The Penn State Conference Center and the Penn State Depart ment of Mathematics. The object in this conference was to provide a variety of presentations giving a current picture of recent, significant work in number theory. There were eight plenary lectures: H. Darmon (McGill University), "Non-vanishing of L-functions and their derivatives modulo p. " A. Granville (University of Georgia), "Mean values of multiplicative functions. " C. Pomerance (University of Georgia), "Recent results in primality testing. " C. Skinner (Princeton University), "Deformations of Galois representations. " R. Stanley (Massachusetts Institute of Technology), "Some interesting hyperplane arrangements. " F. Rodriguez Villegas (Princeton University), "Modular Mahler measures. " T. Wooley (University of Michigan), "Diophantine problems in many variables: The role of additive number theory. " D. Zeilberger (Temple University), "Reverse engineering in combinatorics and number theory. " The papers in this volume provide an accurate picture of many of the topics presented at the conference including contributions from four of the plenary lectures.


Meromorphic Functions And Projective Curves

Author by : Kichoon Yang
Languange : en
Publisher by : Springer Science & Business Media
Format Available : PDF, ePub, Mobi
Total Read : 57
Total Download : 546
File Size : 49,6 Mb
GET BOOK

Description : This book contains an exposition of the theory of meromorphic functions and linear series on a compact Riemann surface. Thus the main subject matter consists of holomorphic maps from a compact Riemann surface to complex projective space. Our emphasis is on families of meromorphic functions and holomorphic curves. Our approach is more geometric than algebraic along the lines of [Griffiths-Harrisl]. AIso, we have relied on the books [Namba] and [Arbarello-Cornalba-Griffiths-Harris] to agreat exten- nearly every result in Chapters 1 through 4 can be found in the union of these two books. Our primary motivation was to understand the totality of meromorphic functions on an algebraic curve. Though this is a classical subject and much is known about meromorphic functions, we felt that an accessible exposition was lacking in the current literature. Thus our book can be thought of as a modest effort to expose parts of the known theory of meromorphic functions and holomorphic curves with a geometric bent. We have tried to make the book self-contained and concise which meant that several major proofs not essential to further development of the theory had to be omitted. The book is targeted at the non-expert who wishes to leam enough about meromorphic functions and holomorphic curves so that helshe will be able to apply the results in hislher own research. For example, a differential geometer working in minimal surface theory may want to tind out more about the distribution pattern of poles and zeros of a meromorphic function.