Sergei Ovchinnikov

This book provides the reader with a detailed theoretical treatment of the key mechanisms of superconductivity, up to the current state of the art (phonons, magnons, plasmons). In addition, the book describes the properties of key superconducting compounds that are of most interest for science and its applications today. For many years there has been a search for new materials with higher values of the main parameters, such as the critical temperature and the critical current. At present, the possibility to observe superconductivity at room temperature has become perfectly realistic. The book is especially concerned with high Tc systems, such as the high Tc oxides, hydrides with record values of the critical temperature under high pressure, nanoclusters, etc. A number of interesting novel superconducting systems have been discovered recently. Among them: topological materials, interface systems, intercalated graphene. The book contains rigorous derivations, based on statistical mechanics and many-body theory. The book is also providing qualitative explanations of the main concepts and results, which makes it accessible and interesting for a broader readership.

This textbook explores the foundations of real analysis using the framework of general ordered fields, demonstrating the multifaceted nature of the area. Focusing on the logical structure of real analysis, the definitions and interrelations between core concepts are illustrated with the use of numerous examples and counterexamples. Readers will learn of the equivalence between various theorems and the completeness property of the underlying ordered field. These equivalences emphasize the fundamental role of real numbers in analysis. Comprising six chapters, the book opens with a rigorous presentation of the theories of rational and real numbers in the framework of ordered fields. This is followed by an accessible exploration of standard topics of elementary real analysis, including continuous functions, differentiation, integration, and infinite series. Readers will find this text conveniently self-contained, with three appendices included after the main text, covering an overview of natural numbers and integers, Dedekind's construction of real numbers, historical notes, and selected topics in algebra. Real Analysis: Foundations is ideal for students at the upper-undergraduate or beginning graduate level who are interested in the logical underpinnings of real analysis. With over 130 exercises, it is suitable for a one-semester course on elementary real analysis, as well as independent study.

This concise text provides a gentle introduction to functional analysis. Chapters cover essential topics such as special spaces, normed spaces, linear functionals, and Hilbert spaces. Numerous examples and counterexamples aid in the understanding of key concepts, while exercises at the end of each chapter provide ample opportunities for practice with the material. Proofs of theorems such as the Uniform Boundedness Theorem, the Open Mapping Theorem, and the Closed Graph Theorem are worked through step-by-step, providing an accessible avenue to understanding these important results. The prerequisites for this book are linear algebra and elementary real analysis, with two introductory chapters providing an overview of material necessary for the subsequent text. Functional Analysis offers an elementary approach ideal for the upper-undergraduate or beginning graduate student. Primarily intended for a one-semester introductory course, this text is also a perfect resource for independent study or as the basis for a reading course.

This classroom-tested text is intended for a one-semester course in Lebesgue’s theory. With over 180 exercises, the text takes an elementary approach, making it easily accessible to both upper-undergraduate- and lower-graduate-level students. The three main topics presented are measure, integration, and differentiation, and the only prerequisite is a course in elementary real analysis.In order to keep the book self-contained, an introductory chapter is included with the intent to fill the gap between what the student may have learned before and what is required to fully understand the consequent text. Proofs of difficult results, such as the differentiability property of functions of bounded variations, are dissected into small steps in order to be accessible to students. With the exception of a few simple statements, all results are proven in the text. The presentation is elementary, where s-algebras are not used in the text on measure theory and Dini’s derivatives are not used in the chapter on differentiation. However, all the main results of Lebesgue’s theory are found in the book.http://online.sfsu.edu/sergei/MID.htm

This introductory text in graph theory focuses on partial cubes, which are graphs that are isometrically embeddable into hypercubes of an arbitrary dimension, as well as bipartite graphs, and cubical graphs. This branch of graph theory has developed rapidly during the past three decades, producing exciting results and establishing links to other branches of mathematics. Currently, Graphs and Cubes is the only book available on the market that presents a comprehensive coverage of cubical graph and partial cube theories. Many exercises, along with historical notes, are included at the end of every chapter, and readers are encouraged to explore the exercises fully, and use them as a basis for research projects. The prerequisites for this text include familiarity with basic mathematical concepts and methods on the level of undergraduate courses in discrete mathematics, linear algebra, group theory, and topology of Euclidean spaces. While the book is intended for lower-division graduate students in mathematics, it will be of interest to a much wider audience; because of their rich structural properties, partial cubes appear in theoretical computer science, coding theory, genetics, and even the political and social sciences.

The focus of this book is a mathematical structure modeling a physical or biological system that can be in any of a number of ‘states. ’ Each state is characterized by a set of binary features, and di?ers from some other nei- bor state or states by just one of those features. In some situations, what distinguishes a state S from a neighbor state T is that S has a particular f- ture that T does not have. A familiar example is a partial solution of a jigsaw puzzle, with adjoining pieces. Such a state can be transformed into another state, that is, another partial solution or the ?nal solution, just by adding a single adjoining piece. This is the ?rst example discussed in Chapter 1. In other situations, the di?erence between a state S and a neighbor state T may reside in their location in a space, as in our second example, in which in which S and T are regions located on di?erent sides of some common border. We formalize the mathematical structure as a semigroup of ‘messages’ transforming states into other states. Each of these messages is produced by the concatenation of elementary transformations called ‘tokens (of infor- tion). ’ The structure is speci?ed by two constraining axioms. One states that any state can be produced from any other state by an appropriate kind of message. The other axiom guarantees that such a production of states from other states satis?es a consistency requirement.

The focus of this book is a mathematical structure modeling a physical or biological system that can be in any of a number of ‘states. ’ Each state is characterized by a set of binary features, and di?ers from some other nei- bor state or states by just one of those features. In some situations, what distinguishes a state S from a neighbor state T is that S has a particular f- ture that T does not have. A familiar example is a partial solution of a jigsaw puzzle, with adjoining pieces. Such a state can be transformed into another state, that is, another partial solution or the ?nal solution, just by adding a single adjoining piece. This is the ?rst example discussed in Chapter 1. In other situations, the di?erence between a state S and a neighbor state T may reside in their location in a space, as in our second example, in which in which S and T are regions located on di?erent sides of some common border. We formalize the mathematical structure as a semigroup of ‘messages’ transforming states into other states. Each of these messages is produced by the concatenation of elementary transformations called ‘tokens (of infor- tion). ’ The structure is speci?ed by two constraining axioms. One states that any state can be produced from any other state by an appropriate kind of message. The other axiom guarantees that such a production of states from other states satis?es a consistency requirement.