A classical theorem on character degrees states that if a finite group has fewer than four degrees, then the is solvable. We prove corresponding result values by showing eight in its table, This confirms conjecture of T. Sakurai. also classify non-solvable groups with exactly values.

Generalizing results on spin character degrees, we determine for a given conjugacy class of odd type in the double cover of S n spin characters of S n which have the minimal 2-power on this class in their character value. Surprisingly, the Glaisher map plays an important r^ ole here.

Generalizing results on spin character degrees, we determine for a given conjugacy class of odd type in the double cover of S n spin characters of S n which have the minimal 2-power on this class in their character value. Surprisingly, the Glaisher map plays an important r^ ole here.

This paper is about the visual requirements for reading with normal vision. It is the first in a series devoted to the psychophysics of reading with normal and low vision. We have measured reading rates for text scanned across the face of a TV monitor while varying parameters that are important in current theories of pattern vision. Our results provide estimates of the stimulus parameters requi...

OBJECTIVE To test the display luminance hypothesis of the positive polarity advantage and gain insights for display design, the joint effects of display polarity and character size were assessed with a proofreading task BACKGROUND Studies have shown that dark characters on light background (positive polarity) lead to better legibility than do light characters on dark background (negative pola...