Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book collects the proceedings of a series of conferences dedicated to birational geometry of Fano varieties held in Moscow, Shanghai and Pohang The conferences were focused on the following two related problems: • existence of Kähler–Einstein metrics on Fano varieties • degenerations of Fano varieties on which two famous conjectures were recently proved. The first is the famous Borisov–Alexeev–Borisov Conjecture on the boundedness of Fano varieties, proved by Caucher Birkar (for which he was awarded the Fields medal in 2018), and the second one is the (arguably even more famous) Tian–Yau–Donaldson Conjecture on the existence of Kähler–Einstein metrics on (smooth) Fano varieties and K-stability, which was proved by Xiuxiong Chen, Sir Simon Donaldson and Song Sun. The solutions for these longstanding conjectures have opened new directions in birational and Kähler geometries. These research directions generated new interesting mathematical problems, attracting the attention of mathematicians worldwide. These conferences brought together top researchers in both fields (birational geometry and complex geometry) to solve some of these problems and understand the relations between them. The result of this activity is collected in this book, which contains contributions by sixty nine mathematicians, who contributed forty three research and survey papers to this volume. Many of them were participants of the Moscow–Shanghai–Pohang conferences, while the others helped to expand the research breadth of the volume—the diversity of their contributions reflects the vitality of modern Algebraic Geometry.

Algebraic geometry. --- Functions of complex variables. --- Polytopes. --- Projective geometry. --- Algebraic Geometry. --- Several Complex Variables and Analytic Spaces. --- Projective Geometry. --- Geometria algebraica --- Mathematics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book defines and studies a combinatorial object called the pedigree and develops the theory for optimising a linear function over the convex hull of pedigrees (the Pedigree polytope). A strongly polynomial algorithm implementing the framework given in the book for checking membership in the pedigree polytope is a major contribution. This book challenges the popularly held belief in computer science that a problem included in the NP-complete class may not have a polynomial algorithm to solve. By showing STSP has a polynomial algorithm, this book settles the P vs NP question. This book has illustrative examples, figures, and easily accessible proofs for showing this unexpected result. This book introduces novel constructions and ideas previously not used in the literature. Another interesting feature of this book is it uses basic max-flow and linear multicommodity flow algorithms and concepts in these proofs establishing efficient membership checking for the pedigree polytope. Chapters 3-7 can be adopted to give a course on Efficient Combinatorial Optimization. This book is the culmination of the author's research that started in 1982 through a presentation on a new formulation of STSP at the XIth International Symposium on Mathematical Programming at Bonn.

Computational complexity. --- Mathematical optimization. --- Calculus of variations. --- Algebraic fields. --- Polynomials. --- Operations research. --- Management science. --- Computational Complexity. --- Optimization. --- Calculus of Variations and Optimization. --- Continuous Optimization. --- Field Theory and Polynomials. --- Operations Research, Management Science . --- Algebraic number fields --- Algebraic numbers --- Fields, Algebraic --- Algebra, Abstract --- Algebraic number theory --- Rings (Algebra) --- Isoperimetrical problems --- Variations, Calculus of --- Maxima and minima --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Operations research --- Simulation methods --- System analysis --- Complexity, Computational --- Electronic data processing --- Machine theory --- Quantitative business analysis --- Management --- Problem solving --- Statistical decision --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Algebra --- Polytopes. --- Hyperspace --- Topology