Permutation Representations
Permutation Representations is a mathematical framework within graphical representation theory that encodes group actions on combinatorial structures by mapping elements of a permutation group to automorphisms of a graph, thereby representing symmetries through vertex relabelings that preserve adjacency relations.
365
Publications
14.3K
Citations
529
Authors
321
Institutions
Publications per year
2017–2026
31
Parents
365
A new approach to representation theory of symmetric groups
Andreĭ Okounkov, A. M. Vershik · Selecta Mathematica · 1996 · 290 citations
Automorphism groups and isomorphisms of Cayley digraphs
Mingyao Xu · Discrete Mathematics · 1998 · 286 citations
Polynomial-time algorithms for permutation groups
Merrick L. Furst, John E. Hopcroft, Eugene M. Luks · 1980 · 252 citations
1–5 of 365
529
5
h-index
5
h-index
5
h-index
5
h-index
5
h-index
1–5 of 529
321

University of Warwick
Coventry, United Kingdom
10 h-index
14 publications
297 citations

The University of Western Australia
Perth, Australia
8 h-index
11 publications
509 citations
University of California, Santa Cruz
Santa Cruz, United States
6 h-index
8 publications
432 citations

University of Manchester
Manchester, United Kingdom
5 h-index
6 publications
113 citations
Hebrew University of Jerusalem
Jerusalem, Israel
5 h-index
7 publications
212 citations

University of Auckland
Auckland, New Zealand
5 h-index
9 publications
298 citations
University of Southern California
Los Angeles, United States
5 h-index
7 publications
412 citations

Australian National University
Canberra, Australia
5 h-index
11 publications
461 citations
1–8 of 321
24 publications · 772 citations
16
h-index
TRAN · 13 publications · 773 citations
13
h-index
13 publications · 660 citations
12
h-index
9 publications · 268 citations
9
h-index
8 publications · 275 citations
8
h-index
1–5