Related papers: A proof of Shelah's recent partition theorem
This work investigates the family of extended tilted-CHSH inequalities in the single-prover cryptographic compiled setting. In particular, we show that a quantum polynomial-time prover can violate these Bell inequalities by at most…
A property of a filter, a kind of large cardinal property, suffices for the proof in Liu Shelah [LiSh:484] and is proved consistent as required there. A natural property which looks better, not only is not obtained here, but is shown to be…
The Halpern-L\"auchli theorem, a combinatorial result about trees, admits an elegant proof due to Harrington using ideas from forcing. In an attempt to distill the combinatorial essence of this proof, we isolate various partition principles…
We use Shelah's theory of possible cofinalities in order to solve a problem about ultrafilters. THEOREM. Suppose that $ \lambda $ is a singular cardinal, $ \lambda ' < \lambda $, and the ultrafilter $D$ is $ \kappa $-decomposable for all…
Recently, George Andrews has given a Glaisher style proof of a finite version of Euler's partition identity. We generalise this result by giving a finite version of Glaisher's partition identity. Both the generating function and bijective…
We prove recent conjectures of Chern concerning nonnegativity of a certain q-series related to parity bias in integer partitions.
We give an exposition of the Abraham-Shelah's proof of the consistency of $\text{GCH}$ with existence of a $\Delta^2_2$-well-ordering of the reals.
To each partition $\lambda$ with distinct parts we assign the probability $Q_\lambda(x) P_\lambda(y)/Z$ where $Q_\lambda$ and $P_\lambda$ are the Schur $Q$-functions and $Z$ is a normalization constant. This measure, which we call the…
Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…
We develop the theory of the forcing with trees and creatures for an inaccessible lambda continuing Ros{\l}anowski and Shelah math.LO/9807172, math.LO/9909115. To make a real use of these forcing notions (that is to iterate them without…
We point out a gap in Shelah's proof of the following result: $\mathbf{Claim}$ Let $K$ be an abstract elementary class categorical in unboundedly many cardinals. Then there exists a cardinal $\lambda$ such that whenever $M, N \in K$ have…
We show that in a separable infinite dimensional Hilbert space, uniform integrability of the square of the norm of normalized partial sums of a strictly stationary sequence, together with a strong mixing condition, does not guarantee the…
In contrast to the wide-spread opinion that any separable quantum state satisfies every classical probabilistic constraint, we present a simple example where a separable quantum state does not satisfy the original Bell inequality although…
We prove a converse theorem for split even special orthogonal groups over finite fields. This is the only case left on converse theorems of split classical groups and the difficulty is the existence of the outer automorphism. In this paper,…
By a re-examination of MacMahon's original proof of his celebrated theorem on the distribution of the major indices over permutations, we give a reformulation of his argument in terms of the structure of labeled partitions. In this…
In Sh506, Shelah develops the theory of $\mathrm{pcf}_I(A)$ without the assumption that $|A|<\min (A)$, going so far as to get generators for every $\lambda\in\mathrm{pcf}_I(A)$ under some assumptions on $I$. Our main theorem is that we can…
We state a new generic absoluteness principle, and use Shelah's memory iteration technique to show that it is consistent with the large continuum.
We show that some cardinal arithmetic configurations related to the negation of the Shelah Weak Hypothesis and natural from the forcing point of view are impossible.
A new case of Shelah's eventual categoricity conjecture is established: $\mathbf{Theorem}$ Let $K$ be an AEC with amalgamation. Write $H_2 := \beth_{\left(2^{\beth_{\left(2^{\text{LS} (K)}\right)^+}}\right)^+}$. Assume that $K$ is…
Recently Alan D. Sokal gave a very short and completely elementary proof of the uniform boundedness principle. The aim of this note is to point out that by using a similiar technique one can give a considerably short and simple proof of a…