Abstract
Roughly speaking, a splitting element of a matrix algebra is an element with a maximal number of eigenvalues. Using randomization, splitting elements can be found very easily and have proved to be extremely useful in computational representation theory. Efficient deterministic algorithms for finding splitting elements have been known only for
... read more