Partitions of $k$-branching trees and the reaping number of Boolean algebras

Laflamme, Claude. "Partitions of $k$-branching trees and the reaping number of Boolean algebras." Commentationes Mathematicae Universitatis Carolinae 34.2 (1993): 397-399. <http://eudml.org/doc/21949>.

@article{Laflamme1993,
abstract = {The reaping number $\mathfrak \{r\}_\{m,n\}(\{\mathbb \{B\}\})$ of a Boolean algebra $\{\mathbb \{B\}\}$ is defined as the minimum size of a subset $\{\mathcal \{A\}\} \subseteq \{\mathbb \{B\}\}\setminus \lbrace \{\mathbf \{O\}\}\rbrace $ such that for each $m$-partition $\mathcal \{P\}$ of unity, some member of $\mathcal \{A\}$ meets less than $n$ elements of $\mathcal \{P\}$. We show that for each $\{\mathbb \{B\}\}$, $\mathfrak \{r\}_\{m,n\}(\mathbb \{B\}) = \mathfrak \{r\}_\{\lceil \frac\{m\}\{n-1\} \rceil ,2\}(\mathbb \{B\})$ as conjectured by Dow, Steprāns and Watson. The proof relies on a partition theorem for finite trees; namely that every $k$-branching tree whose maximal nodes are coloured with $\ell $ colours contains an $m$-branching subtree using at most $n$ colours if and only if $\lceil \frac\{\ell \}\{n\} \rceil < \lceil \frac\{k\}\{m-1\} \rceil $.},
author = {Laflamme, Claude},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {Boolean algebra; reaping number; partition; -partition of unity; reaping number; -branching tree},
language = {eng},
number = {2},
pages = {397-399},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {Partitions of $k$-branching trees and the reaping number of Boolean algebras},
url = {http://eudml.org/doc/21949},
volume = {34},
year = {1993},
}

TY - JOUR
AU - Laflamme, Claude
TI - Partitions of $k$-branching trees and the reaping number of Boolean algebras
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1993
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 34
IS - 2
SP - 397
EP - 399
AB - The reaping number $\mathfrak {r}_{m,n}({\mathbb {B}})$ of a Boolean algebra ${\mathbb {B}}$ is defined as the minimum size of a subset ${\mathcal {A}} \subseteq {\mathbb {B}}\setminus \lbrace {\mathbf {O}}\rbrace $ such that for each $m$-partition $\mathcal {P}$ of unity, some member of $\mathcal {A}$ meets less than $n$ elements of $\mathcal {P}$. We show that for each ${\mathbb {B}}$, $\mathfrak {r}_{m,n}(\mathbb {B}) = \mathfrak {r}_{\lceil \frac{m}{n-1} \rceil ,2}(\mathbb {B})$ as conjectured by Dow, Steprāns and Watson. The proof relies on a partition theorem for finite trees; namely that every $k$-branching tree whose maximal nodes are coloured with $\ell $ colours contains an $m$-branching subtree using at most $n$ colours if and only if $\lceil \frac{\ell }{n} \rceil < \lceil \frac{k}{m-1} \rceil $.
LA - eng
KW - Boolean algebra; reaping number; partition; -partition of unity; reaping number; -branching tree
UR - http://eudml.org/doc/21949
ER -