English
Related papers

Related papers: Weak prediction principles

200 papers

In this paper we investigate more characterizations and applications of $\delta$-strongly compact cardinals. We show that, for a cardinal $\kappa$ the following are equivalent: (1) $\kappa$ is $\delta$-strongly compact, (2) For every…

Logic · Mathematics 2020-09-25 Toshimichi Usuba

Recent results established exponential lower bounds for the length of any Resolution proof for the weak pigeonhole principle. More formally, it was proved that any Resolution proof for the weak pigeonhole principle, with $n$ holes and any…

Computational Complexity · Computer Science 2008-12-15 Ran Raz

We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a criterion which is a priori weaker. The argument is quite general; as well as the classical Euclidean case, it…

Computational Geometry · Computer Science 2007-05-23 Vin de Silva

We investigate a combinatorial game on $\omega_1$ and show that mild large cardinal assumptions imply that every normal ideal on $\omega_1$ satisfies a weak version of precipitousness. As an application, we show that that the…

Logic · Mathematics 2025-03-04 Todd Eisworth

Looking at bivariate copulas from the perspective of conditional distributions and considering weak convergence of almost all conditional distributions yields the notion of weak conditional convergence. At first glance, this notion of…

Statistics Theory · Mathematics 2020-10-12 Thimo M. Kasper , Sebastian Fuchs , Wolfgang Trutschnig

We show that the abc Conjecture implies the Weak Diversity Conjecture of Bilu and Luca.

Algebraic Geometry · Mathematics 2019-09-12 Hilaf Hasson , Andrew Obus

We investigate the consistency strength of the statement: $\kappa$ is weakly compact and there is no tree on $\kappa$ with exactly $\kappa^{+}$ many branches. We show that this statement fails strongly (in the sense that there is a sealed…

Logic · Mathematics 2021-09-22 Yair Hayut , Sandra Müller

We provide a model theoretical and tree property like characterization of $\lambda$-$\Pi^1_1$-subcompactness and supercompactness. We explore the behaviour of those combinatorial principles at accessible cardinals.

Logic · Mathematics 2022-02-03 Yair Hayut , Menachem Magidor

We prove the consistency of $\mathfrak{r}_\lambda<\mathfrak{d}_\lambda$ and even $\mathfrak{u}_\lambda<\mathfrak{d}_\lambda$ for a singular cardinal $\lambda$.

Logic · Mathematics 2020-06-09 Shimon Garti , Saharon Shelah

We prove that for any $C^1$-stably weakly shadowing transitive set $\Lambda$, either $\Lambda$ is a sink or a source, or $\Lambda$ admits a dominated splitting.

Dynamical Systems · Mathematics 2010-03-11 Dawei Yang

We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from…

Logic · Mathematics 2011-10-11 Matteo Viale

The problem of weak radiative hyperon decays (WRHD) is reviewed. With the recent measurement of the $\Xi ^0 \to \Lambda \gamma$ asymmetry confirming Hara's theorem, implications from its violation in low-energy theoretical approaches are…

High Energy Physics - Phenomenology · Physics 2009-11-07 P. Zenczykowski

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.

Logic · Mathematics 2007-05-23 Moti Gitik , Saharon Shelah

The notion of stationary reflection is one of the most important notions of combinatorial set theory. We investigate weak reflection, which is, as the name suggests, a weak version of stationary reflection. This sort of reflection was…

Logic · Mathematics 2007-05-23 Mirna Džamonja , Saharon Shelah

It is well known that S^1_2 cannot prove the injective weak pigeonhole principle for polynomial time functions unless RSA is insecure. In this note we investigate the provability of the surjective (dual) weak pigeonhole principle in S^1_2…

Logic in Computer Science · Computer Science 2007-05-23 Norman Danner , Chris Pollett

An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC…

Logic · Mathematics 2012-05-21 Laura Fontanella

We prove a revised version of Laver's indestructibility theorem which slightly improves over the classical result. An application yields the consistency of $(\kappa^+,\kappa)\notcc(\aleph\_1,\aleph\_0)$ when $\kappa$ is supercompact. The…

Logic · Mathematics 2007-05-23 Bernhard Koenig

If $\kappa$ is regular and $2^{<\kappa}\leq\kappa^+$, then the existence of a weakly presaturated ideal on $\kappa^+$ implies $\square^*_\kappa$. This partially answers a question of Foreman and Magidor about the approachability ideal on…

Logic · Mathematics 2020-10-01 Sean Cox , Monroe Eskew

It is shown that the weak multidimensional Suita conjecture fails for any bounded non-pseudoconvex domain with $C^{1+\varepsilon_-}$-smooth boundary. On the other hand, it is proved that the weak converse to the Suita conjecture holds for…

Complex Variables · Mathematics 2018-08-14 Nikolai Nikolov

We introduce a new compactness principle which we call the gluing property. For a measurable cardinal $\kappa$ and a cardinal $\lambda$, we say that $\kappa$ has the $\lambda$-gluing property if every sequence of $\lambda$-many…

Logic · Mathematics 2026-03-27 Yair Hayut , Alejandro Poveda
‹ Prev 1 4 5 6 7 8 10 Next ›