Combinatorial Speculations and ̧ the Combinatorial Conjecture for Mathematics ̧
نویسنده
چکیده
¸ maolinfan@163. com¸Abstract : Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an more important work for mathematician is to apply combinatorics to other mathematics and other sciences not merely to find combinatorial behavior for objectives. Recently, such research works appeared on journals for mathematics and theoretical physics on cosmos. The main purpose of this paper is to survey these thinking and ideas for mathematics and cosmological physics, such as those of multi-spaces, map geometries and combinatorial cosmoses, also the combinatorial conjecture for mathematics proposed by myself in 2005. Some open problems are included for the 21th mathematics by a combinatorial speculation. 1. The role of classical combinatorics in mathematics Modern science has so advanced that to find a universal genus in the society of sciences is nearly impossible. Thereby a scientist can only give his or her contribution in one or several fields. The same thing also happens for researchers in combinatorics. Generally, combinatorics deals with twofold questions: Question 1.1. determine or find structures or properties of configurations, such as those structure results appeared in graph theory, combinatorial maps and design Consider the contribution of a question to science. We can separate mathematical 1
منابع مشابه
m at h . G M ] 2 8 Ju n 20 06 Combinatorial Speculations and ̧ the Combinatorial Conjecture for Mathematics ̧
¸ maolinfan@163. com¸Abstract : Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an even more important work for mathematician is to apply combinatorics to other mathematics and other sciences beside just to find combinatorial behavior for objectives. In the past few years, works of this kind frequently appeared on journals fo...
متن کاملA Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملSome combinatorial aspects of finite Hamiltonian groups
In this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite Hamiltonian group. The coverings with three proper subgroups and the principal series of such a group are also counted. Finally, we give a complete description of the lattice of characteristic subgroups of a finite H...
متن کاملSome Algebraic and Combinatorial Properties of the Complete $T$-Partite Graphs
In this paper, we characterize the shellable complete $t$-partite graphs. We also show for these types of graphs the concepts vertex decomposable, shellable and sequentially Cohen-Macaulay are equivalent. Furthermore, we give a combinatorial condition for the Cohen-Macaulay complete $t$-partite graphs.
متن کامل