Definition. Let q be a prime power and e be a divisor of q − 1. Fix a generator α of the multiplicative group of GF (q). Then 〈α〉 is a subgroup of index e and its cosets are 〈α〉α, i = 0, . . . , e− 1. Define R0 = {(x, x)|x ∈ GF (q)} Ri = {(x, y)|x, y ∈ GF (q), x− y ∈ 〈αe〉αi−1}, (1 ≤ i ≤ e) R = {Ri|0 ≤ i ≤ e} Then (GF (q),R) forms an association scheme and is called the cyclotomic scheme of clas...

We relate a generic character sheaf on a disconnected reductive group with a character of the rational points of the group over a finite field extending a known result in the connected case.

the group $2^6{{}^{cdot}} g_2(2)$ is a maximal subgroup of the rudvalis group $ru$ of index 188500 and has order 774144 = $2^{12}.3^3.7$. in this paper, we construct the character table of the group $2^6{{}^{cdot}} g_2(2)$ by using the technique of fischer-clifford matrices.

The group $2^6{{}^{cdot}} G_2(2)$ is a maximal subgroup of the Rudvalis group $Ru$ of index 188500 and has order 774144 = $2^{12}.3^3.7$. In this paper, we construct the character table of the group $2^6{{}^{cdot}} G_2(2)$ by using the technique of Fischer-Clifford matrices.

This is a collection of examples showing how class fusions between character tables can be determined using the GAP system [GAP04]. In each of these examples, the fusion is ambiguous in the sense that the character tables do not determine it up to table automorphisms. Our strategy is to compute first all possibilities with the GAP function PossibleClassFusions, and then to use either other char...

There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The bit-parallel algorithms typically use a size-σ table of match bit-vectors, where the bits in the vector for a character λ identify the positions where the character λ occurs in one of the processed strings, and σ is th...