COMBINATORIAL WORLD Linfan Mao Nanjing Normal University

Slides:



Advertisements
Similar presentations
Chapter 2 Revision of Mathematical Notations and Techniques
Advertisements

Project Senses Six blind men and the Elephant. Once upon a time there were six blind men. They lived in a town in India. They thought they were very clever.
Bringing your life together.  Goal of this Series  Developing active exhilarating faith  experiencing God's intervention in our daily life.  You can.
8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.
Introduction to Graphs
Differential geometry I
The Unknot, the Trefoil Knot, and the Figure-Eight Knot are Mutually Nonequivalent An Elementary Proof Jimmy Gillan Thursday, April 10, 2008.
Week 21 Basic Set Theory A set is a collection of elements. Use capital letters, A, B, C to denotes sets and small letters a 1, a 2, … to denote the elements.
6. One-Dimensional Continuous Groups 6.1 The Rotation Group SO(2) 6.2 The Generator of SO(2) 6.3 Irreducible Representations of SO(2) 6.4 Invariant Integration.
CS5371 Theory of Computation Lecture 1: Mathematics Review I (Basic Terminology)
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
Ch.5 Multiview Drawings Objective: Learn the rules for reducing a 3D object onto a 2D multiview drawing and learn some hints for visualizing a 3D object.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
The study of shapes and figures
DEPARTMENT OF MATHEMATI CS [ YEAR OF ESTABLISHMENT – 1997 ] DEPARTMENT OF MATHEMATICS, CVRCE.
Searching & Assessing Websites II Form Science Fall 2012.
9.2 Graph Terminology and Special Types Graphs
A Study of The Applications of Matrices and R^(n) Projections By Corey Messonnier.
Maps. Graphs on Surfaces We are mainly interested in embeddings of graphs on surfaces:  : G ! S. An embedding should be differentiated from immersion.
Petrie maps and Petrie configurations Jurij Kovič, University of Primorska, Slovenia EuroGIGA Final Conference Berlin, February 20, 2014.
Cayley graphs formed by conjugate generating sets of S_n Jacob Steinhardt.
Gauge Fields, Knots and Gravity Wayne Lawton Department of Mathematics National University of Singapore (65)
April 14, 2015Applied Discrete Mathematics Week 10: Equivalence Relations 1 Properties of Relations Definition: A relation R on a set A is called transitive.
David Renardy.  Simple Group- A nontrivial group whose only normal subgroups are itself and the trivial subgroup.  Simple groups are thought to be classified.
Visual Computing Geometric Modelling 1 INFO410 & INFO350 S2 2015
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
Dr. Wang Xingbo Fall , 2005 Mathematical & Mechanical Method in Mechanical Engineering.
Mathematical Preliminaries
Distributing Chemical Compounds in Refrigerators using interval graphs
Discrete Mathematical Structures: Theory and Applications
Relations. Important Definitions We covered all of these definitions on the board on Monday, November 7 th. Definition 1 Definition 2 Definition 3 Definition.
Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
Introduction to Graph Theory
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
On Property L On Property L School of Mathematics School of Mathematics Fudan University Fudan University Xiaoman Chen & Xianjin Wan.
The main study of Field Theory By: Valerie Toothman
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
Topology Preserving Edge Contraction Paper By Dr. Tamal Dey et al Presented by Ramakrishnan Kazhiyur-Mannar.
By: Emma Milch Agledahl!. No-one knows exactly how it started. 24 succeding followers (Tirthankaras)started the reliogion, according to myth. Rishabha.
On Operator Norm Localization Property On Operator Norm Localization Property School of Mathematics School of Mathematics Fudan University Fudan University.
Fundamental Graph Theory (Lecture 1) Lectured by Hung-Lin Fu 傅 恆 霖 Department of Applied Mathematics National Chiao Tung University.
Math 3121 Abstract Algebra I Lecture 6 Midterm back over+Section 7.
SF2714 Discrete Mathematics and Algebra 7.5 hp KTH, period 2, Fall 2009 Course coordinator: Jakob Jonsson –
Geometry: Axiomatic System. MA.912.G Analyze the structure of Euclidean geometry as an axiomatic system. Distinguish between undefined terms, definitions,
Discrete Mathematics Graph: Planar Graph Yuan Luo
Equivalence, Invariants, and Symmetry Chapter 2
Geometry on Combinatorial Structures
37TH ANNUAL AMATYC CONFERENCE A Modern Existence Proof Through Graphs
Applied Discrete Mathematics Week 14: Trees
The countable character of uncountable graphs François Laviolette Barbados 2003.
5.9.2 Characterizations of Planar Graphs
More NP-complete Problems
Labeled Graphs with Combinatorial Manifolds
Graph theory Definitions Trees, cycles, directed graphs.
Introduction to linear Lie groups
Extending Homomorphism Theorem to Multi-Systems
BK21 PLUS 타이거 세미나 ( 화 ) 발 표 자 : 박 지 훈
Basic mathematics topology definition
Differential Manifolds and Tensors
CS100: Discrete structures
Introduction to linear Lie groups
Introduction to linear Lie groups -- continued
5 The Mathematics of Getting Around
Properties of Relations
Sequences on Graphs with Symmetries
Proving the Pythagorean Theorem
A Portrait of a Group on a Surface with Boundary
Sets and Probabilistic Models
Resolvability of some families of Corona Product Graphs By Kareem Nawaz Supervised by Dr. Muhammad Imran.
Presentation transcript:

COMBINATORIAL WORLD Linfan Mao Nanjing Normal University Dedicated to Prof.Feng Tian on Occasion of his 70th Birthday COMBINATORIAL WORLD ----Applications of Voltage Assignament to Principal Fiber Bundles Linfan Mao (Chinese Academy of Mathematics and System Science, Beijing 100080) maolinfan@163.com Nanjing Normal University October 3, 2009

Contents 1. Why Is It Combinatorial? 2. What is a Combinatorial Manifold? 3. What is a Differentiable Combinatorial Manifold? 4. What is a Principal Fiber Bundle? 5. A Question 6. Voltage Graph with Its Lifting 7. Combinatorial Fiber Bundle 8. Principal Fiber Bundle(PFB) 9. Connection on PFB 10. Applications to Gauge Field

1. Why Is It Combinatorial? ● Ames Room—It isn’t all right of our visual sense.

solid pipe, respectively. All of you are right! A wise man said. ● Blind men with an elephant The man touched its leg, tail, trunk, ear, belly or tusk claims that the elephant is like a pillar, a rope, a tree branch, a hand fan, a wall or a solid pipe, respectively. All of you are right! A wise man said.

What is the structure of the world? It is out order? No! in order! Any thing has itself reason for existence.

A depiction of the world by combinatoricians How to characterize it by mathematics? Manifold!

2. What is a Combinatorial Manifold? Loosely speaking, a combinatorial manifold is a combination of finite manifolds, such as those shown in the next figure.

2.1 Euclidean Fan-Space

2.2 Topological Combinatorial Manifold

2.3 Vertex-Edge Labeled Graphs

2.4 Fundamental d-Group

Choose a graph with vertex set being manifolds labeled by its dimension and two manifold adjacent with a label of the dimension of the intersection if there is a d-path in this combinatorial manifold. Such graph is denoted by Gd. d=1 in (a) and (b), d=2 in (c) and (d) in the next figure.

2.5 Homology Group

3. What is a Differentiable Combinatorial Manifold? 3.1 Definition

Explains for condition (2)

3.2 Local Properties of Combinatorial Manifolds

3.3 Tensor Field

3.4 Curvature Tensor

4. What is a Principal Fiber Bundle. 4 4. What is a Principal Fiber Bundle? 4.1 Covering Space A covering space S’ of S consisting of a space S’ with a continuous mapping p : S’ → S such that each point x ∈ S has an arcwise connected neighborhood Ux and each arcwise connected component of p−1(Ux) is mapped topologically onto Ux by p. An opened neighborhoods Ux that satisfies the condition just stated is called an elementary neighborhood and p is often called a projection from S’ to S.

4.2 Principal Fiber Bundle

Lie Group: A Lie group (G,·) is a smooth manifold M such that (a , b) → a·b-1 is C∞-differentiable for any a, b in G.

5. A Question For a family of k principal fiber bundles P1(M1,G1), P2(M2,G2),…, Pk(Mk, Gk) over manifolds M1, M2, · · ·, Ml, how can we construct principal fiber bundles on a smoothly combinatorial manifold consisting of M1, M2, · · ·, Ml underlying a connected graph G?

6. Voltage Graph with Its Lifting 6 6. Voltage Graph with Its Lifting 6.1 Voltage Assignment Let G be a connected graph and (G, o ) a group. For each edge e∈E(G), e = uv, an orientation on e is an orientation on e from u to v, denoted by e = (u, v) , called plus orientation and its minus orientation, from v to u, denoted by e−1 = (v, u). For a given graph G with plus and minus orientation on its edges, a voltage assignment on G is a mapping α from the plus-edges of G into a group (G, o ) satisfying α(e−1) = α−1(e), e∈E(G). These elements α(e), e∈E(G) are called voltages, and (G, α) a voltage graph over the group (G, o ) .

6.2 Lifting of Voltage Graph

6.3 Voltage Vertex-Edge Labeled Graph with Its Lifting

Example:

6.4 Lifting of Automorphism of Graph

7. Combinatorial Fiber Bundle 7.1 Definition

7.2 Theorem Can we introduce differential structure on combinatorial Principal fiber bundles? The answer is YES!

8. Principal Fiber Bundle(PFB) 8.1 Lie Multi-Group

8.2 Principal Fiber Bundle (PFB)

8.3 Construction by Voltage Assignment

8.4 Results

9. Connection on PFB

10. Applications to Gauge Field Whence, we can find infinite combinatorial gauge fields by application of principal fiber bundle.

Background: 1. (2005) Automorphism Groups of Maps, Surfaces and Smarandache Geometries, American Research Press. 2.(2005)Formally presented CC Conjecture: A mathematical science can be reconstructed from or made by combinatorialization. 3. (2006) Smarandache Multi-Space Theory, Hexis, Phoenix, American. (Reviewer: An algebraic geometry book) 4.(2006)Selected Papers on Mathematical Combinatorics, World Academic Union. 5.(2007)Sponsored journal: International J. Mathematical Combinatorics, USA. 6.(2009)Combinatorial Geometry with Application to Field Theory, USA.