EE₈-Lattices and Dihedral Groups

EE8-lattices and dihedral groups

We classify integral rootless lattices which are sums of pairs of EE8-lattices (lattices isometric to √ 2 times the E8-lattice) and which define dihedral groups of orders less than or equal to 12. Most of these may be seen in the Leech lattice. Our classification may help understand Miyamoto involutions on lattice type vertex operator algebras and give a context for the dihedral groups which oc...

Ju n 20 08 EE 8 - lattices and dihedral groups

We classify integral rootless lattices which are sums of pairs of EE8-lattices (lattices isometric to √ 2 times the E8-lattice) and which define dihedral groups of orders less than or equal to 12. Most of these may be seen in the Leech lattice. Our classification may help understand Miyamoto involutions on lattice type vertex operator algebras and give a context for the dihedral groups which oc...

Dihedral Groups

Sumsets in dihedral groups

Let Dn be the dihedral group of order 2n. For all integers r, s such that 1 ≤ r, s ≤ 2n, we give an explicit upper bound for the minimal size μDn (r, s) = min |A · B| of sumsets (product sets) A · B, where A and B range over all subsets of Dn of cardinality r and s respectively. It is shown by construction that μDn (r, s) is bounded above by the known value of μG (r, s), where G is any abelian ...

Calculations of Dihedral Groups Using Circular Indexation

‎In this work‎, ‎a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$‎. ‎Each element of the sequence represents a vertex of the polygon‎. ‎Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis‎. ‎Here each symmetry is considered as a system that takes an input circular sequence and g...