Related papers: Strong tree properties, Kurepa trees, and guessing…
We show that for $\Pi_2$-properties of second or third order arithmetic as formalized in appropriate natural signatures the apparently weaker notion of forcibility overlaps with the standard notion of consistency (assuming large cardinal…
We propose methods to improve the forecasts from generalized autoregressive score (GAS) models (Creal et. al, 2013; Harvey, 2013) by localizing their parameters using decision trees and random forests. These methods avoid the curse of…
I show that it is consistent relative to the consistency of a Mahlo cardinal that Martin's axiom holds at $\omega_2$, but the weak Kurepa Hypothesis fails. This answers a question posed by Honzik, Lambie-Hanson and Stejskalov\'a. The…
The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A similar (but weaker) four point condition characterizes dissimilarity maps derived…
We study the order theoretic properties of relative weak injectivity, w.r.i., in short, in the category of C*-algebras. We prove that Arveson's extension theorem, with additional order assumption on the morphisms, is tightly connected with…
The matching energy is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph, which is proposed first by Gutman and Wagner [The matching energy of a graph, Discrete Appl. Math. 160 (2012) 2177--2187].…
Due to their accuracies, methods based on ensembles of regression trees are a popular approach for making predictions. Some common examples include Bayesian additive regression trees, boosting and random forests. This paper focuses on…
This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recognisable by a weak alternating automaton, or equivalently…
Recently, it has been argued that application of the Weak Gravity Conjecture (WGC) to spin-2 fields implies a universal upper bound on the cutoff of the effective theory for a single spin-2 field. We point out here that these arguments are…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
We study the relationship between Amoeba forcing (the partial order which generically adds a measure one set of random reals) and projective measurability. Given a universe V of set theory and a forcing notion P in V we say that V is…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
The tree theorem for pairs ($\mathsf{TT}^2_2$), first introduced by Chubb, Hirst, and McNicholl, asserts that given a finite coloring of pairs of comparable nodes in the full binary tree $2^{<\omega}$, there is a set of nodes isomorphic to…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…
Given a non-negative $n \times n$ matrix viewed as a set of distances between $n$ points, we consider the property testing problem of deciding if it is a metric. We also consider the same problem for two special classes of metrics, tree…
In a recent paper, M. Green and P. Griffiths used R. Thomas' works on nodal hypersurfaces to establish the equivalence of the Hodge conjecture and the existence of certain singular admissible normal functions. Inspired by their work, we…
We investigate properties of trees of height $\omega_1$ and their preservation under subcomplete forcing. We show that subcomplete forcing cannot add a new branch to an $\omega_1$-tree. We introduce fragments of subcompleteness which are…
By an omega_1 --tree we mean a tree of power omega_1 and height omega_1. We call an omega_1 --tree a Jech--Kunen tree if it has kappa --many branches for some kappa strictly between omega_1 and 2^{omega_1}. In this paper we construct the…
The following results are proved: (a) In a model obtained by adding aleph_2 Cohen reals, there is always a c.c.c. complete Boolean algebra without the weak Freese-Nation property. (b) Modulo the consistency strength of a supercompact…
We show that the dualizing sheaves of reduced simple normal crossings pairs have a canonical weight filtration in a compatible way with the one on the corresponding mixed Hodge modules by calculating the extension classes between the…