The Extremal Universe Exact Solution from Einstein’s Field Equation Gives the Cosmological Constant Directly

Einstein’s field equation is a highly general equation consisting of sixteen equations. However, the equation itself provides limited information about the universe unless it is solved with different boundary conditions. Multiple solutions have been utilized to predict cosmic scales, and among them, the Friedmann-Lemaître-Robertson-Walker solution that is the back-bone of the development into today standard model of modern cosmology: The Λ-CDM model. However, this is naturally not the only solution to Einstein’s field equation. We will investigate the extremal solutions of the Reissner-Nordström, Kerr, and Kerr-Newman metrics. Interestingly, in their extremal cases, these solutions yield identical predictions for horizons and escape velocity. These solutions can be employed to formulate a new cosmological model that resembles the Friedmann equation. However, a significant distinction arises in the extremal universe solution, which does not necessitate the ad hoc insertion of the cosmological constant;instead, it emerges naturally from the derivation itself. To the best of our knowledge, all other solutions relying on the cosmological constant do so by initially ad hoc inserting it into Einstein’s field equation. This clarification unveils the true nature of the cosmological constant, suggesting that it serves as a correction factor for strong gravitational fields, accurately predicting real-world cosmological phenomena only within the extremal solutions of the discussed metrics, all derived strictly from Einstein’s field equation.

一类关联图的Star Extremal性质(英文)

证明了Cn的关联图I(Cn)是循环图,还证明了所有Cn的关联图I(Cn)及一些与I(Cn)有关的图是starextremal的.并用一种同构的方法得到了它们的圆色数和分色数.

A necessary and sufficient condition for a vertex-transitive graph to be star extremal

A graph is called star extremal if its fractional chromatic number is equal to its circular chromatic number. We first give a necessary and sufficient condition for a graph G to have circular chromatic number V(G)/α(G) (where V(G) is the vertex number of G and α(G) is its independence number). From this result, we get a necessary and sufficient condition for a vertex-transitive graph to be star extremal as well as a necessary and sufficient condition for a circulant graph to be star extremal. Using these conditions, we obtain several classes of star extremal graphs.

The Star-Extremality of Circulant Graphs

The circular chromatic number and the fractional chromatic number are two generalizations of the ordinary chromatic number of a graph. We say a graph G is star extremal if its circular chromatic number is equal to its fractional chromatic number. This paper gives an improvement of a theorem. And we show that several classes of circulant graphs are star extremal.

A Class of Star Extremal Circulant Graphs

The circular chromatic number and the fractional chromatic number are two generalizations of the ordinary chromatic number of a graph. A graph is called star extremal if its fractional chromatic number equals to its circular chromatic number (also known as the star chromatic number). This paper studies the star extremality of the circulant graphs whose generating sets are of the form {±1,±k} .

Multiobjective extremal optimization with applications to engineering design

In this paper, we extend a novel unconstrained multiobjective optimization algorithm, so-called multiobjective extremal optimization （MOEO）, to solve the constrained multiobjective optimization problems （MOPs）. The proposed approach is validated by three constrained benchmark problems and successfully applied to handling three multiobjective engineering design problems reported in literature. Simulation results indicate that the proposed approach is highly competitive with three state-of-the-art multiobjective evolutionary algorithms, i.e., NSGA-11, SPEA2 and PAES. Thus MOEO can be considered a good alternative to solve constrained multiobjective optimization problems.

Real scalar field scattering in the nearly extremal Schwarzschild de Sitter space

Reasonable approximations are introduced to investigate the real scalar field scattering in the nearly extremal Schwarzschild-de Sitter （SdS） space. The approximations naturally lead to the invertible x（r） and the global replacement of the true potential by a PSshl-Teller one. Meanwhile, the Schr6dinger-like wave equation is transformed into a solvable form. Our numerical solutions to the wave equation show that the wave is characteristically similar to the harmonic under the tortoise coordinate x, while the wave piles up near the two horizons and the wavelength tends to its maximum as the potential approaches to the peak under the radial coordinate τ.

Hybrid artificial immune system and extremal optimization algorithm for permutation flowshop scheduling problem

The permutation flowshop scheduling problem （PFSP） is one of the most well-known and well-studied production scheduling problems with strong industrial background. This paper presents a new hybrid optimization algorithm which combines the strong global search ability of artificial immune system （AIS） with a strong local search ability of extremal optimization （EO） algorithm. The proposed algorithm is applied to a set of benchmark problems with a makespan criterion. Performance of the algorithm is evaluated. Comparison results indicate that this new method is an effective and competitive approach to the PFSP.

The Extremal Problem on Cartan-egg Domain of the First Type

In this paper,we study the extremal problem on Cartan-egg domain of the first type by using some inequalities.The extremal mapping and extremal value between the first type of Cartan-egg domain and the unit ball when k≤1 and k=2,m=2 are constructed.

Unicyclic graphs with extremal Lanzhou index

Very recently D.Vukicevic et al.[8]introduced a new topological index for a molecular graph G named Lanzhou index as∑_(u∈V(G))d_(u)d^(2)_(u),where d_(u)and d_(u)denote the degree of vertex u in G and in its complement respectively.Lanzhou index Lz(G)can be expressed as(n-1)M_(1)(G)-F(G),where M_(1)(G)and F(G)denote the first Zagreb index and the forgotten index of G respectively,and n is the number of vertices in G.It turns out that Lanzhou index outperforms M_(1)(G)and F(G)in predicting the logarithm of the octanol-water partition coefficient for octane and nonane isomers.It was shown that stars and balanced double stars are the minimal and maximal trees for Lanzhou index respectively.In this paper,we determine the unicyclic graphs and the unicyclic chemical graphs with the minimum and maximum Lanzhou indices separately.

EXISTENCE THEOREMS OF EXTREMAL SOLUTIONS FOR A CLASS OF NONLINEAR INTEGRO－DIFFERENTIAL EQUATIONS

In this paper, the following initial value problem for nonlinear integro-differential equationis considered , whereUsing the method of upper and lower solutions and the monotone iterative technique .We obtain existence results of minimal and maximal solutions .

Uniform Convergence of Extremal Polynomials When Domains Have Corners and Special Cusps on the Boundary

We study the approximation properties of the extremal polynomials in Ap?norm and C?norm. We prove estimates for the rate of such convergence of the sequence of the extremal polynomials on domains with corners and special cusps.

REVISITING A NON-DEGENERACY PROPERTY FOR EXTREMAL MAPPINGS

We extend an earlier result obtained by the author in [7].

NEW SPECTRAL CHARACTERIZATIONS OF EXTREMAL HYPERSURFACES

Let M be a closed extremal hypersurface in S^n＋1 with the same mean curvature of the Willmore torus Wm,n-m.We proved that if Spec^p（M） = Spec^p（Wm,n-m ） for p = 0, 1, 2, then M is Wm,m.

Quadrilaterals, extremal quasiconformal extensions and Hamilton sequences

The relationship between Strebel boundary dilatation of a quasisymmetric function h of the unit circle and the dilatation indicated by the change in the modules of the quadrilaterals with vertices on the circle intrigues many mathematicians. It had been a conjecture for some time that the dilatations Ko（h） and K1（h） of h are equal before Anderson and Hinkkanen disproved this by constructing concrete counterexamples. The independent work of Wu and of Yang completely characterizes the condition for Ko（h） = K1 （h） when h has no substantial boundary point. In this paper, we give a necessary and sufficient condition to determine the equality for h admitting a substantial boundary point.

Hawking Radiation from Spherically Symmetrical Gravitational Collapse to an Extremal R-N Black Hole for a Charged Scalar Field

Si-Jie Gao has recently investigated Hawking radiation from spherically symmetrical gravitational collapse to an extremal R-N black hole for a real scalar field. Especially he estimated the upper bound for the expected number of particles in any wave packet belonging to spontaneously produced from the state , which confirms the traditional belief that extremal black holes do not radiate particles. Making some modifications, we demonstrate that the analysis can go through for a charged scalar field.

Extremal Cut-width Problem for Graphs

The problem studied in this paper is to determine e（p, C）, the minimum size of a connected graph G with given vertex number p and cut-width C.

Design for Two-degree-of-freedom PID Regulator Based on Improved Generalized Extremal Optimization Algorithm

A kind of new design method for two-degree-of-freedom(2DOF)PID regulator was presented,in which,a new global search heuristic--improved generalized extremal optimization(GEO)algorithm is applied to the parameter optimization design of 2DOF PID regulator.The simulated results show that very good dynamic response performance of both command tracking and disturbance rejection characteristics can be achieved simultaneously.At the same time,the comparisons of simulation results with the improved GA,the basic GEO and the improved GEO were given.From the comparisons,it is shown that the improved GEO algorithm is competitive in performance with the GA and basic GEO and is an attractive tool to be used in the design of two-degree-of-freedom PID regulator.

List Extremal Number of Union of Short Cycles

The list extremal number f（G） is defined for a graph G as the smallest integer k such that the join of G with a stable set of size k is not ｜V（G）｜-choosable. In this paper, we find the exact value of f（G）, where G is the union of edge-disjoint cycles of length three, four, five and six. Our results confirm two conjectures posed by S. Gravier, F. Maffray and B. Mohar.

PERFECT SPLINES WITH BOUNDARY CONDITIONS AND THEIR APPLICATION TO CERTAIN EXTREMAL PROBLEMS

In this paper we consider two problems. The first is connected with the optimal recovery of functions satisfyiog boundary conditions. The second is the characterization of the unique func- tion whose r-th derivative has minimum L_∞-norm, taking given values of alternating signs and satis fying boundary conditions.