Related papers: On splitting trees

Model semantics for first-order predicate logic is characterized by a visual inference tool called semantic forcing trees for predicate logic. Formulas that are valid (or invalid) by semantic forcing trees match valid (or invalid) formulas…

We study the symbolic powers of square-free monomial ideals via symbolic Rees algebras and methods in prime characteristic. In particular, we prove that the symbolic Rees algebra and the symbolic associated graded algebra are split with…

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

This paper describes how, in the case of algebraic surfaces, the well-known theorem of Donaldson-Uhlenbeck-Yau can be proved in a framework of generalized 'multiplier ideal sheaves', following the ideas of Siu. The key concept is that the…

We introduce equivariant tree models in algebraic statistics, which unify and generalise existing tree models such as the general Markov model, the strand symmetric model, and group based models. We focus on the ideals of such models. We…

We generalize a Brian\c{c}on-Skoda type theorem first studied by Aberbach and Huneke. With some conditions on a regular local ring $(R,\m)$ containing a field, and an ideal $I$ of $R$ with analytic spread $\ell$ and a minimal reduction $J$,…

On a finite graph, there is a natural family of Boltzmann probability measures on cycle-rooted spanning forests, parametrized by weights on cycles. For a certain subclass of those weights, we construct Gibbs measures in infinite volume, as…

Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often complex and burdensome. We introduce a four-part logical split:…

We consider linear preferential attachment trees, and show that they can be regarded as random split trees in the sense of Devroye (1999), although with infinite potential branching. In particular, this applies to the random recursive tree…

We introduce a notion of finite sampling consistency for phylogenetic trees and show that the set of finitely sampling consistent and exchangeable distributions on n leaf phylogenetic trees is a polytope. We use this polytope to show that…

We study the limiting behavior of a Bienayme-Galton-Watson tree conditioned to have a large number of vertices and either a fixed number of leaves or a fixed number of internal nodes. The first biconditioning gives a universal result with…

For $f,g\in\omega\ho$ let $\mycfa_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e. for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. $\myc_{f,g}$ is…

Let $(R, {\mathfrak m})$ be a Noetherian local ring and let $I$ be an ${\mathfrak m}$-primary ideal. In this paper we give sharp bounds on the multiplicity of the special fiber ring ${\mathcal F}$ of $I$ in terms of other well-known…

In this paper we study complete manifolds equipped with smooth measures whose spectrum of the weighted Laplacian has an optimal positive lower bound and the $m$-dimensional Bakry-\'Emery Ricci curvature is bounded from below by some…

Throughout the last decade, random forests have established themselves as among the most accurate and popular supervised learning methods. While their black-box nature has made their mathematical analysis difficult, recent work has…

We consider ferromagnetic Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the "cavity" prediction for…

Decision tree learning is increasingly being used for pointwise inference. Important applications include causal heterogenous treatment effects and dynamic policy decisions, as well as conditional quantile regression and design of…

We give a brief survey on the interplay between forcing axioms and various other non-constructive principles widely used in many fields of abstract mathematics, such as the axiom of choice and Baire's category theorem. First of all we…

In this paper we at first consider plane trees with the root vertex and a marked directed edge, outgoing from the root vertex. For such trees we introduce a new characteristic --- the \emph{parity}, using the bracket code. It turns out that…

We explore the tree limits recently defined by Elek and Tardos. In particular, we find tree limits for many classes of random trees. We give general theorems for three classes of conditional Galton-Watson trees and simply generated trees,…