Muutke küpsiste eelistusi

E-raamat: Polytopes and Graphs

(Deakin University, Victoria)
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 80,26 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Polytopes and GraphsSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

This book introduces convex polytopes and their graphs, alongside the results and methodologies required to study them. It guides the reader from the basics to current research, presenting many open problems to facilitate the transition. The book includes results not previously found in other books, such as: the edge connectivity and linkedness of graphs of polytopes; the characterisation of their cycle space; the Minkowski decomposition of polytopes from the perspective of geometric graphs; Lei Xue's recent lower bound theorem on the number of faces of polytopes with a small number of vertices; and Gil Kalai's rigidity proof of the lower bound theorem for simplicial polytopes. This accessible introduction covers prerequisites from linear algebra, graph theory, and polytope theory. Each chapter concludes with exercises of varying difficulty, designed to help the reader engage with new concepts. These features make the book ideal for students and researchers new to the field.

This book introduces convex polytopes and their graphs, alongside the results and methodology required to study them. Including background material, open problems, and cutting-edge research, this is the ideal book for readers new to the area.

Arvustused

'This is a welcome monograph on combinatorial aspects of polytope theory, with a focus on graphs. While the book is written to be accessible to non-experts, it does capture a lot of the research on that subject from the last 30 years.' Michael Joswig, Technische Universität Berlin and Max-Planck-Institute for Mathematics in the Sciences, Leipzig 'Polytopes are geometric objects that have fascinated mathematicians since antiquity. Graphs are combinatorial objects that are ubiquitous throughout pure and applied mathematics. Ever since Steinistz's famous theorem asserting that planar 3-connected graphs are precisely graphs of three-dimensional polytopes, the match between polytopes and graphs was engraved in heaven.   Guillermo Pineda Villavicencio, a notable researcher exploring this connection, has authored a remarkable book on the subject. This book is well-suited for advanced undergraduates as well as professional mathematicians. It commences with a comprehensive introduction to polytopes and proceeds to explore the properties of polytopal graphs. Additionally, it delves into advanced topics, such as connectivity, diameter, reconstruction, decomposition, and more. I highly recommend this book.' Gil Kalai, Hebrew University of Jerusalem and Reichman University

Muu info

An introduction to convex polytopes and their graphs, including both background material and cutting-edge research.
Preface;
1. Introduction;
2. Polytopes;
3. Polytopal graphs;
4. Connectivity;
5. Reconstruction;
6. Decomposition;
7. Diameter;
8. Faces; A. Open problems; B. Topology; C. Graphs; References; Glossary; Index.
Guillermo Pineda Villavicencio is an Associate Professor in Computer Science and Mathematics at Deakin University, Australia, and a Fellow of AdvanceHE. He conducts research on graph theory and discrete geometry, the construction and analysis of large networks, and applications of mathematics to health informatics. He is an Accredited Member of the Australian Mathematical Society and served on its Council from 2018 to 2022. He is also a Life Member of the Combinatorial Mathematics Society of Australasia.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97810092577872e.html
Märksõnad: