Search

The authors introduce the concept of finitely coloured equivalence for unital $^•$-homomorphisms between $\mathrm C^•$-algebras, for which unitary equivalence is the $1$-coloured case. They use this notion to classify $^•$-homomorphisms from separable, unital, nuclear $\mathrm C^•$-algebras into ultrapowers of simple, unital, nuclear, $\mathcal Z$-stable $\mathrm C^•$-algebras with compact extremal trace space up to $2$-coloured equivalence by their behaviour on traces; this is based on a $1$-coloured classification theorem for certain order zero maps, also in terms of tracial data. As an application the authors calculate the nuclear dimension of non-AF, simple, separable, unital, nuclear, $\mathcal Z$-stable $\mathrm C^•$-algebras with compact extremal trace space: it is 1. In the case that the extremal trace space also has finite topological covering dimension, this confirms the remaining open implication of the Toms-Winter conjecture. Inspired by homotopy-rigidity theorems in geometry and topology, the authors derive a “homotopy equivalence implies isomorphism” result for large classes of $\mathrm C^•$-algebras with finite nuclear dimension.

In a previous study, the authors built the Bellman function for integral functionals on the $\mathrm{BMO}$ space. The present paper provides a development of the subject. They abandon the majority of unwanted restrictions on the function that generates the functional. It is the new evolutional approach that allows the authors to treat the problem in its natural setting. What is more, these new considerations lighten dynamical aspects of the Bellman function, in particular, the evolution of its picture.

Extremal Finite Set Theory surveys old and new results in the area of extremal set system theory. It presents an overview of the main techniques and tools (shifting, the cycle method, profile polytopes, incidence matrices, flag algebras, etc.) used in the different subtopics. The book focuses on the cardinality of a family of sets satisfying certain combinatorial properties. It covers recent progress in the subject of set systems and extremal combinatorics.Intended for graduate students, instructors teaching extremal combinatorics and researchers, this book serves as a sound introduction to the theory of extremal set systems. In each of the topics covered, the text introduces the basic tools used in the literature. Every chapter provides detailed proofs of the most important results and some of the most recent ones, while the proofs of some other theorems are posted as exercises with hints. Features: Presents the most basic theorems on extremal set systems Includes many proof techniques Contains recent developments The book's contents are well suited to form the syllabus for an introductory course About the Authors: Dániel Gerbner is a researcher at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences in Budapest, Hungary. He holds a Ph.D. from Eötvös Loránd University, Hungary and has contributed to numerous publications. His research interests are in extremal combinatorics and search theory.Balázs Patkós is also a researcher at the Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences. He holds a Ph.D. from Central European University, Budapest and has authored several research papers. His research interests are in extremal and probabilistic combinatorics.

One of the great appeals of Extremal Set Theory as a subject is that the statements are easily accessible without a lot of mathematical background, yet the proofs and ideas have applications in a wide range of fields including combinatorics, number theory, and probability theory. Written by two of the leading researchers in the subject, this book is aimed at mathematically mature undergraduates, and highlights the elegance and power of this field of study. The first half of the book provides classic results with some new proofs including a complete proof of the Ahlswede–Khachatrian theorem as well as some recent progress on the Erdős matching conjecture. The second half presents some combinatorial structural results and linear algebra methods including the Deza–Erdős–Frankl theorem, application of Rödl's packing theorem, application of semidefinite programming, and very recent progress (obtained in 2016) on the Erdős–Szemerédi sunflower conjecture and capset problem. The book concludes with a collection of challenging open problems.

In this book, an extensive circle of questions originating in the classical work of P. L. Chebyshev and A. A. Markov is considered from the more modern point of view. It is shown how results and methods of the generalized moment problem are interlaced with various questions of the geometry of convex bodies, algebra, and function theory. From this standpoint, the structure of convex and conical hulls of curves is studied in detail and isoperimetric inequalities for convex hulls are established; a theory of orthogonal and quasiorthogonal polynomials is constructed; problems on limiting values of integrals and on least deviating functions (in various metrics) are generalized and solved; problems in approximation theory and interpolation and extrapolation in various function classes (analytic, absolutely monotone, almost periodic, etc.) are solved, as well as certain problems in optimal control of linear objects.

Inequalities and Extremal Problems in Probability and Statistics: Selected Topics presents various kinds of useful inequalities that are applicable in many areas of mathematics, the sciences, and engineering. The book enables the reader to grasp the importance of inequalities and how they relate to probability and statistics. This will be an extremely useful book for researchers and graduate students in probability, statistics, and econometrics, as well as specialists working across sciences, engineering, financial mathematics, insurance, and mathematical modeling of large risks. - Teaches users how to understand useful inequalities - Applicable across mathematics, sciences, and engineering - Presented by a team of leading experts

This book is devoted to one of the main questions of the theory of extremal prob­ lems, namely, to necessary and sufficient extremality conditions. It is intended mostly for mathematicians and also for all those who are interested in optimiza­ tion problems. The book may be useful for advanced students, post-graduated students, and researchers. The book consists of four chapters. In Chap. 1 we study the abstract minimization problem with constraints, which is often called the mathemati­ cal programming problem. Chapter 2 is devoted to one of the most important classes of extremal problems, the optimal control problem. In the third chapter we study one of the main objects of the calculus of variations, the integral quadratic form. In the concluding, fourth, chapter we study local properties of smooth nonlinear mappings in a neighborhood of an abnormal point. The problems which are studied in this book (of course, in addition to their extremal nature) are united by our main interest being in the study of the so called abnormal or degenerate problems. This is the main distinction of the present book from a large number of books devoted to theory of extremal problems, among which there are many excellent textbooks, and books such as, e.g., [13, 38, 59, 78, 82, 86, 101, 112, 119], to mention a few.

In this monograph, questions of extensions and relaxations are consid­ ered. These questions arise in many applied problems in connection with the operation of perturbations. In some cases, the operation of'small'per­ turbations generates'small'deviations of basis indexes; a corresponding stability takes place. In other cases, small perturbations generate spas­ modic change of a result and of solutions defining this result. These cases correspond to unstable problems. The effect of an unstability can arise in extremal problems or in other related problems. In this connection, we note the known problem of constructing the attainability domain in con­ trol theory. Of course, extremal problems and those of attainability (in abstract control theory) are connected. We exploit this connection here (see Chapter 5). However, basic attention is paid to the problem of the attainability of elements of a topological space under vanishing perturba­ tions of restrictions. The stability property is frequently missing; the world of unstable problems is of interest for us. We construct regularizing proce­ dures. However, in many cases, it is possible to establish a certain property similar to partial stability. We call this property asymptotic nonsensitivity or roughness under the perturbation of some restrictions. The given prop­ erty means the following: in the corresponding problem, it is the same if constraints are weakened in some'directions'or not. On this basis, it is possible to construct a certain classification of constraints, selecting'di­ rections of roughness'and'precision directions'.

Combinatorial mathematics has been pursued since time immemorial, and at a reasonable scientific level at least since Leonhard Euler (1707-1783). It ren­ dered many services to both pure and applied mathematics. Then along came the prince of computer science with its many mathematical problems and needs - and it was combinatorics that best fitted the glass slipper held out. Moreover, it has been gradually more and more realized that combinatorics has all sorts of deep connections with'mainstream areas'of mathematics, such as algebra, geometry and probability. This is why combinatorics is now apart of the standard mathematics and computer science curriculum. This book is as an introduction to extremal combinatorics - a field of com­ binatorial mathematics which has undergone aperiod of spectacular growth in recent decades. The word'extremal'comes from the nature of problems this field deals with: if a collection of finite objects (numbers, graphs, vectors, sets, etc.) satisfies certain restrictions, how large or how small can it be? For example, how many people can we invite to a party where among each three people there are two who know each other and two who don't know each other? An easy Ramsey-type argument shows that at most five persons can attend such a party. Or, suppose we are given a finite set of nonzero integers, and are asked to mark an as large as possible subset of them under the restriction that the sum of any two marked integers cannot be marked.

In this book we suggest a unified method of constructing near-minimizers for certain important functionals arising in approximation, harmonic analysis and ill-posed problems and most widely used in interpolation theory. The constructions are based on far-reaching refinements of the classical Calderón–Zygmund decomposition. These new Calderón–Zygmund decompositions in turn are produced with the help of new covering theorems that combine many remarkable features of classical results established by Besicovitch, Whitney and Wiener. In many cases the minimizers constructed in the book are stable (i.e., remain near-minimizers) under the action of Calderón–Zygmund singular integral operators.The book is divided into two parts. While the new method is presented in great detail in the second part, the first is mainly devoted to the prerequisites needed for a self-contained presentation of the main topic. There we discuss the classical covering results mentioned above, various spectacular applications of the classical Calderón–Zygmund decompositions, and the relationship of all this to real interpolation. It also serves as a quick introduction to such important topics as spaces of smooth functions or singular integrals.

This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed – the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text.This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the Kruskal—Katona theorem on shadows, the Lovász—Stein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovász Local Lemma, Schöning's algorithm for 3-SAT, the Szemerédi—Trotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.

The central theme of this paper is the variational analysis of homeomorphisms $h: {\mathbb X} \overset{\text{onto}}{\longrightarrow} {\mathbb Y}$ between two given domains ${\mathbb X}, {\mathbb Y} \subset {\mathbb R}^n$. The authors look for the extremal mappings in the Sobolev space ${\mathscr W}^{1,n}({\mathbb X},{\mathbb Y})$ which minimize the energy integral {\mathscr E}_h=\int_{{\mathbb X}} \| Dh(x) \|^n\, \mathrm{d}x\,. Because of the natural connections with quasiconformal mappings this $n$-harmonic alternative to the classical Dirichlet integral (for planar domains) has drawn the attention of researchers in Geometric Function Theory. Explicit analysis is made here for a pair of concentric spherical annuli where many unexpected phenomena about minimal $n$-harmonic mappings are observed. The underlying integration of nonlinear differential forms, called free Lagrangians, becomes truly a work of art.

The series is devoted to the publication of high-level monographs which cover the whole spectrum of current nonlinear analysis and applications in various fields, such as optimization, control theory, systems theory, mechanics, engineering, and other sciences. One of its main objectives is to make available to the professional community expositions of results and foundations of methods that play an important role in both the theory and applications of nonlinear analysis. Contributions which are on the borderline of nonlinear analysis and related fields and which stimulate further research at the crossroads of these areas are particularly welcome. Editor-in-ChiefJürgen Appell, Würzburg, Germany Honorary and Advisory EditorsCatherine Bandle, Basel, SwitzerlandAlain Bensoussan, Richardson, Texas, USAAvner Friedman, Columbus, Ohio, USAUmberto Mosco, Worcester, Massachusetts, USA Editorial BoardManuel del Pino, Bath, UK, and Santiago, ChileMikio Kato, Nagano, JapanWojciech Kryszewski, Toruń, PolandVicenţiu D. Rădulescu, Kraków, PolandSimeon Reich, Haifa, Israel Please submit book proposals to Jürgen Appell. Titles in planning include Ireneo Peral Alonso and Fernando Soria, Elliptic and Parabolic Equations Involving the Hardy–Leray Potential (2020)Cyril Tintarev, Profile Decompositions and Cocompactness: Functional-Analytic Theory of Concentration Compactness (2020)Takashi Suzuki, Semilinear Elliptic Equations: Classical and Modern Theories (2021)

Recent years have seen a growing trend to derive models of macroscopic phenomena encountered in the fields of engineering, physics, chemistry, ecology, self-organisation theory and econophysics from various variational or extremum principles. Through the link between the integral extremum of a functional and the local extremum of a function (explicit, for example, in the Pontryagin's maximum principle variational and extremum principles are mutually related. Thus it makes sense to consider them within a common context. The main goal of Variational and Extremum Principles in Macroscopic Systems is to collect various mathematical formulations and examples of physical reasoning that involve both basic theoretical aspects and applications of variational and extremum approaches to systems of the macroscopic world. The first part of the book is focused on the theory, whereas the second focuses on applications. The unifying variational approach is used to derive the balance or conservation equations, phenomenological equations linking fluxes and forces, equations of change for processes with coupled transfer of energy and substance, and optimal conditions for energy management. - A unique multidisciplinary synthesis of variational and extremum principles in theory and application - A comprehensive review of current and past achievements in variational formulations for macroscopic processes - Uses Lagrangian and Hamiltonian formalisms as a basis for the exposition of novel approaches to transfer and conversion of thermal, solar and chemical energy

This book deals with the new class of one-dimensional variational problems — the problems with branching solutions. Instead of extreme curves (mappings of a segment to a manifold) we investigate extreme networks, which are mappings of graphs (one-dimensional cell complexes) to a manifold. Various applications of the approach are presented, such as several generalizations of the famous Steiner problem of finding the shortest network spanning given points of the plane.

The book contains some of the most important results on the analysis of polynomials and their derivatives. Besides the fundamental results which are treated with their proofs, the book also provides an account of the most recent developments concerning extremal properties of polynomials and their derivatives in various metrics with an extensive analysis of inequalities for trigonometric sums and algebraic polynomials, as well as their zeros. The final chapter provides some selected applications of polynomials in approximation theory and computer aided geometric design (CAGD). One can also find in this book several new research problems and conjectures with sufficient information concerning the results obtained to date towards the investigation of their solution.

Theory of Extremal Problems

Combinatorial research has proceeded vigorously in Russia over the last few decades, based on both translated Western sources and original Russian material. The present volume extends the extremal approach to the solution of a large class of problems, including some that were hitherto regarded as exclusively algorithmic, and broadens the choice of theoretical bases for modelling real phenomena in order to solve practical problems. Audience: Graduate students of mathematics and engineering interested in the thematics of extremal problems and in the field of combinatorics in general. Can be used both as a textbook and as a reference handbook.

Problems in extremal graph theory have traditionally been tackled by ingenious methods which made use of the structure of extremal graphs. In this book, an update of his 1978 book Extremal Graph Theory, the author focuses on a trend towards probabilistic methods. He demonstrates both the direct use of probability theory and, more importantly, the fruitful adoption of a probabilistic frame of mind when tackling main line extremal problems. Essentially self-contained, the book does not merely catalog results, but rather includes considerable discussion on a few of the deeper results. The author addresses pure mathematicians, especially combinatorialists and graduate students taking graph theory, as well as theoretical computer scientists. He assumes a mature familiarity with combinatorial methods and an acquaintance with basic graph theory. The book is based on the NSF-CBMS Regional Conference on Graph Theory held at Emory University in June, 1984.