Vilmos Totik – författare

Although the ?rst decades of the 20th century saw some strong debates on set theory and the foundation of mathematics, afterwards set theory has turned into a solid branch of mathematics, indeed, so solid, that it serves as the foundation of the whole building of mathematics. Later generations, honest to Hilbert’s dictum, “No one can chase us out of the paradise that Cantor has created for us” proved countless deep and interesting theorems and also applied the methods of set theory to various problems in algebra, topology, in?nitary combinatorics, and real analysis. The invention of forcing produced a powerful, technically sophisticated tool for solving unsolvable problems. Still, most results of the pre-Cohen era can be digested with just the knowledge of a commonsense introduction to the topic. And it is a worthy e?ort, here we refer not just to usefulness, but, ?rst and foremost, to mathematical beauty. In this volume we o?er a collection of various problems in set theory. Most of classical set theory is covered, classical in the sense that independence methods are not used, but classical also in the sense that most results come fromtheperiod,say,1920–1970.Manyproblemsarealsorelatedtoother?elds of mathematics such as algebra, combinatorics, topology, and real analysis. We do not concentrate on the axiomatic framework, although some - pects, such as the axiom of foundation or the role ˆ of the axiom of choice, are elaborated.

In this treatise, the authors present the general theory of orthogonal polynomials on the complex plane and several of its applications. The assumptions on the measure of orthogonality are general, the only restriction is that it has compact support on the complex plane. In the development of the theory the main emphasis is on asymptotic behaviour and the distribution of zeros. In the following chapters, the author explores the exact upper and lower bounds are given for the orthonormal polynomials and for the location of their zeros; regular n-th root asymptotic behaviour; and applications of the theory, including exact rates for convergence of rational interpolants, best rational approximants and non-diagonal Pade approximants to Markov functions (Cauchy transforms of measures). The results are based on potential theoretic methods, so both the methods and the results can be extended to extremal polynomials in norms other than L2 norms. A sketch of the theory of logarithmic potentials is given in an appendix.

In this treatise, the authors present the general theory of orthogonal polynomials on the complex plane and several of its applications. The assumptions on the measure of orthogonality are general, the only restriction is that it has compact support on the complex plane. In the development of the theory the main emphasis is on asymptotic behaviour and the distribution of zeros. In the following chapters, the author explores the exact upper and lower bounds are given for the orthonormal polynomials and for the location of their zeros; regular n-th root asymptotic behaviour; and applications of the theory, including exact rates for convergence of rational interpolants, best rational approximants and non-diagonal Pade approximants to Markov functions (Cauchy transforms of measures). The results are based on potential theoretic methods, so both the methods and the results can be extended to extremal polynomials in norms other than L2 norms. A sketch of the theory of logarithmic potentials is given in an appendix.

Although the ?rst decades of the 20th century saw some strong debates on set theory and the foundation of mathematics, afterwards set theory has turned into a solid branch of mathematics, indeed, so solid, that it serves as the foundation of the whole building of mathematics. Later generations, honest to Hilbert’s dictum, “No one can chase us out of the paradise that Cantor has created for us” proved countless deep and interesting theorems and also applied the methods of set theory to various problems in algebra, topology, in?nitary combinatorics, and real analysis. The invention of forcing produced a powerful, technically sophisticated tool for solving unsolvable problems. Still, most results of the pre-Cohen era can be digested with just the knowledge of a commonsense introduction to the topic. And it is a worthy e?ort, here we refer not just to usefulness, but, ?rst and foremost, to mathematical beauty. In this volume we o?er a collection of various problems in set theory. Most of classical set theory is covered, classical in the sense that independence methods are not used, but classical also in the sense that most results come fromtheperiod,say,1920–1970.Manyproblemsarealsorelatedtoother?elds of mathematics such as algebra, combinatorics, topology, and real analysis. We do not concentrate on the axiomatic framework, although some - pects, such as the axiom of foundation or the role ˆ of the axiom of choice, are elaborated.

This is the second edition of an influential monograph on logarithmic potentials with external fields, incorporating some of the numerous advancements made since the initial publication. As the title implies, the book expands the classical theory of logarithmic potentials to encompass scenarios involving an external field.

This monograph offers a new construction for approximating a logarithmic potential by a discrete one. This yields a new approach to approximation with weighted polynomials of the form wn Pn. The new technique settles several open problems. It leads to a simple proof for the strong asymptotics on some Lp extremal problems on the real line with exponential weights, which, for the case p=2, are equivalent to power-type asymptotics for the leading coefficients of the corresponding orthogonal polynomials. The method is also modified to yield (in a sense) uniformly good approximation on the whole support. This allows the reader to deduce strong asymptotics in some Lp extremal problems with varying weights. Applications are given, relating to fast decreasing polynomials, asymptotic behaviour of orthogonal polynomials and multipoint Pade approximation.