The problem of matroid-reachability-based packing of arborescences was solved by Kir\'aly. Here we solve the corresponding decomposition problem that turns out to be more complicated. The result is obtained from the solution of the more general problem of matroid-reachability-based $(\ell,\ell')$-limited packing of arborescences where we are given a lower bound $\ell$ and an upper bound $\ell'$ on the total number of arborescences in the packing. The problem is considered for branchings and in directed hypergraphs as well.

翻译：拟阵可达性基础上的有向树打包问题已由Király解决。本文解决相应的分解问题，该问题更为复杂。这一结果源于对更一般的基于拟阵可达性的$(\ell,\ell')$有限有向树打包问题的求解，其中给定打包中有向树总数的下界$\ell$和上界$\ell'$。该问题也针对分支结构和有向超图进行了考虑。