2 problems

Let $\mathfrak{B}_0\supset \mathfrak{B}_1\supset\cdots$ be an $m$-dimensional linear-fragmentation process, and for $1\leq d\leq m$ let $\mathfrak{m}_d^{(N)}$ denote the maximum pr…

A linear-fragmentation process is a continuous process with finite mean, variance, and third moment. Maximum-criterion conjecture. Every linear-fragmentation process satisfies the…