Related papers: Locally finite trees and the topological minor rel…
The Rabin tree theorem yields an algorithm to solve the satisfiability problem for monadic second-order logic over infinite trees. Here we solve the probabilistic variant of this problem. Namely, we show how to compute the probability that…
We study a general procedure that builds random $\mathbb R$-trees by gluing recursively a new branch on a uniform point of the pre-existing tree. The aim of this paper is to see how the asymptotic behavior of the sequence of lengths of…
We propose a new way to condition random trees, that is, condition random trees to have large maximal out-degree. Under this new conditioning, we show that conditioned critical Galton-Watson trees converge locally to size-biased trees with…
We answer two questions about the topology of end spaces of infinite type surfaces and the action of the mapping class group that have appeared in the literature. First, we give examples of infinite type surfaces with end spaces that are…
One of the major starting points of discrete optimization is the theorem of Nash-Williams and Tutte on the existence of $k$ disjoint spanning trees of a graph along with its counterpart on the existence of $k$ forests covering all edges of…
The purpose of this paper is to make a comprehensive connection between the basic results and properties derived from the two kinds of topologies (namely the $(\epsilon,\lambda)-$topology introduced by the author and the stronger locally…
We consider groups of finite Morley rank with solvable local subgroups of even and mixed types. We also consider miscellaneous aspects of small groups of finite Morley rank of odd type.
We define various notions of locality for *-automorphisms of the algebra of observables for an infinitely extended quantum spin system and study their relationship. In particular, we show that the ubiquitous characterization which arises…
We show that if \kappa\ is a weakly compact cardinal then the embeddability relation on (generalized) trees of size \kappa\ is invariantly universal. This means that for every analytic quasi-order R on the generalized Cantor space 2^\kappa\…
The aim of this paper is to unify the theory of ends of finitely generated groups with that of ends of locally compact, metrizable and connected topological groups. In both theories one proves that, if the number of ends is finite, then it…
Given a tree T, one can define the local mean at some subtree S to be the average order of subtrees containing S. It is natural to ask which subtree of order k achieves the maximal/minimal local mean among all the subtrees of the same order…
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…
We show that the number of types of sequences of tuples of a fixed length can be calculated from the number of 1-types and the length of the sequences. Specifically, if $\kappa \leq \lambda$, then $$\sup_{|A| = \lambda} |S^\kappa(A)| =…
Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\ (1)\, Sharp upper bound on the total number…
We set up a new notion of local convergence for permutations and we prove a characterization in terms of proportions of \emph{consecutive} pattern occurrences. We also characterize random limiting objects for this new topology introducing a…
We consider sequences of finite weighted random graphs that converge locally to unimodular i.i.d. weighted random trees. When the weights are atomless, we prove that the matchings of maximal weight converge locally to a matching on the…
We study universal groups for right-angled buildings. Inspired by Simon Smith's work on universal groups for trees, we explicitly allow local groups that are not necessarily finite nor transitive. We discuss various topological and…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
In this paper we investigate an extremal problem on binary phylogenetic trees. Given two such trees $T_1$ and $T_2$, both with leaf-set ${1,2,...,n}$, we are interested in the size of the largest subset $S \subseteq {1,2,...,n}$ of leaves…
We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…