منابع مشابه
On dihedrants admitting arc-regular group actions
We consider Cayley graphs Γ over dihedral groups, dihedrants for short, which admit an automorphism group G acting regularly on the arc set of Γ . We prove that, if D2n ≤G≤ Aut(Γ ) is a regular dihedral subgroup of G of order 2n such that any of its index 2 cyclic subgroups is core-free in G, then Γ belongs to the family of graphs of the form (Kn1 ⊗ · · · ⊗Kn )[Kc m], where 2n= n1 · · ·n m, and...
متن کاملRing Theory, Group Actions, Evolutionary Algorithms, and Global Optimization
In this paper we explain, using dynamical systems analysis, how evolutionary algorithms (EAs) solve global optimization problems. We start with a basic definition of EAs and a baseline random heuristic. Vose and Wright’s 1998 generalization of the Vose simple evolutionary algorithm model allows us to characterize alphabets of different lengths as multiplication and addition over rings of intege...
متن کاملGroup Actions
The symmetric groups Sn, alternating groups An, and (for n ≥ 3) dihedral groups Dn behave, by their very definition, as permutations on certain sets. The groups Sn and An both permute the set {1, 2, . . . , n} and Dn can be considered as a group of permutations of a regular n-gon, or even just of its n vertices, since rigid motions of the vertices determine where the rest of the n-gon goes. If ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2005
ISSN: 1015-8634
DOI: 10.4134/bkms.2005.42.4.807