English
Related papers

Related papers: Full Souslin trees at small cardinals

200 papers

In all $\kappa$-accessible additive categories, $\kappa$-pure monomorphisms and $\kappa$-pure epimorphisms are well-behaved, as shown in our previous paper arXiv:2311.02418. This is known to be not always true in $\kappa$-accessible…

Category Theory · Mathematics 2026-02-04 Leonid Positselski

Let $\kappa$ be a regular cardinal. Consider the Baire numbers of the spaces $(2^{\theta})_\kappa$ (functions from $\theta$ to 2 and the less than $\kappa$ topology) for various $\theta \geq \kappa$. Let l be the number of such different…

Logic · Mathematics 2008-02-03 Avner Landver

This dissertation includes many theorems which show how to change large cardinal properties with forcing. I consider in detail the degrees of inaccessible cardinals (an analogue of the classical degrees of Mahlo cardinals) and provide new…

Logic · Mathematics 2015-06-15 Erin Carmody

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$, we study a class of toposes with enough points, the $\kappa$-separable toposes. These are equivalent to sheaf toposes over a site with $\kappa$-small limits that has at…

Logic · Mathematics 2017-09-08 Christian Espíndola

We investigate whether the ultrafilter number function $\kappa \mapsto \mathfrak{u}(\kappa)$ on the cardinals is monotone, that is, whether $\mathfrak{u}(\lambda) \le \mathfrak{u}(\kappa)$ holds for all cardinals $\lambda < \kappa$ or not.…

Logic · Mathematics 2025-11-24 Toshimichi Usuba

In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in…

Combinatorics · Mathematics 2012-09-04 Xiu-Mei Zhang , Xiao-Dong Zhang

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

Combinatorics · Mathematics 2022-12-01 K. V. Chelpanov

We say that a topological group $G$ is partially box $\kappa$-resolvable if there exist a dense subset $B$ of $G$ and a subset $A $ of $G$, $|A|=\kappa$ such that the subsets $\{ aB: a\in A\}$ are pairwise disjoint. If $G=AB$ then $G$ is…

General Topology · Mathematics 2015-11-04 Igor Protasov

Sparse trees are trees with sparse branchings. The Laplacian on some of these trees can be shown to have singular spectral measures. We focus on a simple family of sparse trees for which the dimensions can be naturally defined and shown to…

Spectral Theory · Mathematics 2007-05-23 Jonathan Breuer

Trees without vertices of degree $2$ are sometimes named topological trees. In this work, we bring forward the study of the inducibility of (rooted) topological trees with a given number of leaves. The inducibility of a topological tree $S$…

Combinatorics · Mathematics 2018-02-20 Audace Amen Vioutou Dossou-Olory , Stephan Wagner

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

A classical problem in phylogenetic tree analysis is to decide whether there is a phylogenetic tree $T$ that contains all information of a given collection $\cP$ of phylogenetic trees. If the answer is "yes" we say that $\cP$ is compatible…

Combinatorics · Mathematics 2010-06-29 Stefan Grünewald

We consider finite trees with edges labeled by letters on a finite alphabet $\varSigma$. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid $\varSigma^*$. The set of all such words defines the language…

Combinatorics · Mathematics 2015-05-12 Srečko Brlek , Nadia Lafrenière , Xavier Provençal

A spectral faux tree with respect to a given matrix is a graph which is not a tree but is cospectral with a tree for the given matrix. We consider the existence of spectral faux trees for several matrices, with emphasis on constructions.…

Combinatorics · Mathematics 2024-10-09 Steve Butler , Elena D'Avanzo , Rachel Heikkinen , Joel Jeffries , Alyssa Kruczek , Harper Niergarth

We show that it is consistent relative to a huge cardinal that for all infinite cardinals $\kappa$, $\square_\kappa$ holds and there is a stationary $S \subseteq \kappa^+$ such that $\mathrm{NS}_{\kappa^+} \restriction S$ is…

Logic · Mathematics 2020-04-27 Monroe Eskew

Let k be a definable L-cardinal. Then there is a set of reals X, class-generic over L, such that L(X) and L have the same cardinals, X has size k in L(X) and some pi-1-2 formula defines X in all set-generic extensions of L(X). Two…

Logic · Mathematics 2009-09-25 Sy D. Friedman

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

Computational Complexity · Computer Science 2026-01-01 Alice Moayyedi

We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…

Logic · Mathematics 2022-10-18 Saharon Shelah

We prove, that every connected graph with $s$ vertices of degree 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${2\over 5}t +{1\over 5}s+\alpha$ leaves, where $\alpha \ge {8\over 5}$. Moreover, $\alpha \ge 2$ for…

Combinatorics · Mathematics 2014-05-29 D. V. Karpov

We consider the two-cardinal Kurepa Hypothesis $\mathsf{KH}(\kappa,\lambda)$. We observe that if $\kappa\leq\lambda<\mu$ are infinite cardinals then…

Logic · Mathematics 2025-10-17 Fanxin Wu