English
Related papers

Related papers: Kurepa-trees and Namba-forcing

200 papers

We discuss the rainbow Ramsey theorems at limit cardinals and successors of singular cardinals, addressing some questions in \cite{MR2354904} and \cite{MR2902230}. In particular, we show for inaccessible $\kappa$,…

Logic · Mathematics 2019-12-03 Jing Zhang

In this paper we consider the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods…

Statistical Mechanics · Physics 2007-05-23 Marco Pretti

The two parallel concepts of "small" sets of the real line are meagre sets and null sets. Those are equivalent to Cohen forcing and Random real forcing for $\aleph^{\aleph_0}_0$; in spite of this similarity, the Cohen forcing and Random…

Logic · Mathematics 2023-08-24 Shani Cohen , Saharon Shelah

This paper makes significant progress towards resolving a conjecture relating strong forcing axioms like $PFA$ and the derived model at a limit of Woodin cardinals $\kappa$. In particular, using a concept called Covering Matrices, we show…

Logic · Mathematics 2026-02-20 Derek Levinson , Nam Trang , Trevor Wilson

We answer Kurepa's conjecture on the left factorials in affirmative.

Number Theory · Mathematics 2022-10-04 Vyacheslav M. Abramov

We investigate the problem of when $\leq\lambda$--support iterations of $<\lambda$--complete notions of forcing preserve $\lambda^+$. We isolate a property -- {\em properness over diamonds} -- that implies $\lambda^+$ is preserved and show…

Logic · Mathematics 2007-05-23 Todd Eisworth

We provide a combinatorial approach to counting the number of spanning trees at the $n$-th layer of a branched $\mathbb{Z}_p$-cover of a finite connected graph $\mathsf{X}$. Our method achieves in explaining how the position of the ramified…

Combinatorics · Mathematics 2025-08-22 Debanjana Kundu , Katharina Mueller

The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…

Logic in Computer Science · Computer Science 2007-05-23 Thomas Colcombet

Let $M$ be a $\lambda$-indexed (that is, Jensen indexed) premouse. We prove that $M$ is iterable with respect to standard $\lambda$-iteration rules iff $M$ is iterable with respect to a natural version of Mitchell-Steel iteration rules.…

Logic · Mathematics 2021-01-12 Farmer Schlutzenberg

For $f,g\in\omega\ho$ let $\mycfa_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e. for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. $\myc_{f,g}$ is…

Logic · Mathematics 2011-01-25 Jakob Kellner , Saharon Shelah

Consider $(\kappa^{+++},\kappa^{++}) \twoheadrightarrow (\kappa^+,\kappa)$ where $\kappa$ is an uncountable regular cardinal. By a result of Shelah's we have $\operatorname{cof}(X \cap \kappa^{++}) = \kappa$ for almost all $X \subset…

Logic · Mathematics 2020-03-26 Dominik Adolf

Woodin has shown that if there is a measurable Woodin cardinal then there is, in an appropriate sense, a sharp for the Chang model. We produce, in a weaker sense, a sharp for the Chang model using only the existence of a cardinal $\kappa$…

Logic · Mathematics 2017-05-02 William Mitchell

We develop the theory of layered posets, and use the notion of layering to prove a new iteration theorem (Theorem 6): if $\kappa$ is weakly compact then any universal Kunen iteration of $\kappa$-cc posets (each possibly of size $\kappa$) is…

Logic · Mathematics 2019-09-18 Sean D. Cox

We show that the notions of "strongly unfoldable cardinals", introduced by Villaveces in his model-theoretic studies of models of set theory, and "shrewd cardinals", introduced by Rathjen in a proof-theoretic context, coincide. We then…

Logic · Mathematics 2021-12-08 Philipp Lücke

We prove the exponential growth of the cardinality of the set of numbers of spanning trees in simple (and planar) graphs on $n$ vertices, answering a question of Sedl\'a\v{c}ek from 1969. The proof uses a connection with continued…

Combinatorics · Mathematics 2025-07-02 Swee Hong Chan , Alex Kontorovich , Igor Pak

The paper gives several sufficient conditions on the paracompactness of box products with an arbitrary number of many factors and boxes of arbitrary size. The former include results on generalised metrisability and Sikorski spaces. Of…

Logic · Mathematics 2022-11-07 David Buhagiar , Mirna Džamonja

Assuming 0^sharp does not exist, kappa is an uncountable cardinal and for all cardinals lambda with kappa <= lambda < kappa^{+ omega}, 2^lambda = lambda^+, we present a ``mini-coding'' between kappa and kappa^{+ omega}. This allows us to…

Logic · Mathematics 2016-09-06 Saharon Shelah , Lee Stanley

The aim of this paper is to extend the notion of commutativity of vector fields to the category of singular foliations, using Nambu structures, i.e. integrable multi-vector fields. We will classify the relationship between singular…

Differential Geometry · Mathematics 2013-10-22 Nguyen Tien Zung , Truong Hong Minh

We introduce a natural generalization of Borel's Conjecture. For each infinite cardinal number $\kappa$, let {\sf BC}$_{\kappa}$ denote this generalization. Then ${\sf BC}_{\aleph_0}$ is equivalent to the classical Borel conjecture.…

Logic · Mathematics 2012-07-06 Fred Galvin , Marion Scheepers

We show that if $cf(2^{\aleph_0})=\aleph_1,$ then any non-trivial $\aleph_1$-closed forcing notion of size $\leq 2^{\aleph_0}$ is forcing equivalent to $Add(\aleph_1, 1),$ the Cohen forcing for adding a new Cohen subset of $\omega_1.$ We…

Logic · Mathematics 2020-03-11 Mohammad Golshani , Saharon Shelah
‹ Prev 1 8 9 10 Next ›