Related papers: Some combinatorial properties of splitting trees
This note presents a simple criterion for the tightness of stochastic fragmentation processes. Our work is motivated by an application to a fragmentation process derived from deleting edges in a conditioned Galton-Watson tree studied by…
We provide a constructive characterization of the trees for which the Roman domination number strongly equals the weak Roman domination number, that is, for which every weak Roman dominating function of minimum weight is a Roman dominating…
Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…
We introduce a new compactness principle which we call the gluing property. For a measurable cardinal $\kappa$ and a cardinal $\lambda$, we say that $\kappa$ has the $\lambda$-gluing property if every sequence of $\lambda$-many…
It is proved that the space of differential forms with weak exterior and co-derivative, is compactly embedded into the space of square integrable differential forms. Mixed boundary conditions on weak Lipschitz domains are considered.…
We give a model where there is a ccc Souslin forcing which does not satisfy the Knaster condition. Next, we present a model where there is a sigma-linked not sigma-centered Souslin forcing such that all its small subsets are sigma-centered…
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
We introduce a method of constructing a forcing along a simplified $(\kappa,1)$-morass such that the forcing satisfies the $\kappa$-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain…
We define the strong splitting number, prove that it equals s when exists, and put some restrictions on the possibility that s is a singular carcinal.
We consider the second-order in time Strang-splitting approximation for vector-valued and matrix-valued Allen-Cahn equations. Both the linear propagator and the nonlinear propagator are computed explicitly. For the vector-valued case, we…
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
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…
For g < f in omega^omega we define c(f,g) be the least number of uniform trees with g-splitting needed to cover a uniform tree with f-splitting. We show that we can simultaneously force aleph_1 many different values for different functions…
After small forcing, any < kappa-closed forcing will destroy the supercompactness, even the strong compactness, of kappa .
This paper presents the main results in my Ph.D. thesis. In what follows several proofs of SCH are presented introducing a family of covering properties which implies both SCH and the failure of various forms of square. These covering…
The strength of a multivariate homogeneous polynomial is the minimal number of terms in an expression as a sum of products of lower-degree homogeneous polynomials. Partition rank is the analogue for multilinear forms. Both ranks can drop…
In this paper we prove that the tree property can hold on regular cardinals in an interval which overlaps a strong limit cardinal. This is a crucial milestone in the long term project, tracing back to a question raised by Foreman and…
We study a notion of deformation for simplicial trees with group actions (G-trees). Here G is a fixed, arbitrary group. Two G-trees are related by a deformation if there is a finite sequence of collapse and expansion moves joining them. We…
Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…
We give a combinatorial characterization of countable submaximal subspaces of $2^\kappa$. Using a parametrized version of Mathias forcing, we prove that there exists a countable submaximal subspace of $2^{\omega_1}$ whilst…