Related papers: The strong Prikry property
We introduce the property ``$F$-linked'' of subsets of posets for a given free filter $F$ on the natural numbers, and define the properties ``$\mu$-$F$-linked'' and ``$\theta$-$F$-Knaster'' for posets in a natural way. We show that…
We prove a Theorem about the relationship between the Depth of the ultraproduct of Boolean algebras, divided by an ultrafilter, and the products of the depths of each component. This answers (partly) an open problem of Monk.
Henle, Mathias, and Woodin proved that, provided that $\omega\rightarrow(\omega)^{\omega}$ holds in a model $M$ of ZF, then forcing with $([\omega]^{\omega},\subseteq^*)$ over $M$ adds no new sets of ordinals, thus earning the name a…
We show that it is possible to add $\kappa^+-$Cohen subsets to $\kappa$ with a Prikry forcing over $\kappa$. This answers a question from \cite{HayutBenhanouGitik}. A strengthening of non-Galvin property is introduced. It is shown to be…
We study ultrafilters on $\omega^2$ produced by forcing with the quotient of $\scr P(\omega^2)$ by the Fubini square of the Fr\'echet filter on $\omega$. We show that such an ultrafilter is a weak P-point but not a P-point and that the only…
We study two generalizations of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras. To highlight the difference between them, we develop new techniques to construct incomparable ultrafilters in this setting.…
For posets $P$ and $Q$, extremal and saturation problems about weak and strong $P$-free subposets of $Q$ have been studied mostly in the case $Q$ is the Boolean poset $Q_n$, the poset of all subsets of an $n$-element set ordered by…
We build a supercompact version of the forcing defined in \cite{gitik2019}. For each singular cardinal in the ground model with any fixed cofinality, which is a limit of supercompact cardinals, it is possible to force so that the size of…
Razborov and Rudich have shown that so-called "natural proofs" are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is widely regarded as a serious barrier to proving strong…
We prove that the noncrossing partition lattices associated with the complex reflection groups $G(d,d,n)$ for $d,n\geq 2$ admit symmetric decompositions into Boolean subposets. As a result, these lattices have the strong Sperner property…
We isolate two combinatorial properties, each expressible by a $\Pi_2$-sentence over the structure $(H(\omega_3),\in,\omega_1,\omega_2,\text{NS}_{\omega_2})$, such that each property is consistent with CH, and their conjunction together…
We introduce the forcing property "almost strong properness" which sits between properness and strong properness. As an application, we introduce a simple forcing with finite conditions to force $\rm MRP$.
We characterize the Tukey order, the Galvin property/ Cohesive ultrafilters from \cite{Kanamori1978} in terms of ultrapowers. We use this characterization to measure the distance between the Tukey order and other well-known orders of…
The bipolaron are two electrons coupled to the elastic deformations of an ionic crystal. We study this system in the Fr\"{o}hlich approximation. If the Coulomb repulsion dominates, the lowest energy states are two well separated polarons.…
In this paper, we explore combinatorial properties of the posets associated with Kohnert polynomials. In particular, we determine a sufficient condition guaranteeing when such ``Kohnert posets'' are bounded and two necessary conditions for…
This paper establishes a number of constraints on the structure of large cardinals under strong compactness assumptions. These constraints coincide with those imposed by the Ultrapower Axiom, a principle that is expected to hold in Woodin's…
We investigate the combinatorial structure of the set of maximal antichains in a Boolean algebra ordered by almost refinement. We also consider the reaping relation and its associated cardinal invariants, focusing in particular on reduced…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…
Every absolutely summing linear operator is weakly compact. However, for strongly summing multilinear operators and polynomials - one of the most natural extensions of the linear case to the non linear framework - weak compactness does not…
Notions of rank abound in the literature on tensor decomposition. We prove that strength, recently introduced for homogeneous polynomials by Ananyan-Hochster in their proof of Stillman's conjecture and generalised here to other tensors, is…