English
Related papers

Related papers: A Rigid Kurepa Tree From a Free Suslin Tree

200 papers

We introduce regenerative tree growth processes as consistent families of random trees with n labelled leaves, n>=1, with a regenerative property at branch points. This framework includes growth processes for exchangeably labelled Markov…

Probability · Mathematics 2013-09-30 Jim Pitman , Douglas Rizzolo , Matthias Winkel

A gluing of two rooted trees is an identification of their leaves and un-subdivision of the resulting 2-valent vertices. A gluing of two rooted trees is subdivergence free if it has no 2-edge cuts with both roots on the same side of the…

Combinatorics · Mathematics 2025-01-13 Xinle Dai , Jordan Long , Karen Yeats

A variant of Turing machines is introduced where the tape is replaced by a single tree which can be manipulated in a style akin to purely functional programming. This yields two benefits: first, the extra structure on the tape can be…

Logic in Computer Science · Computer Science 2015-07-17 Arnaud Spiwack

This paper proposes FREEtree, a tree-based method for high dimensional longitudinal data with correlated features. Popular machine learning approaches, like Random Forests, commonly used for variable selection do not perform well when there…

Machine Learning · Statistics 2020-06-18 Yuancheng Xu , Athanasse Zafirov , R. Michael Alvarez , Dan Kojis , Min Tan , Christina M. Ramirez

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 following is consistent: There is a stationary set S such that every Aronszajn tree is S-*-special and there is an Aronszajn tree T such that for every unbounded E we have T is not E-special. This answers a question of Shelah (Proper…

Logic · Mathematics 2007-05-23 Chaz Schlindwein

We investigate the structure of crossed product von Neumann algebras arising from Bogoljubov actions of countable groups on Shlyakhtenko's free Araki-Woods factors. Among other results, we settle the questions of factoriality and Connes'…

Operator Algebras · Mathematics 2025-07-17 Cyril Houdayer , Benjamin Trom

With the help of various square principles, we obtain results concerning the consistency strength of several statements about trees containing ascent paths, special trees, and strong chain conditions. Building on a result that shows that…

Logic · Mathematics 2019-02-20 Chris Lambie-Hanson , Philipp Lücke

The aim of the present paper is on the one hand to produce examples supporting the conclusion of Y. Namikawa in Remark 2.8 of \cite{N} and improving considerations of Example 1.11 of the same paper. On the other hand, it is intended to give…

Algebraic Geometry · Mathematics 2014-08-29 Michele Rossi

A linear order $L$ is strongly surjective if $L$ can be mapped onto any of its suborders in an order preserving way. We prove various results on the existence and non-existence of uncountable strongly surjective linear orders answering…

Logic · Mathematics 2018-01-31 Dániel T. Soukup

A relaxed $k$-ary tree is an ordered directed acyclic graph with a unique source and sink in which every node has out-degree $k$. These objects arise in the compression of trees in which some repeated subtrees are factored and repeated…

Combinatorics · Mathematics 2024-04-15 Manosij Ghosh Dastidar , Michael Wallner

A theorem of Frieze from 1985 asserts that the total weight of the minimum spanning tree of the complete graph $K_n$ whose edges get independent weights from the distribution $UNIFORM[0,1]$ converges to Ap\'ery's constant in probability, as…

Combinatorics · Mathematics 2025-04-14 Jan Hladký , Gopal Viswanathan

We extend Forester's rigidity theorem so as to give a complete characterization of rigid group actions on trees (an action is rigid if it is the only reduced action in its deformation space, in particular it is invariant under automorphisms…

Group Theory · Mathematics 2008-01-31 Gilbert Levitt

A compositional tree refers to a tree structure on a set of random variables where each random variable is a node and composition occurs at each non-leaf node of the tree. As a generalization of compositional data, compositional trees…

Methodology · Statistics 2021-04-20 Bingkai Wang , Brian S. Caffo , Xi Luo , Chin-Fu Liu , Andreia V. Faria , Michael I. Miller , Yi Zhao

We give a short and elementary proof of the fact that every metric space of finite asymptotic dimension can be embedded into a finite product of trees.

Metric Geometry · Mathematics 2023-02-22 Daniel Kasprowski

We define and study a new compactification, called the height compactification of the horospheric product of two infinite trees. We will provide a complete description of this compactification. In particular, we show that this…

General Topology · Mathematics 2022-05-03 Behrang Forghani , Keivan Mallahi-Karai

We present an approach to Morse theory on symmetric products of surfaces using the notion of folded ribbon trees. We introduce an $A_\infty$-category with objects defined as $\kappa$-tuples of Morse functions, where the differential of the…

Symplectic Geometry · Mathematics 2023-09-13 Tianyu Yuan

We define \emph{piecewise rank 1} manifolds, which are aspherical manifolds that generally do not admit a nonpositively curved metric but can be decomposed into pieces that are diffeomorphic to finite volume, irreducible, locally symmetric,…

Geometric Topology · Mathematics 2014-02-26 T. Tam Nguyen Phan

We introduce a new class of tree-based models, P-Trees, for analyzing (unbalanced) panel of individual asset returns, generalizing high-dimensional sorting with economic guidance and interpretability. Under the mean-variance efficient…

Machine Learning · Computer Science 2025-02-05 Lin William Cong , Guanhao Feng , Jingyu He , Xin He

Let $T$ be a tree, a vertex of degree one is a leaf of $T$ and a vertex of degree at least three is a branch vertex of $T$. For two distinct vertices $u,v$ of $T$, let $P_T[u,v]$ denote the unique path in $T$ connecting $u$ and $v.$ For a…

Combinatorics · Mathematics 2021-12-09 Pham Hoang Ha