Related papers: Strong tree properties, Kurepa trees, and guessing…
The aim of this paper is to determine the logical and computational strength of instances of the Bolzano-Weierstra{\ss} principle (BW) and a weak variant of it. We show that BW is instance-wise equivalent to the weak K\"onig's lemma for…
Let $k$ be a field of characteristic $0$, let $\mathsf{C}$ be a finite split category, let $\alpha$ be a 2-cocycle of $\mathsf{C}$ with values in the multiplicative group of $k$, and consider the resulting twisted category algebra…
We consider the problem of testing properties of graphs underlying high-dimensional graphical models. We adopt the model of covariance queries introduced by Lugosi, Truszkowski, Velona, and Zwiernik (2021). We study the case when the…
We identify a premouse inner model $L[\mathbb{E}]$, such that for any coarsely iterable background universe $R$ modelling $\mathrm{ZFC}$, $L[\mathbb{E}]^R$ is a proper class premouse of $R$ inheriting all strong and Woodin cardinals from…
Let $p$ be an odd prime number and $k$ an imaginary quadratic field in which $p$ splits. In this paper, we consider a weak form of Greenberg's generalized conjecture for $p$ and $k$, which states that the non-trivial Iwasawa module of the…
We extend the usual Hilbert property for varieties over fields to arithmetic schemes over integral domains by demanding the set of near-integral points (as defined by Vojta) to be non-thin. We then generalize results of…
We introduce the notions of almost positively closed models and positive strong amalgamation property. We study the fundamental properties of these notions and develop some interactions between them.
The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…
We study various types of consistency of honest decision trees and random forests in the regression setting. In contrast to related literature, our proofs are elementary and follow the classical arguments used for smoothing methods. Under…
Linear connections satisfying the Einstein metricity condition are important in the study of generalized Riemannian manifolds $(M,G=g+F)$, where the symmetric part $g$ of $G$ is a non-degenerate $(0,2)$-tensor, and $F$ is the skew-symmetric…
In this paper we investigate the problem of the distributivity of Kurepa trees. We show that it is consistent that there are Kurepa trees and for every Kurepa tree there is a small forcing notion which adds a branch to it without collapsing…
Strong spatial mixing (SSM) is a form of correlation decay that has played an essential role in the design of approximate counting algorithms for spin systems. A notable example is the algorithm of Weitz (2006) for the hard-core model on…
The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…
It is argued that, in models where the gravitational coupling is scale-dependent, predictions concerning weak gravitational lensing and shear are essentially similar to the ones derived from General Relativity. This is consistent with…
In this paper, the averaging principle is studied for a class of multiscale stochastic partial differential equations driven by $\alpha$-stable process, where $\alpha\in(1,2)$. Using the technique of Poisson equation, the orders of strong…
In this paper we analyse some notions of amoeba for tree forcings. In particular we introduce an amoeba-Silver and prove that it satisfies quasi pure decision but not pure decision. Further we define an amoeba-Sacks and prove that it…
In this paper we investigate some properties of first order theories which prevent them from having universal models under certain cardinal arithmetic assumptions. Our results give a new syntactical condition, oak property, which is a…
Treeging combines the flexible mean structure of regression trees with the covariance-based prediction strategy of kriging into the base learner of an ensemble prediction algorithm. In so doing, it combines the strengths of the two primary…
We introduce a new combinatorial principle which we call $\clubsuit_{AD}$. This principle asserts the existence of a certain multi-ladder system with guessing and almost-disjointness features, and is shown to be sufficient for carrying out…
We first consider the growth of trees by probabilistic attachment of new vertices to leaves. This leads to a growth model based on vertex clusters and probabilities assigned to clusters. This model turns out to be readily applicable to…