Related papers: A Theorem of Roe and Strichartz on homogeneous tre…

Let $\mathcal{B}$ be a homogeneous differential operator of order $l=1$ or $l=2$. We show that a sequence of functions of the form $(\mathcal{B}u_j)_j$ converging in the $L^1$-sense to a compact, convex set $K$ can be modified into a…

Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are determined up to isomorphism by their chromatic symmetric…

In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

A general theorem due to Howe of dual action of a classical group and a certain non-associative algebra on a space of symmetric or alternating tensors is reformulated in a setting of second quantization, and familiar examples in atomic and…

Richard P. Stanley conjectured that finite trees can be distinguished by their chromatic symmetric functions. In this paper, we prove an analogous statement for posets: Finite rooted trees can be distinguished by their order quasisymmetric…

We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…

For any real-valued $k > 1$, we consider the tree rooted at 0, where each positive integer $n$ has parent $\lfloor\frac{n}{k}\rfloor$. The average number of children per node is $k$, thus this definition gives a natural way to extend…

In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this…

We present bijections enumerating (k,m)-trees, k-gon trees, edge labelled (2,1)-trees, and other tree-like structures. Our constructions are based on Foata's (1971) bijection for cycle-free functions, which is simplified here.

Let $\mathcal{T}_n$ be the set of trees with $n$ vertices. Suppose that each tree in $\mathcal{T}_n$ is equally likely. We show that the number of different rooted trees of a tree equals $(\mu_r+o(1))n$ for almost every tree of…

Zeckendorf's theorem states that every positive integer can be written uniquely as the sum of non-consecutive shifted Fibonacci numbers $\{F_n\}$, where we take $F_1=1$ and $F_2=2$. This has been generalized for any Positive Linear…

We study random integer-valued Lipschitz functions on regular trees. It was shown by Peled, Samotij and Yehudayoff that such functions are localized, however, finer questions about the structure of Gibbs measures remain unanswered. Our main…

A recent refinement of Ker\'ekj\'art\'o's Theorem has shown that in $\mathbb R$ and $\mathbb R^2$ all $\mathcal C^l$-solutions of the functional equation $f^n =\textrm{Id}$ are $\mathcal C^l$-linearizable, where $l\in \{0,1,\dots \infty\}$.…

We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…

Let A be a C*-algebra with real rank zero which has the stable weak cancellation property. Let I be an ideal of A such that I is stable and satisfies the corona factorization property. We prove that 0->I->A->A/I->0 is a full extension if…

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…

We extend the Quillen Theorem Bn for homotopy fibers of Dwyer, et al. to similar results for homotopy pullbacks and note that these results imply similar results for zigzags in the categories of relative categories and k-relative…

We study the profile $X_{n,k}$ of random search trees including binary search trees and $m$-ary search trees. Our main result is a functional limit theorem of the normalized profile $X_{n,k}/\mathbb{E}X_{n,k}$ for $k=\lfloor\alpha\log…

We prove that if a unimodular random rooted graph is recurrent, the number of ends of its uniform spanning tree is almost surely equal to the number of ends of the graph. Together with previous results in the transient case, this completely…