Related papers: Forests and the W Construction

We prove that the infinite components of the Free Uniform Spanning Forest of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the…

Forester has defined spaces of simplicial tree actions for a finitely generated group, called deformation spaces. Culler and Vogtmann's Outer space is an example of a deformation space. Using ideas from Skora's proof of the contractibility…

Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…

A spanning subgraph $F$ of a graph $G$ is called perfect if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$. We provide a short proof of the following theorem of A.D.…

We prove the existence of Verdier stratifications for sets definable in any o-minimal structure on (R, +, .). It is also shown that the Verdier condition (w) implies the Whitney condition (b) in o-minimal structures on (R, +, .). As a…

We generalize the small object argument in order to allow for its application to proper classes of maps (as opposed to sets of maps in Quillen's small object argument). The necessity of such a generalization arose with appearance of several…

We show that splitting forcing does not have the weak Sacks property below any condition, answering a question of Laguzzi, Mildenberger and Stuber-Rousselle. We also show how some partition results for splitting trees hold or fail and we…

We first identify (up to linear isomorphism) the Lipschitz free spaces of quasiarcs. By decomposing quasiconformal trees into quasiarcs as done in an article of David, Eriksson-Bique, and Vellis, we then identify the Lipschitz free spaces…

We give an algebraic characterization of the tree languages that are defined by logical formulas using certain Lindstr\"om quantifiers. An important instance of our result concerns first-order definable tree languages. Our characterization…

We present a characterization of spaces of strictly decreasing functions on trees in terms of bisequentiality. This characterization answers Questions 6.1 and 6.2 of "A filter on a collection of finite sets and Eberlein compacta" by T.…

Given a permutation $\pi\in \Sn\_n$, construct a graph $G\_\pi$ on the vertex set $\{1,2, ..., n\}$ by joining $i$ to $j$ if (i) $i<j$ and $\pi(i)<\pi(j)$ and (ii) there is no $k$ such that $i < k < j$ and $\pi(i)<\pi(k)<\pi(j)$. We say…

In a paper from 2012 Jab{\l}o\'nski, Jung and Stochel introduced the weighted shifts on directed trees, a generalisation of well known weighted shift operators on $\ell^2$. In the last decade this class has proven itself handy for finding…

We give further insights into the weighted Hurwitz product and the weighted tensor product of Joyal species. Our first group of results relate the Hurwitz product to the pointwise product, including the interaction with Rota--Baxter…

We prove some general results about quasi-actions on trees and define Property (QFA), which is analogous to Serre's Property (FA), but in the coarse setting. This property is shown to hold for a class of groups, including $SL(n,\Z)$ for…

We prove the equivalence of VOA tensor categories and conformal net tensor categories for the following examples: all WZW models; all lattice VOAs; all unitary parafermion VOAs; type $ADE$ discrete series $W$-algebras; their tensor…

It is well known that strict $\omega$-categories, strict $\omega$-functors, strict natural $\omega$-transformations, and so on, form a strict $\omega$-category. A similar property for weak $\omega$-categories is one of the main hypotheses…

We develop the notion of the composition of two coalgebras, which arises naturally in higher category theory and in the theory of species. We prove that the composition of two cofree coalgebras is again cofree, and we give sufficient…

This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…

We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…

This paper introduces Weighted Optimal Classification Forests (WOCFs), a new family of classifiers that takes advantage of an optimal ensemble of decision trees to derive accurate and interpretable classifiers. We propose a novel…