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...

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...

The full automorphism group of $U_6(2)$ is a group of the form $U_6(2){:}S_3$. The group $U_6(2){:}S_3$ has a maximal subgroup $2^9{:}(L_3(4){:}S_3)$ of order 61931520. In the present paper, we determine the Fischer-Clifford matrices (which are not known yet) and hence compute the character table of the split extension $2^9{:}(L_3(4){:}S_3)$.

In the character theory of finite groups the Burnside-Brauer Theorem is a wellknown result which deals with products of characters in finite groups. In this paper, we first define the character products for table algebras and then by observing the relationship between the characters of a table algebra and the characters of its quotient, we provide a condition in which the products of characters...