Everand Logo

Welcome to Everand!

  • Discover millions of ebooks, audiobooks, and so much more with a free trial

    Only $11.99/month after trial. Cancel anytime.

    Computers, Rigidity, and Moduli: The Large-Scale Fractal Geometry of Riemannian Moduli Space
    Ebook series1 title

    Porter Lectures Series

    By János Kollár, Harry Furstenberg, Barry Simon and

    ()

    About this series

    This book presents a comprehensive overview of the sum rule approach to spectral analysis of orthogonal polynomials, which derives from Gábor Szego's classic 1915 theorem and its 1920 extension. Barry Simon emphasizes necessary and sufficient conditions, and provides mathematical background that until now has been available only in journals. Topics include background from the theory of meromorphic functions on hyperelliptic surfaces and the study of covering maps of the Riemann sphere with a finite number of slits removed. This allows for the first book-length treatment of orthogonal polynomials for measures supported on a finite number of intervals on the real line.


    In addition to the Szego and Killip-Simon theorems for orthogonal polynomials on the unit circle (OPUC) and orthogonal polynomials on the real line (OPRL), Simon covers Toda lattices, the moment problem, and Jacobi operators on the Bethe lattice. Recent work on applications of universality of the CD kernel to obtain detailed asymptotics on the fine structure of the zeros is also included. The book places special emphasis on OPRL, which makes it the essential companion volume to the author's earlier books on OPUC.

    LanguageEnglish
    PublisherPrinceton University Press
    Release dateSep 25, 2012
    Computers, Rigidity, and Moduli: The Large-Scale Fractal Geometry of Riemannian Moduli Space

    Titles in the series (2)

    • 5

      Computers, Rigidity, and Moduli: The Large-Scale Fractal Geometry of Riemannian Moduli Space
      Computers, Rigidity, and Moduli: The Large-Scale Fractal Geometry of Riemannian Moduli Space

      Computers, Rigidity, and Moduli: The Large-Scale Fractal Geometry of Riemannian Moduli Space

      Shmuel Weinberger
      0 ratings
      0 ratings

      This book is the first to present a new area of mathematical research that combines topology, geometry, and logic. Shmuel Weinberger seeks to explain and illustrate the implications of the general principle, first emphasized by Alex Nabutovsky, that logical complexity engenders geometric complexity. He provides applications to the problem of closed geodesics, the theory of submanifolds, and the structure of the moduli space of isometry classes of Riemannian metrics with curvature bounds on a given manifold. Ultimately, geometric complexity of a moduli space forces functions defined on that space to have many critical points, and new results about the existence of extrema or equilibria follow. The main sort of algorithmic problem that arises is recognition: is the presented object equivalent to some standard one? If it is difficult to determine whether the problem is solvable, then the original object has doppelgängers--that is, other objects that are extremely difficult to distinguish from it. Many new questions emerge about the algorithmic nature of known geometric theorems, about "dichotomy problems," and about the metric entropy of moduli space. Weinberger studies them using tools from group theory, computability, differential geometry, and topology, all of which he explains before use. Since several examples are worked out, the overarching principles are set in a clear relief that goes beyond the details of any one problem.

      This book is the first to present a new area of mathematical research that combines topology, geometry, and logic. Shmuel Weinberger seeks to explain and illustrate the implications of the general principle, first emphasized by Alex Nabutovsky, that logical complexity engenders geometric complexity. He provides applications to the problem of closed geodesics, the theory of submanifolds, and the structure of the moduli space of isometry classes of Riemannian metrics with curvature bounds on a given manifold. Ultimately, geometric complexity of a moduli space forces functions defined on that space to have many critical points, and new results about the existence of extrema or equilibria follow. The main sort of algorithmic problem that arises is recognition: is the presented object equivalent to some standard one? If it is difficult to determine whether the problem is solvable, then the original object has doppelgängers--that is, other objects that are extremely difficult to distinguish from it. Many new questions emerge about the algorithmic nature of known geometric theorems, about "dichotomy problems," and about the metric entropy of moduli space. Weinberger studies them using tools from group theory, computability, differential geometry, and topology, all of which he explains before use. Since several examples are worked out, the overarching principles are set in a clear relief that goes beyond the details of any one problem.

    Author

    János Kollár

    János Kollár is a professor of Mathematics at Princeton University.

    Related to Porter Lectures

    Related ebooks

    Mathematics For You

    View More
    View More

    Related podcast episodes

    Related categories

    Reviews for Porter Lectures

    0 ratings

    0 ratings0 reviews

    What did you think?

    Tap to rate

    Review must be at least 10 words