English
Related papers

Related papers: Uncountably many homogeneous real trees with the s…

200 papers

Given any $\lambda\leq\kappa$, we construct a symmetric extension in which there is a set $X$ such that $\aleph(X)=\lambda$ and $\aleph^*(X)=\kappa$. Consequently, we show that $\mathsf{ZF}+$"For all pairs of infinite cardinals…

Logic · Mathematics 2024-08-16 Asaf Karagila , Calliope Ryan-Smith

We prove that every connected graph with $s$ vertices of degree~1 and 3 and $t$ vertices of degree at least~4 has a spanning tree with at least ${1\over 3}t +{1\over 4}s+{3\over 2}$ leaves. We present infinite series of graphs showing that…

Combinatorics · Mathematics 2014-05-29 Dmitri Karpov

We develop a version of Cichon's diagram for cardinal invariants on the generalized Cantor space 2^kappa or the generalized Baire space kappa^kappa where kappa is an uncountable regular cardinal. For strongly inaccessible kappa, many of the…

Logic · Mathematics 2016-11-28 Joerg Brendle , Andrew Brooke-Taylor , Sy-David Friedman , Diana Montoya

We study $\Sigma_1(\omega_1)$-definable sets (i.e. sets that are equal to the collection of all sets satisfying a certain $\Sigma_1$-formula with parameter $\omega_1$) in the presence of large cardinals. Our results show that the existence…

Logic · Mathematics 2017-10-27 Philipp Lücke , Ralf Schindler , Philipp Schlicht

A theory $T$ is said to have exact saturation at a singular cardinal $\kappa$ if it has a $\kappa$-saturated model which is not $\kappa^{+}$-saturated. We show, under some set-theoretic assumptions, that any simple theory has exact…

Logic · Mathematics 2015-10-12 Itay Kaplan , Saharon Shelah , Pierre Simon

We prove that every connected graph with $s$ vertices of degree not 2 has a spanning tree with at least ${1\over 4}(s-2)+2$ leaves. Let $G$ be a be a connected graph of girth $g$ with $v>1$ vertices. Let maximal chain of successively…

Combinatorics · Mathematics 2014-05-29 Anton Bankevich , Dmitri Karpov

We prove that for every uncountable cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$, the quasi-order of embeddability on the $\kappa$-space of $\kappa$-sized graphs Borel reduces to the embeddability on the $\kappa$-space of…

Logic · Mathematics 2019-01-03 Filippo Calderoni

For certain uncountable cardinals $\kappa$ we produce a group of cardinality $\kappa$ which is freely indecomposable, strongly $\kappa$-free, and whose abelianization is free abelian of rank $\kappa$. The construction takes place in…

Group Theory · Mathematics 2020-10-07 Samuel M. Corson

It is well-known that the consistency strength of the GCH failing at a measurable cardinal is the existence of a cardinal $\kappa$ with $o(\kappa)=\kappa^{++}$. As the literature does not contain more than a proof sketch of the lower bound…

Logic · Mathematics 2025-01-03 Connor Watson

A usual dichotomy is that in many cases, reasonably definable sets, satisfy the CH, i.e. if they are uncountable they have cardinality continuum. A strong dichotomy is when: if the cardinality is infinite it is continuum as in [Sh:273]. We…

Logic · Mathematics 2016-09-07 Saharon Shelah

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Andre Arnold , Patrick Cegielski , Serge Grigorieff , Irene Guessarian

We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…

Combinatorics · Mathematics 2012-05-03 B. S. Kochkarev

Generalizing some earlier techniques due to the second author, we show that Menas' theorem which states that the least cardinal kappa which is a measurable limit of supercompact or strongly compact cardinals is strongly compact but not…

Logic · Mathematics 2016-09-06 Arthur Apter , Saharon Shelah

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

Starting from a stationary set of supercompact cardinals we find a generic extension in which the tree property holds at every regular cardinal between $\aleph_2$ and $\aleph_{\omega^2}$.

Logic · Mathematics 2020-02-06 Yair Hayut

We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…

Logic · Mathematics 2024-03-15 Andreas Lietz

Let $\kappa$,$\lambda$ be regular uncountable cardinals such that $\lambda > \kappa^+$ is not a successor of a singular cardinal of low cofinality. We construct a generic extension with $s(\kappa) = \lambda$ starting from a ground model in…

Logic · Mathematics 2015-08-18 Omer Ben-Neria , Moti Gitik

For a regular uncountable cardinal kappa, we discuss the order relationship between the unbounding and dominating numbers on kappa and cardinal invariants of the higher meager ideal M_kappa. In particular, we obtain a complete…

Logic · Mathematics 2022-02-03 Joerg Brendle

It is proved that the consistency strength of having definable tree property for successors of all regular cardinals is the consistency strength of having proper class many small large cardinals which are defined very similar to…

Logic · Mathematics 2015-11-24 Ali Sadegh Daghighi , Massoud Pourmahdian

Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…

Logic · Mathematics 2016-09-07 Bradd Hart , Ehud Hrushovski , Michael C. Laskowski
‹ Prev 1 8 9 10 Next ›