Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most k paths [6]. The multicommodity variant of this problem is a natural generalization of disjoint paths and unsplittable flow problems. Constructing a k–splittable flow requires two interdepending decisions. One has to decide ...

Bilexical context-free grammars (2-LCFGs) have proved to be accurate models for statistical natural language parsing. Existing dynamic programming algorithms used to parse sentences under these models have running time of O(|w|4), where w is the input string. A 2-LCFG is splittable if the left arguments of a lexical head are always independent of the right arguments, and vice versa. When a 2-LC...

We show that Z-cyclic splittable triplewhist tournament designs exist for all primes of the form p = 8t + 1, t odd, except possibly p = 41.

Kleshchev has recently [7] classi®ed those modules for the symmetric group which have semisimple restriction to any Young subgroup. We determine Ext K Sd …D ;D m† where D l and D m are K Sd -modules of this type, called completely splittable. As a corollary of this and recent work of Kleshchev and Nakano, we can determine ExtGL n…K†……L…l†;L…m†† for certain simple GLn…K†-modules L…l† and L…m†. 1...

A permutation class C is said to be splittable if there exist two proper subclasses , B ? such that any ? ? can red–blue colored so the red (respectively, blue) subsequence of order isomorphic an element ). The composable exists some number 1 … k written as ? ? ? for i . We answer a question Karpilovskij by showing not splittable. also give condition under which infinite must