AbstractWe survey the modern theory of schemes (coherent configurations). The main attention is paid to the schurity problem and the separability problem. Several applications of schemes to constructing polynomial-time algorithms, in particular, graph isomorphism tests, are discussed
Funding: The research of the first author was supported by an Undergraduate Research Bursary, number...
AbstractIn this article, we investigate association schemes S (on finite sets) in which each element...
AbstractAn association scheme is the associated scheme of a superscheme iff it is a permutation grou...
AbstractWe survey the modern theory of schemes (coherent configurations). The main attention is paid...
Every permutation group which is not 2-transitive acts on a non-trivial coherent configuration, but ...
Every permutation group which is not 2-transitive acts on a non-trivial coherent configuration, but ...
Every permutation group which is not 2-transitive acts on a non-trivial coherent configuration, but ...
AbstractIsomorphisms of association schemes are isomorphisms of edge-labeled regular graphs permitti...
AbstractEvery permutation group which is not 2-transitive acts on a non-trivial coherent configurati...
AbstractAssociation schemes were originally introduced by Bose and his co-workers in the design of s...
Abstract. Association schemes were originally introduced by Bose and his co-workers in the design of...
In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p"...
Joint work with K. Coolsaet We are interested in the exhaustive generation (up to isomorphism) by co...
In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p"...
As a concept related to many combinatorial objects (codes, designs, graphs, etc.) association scheme...
Funding: The research of the first author was supported by an Undergraduate Research Bursary, number...
AbstractIn this article, we investigate association schemes S (on finite sets) in which each element...
AbstractAn association scheme is the associated scheme of a superscheme iff it is a permutation grou...
AbstractWe survey the modern theory of schemes (coherent configurations). The main attention is paid...
Every permutation group which is not 2-transitive acts on a non-trivial coherent configuration, but ...
Every permutation group which is not 2-transitive acts on a non-trivial coherent configuration, but ...
Every permutation group which is not 2-transitive acts on a non-trivial coherent configuration, but ...
AbstractIsomorphisms of association schemes are isomorphisms of edge-labeled regular graphs permitti...
AbstractEvery permutation group which is not 2-transitive acts on a non-trivial coherent configurati...
AbstractAssociation schemes were originally introduced by Bose and his co-workers in the design of s...
Abstract. Association schemes were originally introduced by Bose and his co-workers in the design of...
In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p"...
Joint work with K. Coolsaet We are interested in the exhaustive generation (up to isomorphism) by co...
In January 1969, Peter M. Neumann wrote a paper entitled "Primitive permutation groups of degree 3p"...
As a concept related to many combinatorial objects (codes, designs, graphs, etc.) association scheme...
Funding: The research of the first author was supported by an Undergraduate Research Bursary, number...
AbstractIn this article, we investigate association schemes S (on finite sets) in which each element...
AbstractAn association scheme is the associated scheme of a superscheme iff it is a permutation grou...
DOI
Add to ORKG