Related papers: Namba forcing, weak approximation, and guessing

We investigate the power of weak measurements in the framework of quantum state discrimination. First, we define and analyze the notion of weak consecutive measurements. Our main result is a convergence theorem whereby we demonstrate when…

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

In this note, we are interested in local-global principles for multinorm equations of the form $\prod_{i=1}^n N_{L_i /k}(z_i) = a$ where $k$ is a global field, $L_i/k$ are finite separable field extensions and $a \in k^*$. In particular, we…

We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.

Nagata conjectured that every $M$-space is homeomorphic to a closed subspace of the product of a countably compact space and a metric space. This conjecture was refuted by Burke and van Douwen, and A. Kato, independently. However, we can…

In this paper, we give precise rates of convergence in the strong invariance principle for stationary sequences of bounded real-valued random variables satisfying weak dependence conditions. One of the main ingredients is a new Fuk-Nagaev…

We show that compact cardinals and {\rm MM} are sensitive to $\lambda$-closed forcings for arbitrarily large $\lambda$. This is done by adding 'regressive' $\lambda$-Kurepa-trees in either case. We argue that the destruction of regressive…

Posner and Robinson (1981) proved that if $S \subseteq \omega$ is non-computable, then there exists a $G \subseteq \omega$ such that $S \oplus G \geq_T G'$. Shore and Slaman (1999) extended this result to all $n \in \omega$, by showing that…

The aim of this work is to prove the weak-strong uniqueness principle for the compressible Navier-Stokes-Poisson system on an exterior domain, with an isentropic pressure of the type $p(\varrho)=a\varrho^{\gamma}$ and allowing the density…

Iverson (2006) proposed the law of similarity \[ \xi_{s}(\lambda x)= \gamma(\lambda, s)\xi_{\eta(\lambda, s)}(x) \] for the sensitivity functions $\xi_{s}\, (s\in S)$. Compared to the former models, the generality of this one lies in that…

We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…

We show that the weakest versions of Foreman's minimal generic hugeness axioms cannot hold simultaneously on adjacent cardinals. Moreover, conventional forcing techniques cannot produce a model of one of these axioms.

Answering a question of Harrington, we show that there exists a proper forcing notion, which adds a minimal real $\eta \in \prod_{i<\omega} n^*_i$, which is eventually different from any old real in $\prod_{i<\omega} n^*_i$, where the…

The Gap Forcing Theorem, a key contribution of this paper, implies essentially that after any reverse Easton iteration of closed forcing, such as the Laver preparation, every supercompactness measure on a supercompact cardinal extends a…

We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…

Let $0 < \theta \leqslant 1$. A sequence of positive integers $(b_n)_{n=1}^\infty$ is called a weak greedy approximation of $\theta$ if $\sum_{n=1}^{\infty}1/b_n = \theta$. We introduce the weak greedy approximation algorithm (WGAA), which,…

For a relational structure ${\mathbb X}$ we investigate the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X}):=\{ f[X]: f\in \mathop{\rm Emb}\nolimits ({\mathbb X})\}$. Here we consider…

We introduce the forcing property of descending distributivity. A forcing $\mathbb{P}$ is $\kappa$-descending distributive if for all decreasing sequences $(D_\alpha)_{\alpha<\kappa}$ of open dense sets, $\bigcap_\alpha D_\alpha$ is open…

Many of the most common reverse Easton iterations found in the large cardinal context, such as the Laver preparation, admit a gap at some small delta in the sense that they factor as P*Q, where P has size less than delta and Q is forced to…

We propose a study of the Adaptive Biasing Force method's robustness under generic (possibly non-conservative) forces. We first ensure the flat histogram property is satisfied in all cases. We then introduce a fixed point problem yielding…