Results 21 to 30 of about 332 (30)

Abelian Carter subgroups in finite permutation groups

, 2013
We show that a finite permutation group containing a regular abelian self-normalizing subgroup is soluble.Comment: 6 ...
Jabara, Enrico, Spiga, Pablo
core   +1 more source

Coloring Groups [PDF]

Discrete Mathematics & Theoretical Computer Science
We introduce coloring groups, which are permutation groups obtained from a proper edge coloring of a graph. These groups generalize the generalized toggle groups of Striker (which themselves generalize the toggle groups introduced by Cameron and Fon-der ...
Ben Adenbaum, Alexander Wilson
doaj   +1 more source

Generalized iterated wreath products of symmetric groups and generalized rooted trees correspondence

, 2018
Consider the generalized iterated wreath product $S_{r_1}\wr \ldots \wr S_{r_k}$ of symmetric groups. We give a complete description of the traversal for the generalized iterated wreath product.
A Kleshchev, Adalbert Kerber, AM Vershik, Barry Simon, DK Maslen, DK Maslen, DN Rockmore, G Mirchandani, Gregory Karpilovsky, JT Astola, JW Cooley, K Balasubramanian, K Balasubramanian, M Clausen, M Leyton, M Schnell, MG Karpovsky, R Foote, R Milot, RC Orellana, T. Ceccherini-Silberstein, Z Daugherty   +21 more
core   +1 more source

Bender–Knuth Billiards in Coxeter Groups

Forum of Mathematics, Sigma
Let $(W,S)$ be a Coxeter system, and write $S=\{s_i:i\in I\}$ , where I is a finite index set. Fix a nonempty convex subset $\mathscr {L}$ of W. If W is of type A, then $\mathscr {L}$ is the set of linear extensions of a poset,
Grant Barkley, Colin Defant, Eliot Hodges, Noah Kravitz, Mitchell Lee   +4 more
doaj   +1 more source

Enumeration of strong dichotomy patterns [PDF]

, 2018
We apply the version of P\'{o}lya-Redfield theory obtained by White to count patterns with a given automorphism group to the enumeration of strong dichotomy patterns, that is, we count bicolor patterns of $\mathbb{Z}_{2k}$ with respect to the action of $\
Agustín-Aquino, Octavio A.
core   +1 more source

Classifying pentavalent symmetric graphs of order 12pq

Open Mathematics
A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Pentavalent symmetric graphs of order 12p, Electron. J. Combin. 18 (2011), no. 1, #P233, DOI: https://doi.org/10.37236/720) and Ling (Classifying pentavalent
Qian Xiaorui, Ling Bo, Yang Jinlong, Zhao Yun   +3 more
doaj   +1 more source

A new infinite family of star normal quotient graphs of twisted wreath type. [PDF]

J Algebr Comb (Dordr), 2023
Kaja E, Morgan L.
europepmc   +1 more source

A group theoretic approach to model comparison with simplicial representations. [PDF]

J Math Biol, 2022
Vittadello ST, Stumpf MPH.
europepmc   +1 more source

Binary codes and partial permutation decoding sets from the odd graphs

Open Mathematics, 2014
Fish Washiela, Fray Roland, Mwambene Eric   +2 more
doaj   +1 more source

Homogeneous isosceles-free spaces. [PDF]

Rev R Acad Cienc Exactas Fis Nat A Mat
Bargetz C, Bartoš A, Kubiś W, Luggin F.   +3 more
europepmc   +1 more source