• Title: Combinatorial Geometry with Application to Field Theory
• Author(s) Linfan Mao
• Publisher: Chinese Academy of Sciences; 2nd edition (August 15, 2011)
• Paperback: 500 pages
• eBook: PDF (502 pages, 2.5 MB)
• Language: English
• ISBN-10: 159973155X
• ISBN-13: 978-1599731551
• Share This:  

Book Description

Motivated by the combinatorial principle, particularly, the CC conjecture, i.e., any mathematical science can be reconstructed from or made by combinatorialization, this book surveys mathematics and field theory.

Topics covered in this book include fundamental of combinatorics, algebraic combinatorics, topology with Smarandache geometry, combinatorial differential geometry, combinatorial Riemannian submanifolds, Lie multi-groups, combinatorial principal fiber bundles, gravitational field, quantum fields and gauge field with their combinatorial generalization, also with discussions on fundamental questions in epistemology.

Nearly all geometries, such as pseudo-manifold geometries, Finsler geometry, combinatorial Finsler geometries, Riemann geometry, combinatorial Riemannian geometries, Weyl geometry, Kahler geometry are particular cases of Smarandache geometries.

All of these materials are valuable for researchers or graduate students in topological graph theory with enumeration, topology, Smarandache geometry, Riemannian geometry, gravitational or quantum fields, many-body system and globally quantifying economy.

• Dr. Linfan Mao is a researcher of Chinese Academy of Mathematics and System Science, an honorary professor of Beijing Institute of Architectural Engineering, also a deputy general secretary of the China Tendering & Bidding Association in Beijing.

• Amazon

• Combinatorics and Game Theory
• Geometry and Topology
• Physics
• Algebra, Abstract Algebra, and Linear Algebra

• Combinatorial Geometry with Application to Field Theory (Linfan Mao)
• First Edition (2009) - PDF

• Combinatorial and Computational Geometry (Jacob E. Goodman)

  It includes surveys and research articles exploring geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension.

• LEDA: A Platform for Combinatorial and Geometric Computing

  LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing. This book, written by the main authors of LEDA, is the definitive account of how the system operates and how it can be used.

• Combinatorics Through Guided Discovery (Kenneth P. Bogart)

  This book is an introduction to combinatorial mathematics, also known as combinatorics. The book focuses especially but not exclusively on the part of combinatorics that mathematicians refer to as 'counting'.

• Introduction to Ramsey Theory (Veselin Jungic)

  This book serves as a gentle introduction to Ramsey Theory for readers interested in becoming familiar with a dynamic segment of contemporary mathematics that combines ideas from number theory and combinatorics.

• Applied Combinatorics (Mitchel T. Keller, et al)

  This is a text with more than enough material for a one-semester introduction to combinatorics. The original target audience was primarily computer science majors, but the topics included make it suitable for a variety of different students.

• Analytic Combinatorics (Philippe Flajolet, et al)

  The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications.

• An Introduction to Combinatorics and Graph Theory

  This book walks the reader through the classic parts of Combinatorics and graph theory, while also discussing some recent progress in the area: on the one hand, providing material that will help students learn the basic techniques.