The controllability for complex network system is to find the minimum number of leaders achieve effective control global networks. In this paper, problem directed a family matrices carrying structure under hypercube considered. relationship between and signed zero forcing set established. networks obtained by computing graph.

We study how the number of numerically determining modes in the Navier–Stokes equations depends on the Grashof number. Consider the two-dimensional incompressible Navier–Stokes equations in a periodic domain with a fixed time-independent forcing function. We increase the Grashof number by rescaling the forcing and observe through numerical computation that the number of numerically determining ...

Zero forcing is a combinatorial game played on a graph with a goal of changing the color of every vertex at minimal cost. This leads to a parameter known as the zero forcing number that can be used to give an upper bound for the maximum nullity of a matrix associated with the graph. A variation on the zero forcing game is introduced that can be used to give an upper bound for the maximum nullit...

In a systematic study, we compare the density statistics in high-resolution numerical experiments of supersonic isothermal turbulence, driven by the usually adopted solenoidal (divergence-free) forcing and by compressive (curl-free) forcing. We find that for the same rms Mach number, compressive forcing produces much stronger density enhancements and larger voids compared to solenoidal forcing....

This work defines a variant of Prikry forcing and applies it to increase the number of normal measures on a single cardinal, relying on a large cardinal property of consistency strength between measurable and Mitchell order two. In particular, from an assumption weaker than o(κ) = 2, there is a forcing extension in which the first measurable cardinal κ has any number λ ≤ κ of normal measures.

This study proposes a new forcing scheme suitable for massively-parallel finite-difference simulations of stationary isotropic turbulence. The proposed forcing scheme, named reduced-communication forcing (RCF), is based on the same idea as the conventional large-scale forcing scheme, but requires much less data communication, leading to a high parallel efficiency. It has been confirmed that the...

An important problem in the dynamics of surface homeomorphisms is determining the forcing relation between orbits. The forcing relation between periodic orbits can be computed using existing algorithms. Here we consider forcing relations between homoclinic orbits. We outline a general procedure for computing the forcing relation, and apply this to compute the equivalence and forcing relations f...

With every σ-ideal I on a Polish space we associate the σ-ideal generated by closed sets in I. We study the forcing notions of Borel sets modulo the respective σ-ideals and find connections between their forcing properties. To this end, we associate to a σ-ideal on a Polish space an ideal on a countable set and show how forcing properties of the forcing depend on combinatorial properties of the...

ABSRACT In his book Proper Forcing (1982) Shelah introduced three classes of forcings (complete, proper, and semi-proper) and proved a strong iteration theorem for each of them: The first two are closed under countable support iterations. The latter is closed under revised countable support iterations subject to certain standard restraints. These theorems have been heavily used in modern set th...

We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topologically sweet forcing notions over Cohen reals are topologically sweet while the quotients over random reals do not have to be such. One of the main ingredients of the construction of the model for all projective sets of reals h...