This paper describes an extension and a new foundation of the Standard Model of particle physics based on a SU(4)-force called hyper-color, and on preon subparticles. The hyper-color force is a generalization of the S...This paper describes an extension and a new foundation of the Standard Model of particle physics based on a SU(4)-force called hyper-color, and on preon subparticles. The hyper-color force is a generalization of the SU(2)-based weak interaction and the SU(1)-based right-chiral self-interaction, in which the W-and the Z-bosons are Yukawa residual-field-carriers of the hyper-color force, in the same sense as the pions are the residual-field-carriers of the color SU(3) interaction. Using the method of numerical minimization of the SU(4)-action based on this model, the masses and the inner structure of leptons, quarks and weak bosons are calculated: the mass results are very close to the experimental values. We calculate also precisely the value of the Cabibbo angle, so the mixing matrices of the Standard model, CKM matrix for quarks and PMNS matrix for neutrinos can also be calculated. In total, we reduce the 29 parameters of the Standard Model to a total of 7 parameters.展开更多
Abstract. Let G be a graph with edge set E(G). S E(G) is called an edge cover of G ifevery vertex of G is an end vertex of some edges in S. The edge covering chromatic numberof a graph G, denoted by Xc(G) is the maxim...Abstract. Let G be a graph with edge set E(G). S E(G) is called an edge cover of G ifevery vertex of G is an end vertex of some edges in S. The edge covering chromatic numberof a graph G, denoted by Xc(G) is the maximum size of a partition of E(G) into edgecovers of G. It is known that for any graph G with minimum degree δ,δ- 1 The fractional edge covering chromatic number of a graph G, denoted by Xcf(G), is thefractional matching number of the edge covering hypergraph H of G whose vertices arethe edges of G and whose hyperedges the edge covers of G. In this paper, we studythe relation between X’c(G) and δ for any graph G, and give a new simple proof of theinequalities δ - 1 ≤ X’c(G) ≤ δ by the technique of graph coloring. For any graph G, wegive an exact formula of X’cf(G), that is,where A(G)=minand the minimum is taken over all noempty subsets S of V(G) and C[S] is the set of edgesthat have at least one end in S.展开更多
文摘This paper describes an extension and a new foundation of the Standard Model of particle physics based on a SU(4)-force called hyper-color, and on preon subparticles. The hyper-color force is a generalization of the SU(2)-based weak interaction and the SU(1)-based right-chiral self-interaction, in which the W-and the Z-bosons are Yukawa residual-field-carriers of the hyper-color force, in the same sense as the pions are the residual-field-carriers of the color SU(3) interaction. Using the method of numerical minimization of the SU(4)-action based on this model, the masses and the inner structure of leptons, quarks and weak bosons are calculated: the mass results are very close to the experimental values. We calculate also precisely the value of the Cabibbo angle, so the mixing matrices of the Standard model, CKM matrix for quarks and PMNS matrix for neutrinos can also be calculated. In total, we reduce the 29 parameters of the Standard Model to a total of 7 parameters.
基金the National Natural Science Foundation the Doctoral Foundation of the Education Committee of China.
文摘Abstract. Let G be a graph with edge set E(G). S E(G) is called an edge cover of G ifevery vertex of G is an end vertex of some edges in S. The edge covering chromatic numberof a graph G, denoted by Xc(G) is the maximum size of a partition of E(G) into edgecovers of G. It is known that for any graph G with minimum degree δ,δ- 1 The fractional edge covering chromatic number of a graph G, denoted by Xcf(G), is thefractional matching number of the edge covering hypergraph H of G whose vertices arethe edges of G and whose hyperedges the edge covers of G. In this paper, we studythe relation between X’c(G) and δ for any graph G, and give a new simple proof of theinequalities δ - 1 ≤ X’c(G) ≤ δ by the technique of graph coloring. For any graph G, wegive an exact formula of X’cf(G), that is,where A(G)=minand the minimum is taken over all noempty subsets S of V(G) and C[S] is the set of edgesthat have at least one end in S.
