Related papers: Gregory Trees, The Continuum, And Martin's Axiom
Assuming an inaccessible cardinal kappa, there is a generic extension in which MA + 2^{aleph_0} = kappa holds and the reals have a Delta^2_1 well-ordering.
We generalize the classical single-crossing property to single-crossing property on trees and obtain new ways to construct Condorcet domains which are sets of linear orders which possess the property that every profile composed from those…
Tree-structured data naturally appear in various fields, particularly in biology where plants and blood vessels may be described by trees, but also in computer science because XML documents form a tree structure. This paper is devoted to…
We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the…
Improving a result of Woodin, we identify some classes of individually consistent but mutually inconsistent generic large cardinal axioms.
We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…
We present a coherent collection of finite mathematical theorems some of which can only be proved by going well beyond the usual axioms for mathematics. The proofs of these theorems illustrate in clear terms how one uses the well studied…
We study the simple random walk on trees and give estimates on the mixing and relaxation time. Relying on a recent characterization by Basu, Hermon and Peres, we give geometric criteria, which are easy to verify and allow to determine…
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of…
We study the local convergence of critical Galton-Watson trees and Levy trees under various conditionings. Assuming a very general monotonicity property on the functional of random trees, we show that random trees conditioned to have large…
We prove a theorem which implies a quantum (multiplicative) analogue of the Horn conjecture, and also of the saturation conjecture. We obtain transversality statements for quantum schubert calculus in any characteristic and also determine…
This is the second part of a series of three articles which introduce laminations for free groups (see math.GR/0609416 for the first part). Several definition of the dual lamination of a very small action of a free group on an $\R$-tree are…
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…
Motivated by recent developments in the metrical theory of continued fractions for real numbers concerning the growth of consecutive partial quotients, we consider its analogue over the field of formal Laurent series. Let $A_n(x)$ be the…
Hex-trees are identified as a particular instance of weighted unary-binary trees. The Horton-Strahler numbers of these objects are revisited, and, thanks to a substitution that is not immediately intuitive, explicit results are possible.…
We study the category whose objects are trees (with or without roots) and whose morphisms are contractions. We show that the corresponding contravariant module categories are Noetherian, and we study two natural families of modules over…
Graham and Sloane proposed in 1980 a conjecture stating that every tree has a harmonious labelling, a graph labelling closely related to additive base. Very limited results on this conjecture are known. In this paper, we proposed a…
We introduce a new stick-breaking construction for inhomogeneous continuum random trees (ICRT). This new construction allows us to prove the necessary and sufficient condition for compactness conjectured by Aldous, Miermont and Pitman…
Let $\mathcal{B}$ be the set of rooted trees containing an infinite binary subtree starting at the root. This set satisfies the metaproperty that a tree belongs to it if and only if its root has children $u$ and $v$ such that the subtrees…
We study the fundamental question of how likely it is that two randomly chosen trees are isomorphic to each other for different models of random trees. We show that the probability decays exponentially for rooted labeled trees as well as…