Some Problems in Reproducing Kernel Spaces

The two chapters of this thesis are comprised of work in the setting of reproducing kernel (Hilbert) spaces. These are Banach (or Hilbert) spaces of functions defined on some set, with the special property that point evaluation, on the underlying set, is bounded. The first chapter deals with the study of inner functions. These functions have a rich history in function and operator theory in the Hardy spaces of the unit disk. The first section of this chapter studies the relationship between generalized inner functions and optimal polynomial approximants. The second section, which is joint work with Trieu Le, deals with a generalization of a classical type of inner function (finite Blaschke product). The last section, which is joint work with Raymond Cheng, considers the (Banach) space $\ell^p_A$-- the space of analytic functions on the disk with $p$-summable Maclaurin coefficients. We consider the geometry of the multiplier algebra of this space and characterize extremal multipliers. The second chapter considers the geometry of two planar sets associated to linear operators acting on reproducing kernel Hilbert spaces. The first section of this chapter, which is joint work with Carl Cowen, considers the convexity of the Berezin range of an operator on a reproducing kernel Hilbert space. We focus primarily on a class of composition operators acting on the Hardy space of the unit disk. The final section of the chapter, and the thesis, joint work with Benjamin Russo and Douglas Pfeffer, deals with the connectedness of various spectra of certain Toeplitz acting on a family of sub-Hardy Hilbert spaces

Notes in Pure Mathematics & Mathematical Structures in Physics

These Notes deal with various areas of mathematics, and seek reciprocal combinations, explore mutual relations, ranging from abstract objects to problems in physics.Comment: Small improvements and addition

Natural Communication

In Natural Communication, the author criticizes the current paradigm of specific goal orientation in the complexity sciences. His model of "natural communication" encapsulates modern theoretical concepts from mathematics and physics, in particular category theory and quantum theory. The author is convinced that only by looking to the past is it possible to establish continuity and coherence in the complexity science

On approximate polynomial identity testing and real root finding

In this thesis we study the following three topics, which share a connection through the (arithmetic) circuit complexity of polynomials. 1. Rank of symbolic matrices. 2. Computation of real roots of real sparse polynomials. 3. Complexity of symmetric polynomials. We start with studying the commutative and non-commutative rank of symbolic matrices with linear forms as their entries. Here we show a deterministic polynomial time approximation scheme (PTAS) for computing the commutative rank. Prior to this work, deterministic polynomial time algorithms were known only for computing a 1/2-approximation of the commutative rank. We give two distinct proofs that our algorithm is a PTAS. We also give a min-max characterization of commutative and non-commutative ranks. Thereafter we direct our attention to computation of roots of uni-variate polynomial equations. It is known that solving a system of polynomial equations reduces to solving a uni-variate polynomial equation. We describe a polynomial time algorithm for (n,k,\tau)-nomials which computes approximations of all the real roots (even though it may also compute approximations of some complex roots). Moreover, we also show that the roots of integer trinomials are well-separated. Finally, we study the complexity of symmetric polynomials. It is known that symmetric Boolean functions are easy to compute. In contrast, we show that the assumption VP \neq VNP implies that there exist hard symmetric polynomials. To prove this result, we use an algebraic analogue of the classical Newton iteration.In dieser Dissertation untersuchen wir die folgenden drei Themen, welche durch die (arithmetische) Schaltkreiskomplexität von Polynomen miteinander verbunden sind: 1. der Rang von symbolischen Matrizen, 2. die Berechnung von reellen Nullstellen von dünnbesetzten (“sparse”) Polynomen mit reellen Koeffizienten, 3. die Komplexität von symmetrischen Polynomen. Wir untersuchen zunächst den kommutativen und nicht-kommutativen Rang von Matrizen, deren Einträge aus Linearformen bestehen. Hier beweisen wir die Existenz eines deterministischem Polynomialzeit-Approximationsschemas (PTAS) für die Berechnung des kommutative Ranges. Zuvor waren polynomielle Algorithmen nur für die Berechnung einer 1/2-Approximation des kommutativen Ranges bekannt. Wir geben zwei unterschiedliche Beweise für den Fakt, dass unser Algorithmus tatsächlich ein PTAS ist. Zusätzlich geben wir eine min-max Charakterisierung des kommutativen und nicht-kommutativen Ranges. Anschließend lenken wir unsere Aufmerksamkeit auf die Berechnung von Nullstellen von univariaten polynomiellen Gleichungen. Es ist bekannt, dass das Lösen eines polynomiellem Gleichungssystems auf das Lösen eines univariaten Polynoms zurückgeführt werden kann. Wir geben einen Polynomialzeit-Algorithmus für (n, k, \tau)-Nome, welcher Abschätzungen für alle reellen Nullstellen berechnet (in manchen Fallen auch Abschätzungen von komplexen Nullstellen). Zusätzlich beweisen wir, dass Nullstellen von ganzzahligen Trinomen stets weit voneinander entfernt sind. Schließlich untersuchen wir die Komplexität von symmetrischen Polynomen. Es ist bereits bekannt, dass sich symmetrische Boolesche Funktionen leicht berechnen lassen. Im Gegensatz dazu zeigen wir, dass die Annahme VP \neq VNP bedeutet, dass auch harte symmetrische Polynome existieren. Um dies zu beweisen benutzen wir ein algebraisches Analog zum klassischen Newton-Verfahren

Select Topics in Quantum Gravity : A Maiden Voyage

We study selected aspects of Theoretical Physics confronting some key issues related to the fundamental interactions along the line of Black Holes (BHs) and Attractors and its thread may be found in the concepts of Supersymmetry, Supergravity and Holography which encompass all of String theory and Quantum gravity. Then we also had an encounter with maximally symmetric spaces in General Relativity such as de Sitter and we did some significant computation in this backdrop which is tempting to pursue keeping in mind the recent observational data in favor of inflationary picture of the Universe

Framing Global Mathematics

This open access book is about the shaping of international relations in mathematics over the last two hundred years. It focusses on institutions and organizations that were created to frame the international dimension of mathematical research. Today, striking evidence of globalized mathematics is provided by countless international meetings and the worldwide repository ArXiv. The text follows the sinuous path that was taken to reach this state, from the long nineteenth century, through the two wars, to the present day. International cooperation in mathematics was well established by 1900, centered in Europe. The first International Mathematical Union, IMU, founded in 1920 and disbanded in 1932, reflected above all the trauma of WW I. Since 1950 the current IMU has played an increasing role in defining mathematical excellence, as is shown both in the historical narrative and by analyzing data about the International Congresses of Mathematicians. For each of the three periods discussed, interactions are explored between world politics, the advancement of scientific infrastructures, and the inner evolution of mathematics. Readers will thus take a new look at the place of mathematics in world culture, and how international organizations can make a difference. Aimed at mathematicians, historians of science, scientists, and the scientifically inclined general public, the book will be valuable to anyone interested in the history of science on an international level