Related papers: A proof of Shelah's recent partition theorem
The Strong Exponential Time Hypothesis (SETH) asserts that for every $\varepsilon>0$ there exists $k$ such that $k$-SAT requires time $(2-\varepsilon)^n$. The field of fine-grained complexity has leveraged SETH to prove quite tight…
Question when rectangle can be tiled with similar copies of rectangles witch quetient of sides quadratic irrationalities. New proof of one part F. Sharov's theorem. Other close result.
This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A key part of this work involves representing the deletion channel using a trellis…
A. Peres constructed an example of particles entangled in the state of spin singlet. He claimed to have obtained the CHSH inequality and concluded that the violation of this inequality shows that in a measurement in which some variables are…
We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…
We give an example of iteration of length omega of (<kappa)-complete kappa^+-cc forcing notions with the limit collapsing kappa^+. The construction is decoded from the proof of Shelah [Proper and Improper Forcing, Appendix, Theorem 3.6(1)].
To date, most efforts to demonstrate quantum nonlocality have concentrated on systems of two (or very few) particles. It is however difficult in many experiments to address individual particles, making it hard to highlight the presence of…
We prove: Main Theorem: Let $\mathcal{K}$ be an abstract elementary class satisfying the joint embedding and the amalgamation properties with no maximal models of cardinality $\mu$. Let $\mu$ be a cardinal above the the L\"owenheim-Skolem…
Since the diagonal lemma plays a key role in the proof of the main limitative theorems of logic, its proof could shed light on the very essence of these fundamental theorems. Yet the lemma is often characterized as one of those important…
If \chi^\lambda is the irreducible character of the symmetric group S_n corresponding to the partition \lambda of n then we may symmetrize a tensor v_1 \otimes ... \otimes v_n by \chi^\lambda. Gamas's theorem states that the result is not…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
Recently in Reference [ quant-ph/0202121] a computational criterion of separability induced by greatest cross norm is proposed by Rudolph. There, Rudolph conjectured that the new criterion is not weaker than positive partial transpose…
A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…
We list some open problems, concerning the polarized partition relation. We solve a couple of them by showing that for every singular cardinal $\mu$ one can force the strong polarized relation with respect to the pair $\mu^+,\mu$.
We present a proof-theoretic analysis of the logic NL$\lambda$ (Barker \& Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calculus for the logic. We…
The {\em Singular Cardinal Hypothesis} (SCH) is one of the most classical combinatorial principles in set theory. It says that if $\kappa$ is singular strong limit, then $2^{\kappa}=\kappa^+$. We prove that given a singular cardinal…
This work presents a formalized proof of modal completeness for G\"odel-L\"ob provability logic (GL) in the HOL Light theorem prover. We describe the code we developed, and discuss some details of our implementation, focusing on our choices…
In this note, we give short proofs of the well-known results that the exponent of the Schur multiplier $\M$ divides the exponent of $\G$ for finite $\p$-groups of maximal class and potent $\p$-groups. Moreover, we prove the same for a…
A combinatorial principle CECA is formulated and its equivalence with GCH+ certain weakenings of Box_lambda for singular lambda is proved. CECA is used to show that certain ``almost point- < tau'' families can be refined to point- < tau…
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 null ideal of the…