Table algebras - ScienceDirect Skip to main contentSkip to article Elsevier logo Journals & Books
Search RegisterSign in View PDF Download full issue Search ScienceDirect Elsevier European …

The present text is an introduction to the theory of association schemes. We start with the
de? nition of an association scheme (or a scheme as we shall say brie? y), and in order to …

The notion of pseudocyclic association scheme is generalized to the non-commutative case.
It is proved that any pseudocyclic scheme the rank of which is much more than the valency is …

Hanaki [A. Hanaki, Representations of association schemes and their factor schemes,
Graphs Combin. 19 (2003) 195–201; A. Hanaki, Characters of association schemes and …

Using a backtracking algorithm along with an essential change to the rows of
representatives of known 13 710 027 equivalence classes of Hadamard matrices of order …

This article is a survey on representation theory of association schemes including recent
developments and some applications. A lot of known formulas on complex characters are …

Multiplicities corresponding to irreducible characters are defined for reality-based algebras.
These algebras with a distinguished basis include fusion rings, C-algebras, and the …

In this work we relate the deterministic complexity of factoring polynomials (over finite fields)
to certain combinatorial objects, we call m-schemes, that are generalizations of permutation …

The problem of finding a nontrivial factor of a polynomial points, implicitly appearing in our
factoring algorithm, has an exceptional structure, leading us to the improved time complexity …

Let X be a coherent configuration associated with a transitive group G. In terms of the
intersection numbers of X, a necessary condition for the point stabilizer of G to be a TI …