Related papers: More on trees and Cohen reals

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…

We study the problem of enumerating Braess edges for Kemeny's constant in trees. We obtain bounds and asympotic results for the number of Braess edges in some families of trees.

For every uncountable regular $\kappa$, we give two examples of proper posets which turn improper in some $\kappa$-closed forcing extension.

We present a study of unification for rational trees in the context of miniKanren. We give the definition of rational trees, specify the unification algorithm and prove some of its properties. We also introduce a number of heuristic…

We are interested in the possible sets of cardinalities of branches of Kurepa trees in models of $ZFC$ $+$ $CH$. In this paper we present a sufficient condition (for sets of cardinals) to be consistently the set of cardinalities of branches…

We relate the author's Lie cobracket in the module additively generated by loops on a surface with the Connes-Kreimer Lie bracket in the module additively generated by trees. To this end we introduce a pre-Lie coalgebra and a (commutative)…

Tree-child networks are a recently-described class of directed acyclic graphs that have risen to prominence in phylogenetics (the study of evolutionary trees and networks). Although these networks have a number of attractive mathematical…

In this paper, we study some tree properties and their related indiscernibilities. First, we prove that SOP$_2$ can be witnessed by a formula with a tree of tuples holding 'arbitrary homogeneous inconsistency' (e.g., weak k-TP$_1$…

We construct and study the conformal loop ensembles CLE(kappa), defined for all kappa between 8/3 and 8, using branching variants of SLE(kappa) called exploration trees. The conformal loop ensembles are random collections of countably many…

We develop the theory of layered posets, and use the notion of layering to prove a new iteration theorem (Theorem 6): if $\kappa$ is weakly compact then any universal Kunen iteration of $\kappa$-cc posets (each possibly of size $\kappa$) is…

Our goal is to study the pseudo-intersection and tower numbers on uncountable regular cardinals, whether these two cardinal characteristics are necessarily equal, and related problems on the existence of gaps. First, we prove that either…

Rooted tree maps assign to an element of the Connes-Kreimer Hopf algebra of rooted trees a linear map on the noncommutative polynomial algebra in two letters. Evaluated at any admissible word these maps induce linear relations between…

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…

We show that if the universe is self-iterable and $\kappa$ is an inaccessible limit of Woodin cardinal then $AD_R + "\Theta$ is regular" holds in the derived model at $\kappa$. The proof is fine-structure free, and only assumes basic…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

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…

We consider an infinite sequence of rooted trees naturally emerging in a number-theoretical context. We advance some ideas on its structure by discussing some elementary properties. Some of those properties are shown to be related to…

In this article, we present a binary tree with vertices given by rational functions $p(x)/q(x)$; the root and functional derivation of children are inspired by continued fractions. We prove some special properties of the tree. For example,…

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

We prove the existence and uniqueness of multiple SLE$_\kappa$ associated with any given link pattern for $\kappa\in (4,6]$. We also have the uniqueness for $\kappa\in (6,8)$. The multiple SLE$_\kappa$ law is constructed by first…