Related papers: On splitting trees
We prove that the standard conjecture of Hodge type holds for powers of abelian threefolds. Along the way, we also prove the conjecture for powers of simple abelian variety of prime dimension over finite fields, and in other related cases…
We prove that certain roots of the Bernstein-Sato polynomial (i.e. b-function) are jumping coefficients up to a sign, showing a partial converse of a theorem of L. Ein, R. Lazarsfeld, K.E. Smith, and D. Varolin. We also prove that certain…
We introduce an abstract framework for forcing over a free Suslin tree with suborders of products of forcings which add some structure to the tree using countable approximations. The main ideas of this framework are consistency, separation,…
We study the dynamic optimality conjecture, which predicts that splay trees are a form of universally efficient binary search tree, for any access sequence. We reduce this claim to a regular access bound, which seems plausible and might be…
We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are…
In this article, we study combinatorial properties of a certain ideal on $\omega$, called the \emph{Splitting ideal}. We calculate its cardinal invariants and its position in the Kat\v{e}tov order among other definable ideals. We also study…
Gradient boosted decision trees are some of the most popular algorithms in applied machine learning. They are a flexible and powerful tool that can robustly fit to any tabular dataset in a scalable and computationally efficient way. One of…
We introduce bounded category forcing axioms for well-behaved classes $\Gamma$. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe $H_{\lambda_\Gamma^+}$ modulo…
We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…
The Halpern-L\"auchli theorem, a combinatorial result about trees, admits an elegant proof due to Harrington using ideas from forcing. In an attempt to distill the combinatorial essence of this proof, we isolate various partition principles…
We study the number of random records in an arbitrary split tree (or equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for convergence of sums of triangular arrays to…
In this paper we give a new family of complete intersections which have the strong Lefschetz property. The family consists of (Artinian algebras defined by) ideals generated by power sum symmetric polynomials of consecutive degrees and of…
We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…
A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in…
One of the most significant discrete invariants of a quadratic form $\phi$ over a field $k$ is its (full) splitting pattern, a finite sequence of integers which describes the possible isotropy behaviour of $\phi$ under scalar extension to…
Dynamic trees are mixtures of tree structured belief networks. They solve some of the problems of fixed tree networks at the cost of making exact inference intractable. For this reason approximate methods such as sampling or mean field…
Rado's Conjecture is a compactness/reflection principle that says any nonspecial tree of height $\omega_1$ has a nonspecial subtree of size $\leq \aleph_1$. Though incompatible with Martin's Axiom, Rado's Conjecture turns out to have many…
We show that if a strictly positive joint probability distribution for a set of binary random variables factors according to a tree, then vertex separation represents all and only the independence relations enclosed in the distribution. The…
We find exact solutions of the string equations of motion and constraints describing the {\em classical}\ splitting of a string into two. We show that for the same Cauchy data, the strings that split have {\bf smaller} action than the…
Decision trees built with data remain in widespread use for nonparametric prediction. Predicting probability distributions is preferred over point predictions when uncertainty plays a prominent role in analysis and decision-making. We study…