English
Related papers

Related papers: Club isomorphisms on higher Aronszajn trees

200 papers

We show that, for a sheet or a Lusztig stratum S containing spherical conjugacy classes in a connected reductive algebraic group G over an algebraically closed field in good characteristic, the orbit space S/G is isomorphic to the quotient…

Representation Theory · Mathematics 2015-01-20 Giovanna Carnovale , Francesco Esposito

We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…

Probability · Mathematics 2018-10-16 Tom Hutchcroft

Two graphs are of the same topological type if they can be mutually embedded into each other topologically. We show that there are exactly $\aleph_1$ distinct topological types of countable trees. In general, for any infinite cardinal…

Combinatorics · Mathematics 2023-05-24 Thilo Krill , Max Pitz

We generalize the diamond principle and its variants using the notion of stationarity in trees introduced by Brodsky in [Brodsky, A. M., A theory of stationary trees and the balanced Baumgartner--Hajnal--Todorcevic theorem for trees. The…

Logic · Mathematics 2026-02-17 Osvaldo Guzmán , Carlos López-Callejas

It is shown that the fundamental group of the Griffiths double cone space is isomorphic to that of the triple cone. More generally if $\kappa$ is a cardinal such that $2 \leq \kappa \leq 2^{\aleph_0}$ then the $\kappa$-fold cone has the…

Group Theory · Mathematics 2024-03-13 Samuel M. Corson

We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even when we allow $\epsilon$-contractions and add a reachability predicate (with regular constraints) for pairs of configurations, the structures…

Logic · Mathematics 2010-02-03 Alexander Kartzow

We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…

Logic · Mathematics 2020-03-30 Keegan Dasilva Barbosa

Following Laczkovich we consider the partially ordered set $\iB_1(\RR)$ of Baire class 1 functions endowed with the pointwise order, and investigate the order types of the linearly ordered subsets. Answering a question of Komj\'ath and…

Logic · Mathematics 2011-09-29 Márton Elekes , Juris Steprāns

We answer a question of Shelah by showing that it is consistent that every set of ordinals of cofinality omega_1 in I[omega_2] is nonstationary if and only if it is consistent that that there is a kappa^+ Mahlo cardinal kappa.

Logic · Mathematics 2007-05-23 William J. Mitchell

We show a number of undecidable assertions concerning countably compact spaces hold under PFA(S)[S]. We also show the consistency without large cardinals of "every locally compact, perfectly normal space is paracompact".

Logic · Mathematics 2016-07-18 Alan Dow , Franklin D. Tall

A graph is $\alpha$-excellent if every vertex of the graph is contained in some maximum independent set of the graph. In this paper, we present two characterizations of the $\alpha$-excellent $2$-trees.

Combinatorics · Mathematics 2022-10-27 Magda Dettlaff , Michael A. Henning , Jerzy Topp

The Proper Forcing Axiom implies all automorphisms of every Calkin algebra associated with an infinite-dimensional complex Hilbert space and the ideal of compact operators are inner. As a means of the proof we introduce the notion of Polish…

Logic · Mathematics 2011-03-18 Ilijas Farah

We introduce the split principles and show that they bear tight connections to large cardinal properties such as inaccessibility, weak compactness, subtlety, almost ineffability and ineffability, as well as classical combinatorial objects…

Logic · Mathematics 2024-11-26 Gunter Fuchs , Kaethe Minden

Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$.…

Combinatorics · Mathematics 2026-01-27 Daniel Neuen , Tim Seppelt

We show that the existence of an almost Souslin Kurepa tree is consistent with $ZFC$. We also prove their existence in $L$. These results answer two questions from Zakrzewski.

Logic · Mathematics 2015-10-13 Mohammad Golshani

We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even if we allow epsilon-contractions and reachability predicates (with regular constraints) for pairs of configurations, the structures remain…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kartzow

From many supercompact cardinals, we show that it is consistent for the tree property to hold at many small successors of singular cardinals, each with a different cofinality. In particular, we construct a model in which the tree property…

Logic · Mathematics 2025-02-05 William Adkisson

The monadic second-order theory of trees allows quantification over elements and over arbitrary subsets. We classify the class of trees with respect to the question: does a tree T have definable Skolem functions (by a monadic formula with…

Logic · Mathematics 2008-02-03 Shmuel Lifsches , Saharon Shelah

We show that a locally finite, connected graph $G$ is $r$-locally chordal (that is, its $r/2$-balls are chordal) if and only if the unique canonical graph-decomposition $\mathcal{H}_r(G)$ of $G$ displaying its $r$-global structure is into…

Combinatorics · Mathematics 2026-05-05 Raphael W. Jacobs , Paul Knappe

I. M. Chiswell has asked whether every group that admits a free isometric action (without inversions) on a $\Lambda$-tree is orderable. We give an example of a multiple HNN extension $\Gamma$ which acts freely on a $\mathbb{Z}^2$-tree but…

Group Theory · Mathematics 2012-12-10 Shane O. Rourke