ZIB

Treffer pro Seite

Treffer 1 - 2 | 2 Treffer

Sortierung

Digitale Medien

On a New High Dimensional Weisfeiler-Lehman Algorithm (1999)

Evdokimov, Sergei ; Karpinski, Marek ; Ponomarenko, Ilia

Springer

Journal of algebraic combinatorics 10 (1999), S. 29-45

zur Merkliste hinzufügen auf der Merkliste

Details

ISSN: 1572-9192

Schlagwort(e): graph isomorphism problem ; cellular algebra ; permutation group

Quelle: Springer Online Journal Archives 1860-2000

Thema: Mathematik

Notizen: Abstract We investigate the following problem: how different can a cellular algebra be from its Schurian closure, i.e., the centralizer algebra of its automorphism group? For this purpose we introduce the notion of a Schurian polynomial approximation scheme measuring this difference. Some natural examples of such schemes arise from high dimensional generalizations of the Weisfeiler-Lehman algorithm which constructs the cellular closure of a set of matrices. We prove that all of these schemes are dominated by a new Schurian polynomial approximation scheme defined by the m-closure operators. A sufficient condition for the m-closure of a cellular algebra to coincide with its Schurian closure is given.

Materialart: Digitale Medien

URL: http://dx.doi.org/10.1023/A:1018672019177

Permalink

Bibliothek	Standort	Signatur	Band/Heft/Jahr	Verfügbarkeit

Andere fanden auch interessant ...

Artikel (Nationallizenzen)

Volltext

Digitale Medien

Isomorphism of Coloured Graphs with Slowly Increasing Multiplicity of Jordan Blocks (1999)

Evdokimov, Sergei ; Ponomarenko, Ilia

Springer

Combinatorica 19 (1999), S. 321-333