AbstractIn this paper we deal with equitable partitions of association schemes. We try to generalize a result in group theory and show examples that a generalization of a certain property conjectured for permutation groups does not hold for association schemes
AbstractWe survey the modern theory of schemes (coherent configurations). The main attention is paid...
AbstractLet (X,S) denote an association scheme where X is a finite set. For a prime p we say that (X...
AbstractGiven a finite partially ordered set X, and, for each x in X, an association scheme on a set...
AbstractPartitions on a set are partially ordered by nesting: partition F is nested in partition G i...
AbstractSuppose that (X,G) is a primitive association scheme with |G|≥3 and π is an equitable partit...
This paper defines a new type of product of association schemes (and of the related objects, permuta...
This paper defines a new type of product of association schemes (and of the related objects, permuta...
AbstractLet G be a group acting transitively on a set X such that all subdegrees are finite. Isaacs ...
AbstractLet G be a group acting transitively on a set X such that all subdegrees are finite. Isaacs ...
AbstractWe give some observations on association schemes with a relation of valency 2 from the repre...
AbstractEvery permutation group which is not 2-transitive acts on a non-trivial coherent configurati...
AbstractA necessary and sufficient condition is given for the partition of a finite group to define ...
For any finite group G, and any positive integer n, we construct an association scheme which admits ...
The paper defines a new type of product of association schemes (and of the related objects, permutat...
AbstractLet (X, {Ri}0⩽i⩽d) be a primitive commutative association scheme. If there is a non-symmetri...
AbstractWe survey the modern theory of schemes (coherent configurations). The main attention is paid...
AbstractLet (X,S) denote an association scheme where X is a finite set. For a prime p we say that (X...
AbstractGiven a finite partially ordered set X, and, for each x in X, an association scheme on a set...
AbstractPartitions on a set are partially ordered by nesting: partition F is nested in partition G i...
AbstractSuppose that (X,G) is a primitive association scheme with |G|≥3 and π is an equitable partit...
This paper defines a new type of product of association schemes (and of the related objects, permuta...
This paper defines a new type of product of association schemes (and of the related objects, permuta...
AbstractLet G be a group acting transitively on a set X such that all subdegrees are finite. Isaacs ...
AbstractLet G be a group acting transitively on a set X such that all subdegrees are finite. Isaacs ...
AbstractWe give some observations on association schemes with a relation of valency 2 from the repre...
AbstractEvery permutation group which is not 2-transitive acts on a non-trivial coherent configurati...
AbstractA necessary and sufficient condition is given for the partition of a finite group to define ...
For any finite group G, and any positive integer n, we construct an association scheme which admits ...
The paper defines a new type of product of association schemes (and of the related objects, permutat...
AbstractLet (X, {Ri}0⩽i⩽d) be a primitive commutative association scheme. If there is a non-symmetri...
AbstractWe survey the modern theory of schemes (coherent configurations). The main attention is paid...
AbstractLet (X,S) denote an association scheme where X is a finite set. For a prime p we say that (X...
AbstractGiven a finite partially ordered set X, and, for each x in X, an association scheme on a set...
DOI
Add to ORKG