We prove a conjecture by Dipper, James, and Murphy that a bipartition is restricted if and only if it is Kleshchev. Hence, the restricted bipartitions naturally label the crystal graphs of level 2 irreducible integrable Uv.bsle/-modules and the simple modules of Hecke algebras of type Bn in the non semisimple case.

We present a system for UAV obstacle detection on embedded hardware based on Sarnoff Corp's Acadia I vision processor for 23Hz 640x480 binocular stereo and 10Hz mincut based recursive bipartition of an affinity graph. We briefly describe the system architecture, followed by performance results on simulated imagery, indoor and outdoor imagery, and flight experiments.

The purpose of the paper is to outline MULTI-PRIDE, a system for supporting multi-layered printed wiring board design. It consists of (i) circuit bipartition, (ii) placement and routing on each outside layer, (iii) modi cation of wiring and compaction, and (iv) routing on inside layers.

Abstract We prove that if M and N are finitary matroids on a common countable edge set E then they admit independent I such there is bipartition = ? for which ? spans in N. It answers positively the Matroid Intersection Conjecture of Nash-Williams case.

Regular triangulations of products of lattice polytopes are constructed with the additional property that the dual graphs of the triangulations are bipartite. The (weighted) size difference of this bipartition is a lower bound for the number of real roots of certain sparse polynomial systems by recent results of Soprunova and Sottile [Adv. Math. 204(1):116–151, 2006]. Special attention is paid ...