Related papers: Some combinatorial properties of splitting trees
We study the subdivision properties of certain lattice gauge theories based on the groups $Z_{2}$ and $Z_{3}$, in four dimensions. The Boltzmann weights are shown to be invariant under all type $(k,l)$ subdivision moves, at certain discrete…
Assuming $\rm PFA$, we shall use internally club $\omega_1$-guessing models as side conditions to show that for every tree $T$ of height $\omega_2$ without cofinal branches, there is a proper and $\aleph_2$-preserving forcing notion with…
We show that the tree property, stationary reflection and the failure of approachability at $\kappa^{++}$ are consistent with $\mathfrak{u}(\kappa) = \kappa^+ < 2^\kappa$, where $\kappa$ is a singular strong limit cardinal with the…
We study selective and game-theoretic versions of properties like the ccc, weak Lindel\"ofness and separability, giving various characterizations of them and exploring connections between these properties and some classical cardinal…
We construct a model in which the tree property holds in $\aleph_{\omega + 1}$ and it is destructible under $\text{Col}(\omega, \omega_1)$. On the other hand we discuss some cases in which the tree property is indestructible under small or…
A cardinal $\lambda$ satisfies a property P robustly if, whenever $\mathbb{Q}$ is a forcing poset and $|\mathbb{Q}|^+ < \lambda$, $\lambda$ satisfies P in $V^{\mathbb{Q}}$. We study the extent to which certain reflection properties of large…
We propose Partition Tree, a novel tree-based framework for conditional density estimation over general outcome spaces that supports both continuous and categorical variables within a unified formulation. Our approach models conditional…
We prove the following indistinguishability theorem for $k$-tuples of trees in the uniform spanning forest of $\mathbb{Z}^d$: Suppose that $\mathscr{A}$ is a property of a $k$-tuple of components that is stable under finite modifications of…
We investigate infinite versions of vector and affine space partition results, and thus obtain examples and a counterexample for a partition problem for relational structures. In particular we provide two (related) examples of an age…
We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds, but a strong form of this theorem does not hold. Translating these…
Given a tree of weighted vertices, it is sometimes possible to break the tree into two equally-weighted subtrees within an allowable error. We give a fast algorithm that finds an edge which breaks the tree into equal-weight components or…
Assuming the existence of a strong cardinal $\kappa$ and a measurable cardinal above it, we force a generic extension in which $\kappa$ is a singular strong limit cardinal of any prescribed cofinality, and such that the tree property holds…
Orderability, weak orderability and the existence of continuous weak selections on filter spaces (i.e., spaces with a single non-isolated point) and their products are discussed. We prove that a closed continuous image X of a suborderable…
We consider a property stronger than the Sacks property, called the shrink wrapping property, which holds between the ground model and each Sacks forcing extension. Unlike the Sacks property, the shrink wrapping property does not hold…
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…
We study a notion of potential isomorphism, where two structures are said to be potentially isomorphic if they are isomorphic in some generic extension that preserves stationary sets and does not add new sets of cardinality less than the…
We strengthen the property $\Delta$ of a function $f:[\omega_2]^2\rightarrow [\omega_2]^{\leq \omega}$ considered by Baumgartner and Shelah. This allows us to consider new types of amalgamations in the forcing used by Rabus, Juh\'asz and…
For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…
Dobrinen, Hathaway and Prikry studied a forcing $\mathbb{P}_\kappa$ consisting of perfect trees of height $\lambda$ and width $\kappa$ where $\kappa$ is a singular $\omega$-strong limit of cofinality $\lambda$. They showed that if $\kappa$…
We prove explicit congruences modulo powers of arbitrary primes for three smallest parts functions: one for partitions, one for overpartitions, and one for partitions without repeated odd parts. The proofs depend on $\ell$-adic properties…