The minimum forcing number of a graph G is the smallest edges simultaneously contained in unique perfect matching G. Zhang et al. (2010) claimed that any fullerene was bounded below by 3. However, we find there exists exactly one exceptional F24 with 2. In this paper, characterize all fullerenes 3 construction approach. This also solves an open problem proposed We except for F24, anti-forcing 4...

We present a notion of forcing that can be used, in conjunction with other results, to show that there is a Martin-Löf random set X such that X 6≥T ∅′ and X computes every K-trivial set.

In this paper I will communicate some new consequences of the Proper Forcing Axiom. First, the Bounded Proper Forcing Axiom implies that there is a well ordering of R which is Σ1-definable in (H(ω2),∈). Second, the Proper Forcing Axiom implies that the class of uncountable linear orders has a five element basis. The elements are X, ω1, ω∗ 1 , C, C ∗ where X is any suborder of the reals of size ...

It is well known to generalize the meagre ideal replacing ℵ 0 by a (regular) cardinal λ > ℵ 0 and requiring the ideal to be λ +-complete. But can we generalize the null ideal? In terms of forcing, this means finding a forcing notion similar to the random real forcing, replacing ℵ 0 by λ, so requiring it to be (< λ)-complete. Of course, we would welcome additional properties generalizing the one...

We show that bounded forcing axioms (for instance, the Bounded Proper Forcing Axiom and the Bounded Semiproper Forcing Axiom) are consistent with the existence of (!2; !2)-gaps and thus do not imply the Open Coloring Axiom. They are also consistent with Jensen’s combinatorial principles for L at the level !2, and therefore with the existence of an !2-Suslin tree. We also show that the axiom we ...

In this paper we consider MIMO broadcast channels with separable variance profile modelling antenna correlation at both transmit and receive sides. For large number of antennas we derive the theoretical sum-rate capacity when the transmitter performs zero-forcing or regularized zero-forcing precoding. In particular, we apply the results to volumelimited devices where the correlation originates ...

A natural question to ask is whether this result has an analogue in the context of large cardinals. The purpose of this article is to provide the strongest such analogue not ruled out by limitations imposed by the existence of Woodin cardinals. To describe the latter limitations we consider the forcing P , described as follows. Let δ be inaccessible and consider the language L(δ): (a) n ∈ R bel...