The Benson–Solomon systems comprise an infinite ascending family of simple exotic fusion at the prime 2. results we prove give significant additional evidence that these are only 2-fusion systems, as conjectured by Solomon. We consider a saturated system F having involution centralizer with component C isomorphic to system, and show under rather general hypotheses cannot be simple. Furthermore,...

Cli ord Lau [email protected] Jim Burr [email protected] Pat Shoemaker [email protected] Alice Chiang [email protected] Tony Montalvo [email protected] Shaolin Li [email protected] Nathan Zeldes [email protected] Torsten Lehmann torsten@ei el.ei.dth.dk Michael Chuang [email protected] Hans Peter Graf [email protected] Andreas Andreou [email protected]...

Due to the complexity in structure and the various distortions (translation, rotation, shifting, and deformation) in different writing styles of Handwritten Chinese Characters(HCCs), it is moresuitable to use astructural matching algorithm for computer recognition of HCC. Relaxation matching is a powerful technique which can tolerate considerable distortion. However, most relaxation techniques ...