One of the fundamental questions of Banach space theory is whether every Banach space has a basis. A space with a basis gives us the feeling of familiarity and concreteness, and perhaps a chance to attempt the classification of all Banach spaces and other problems.
The main goals of this book are to:
introduce the reader to some of the basic concepts, results and applications of biorthogonal systems in infinite dimensional geometry of Banach spaces, and in topology and nonlinear analysis in Banach spaces;
to do so in a manner accessible to graduate students and...
One of the fundamental questions of Banach space theory is whether every Banach space has a basis. A space with a basis gives us the feeling of fam...
Reflection groups and their invariant theory provide the main themes of this book and the first two parts focus on these topics. The first 13 chapters deal with reflection groups (Coxeter groups and Weyl groups) in Euclidean Space while the next thirteen chapters study the invariant theory of pseudo-reflection groups. The third part of the book studies conjugacy classes of the elements in reflection and pseudo-reflection groups. The book has evolved from various graduate courses given by the author over the past 10 years. It is intended to be a graduate text, accessible to students with a...
Reflection groups and their invariant theory provide the main themes of this book and the first two parts focus on these topics. The first 13 chapters...
Optimization is a rich and thriving mathematical discipline. The theory underlying current computational optimization techniques grows ever more sophisticated. The powerful and elegant language of convex analysis unifies much of this theory. The aim of this book is to provide a concise, accessible account of convex analysis and its applications and extensions, for a broad audience. It can serve as a teaching text, at roughly the level of first year graduate students. While the main body of the text is self-contained, each section concludes with an often extensive set of optional exercises....
Optimization is a rich and thriving mathematical discipline. The theory underlying current computational optimization techniques grows ever more so...
The theory of convex optimization has been constantly developing over the past 30 years. Most recently, many researchers have been studying more complicated classes of problems that still can be studied by means of convex analysis, so-called "anticonvex" and "convex-anticonvex" optimizaton problems. This manuscript contains an exhaustive presentation of the duality for these classes of problems and some of its generalization in the framework of abstract convexity. This manuscript will be of great interest for experts in this and related fields.
The theory of convex optimization has been constantly developing over the past 30 years. Most recently, many researchers have been studying more compl...
This book presents the Riemann Hypothesis, connected problems, and a taste of the body of theory developed towards its solution. It is targeted at the educated non-expert. Almost all the material is accessible to any senior mathematics student, and much is accessible to anyone with some university mathematics. The appendices include a selection of original papers that encompass the most important milestones in the evolution of theory connected to the Riemann Hypothesis. The appendices also include some authoritative expository papers. These are the expert witnesses whose insight into this...
This book presents the Riemann Hypothesis, connected problems, and a taste of the body of theory developed towards its solution. It is targeted at ...
The study of combinatorial block designs is a vibrant area of combinatorial mathematics with connections to finite geometries, graph theory, coding theory and statistics. The practice of ordering combinatorial objects can trace its roots to bell ringing which originated in 17th century England, but only emerged as a significant modern research area with the work of F. Gray and N. de Bruijn.
These two fascinating areas of mathematics are brought together for the first time in this book. It presents new terminology and concepts which unify existing and recent results from a wide...
The study of combinatorial block designs is a vibrant area of combinatorial mathematics with connections to finite geometries, graph theory, coding...
Understanding special sets of integers was classically of interest to Hadamard, Zygmund and others, and continues to be of interest today. This book is a modern treatment of the subject of interpolation and Sidon sets. It is a unique book, aimed at both new and experienced researchers. In particular, this is the only book in Englishwhich featuresa complete treatment of the Pisier-Bourgain results on Sidon sets, many of which were originally in French, in hard to access publications. Applications of the P-B results, due to Pisier, Bourgain, Ramsey, and the authors are included. The book...
Understanding special sets of integers was classically of interest to Hadamard, Zygmund and others, and continues to be of interest today. This book i...
Geometry is a classical core part of mathematics which, with its birth, marked the beginning of the mathematical sciences. Thus, not surprisingly, geometry has played a key role in many important developments of mathematics in the past, as well as in present times. While focusing on modern mathematics, one has to emphasize the increasing role of discrete mathematics, or equivalently, the broad movement to establish discrete analogues of major components of mathematics. In this way, the works of a number of outstanding mathema- cians including H. S. M. Coxeter (Canada), C. A. Rogers (United...
Geometry is a classical core part of mathematics which, with its birth, marked the beginning of the mathematical sciences. Thus, not surprisingly, geo...
The theme of this book is an exposition of connections between representations of finite partially ordered sets and abelian groups. Emphasis is placed throughout on classification, a description of the objects up to isomorphism, and computation of representation type, a measure of when classification is feasible. David M. Arnold is the Ralph and Jean Storm Professor of Mathematics at Baylor University. He is the author of "Finite Rank Torsion Free Abelian Groups and Rings" published in the Springer-Verlag Lecture Notes in Mathematics series, a co-editor for two volumes of conference...
The theme of this book is an exposition of connections between representations of finite partially ordered sets and abelian groups. Emphasis is placed...
The analysis of orthogonal polynomials associated with general weights has been a major theme in classical analysis this century. In this monograph, the authors define and discuss their classes of weights, state several of their results on Christoffel functions, Bernstein inequalities, restricted range inequalities, and record their bounds on the orthogonal polynomials, as well as their asymptotic results. This book will be of interest to researchers in approximation theory, potential theory, as well as in some branches of engineering.
The analysis of orthogonal polynomials associated with general weights has been a major theme in classical analysis this century. In this monograph, t...
