Related papers: More on trees and Cohen reals
Let $\kappa$ be an uncountable cardinal such that $2^{<\kappa} = \kappa$ or just ${\rm cf}(\kappa) > \omega$, $2^{2^{<\kappa}}= 2^\kappa$, and $([\kappa]^\kappa, \supseteq)$ collapses $2^\kappa$ to $\omega$. We show under these assumptions…
An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC…
(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix.…
Questions regarding the continuity in $\kappa$ of the $SLE_{\kappa}$ traces and maps appear very naturally in the study of SLE. In order to study the first question, we consider a natural coupling of SLE traces: for different values of…
This is mainly an expository text on the Haagerup property for countable groupoids equipped with a quasi-invariant measure, aiming to complete an article of Jolissaint devoted to the study of this property for probability measure preserving…
We develop a probabilistic approach to the celebrated Jacobian conjecture, which states that any Keller map (i.e. any polynomial mapping $F\colon \mathbb{C}^n \to \mathbb{C}^n$ whose Jacobian determinant is a nonzero constant) has a…
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…
This paper is devoted to proving an infinite sequence of relations for rooted tree maps. On the way, we also give a basis for the space of rooted tree maps.
We develop the theory of the forcing with trees and creatures for an inaccessible lambda continuing Ros{\l}anowski and Shelah math.LO/9807172, math.LO/9909115. To make a real use of these forcing notions (that is to iterate them without…
Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…
By revisiting the Kirchhoff's Matrix-Tree Theorem, we give an exact formula for the number of spanning trees of a graph in terms of the quantum relative entropy between the maximally mixed state and another state specifically obtained from…
The continuum limit and scaling properties of an asymptotically free field theory regularized on a random lattice are compared with those on a regular square lattice. We work on random lattices parametrized by a degree of ``randomness''…
We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if $\kappa$ is a measurable cardinal and $\theta<\kappa<\mu<\lambda$ are…
Starting from the existence of many supercompact cardinals, we construct a model of ZFC in which the tree property holds at a countable segment of successor of singular cardinals.
We study pairs $(V, V_1)$ of models of $ZFC$ such that adding $\kappa$-many random reals over $V_1$ adds $\lambda$-many random reals over $V$, for some $\lambda > \kappa.$
The notion of tree entropy was introduced by the author as a normalized limit of the number of spanning trees in finite graphs, but is defined on random infinite rooted graphs. We give some new expressions for tree entropy; one uses…
This work is a part of my upcoming thesis [7]. We establish an equiconsistency between (1) weak indestructibility for all $\kappa +2$-degrees of strength for cardinals $\kappa $ in the presence of a proper class of strong cardinals, and (2)…
This document contains additional numerical and graphical evidence to support some of the conjectures mentioned in \cite{GM3}. We give more evidence for $\kappa=3,4$ in dimension 2. As mentioned in that article we still don't quite…
Description of cocommutative Hopf algebras associated with families of trees. Applications include Cayley's theorem on the number of rooted trees with n nodes, and Catalan's theorem on the number of rooted ordered trees with n nodes.
We provide a combinatorial approach to counting the number of spanning trees at the $n$-th layer of a branched $\mathbb{Z}_p$-cover of a finite connected graph $\mathsf{X}$. Our method achieves in explaining how the position of the ramified…