Results 71 to 80 of about 104,175 (189)
Cartesian symmetry classes associated with certain subgroups of $S_m$ [PDF]
In this paper, the problem existing $O$-basis for Cartesian symmetry classes is discussed. The dimensions of Cartesian symmetry classes associated with a cyclic subgroup of the symmetric group $S_m$ (generated by a product of disjoint cycles) and the ...
Seyyed Sadegh Gholami, Yousef Zamani
doaj +1 more source
The surgery obstruction groups of the infinite dihedral group
This paper computes the quadratic Witt groups (the Wall L-groups) of the polynomial ring Z[t] and the integral group ring of the infinite dihedral group, with various involutions.
Arf +9 more
core +2 more sources
Automorphisms of the generalized cluster complex
We exhibit a dihedral symmetry in the generalized cluster complex defined by Fomin and Reading. Together with diagram symmetries, they generate the automorphism group of the complex.
Matthieu Josuat-Vergès
doaj +1 more source
The dihedral group $\Dh_5$ as group of symplectic automorphisms on K3 surfaces
We prove that if a K3 surface $X$ admits $\Z/5\Z$ as group of symplectic automorphisms, then it actually admits $\Dh_5$ as group of symplectic automorphisms.
Garbagnati, Alice
core +1 more source
On commutation semigroups of dihedral groups [PDF]
For G a group and g in G, we define mappings pg(G) and lg(G) from G into G by pg(x)=[x,g] and lg(x)=[g,x]. We let P(G) and L(G) denote the subsemigroups of the set of all mappings from G to G generated by {pg: g in G} and {lg: g in G}, respectively. P(G) and L(G) are called the right and left commutation semigroup of G, respectively.
DeWolf, Darien +2 more
openaire +2 more sources
On Direct Products of Dihedral Groups in Locally Finite Groups
When studying infinite groups, as a rule, some finiteness conditions are imposed. For example, they require that the group be periodic, a Shunkov group, a Frobenius group, or a locally finite group.
I. A. Timofeenko, A.A. Shlepkin
doaj +1 more source
On the symmetries of some classes of recursive circulant graphs
A recursive-circulant $G(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$G(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties.
Seyed Morteza Mirafzal
doaj
Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially $q$-analogues, have useful interpretations related to actions and representations of the cyclic group.
Rao, Sujit, Suk, Joe
core
Hurwitz Equivalence in Dihedral Groups
In this paper we determine the orbits of the braid group $B_n$ action on $G^n$ when $G$ is a dihedral group and for any $T \in G^n$. We prove that the following invariants serve as necessary and sufficient conditions for Hurwitz equivalence. They are: the product of its entries, the subgroup generated by its entries, and the number of times each ...
openaire +2 more sources
Spektrum Signless-Laplace dan Spektrum Detour Graf Konjugasi dari Grup Dihedral
Misalkan G graf berhingga yang tidak memuat loop dan sisi rangkap. Matriks keterhubungan titik A(G) dari graf G adalah matriks dengan entri aij = 1 jika vi terhubung langsung dengan vj dan aij = 0 untuk lainnya.
Abdussakir Abdussakir, Rhoul Khasanah
doaj +1 more source

