نتایج جستجو برای: forcing number
تعداد نتایج: 1188999 فیلتر نتایج به سال:
An edge geodetic set of a connected graph G of order p ≥ 2 is a set S ⊆ V (G) such that every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g1(G) of G is the minimum cardinality of its edge geodetic sets and any edge geodetic set of cardinality g1(G) is a minimum edge geodetic set of G or an edge geodetic basis of G. An edge geodetic set S in ...
An Open Coloring Axiom type principle is formulated for uncountable cardinals and is shown to be a consequence of the Proper Forcing Axiom. Several applications are found. We also study dense C∗-embedded subspaces of ω∗, showing that there can be such sets of cardinality c and that it is consistent that ω∗ \ {p} is C∗-embedded for some but not all p ∈ ω∗.
By the technique of forcing, some new independence results are proved for the alternative set theory (AST) and similar weak theories: The scheme of choice is independent both of AST and of second order arithmetic, axiom of constructibility is independent of AST plus schemes of choice.
Linear forcing has been proposed as a useful method for forced isotropic turbulence simulations because it is a physically realistic forcing method with a straightforward implementation in physical-space numerical codes T. S. Lundgren, “Linearly forced isotropic turbulence,” Annual Research Briefs Center for Turbulence Research, Stanford, CA, 2003 , p. 461; C. Rosales and C. Meneveau, “Linear f...
A large number of processes are involved in the chain from emissions of aerosol precursor gases and primary particles to impacts on cloud radiative forcing. Those processes are manifest in a number of relationships that can be expressed as factors dlnX/dlnY driving aerosol effects on cloud radiative forcing. These factors include the relationships between cloud condensation nuclei (CCN) concent...
The metric dimension dim(G) of a graph G is the minimum number of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices. The zero forcing number Z(G) of a graph G is the minimum cardinality of a set S of black vertices (whereas vertices in V (G)\S are colored white) such that V (G) is converted entirely to black after finitely many applica...
The probability density function (PDF) of the gas density in turbulent supersonic flows is investigated with high-resolution numerical simulations. In a systematic study, we compare the density statistics of compressible turbulence driven by the usually adopted solenoidal forcing (divergence-free) and by compressive forcing (curl-free). Our results are in agreement with studies using solenoidal...
in this paper, we investigate a damped korteweg-de vries equation with forcing on a periodic domain $mathbb{t}=mathbb{r}/(2pimathbb{z})$. we can obtain that if the forcing is periodic with small amplitude, then the solution becomes eventually time-periodic.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید