Permutation groups through invariant relations and invariant functions
By H. Wielandt. 1969
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Haggai Maron
- Siamak Ravanbakhsh
- Nimrod Segol
- Jeff Schneider
- Yaron Lipman
- Barnab'as P'oczos
- Ethan Fetaya
- Peter J. Cameron
Citations in the corpus
- Equivariance Through Parameter-Sharing (2017, background): “Permutation groups (cid:71) that can be expressed in this way are called 2-closed groups (Wielandt, 1969).”
- Quasiprimitive Groups with No Fixed Point Free Elements of Prime Order (2003, background): “See Wielandt [13] for more details on the concept Received 24 April 2001; revised 17 January 2002.”
- Automorphisms of graphs (2003, unknown): “These concepts was introduced by Wielandt [56].”
- Between primitive and 2-transitive: Synchronization and its friends (2015, background): “(b) A theorem of Wielandt [114] asserts that a primitive group G of degree p(2), where p is prime, satisfies one of the following: G is affine; G is contained in Sp wr S2; or G is 2-transitive.”
- Transitive Permutation Groups Without Semiregular Subgroups (2002, background): “Thus by Wielandt’s Dissection Theorem [25, Theorem 6.5], the 2-closure of G contains A6 × A6. q 6.”
- Coherent configurations (1975, background): “The Schur relations are established and applied to obtain general versions of results of Frame [7] and Wielandt [19] in Section 3, and in Section 6 to obtain a general version of the Krein condition of L. L. Scott Jr. [16].”
- On the Universality of Invariant Networks (2019, background): “Groups for which the condition in theorem 3 holds are called 2-closed and were first introduced by (Wielandt, 1969) (see (Babai, 1995) for further study).”
- On the orders of primitive groups (2002, methodology): “Based on Wielandt’s method [20] of bounding the orders of Sylow subgroups Praeger and Saxl [16] obtained an exponential estimate, 4, where n is the degree of the permutation group.”
- A Solution of the Isomorphism Problem for Circulant Graphs (2004, background): “In fact this conjecture goes back to Schur who thought that every S-ring over a 4nite group is Schurian (see [42]).”