相关论文: A proof of Shelah's recent partition theorem
We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…
Let $G$ be a connected, complex reductive Lie group and $G/H$ a spherical homogenous space. Let $(X,L)$ be a polarized $G$-variety which is a spherical embedding of $G/H$. In this paper we classify $G$-equivariant normal $\mathbb R$-test…
Shelah considered a certain version of Strong Chang's Conjecture, which we denote $\text{SCC}^{\text{cof}}$, and proved that it is equivalent to several statements, including the assertion that Namba forcing is semiproper. We introduce an…
In this paper we go on to discuss about Stanley's theorem in Integer partitions. We give two different versions for the proof of the generalization of Stanley's theorem illustrating different techniques that may be applied to profitably…
In this paper, we investigate a novel family of polar codes based on multi-kernel constructions, proving that this construction actually polarizes. To this end, we derive a new and more general proof of polarization, which gives sufficient…
Geurdes (2014, Results in Physics) outlines a probabilistic construction of a counterexample to Bell's theorem. He gives a procedure to repeatedly sample from a specially constructed "pool" of local hidden variable models (depending on a…
We argue that we solved Hilbert's first problem positively (after reformulating it just to avoid the known consistency results) and give some applications. Let lambda to the revised power of kappa, denoted lambda^{[kappa]}, be the minimal…
The aim of this paper is to prove all well-known metrization theorems using partitions of unity. To accomplish this, we first discuss sufficient and necessary conditions for existence of $\mathcal{U}$-small partitions of unity (partitions…
This paper gives a new and short proof of existence and uniqueness of the Polubarinova-Galin equation. The existence proof is an application of the main theorem in Lin's paper. Furthermore, we can conclude that every strong solution can be…
In this paper we give an asymptotically tight bound for the tolerated Tverberg Theorem when the dimension and the size of the partition are fixed. To achieve this we study certain partitions of order-type homogeneous sets and use a…
A long-standing problem in the foundations of quantum mechanics is to identify a physical principle that explains why algebraically maximal violations of Bell inequalities can generally not be achieved in Nature. One recently proposed…
Let $K$ be a number field. We present several new finiteness results for isomorphism classes of abelian varieties over $K$ whose $\ell$-power torsion fields are arithmetically constrained for some rational prime $\ell$. Such arithmetic…
This article continues Ros{\l}anowski and Shelah math.LO/9906024, math.LO/0508272, math.LO/0210205, math.LO/0611131 and math.LO/0605067. We introduce here a new property of <lambda-strategically complete forcing notions which implies that…
For ample vector bundles $E$ over compact complex varieties $X$ and a Schur functor $S_I$ corresponding to an arbitrary partition $I$ of the integer $|I|$, one would like to know the optimal vanishing theorem for the cohomology groups…
In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…
The language of finite games is used to rephrase Pelant's proof of his result: The separable modification of the complete metric space $C([0,\omega_1])$ is not complete.
We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These logics are obtained from the restriction of set…
Violation of the Clauser-Horne-Shimony-Holt (CHSH) inequality certifies genuine quantum correlations. In this work, we formalize in Lean 4 the rigidity theorem -- any strategy achieving near-optimal CHSH value must be locally isometric to…
Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…
We prove that any countable support iteration formed with posets with $\omega_2$-p.i.c.\ has $\omega_2$-c.c., assuming CH in the ground model and assuming also that $\omega_1$ is not collapsed. This improves earlier results of Shelah by…