Related papers: Some considerations on Amoeba forcing notions
We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\'{e}nes…
Considering a linearly ordered set, we introduce its symmetric version, and endow it with two operations extending supremum and infimum, so as to obtain an algebraic structure close to a commutative ring. We show that imposing symmetry…
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…
The foundations of forcing theory are reworked to streamline the presentation and to show how the most basic results are applicable in very general contexts.
We introduce and study a family of axioms that closely follows the pattern of parametrized diamonds, studied by Moore, Hru\v{s}\'ak, and D\v{z}amonja in [13]. However, our approach appeals to model theoretic / forcing theoretic notions,…
An absolute continuity approach to quasinormality which relates the operator in question to the spectral measure of its modulus is developed. Algebraic characterizations of some classes of operators that emerged in this context are…
For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…
We prove via a composition lemma, the Kotzig-Ringel-Rosa conjecture, better known as the Graceful Labeling Conjecture. We also prove via a stronger version of the composition lemma a stronger form of the Graceful Labeling Conjecture.
This is an exposition of the first two sections of Chapter VI of Shelah's book Proper and Improper Forcing. It covers various preservation theorems for CS iteration of proper forcing (omega-omega bounding, Sacks property, P-point property,…
In this paper we investigate some properties of forcing which can be considered "nice" in the context of singularizing regular cardinals to have an uncountable cofinality. We show that such forcing which changes cofinality of a regular…
We continue the development of the theory of construction schemes over $\omega_1$ as introduced by the third author by studying their relation with forcing axioms. Formally, we introduce the cardinals $\mathfrak{m}^n_{\mathcal{F}}$ and use…
Despite widespread interest and practical use, the theoretical properties of random forests are still not well understood. In this paper we contribute to this understanding in two ways. We present a new theoretically tractable variant of…
There are various reasons why adding stubs to the vertices of open string field theory (OSFT) is interesting: Not only the stubs can tame certain singularities and make the theory more well-behaved, but also the new theory shares a lot of…
This paper describes experiments, on two domains, to investigate the effect of averaging over predictions of multiple decision trees, instead of using a single tree. Other authors have pointed out theoretical and commonsense reasons 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 develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…
For $f,g\in\omega^\omega$ let $c^\forall_{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$. Let…
A recent flurry of research activity has attempted to quantitatively define "fairness" for decisions based on statistical and machine learning (ML) predictions. The rapid growth of this new field has led to wildly inconsistent terminology…
This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…
We generalize the notion of an exact category and introduce weakly exact categories. A proof of the snake lemma in this general setting is given. Some applications are given to illustrate how one can do homological algebra in a weakly exact…