Related papers: Coherent forests
A 1965 problem due to Danzer asks whether there exists a set in Euclidean space with finite density intersecting any convex body of volume one. A recent approach to this problem is concerned with the construction of dense forests and is…
The parameterized proxy principles were introduced by Brodsky and Rinot in a 2017 paper, as new foundations for the construction of $\kappa$-Souslin trees in a uniform way that does not depend on the nature of the (regular uncountable)…
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…
An algorithm is proposed for constructing directed spanning forests of the minimum weight, in which the maximum possible degree of affinity between the minimum forests is preserved when the number of trees changes. The correctness of the…
Assuming Jenson's principle diamond: Whenever B is a totally imperfect set of real numbers, there is special Aronszajn tree with no continuous order preserving map into B.
We show that under the proper forcing axiom the class of all Aronszajn lines behave like $\sigma$-scattered orders under the embeddability relation. In particular, we are able to show that the class of better quasi order labeled fragmented…
Hash codes are a very efficient data representation needed to be able to cope with the ever growing amounts of data. We introduce a random forest semantic hashing scheme with information-theoretic code aggregation, showing for the first…
Consider the following process on a simple graph without isolated vertices: Order the edges randomly and keep an edge if and only if it contains a vertex which is not contained in some preceding edge. The resulting set of edges forms a…
We study the relationship between several constructions of symplectic realizations of a given Poisson manifold. Our main result is a general formula for a formal symplectic realization in the case of an arbitrary Poisson structure on…
A 1965 problem due to Danzer asks whether there exists a set with finite density in Euclidean space intersecting any convex body of volume one. A suitable weakening of the volume constraint leads to the (much more recent) problem of…
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 show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions preserving a given Souslin tree T. The proof uses a Neeman style iteration with generalized side conditions consisting…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
Random forests are popular methods for regression and classification analysis, and many different variants have been proposed in recent years. One interesting example is the Mondrian random forest, in which the underlying constituent trees…
The last decade has witnessed a growing interest in random forest models which are recognized to exhibit good practical performance, especially in high-dimensional settings. On the theoretical side, however, their predictive power remains…
For any countable group with infinite conjugacy classes we construct a family of forests on the group. For each of them there is a random walk on the group with the property that its sample paths almost surely converge to the geometric…
We show that if $cf(2^{\aleph_0})=\aleph_1,$ then any non-trivial $\aleph_1$-closed forcing notion of size $\leq 2^{\aleph_0}$ is forcing equivalent to $Add(\aleph_1, 1),$ the Cohen forcing for adding a new Cohen subset of $\omega_1.$ We…
We investigate some versions of amoeba for tree-forcings in the generalized Cantor and Baire spaces. This answers [10, Question 3.20] and generalizes a line of research that in the standard case has been studied in [11], [13], and [7].…
We show that under certain circumstances wide Aronszajn trees can be specialized iteratively without adding reals. We then use this fact to study forcing axioms compatible with CH and list some open problems.
Building on recent work of Krueger and the second author, we prove the consistency of the Guessing Model Principle at $\omega_2$ together with the existence of an almost Kurepa Suslin tree. In particular, it is consistent that the Guessing…