Composed, found, changed, modified, diversified computer-programmed images of stars, galaxies, cosmic dust, black (and other color) holes, comets, spacecrafts, robots and poetry....

…We simultaneously leave in parallel universes without knowing it… …Our contradictions coexist in a multi-space endowed with a multi-structure…

COSMOLOGY : pages 4-69 LET’S BIKE THE ART! : pages 70-129

A line of thought explored herein is the correspondence between cosmological phenomena and condensed matter physics, and therefore we can think that the quantization of orbit distances can be caused by superfluid helium quantization. This issue is explored by F. Smarandache and V. Christianto. Moreover, F. Smarandache also discusses possible new era of research that is pertaining to superluminal physics and instantaneous physics. Ion Patrascu and D. Rabounski discuss superluminality from their perspectives. And M. Pereira discusses his Hypergeometrical Universe model....

Preface III Contents IV Planetary orbits in Solar and Extrasolar systems (A. Rubcic & J. Rubcic) Fizika A, 19 no.3, 2010...................1 Areal velocities of planets and their comparison (P. Pintr, V. Per\inova% , A. Luks\) unpubl. 2011...................15 Distribution of distances in solar system (P. Pintr, V. Perinova , A. Luks) Chaos , Soliton, Fractals 2007...................27 New cosmological model of universe and possible quantization of the Hubble parameter (P.Pintr) unpublished paper, Dec. 2011...................39 Do we really understand the solar system? (M. Pitkanen) Nov. 27th 2011...................50 Inflation and TGD (M. Pitkanen) Dec. 10th 2011...................70 QCD and TGD (M. Pitkanen) Dec. 19th 2011...................78 Quantum arithmetics and the relationship between real and p-adic physics (M. Pitkanen) Dec. 12th 2011...................94 A blind pilot: who is super-luminal observer? (D. Rabounski) Progress in Physics Vol.2, 2008................126 Scientist deduced the existence of particles with faster-than-light speeds recently discovered by CERN. (I. Patrascu) Progress in Physics Vol.4, 20...

In The 2nd Conference on Combinatorics and Graph Theory of China (Aug. 16-19, 2006, Tianjing), I formally presented a combinatorial conjecture on mathematical sciences (abbreviated to CC Conjecture), i.e., a mathematical science can be reconstructed from or made by combinatorialization, implicated in the foreword of Chapter 5 of my book Automorphism groups of Maps, Surfaces and Smarandache Geometries (USA, 2005). This conjecture is essentially a philosophic notion for developing mathematical sciences of 21st century, which means that we can combine different fields into a union one and then determines its behavior quantitatively. It is this notion that urges me to research mathematics and physics by combinatorics, i.e., mathematical combinatorics beginning in 2004 when I was a post-doctor of Chinese Academy of Mathematics and System Science. It finally brought about me one self-contained book, the first edition of this book, published by InfoQuest Publisher in 2009. This edition is a revisited edition, also includes the development of a few topics discussed in the first edition....

1.5 ENUMERATION TECHNIQUES 1.5.1 Enumeration Principle. The enumeration problem on a finite set is to count and find closed formula for elements in this set. A fundamental principle for solving this problem in general is on account of the enumeration principle: For finite sets X and Y , the equality |X| = |Y | holds if and only if there is a bijection f : X → Y . Certainly, if the set Y can be easily countable, then we can find a closed formula for elements in X....

Contents Preface to the Second Edition . . . . . . . . . . . . . . . . . . . i Chapter 1. Combinatorial Principle with Graphs . . . . . . . . . . 1 1.1 Multi-sets with operations. . . . . . . . . . . . . . . . . . . . .2 1.1.1 Set . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.1.2 Operation . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.3 Boolean algebra . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.1.4 Multi-Set . . . . . . . . . . . . . . . . . . . . . . . . . .8 1.2 Multi-posets . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.2.1 Partially ordered set . . . . . . . . . . . . . . . . . . . . .11 1.2.2 Multi-Poset . . . . . . . . . . . . . . . . . . . . . . 13 1.3 Countable sets . . . . . . . . . . . . . . . . . . . . . . . . 15 1.3.1 Mapping . . . . . . . . . . . . . . . . . . . . . . . . . 15 1.3.2 Countable set . . . . . . . . . . . . . . . . . . . . 16 1.4 Graphs . . . . . . . . . . . . . . . . . . . . . . . . 18 1.4.1 Graph. . . . . . . . . . . . . . . . . . . . . . . . . . . .18 1.4.2 Subgraph . . . . . . . . . . . . . . . . . . . . . . . . 21 1.4.3 Labeled graph. . . . . . ...