中文
相关论文

相关论文: Full Souslin trees at small cardinals

200 篇论文

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

逻辑 · 数学 2021-02-18 Filippo Calderoni , Heike Mildenberger , Luca Motto Ros

We determine upper and lower bounds for the number of maximum matchings (i.e., matchings of maximum cardinality) $m(T)$ of a tree $T$ of given order. While the trees that attain the lower bound are easily characterised, the trees with…

组合数学 · 数学 2013-04-09 Clemens Heuberger , Stephan Wagner

An $\mathbb R$-tree is a certain kind of metric space tree in which every point can be branching. Favre and Jonsson posed the following problem in 2004: can the class of orders underlying $\mathbb R$-trees be characterised by the fact that…

逻辑 · 数学 2022-06-22 Sam Adam-Day

The following pcf results are proved: 1. Assume that kappa > aleph_0 is a weakly compact cardinal. Let mu > 2^kappa be a singular cardinal of cofinality kappa. Then for every regular lambda < pp^+_{Gamma(kappa)} (mu) there is an increasing…

逻辑 · 数学 2013-07-24 Moti Gitik , Saharon Shelah

We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…

逻辑 · 数学 2013-09-03 Heike Mildenberger , Saharon Shelah

A proper elementary extension of a model is called small if it realizes no new types over any finite set in the base model. We answer a question of Marker, and show that it is possible to have an o-minimal structure with a maximal small…

逻辑 · 数学 2011-04-22 Janak Ramakrishnan

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…

逻辑 · 数学 2007-05-23 Bernhard Koenig

In this paper, we investigate a problem concerning quartets, which are a particular type of tree on four leaves. Loosely speaking, a set of quartets is said to be `definitive' if it completely encapsulates the structure of some larger tree,…

组合数学 · 数学 2011-01-28 Chris Dowden

A space $X$ is said to be $\kappa$-resolvable (resp. almost $\kappa$-resolvable) if it contains $\kappa$ dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets). $X$ is maximally resolvable iff…

一般拓扑 · 数学 2007-05-23 Istvan Juhasz , Lajos Soukup , Zoltan Szentmiklossy

The paper settles the problem of the consistency of the existence of a single universal graph between a strong limit singular and its power. Assuming that in a model of $\mathbf{GCH}$ $\kappa$ is supercompact and the cardinals $\theta <…

逻辑 · 数学 2022-01-04 Márk Poór , Saharon Shelah

For a cardinal of the form $\kappa=\beth_\kappa$, Shelah's logic $L^1_\kappa$ has a characterisation as the maximal logic above $\bigcup_{\lambda<\kappa} L_{\lambda, \omega}$ satisfying Strong Undefinability of Well Order (SUDWO). SUDWO is…

逻辑 · 数学 2021-07-22 Mirna Džamonja , Jouko Väänänen

The repetition threshold is the smallest real number $\alpha$ such that there exists an infinite word over a $k$-letter alphabet that avoids repetition of exponent strictly greater than $\alpha$. This notion can be generalized to graph…

离散数学 · 计算机科学 2018-06-29 Borut Lužar , Pascal Ochem , Alexandre Pinlou

We characterize the extremal trees that maximize the number of almost-perfect matchings, which are matchings covering all but one or two vertices, and those that maximize the number of strong almost-perfect matchings, which are matchings…

组合数学 · 数学 2025-02-24 Stijn Cambie , Bradley McCoy , Gunjan Sharma , Stephan Wagner , Corrine Yap

We prove that mu = mu^{< mu}, 2^mu = mu^+ and ``there is a non reflecting stationary subset of mu^+ composed of ordinals of cofinality < mu'' imply that there is a mu-complete Souslin tree on mu^+ .

逻辑 · 数学 2008-02-03 Menachem Kojman , Saharon Shelah

In this paper, we prove that: if $\kappa$ is supercompact and the $\mathsf{HOD}$ Hypothesis holds, then there is a proper class of regular cardinals in $V_{\kappa}$ which are measurable in $\mathsf{HOD}$. Woodin also proved this result. As…

逻辑 · 数学 2025-10-02 Yong Cheng

In the first part of this paper, we explore the possibility for a very large cardinal $\kappa$ to carry a $\kappa$-complete ultrafilter without Galvin's property. In this context, we prove the consistency of every ground model…

逻辑 · 数学 2025-11-07 Tom Benhamou , Shimon Garti , Alejandro Poveda

A forest is a generalization of a tree, and here we consider the Aronszajn and Suslin properties for forests. We focus on those forests satisfying coherence, a local smallness property. We show that coherent Aronszajn forests can be…

逻辑 · 数学 2019-01-07 Monroe Eskew

We show that the existence of a Suslin tree does not necessarily imply that there are uncountable minimal linear orders other than $\omega_1$ and $-\omega_1$, answering a question of J. Baumgartner. This is done by a Jensen-type iteration,…

逻辑 · 数学 2018-03-13 Dániel T. Soukup

A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of…

计算几何 · 计算机科学 2015-11-17 Ferran Hurtado , Giuseppe Liotta , David R. Wood

A 27 years old and still open problem of Juhasz and van Mill asks whether there exists a cardinal kappa such that every regular dense in itself countably compact space has a dense in itself subset of cardinality at most kappa. We give a…

一般拓扑 · 数学 2010-11-05 Saharon Shelah , Boaz Tsaban