Related papers: Gregory Trees, The Continuum, And Martin's Axiom
In this article we study two related models of quantum geometry: generic random trees and two-dimensional causal triangulations. The Hausdorff and spectral dimensions that arise in these models are calculated and their relationship with the…
A continuum $K$ is a common model for the family ${\mathcal K}$ of continua if every member of ${\mathcal K}$ is a continuous image of $K$. We show that none of the following classes of spaces has a common model: 1) the class of strongly…
Since being isolated by Viale and Weiss in 2009, the Guessing Model Property has emerged as a particularly prominent and powerful consequence of the Proper Forcing Axiom. In this paper, we investigate connections between variations of the…
Building on previous work of [BPS] we investigate $\sigma$-closed partial orders of size continuum. We provide both an internal and external characterization of such partial orders by showing that (1) every $\sigma$-closed partial order of…
The metrical theory of the product of consecutive partial quotients is associated with the uniform Diophantine approximation, specifically to the improvements to Dirichlet's theorem. Achieving some variant forms of metrical theory in…
We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…
The strong tree property and ITP (also called the super tree property) are generalizations of the tree property that characterize strong compactness and supercompactness up to inaccessibility. That is, an inaccessible cardinal $\kappa$ is…
We discuss the geometry of trees endowed with a causal structure using the conventional framework of equilibrium statistical mechanics. We show how this ensemble is related to popular growing network models. In particular we demonstrate…
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…
We consider fixed-point equations for probability measures charging measured compact metric spaces that naturally yield continuum random trees. On the one hand, we study the existence/uniqueness of the fixed-points and the convergence of…
We show that every group acting freely and vertex-transitively by isometries on a product of two regular trees of finite valence is boundary rigid. That means that every CAT(0) space that admits a geometric action of any such group has the…
It was shown by Connes, Douglas, Schwarz[1] that one can compactify M(atrix) theory on noncommutative torus. We prove that compactifications on Morita equivalent tori are physically equivalent. This statement can be considered as a…
For any proper action of a non-elementary group $G$ on a proper geodesic metric space, we show that if $G$ contains a contracting element, then there exists a sequence of proper quotient groups whose growth rate tends to the growth rate of…
The primary goal of this paper is to establish a model of $ZFC$ wherein the definable tree property is affirmed for all uncountable regular cardinals. This endeavor commences with the utilization of both a supercompact cardinal and a…
We study several enumeration problems connected to linear trees, a broad class which includes stars, paths, generalized stars, and caterpillars. We provide generating functions for counting the number of linear trees on $n$ vertices,…
In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…
Combinatoric formulas for cluster expansions have been improved many times over the years. Here we develop some new combinatoric proofs and extensions of the tree formulas of Brydges and Kennedy, and test them on a series of pedagogical…
We prove canonical and non-canonical tree-of-tangles theorems for abstract separation systems that are merely structurally submodular. Our results imply all known tree-of-tangles theorems for graphs, matroids and abstract separation systems…
This paper shows that decision trees constructed with Classification and Regression Trees (CART) and C4.5 methodology are consistent for regression and classification tasks, even when the number of predictor variables grows…
We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…