On forcing matching number of boron-nitrogen fullerene graphs

Let G be a graph that admits a perfect matching M. A forcing set S for a perfect matching M is a subset of M such that it is contained in no other perfect matchings of G. The smallest cardinality of forcing sets of M is called the forcing number of M. Computing the minimum forcing number of perfect matchings of a graph is an NP-complete problem. In this paper, we consider boron-nitrogen (BN) fullerene graphs, cubic 3-connected plane bipartite graphs with exactly six square faces and other hexagonal faces. We obtain the forcing spectrum of tubular BN-fullerene graphs with cyclic edge-connectivity 3. Then we show that all perfect matchings of any BN-fullerene graphs have the forcing number at least two. Furthermore, we mainly construct all seven BN-fullerene graphs with the minimum forcing number two.     

Forcing Linearity Numbers for Multiplication Modules

In this article, we prove that for any multiplication module M, the forcing linearity number of M, fln(M), belongs to {0,1,2}, and if M is finitely generated whose annihilator is contained in only finitely many maximal ideals, then fln(M) = 0. Also, the forcing linearity numbers of multiplication modules over some special rings are given. We also show that every multiplication module is semi-endomorphal.     

一类带强迫项的二阶脉冲时滞微分方程的振动性

给出引理解决了一类带强迫项的二阶脉冲时滞微分方程的非振动解与其导数的符号关系,得到其振动性与渐近性的判别准则,并举例说明准则的有效性。     

Computing exact solutions to a generalized Lax seventh-order forced KdV equation (KdV7)

In this paper, the Cole-Hopf transform is used to construct exact solutions to a generalization of both the seventh-order Lax KdV equation (Lax KdV7) and the seventh-order Sawada-Kotera-Ito KdV equation (Sawada-Kotera-Ito KdV7 ) with forcing term.     

Changing cofinalities and collapsing cardinals in models of set theory

If a˜cardinal κ₁, regular in the ground model M, is collapsed in the extension N to a˜cardinal κ₀ and its new cofinality, ρ, is less than κ₀, then, under some additional assumptions, each cardinal λ>κ₁ less than cc(P(κ₁)/[κ₁]^<κ₁) is collapsed to κ₀ as well. If in addition N=M[f], where f : ρ→κ₁ is an unbounded mapping, then N is a˜|λ|=κ₀-minimal extension. This and similar results are applied to generalized forcing notions of Bukovský and Namba.     

Forcing the Least Measurable to Violate GCH

Starting with a model for “GCH + k is k⁺ supercompact”, we force and construct a model for “k is the least measurable cardinal + 2^k = K⁺”. This model has the property that forcing over it with Add(k,k⁺⁺) preserves the fact k is the least measurable cardinal.