Let be a finite permutation group acting on a set . A sequence of k distinct elements of is a base for G if the only element of which fixes every pointwise is the identity element of . Bases and strong generating sets are concepts of importance in computational group theory. A base and a strong generating set (together often called a BSGS) for a group can be obtained using the Schreier–Sims algorithm.