An Invitation to Web Geometry

Nonfiction, Science & Nature, Mathematics, Mathematical Analysis, Geometry
Cover of the book An Invitation to Web Geometry by Luc Pirio, Jorge Vitório Pereira, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Luc Pirio, Jorge Vitório Pereira ISBN: 9783319145624
Publisher: Springer International Publishing Publication: February 23, 2015
Imprint: Springer Language: English
Author: Luc Pirio, Jorge Vitório Pereira
ISBN: 9783319145624
Publisher: Springer International Publishing
Publication: February 23, 2015
Imprint: Springer
Language: English

This book takes an in-depth look at abelian relations of codimension one webs in the complex analytic setting. In its classical form, web geometry consists in the study of webs up to local diffeomorphisms. A significant part of the theory revolves around the concept of abelian relation, a particular kind of functional relation among the first integrals of the foliations of a web. Two main focuses of the book include how many abelian relations can a web carry and which webs are carrying the maximal possible number of abelian relations. The book offers complete proofs of both Chern’s bound and Trépreau’s algebraization theorem, including all the necessary prerequisites that go beyond elementary complex analysis or basic algebraic geometry. Most of the examples known up to date of non-algebraizable planar webs of maximal rank are discussed in detail. A historical account of the algebraization problem for maximal rank webs of codimension one is also presented.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

This book takes an in-depth look at abelian relations of codimension one webs in the complex analytic setting. In its classical form, web geometry consists in the study of webs up to local diffeomorphisms. A significant part of the theory revolves around the concept of abelian relation, a particular kind of functional relation among the first integrals of the foliations of a web. Two main focuses of the book include how many abelian relations can a web carry and which webs are carrying the maximal possible number of abelian relations. The book offers complete proofs of both Chern’s bound and Trépreau’s algebraization theorem, including all the necessary prerequisites that go beyond elementary complex analysis or basic algebraic geometry. Most of the examples known up to date of non-algebraizable planar webs of maximal rank are discussed in detail. A historical account of the algebraization problem for maximal rank webs of codimension one is also presented.

More books from Springer International Publishing

Cover of the book Technology and Adolescent Mental Health by Luc Pirio, Jorge Vitório Pereira
Cover of the book Contemporary Trends and Challenges in Finance by Luc Pirio, Jorge Vitório Pereira
Cover of the book Algorithms for Computational Biology by Luc Pirio, Jorge Vitório Pereira
Cover of the book Smart Computing and Communication by Luc Pirio, Jorge Vitório Pereira
Cover of the book Jokes by Luc Pirio, Jorge Vitório Pereira
Cover of the book Iranian Entrepreneurship by Luc Pirio, Jorge Vitório Pereira
Cover of the book Core Concepts and Contemporary Issues in Privacy by Luc Pirio, Jorge Vitório Pereira
Cover of the book GeNeDis 2014 by Luc Pirio, Jorge Vitório Pereira
Cover of the book Nonmalignant Hematology by Luc Pirio, Jorge Vitório Pereira
Cover of the book Intelligent Building Control Systems by Luc Pirio, Jorge Vitório Pereira
Cover of the book Human-Computer Interaction – INTERACT 2017 by Luc Pirio, Jorge Vitório Pereira
Cover of the book Operations Research Proceedings 2012 by Luc Pirio, Jorge Vitório Pereira
Cover of the book Dynamics of Complex Autonomous Boolean Networks by Luc Pirio, Jorge Vitório Pereira
Cover of the book Dignity in the Workplace by Luc Pirio, Jorge Vitório Pereira
Cover of the book Current Research in Nonlinear Analysis by Luc Pirio, Jorge Vitório Pereira
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy