Related papers: A Rigid Kurepa Tree From a Free Suslin Tree
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
In this paper we analyse some questions concerning trees on $\kappa$, both for the countable and the uncountable case, and the connections with Cohen reals. In particular, we provide a proof for one of the implications left open in…
We discuss rigid compact complex manifolds of Kodaira dimension 1, arising as product-quotient varieties. First, we show that there is no free rigid action on the product of $(n-1)$ elliptic curves and a curve of genus at least two. Then,…
Motivated by a question from a recent paper by Gilton, Levine and Stejskalova, we obtain a new characterization of the ideal $J[\kappa]$, from which we confirm that $\kappa$-Souslin trees exist in various models of interest. As a corollary…
We study the strong coupling expansion of large $N$ QCD in various dimensions, reformulating the Kogut-Susskind Hamiltonian on a square lattice in terms of (constrained) one dimensional spin chain models. We study the integrability…
By an omega_1 --tree we mean a tree of size omega_1 and height omega_1. An omega_1 --tree is called a Kurepa tree if all its levels are countable and it has more than omega_1 branches. An omega_1 --tree is called a Jech--Kunen tree if it…
Let $P$ be a finite full-dimensional point configuration in $\mathbb{R}^d$. We show that if a point configuration $Q$ has the property that all finite chirotopes realizable by adding (generic) points to $P$ are also realizable by adding…
We prove that mu = mu^{< mu}, 2^mu = mu^+ and ``there is a non reflecting stationary subset of mu^+ composed of ordinals of cofinality < mu'' imply that there is a mu-complete Souslin tree on mu^+ .
We present a streamlined exposition of a construction by R. Chen, A. Poulin, R. Tao, and A. Tserunyan, which proves the treeability of equivalence relations generated by any locally-finite Borel graph such that each component is a…
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…
We show the kernel sheaf associated to a sufficiently positive torsion-free sheaf of rank 1 is slope stable. Furthermore, we are able to give an explicit bound for "sufficiently positive." This settles a conjecture of…
We study a random recursive tree model featuring complete redirection called the random friend tree and introduced by Saram\"aki and Kaski. Vertices are attached in a sequential manner one by one by selecting an existing target vertex and…
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…
A weighted recursive tree is an evolving tree in which vertices are assigned random vertex-weights and new vertices connect to a predecessor with a probability proportional to its weight. Here, we study the maximum degree and near-maximum…
We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…
In Part I of this series, we presented the microscopic approach to Souslin-tree constructions, and argued that all known $\diamondsuit$-based constructions of Souslin trees with various additional properties may be rendered as applications…
We consider a four-dimensional space-time supplemented by two discrete points assigned to a $Z_2$ algebraic structure and develop the formalism of noncommutative geometry. By setting up a generalised vielbein, we study the metric structure.…
We introduce a non-increasing tree growth process $((T_n,\sigma_n),\, n\ge 1)$, where $T_n$ is a rooted labeled tree on $n$ vertices and ${\sigma}_n$ is a permutation of the vertex labels. The construction of $(T_{n},{\sigma}_n)$ from…
Motivated by geometric origami and the straight skeleton construction, we outline a map between spaces of phylogenetic trees and spaces of planar polygons. The limitations of this map is studied through explicit examples, culminating in…
We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…