Results 11 to 20 of about 9,099,574 (279)

Codes in Dihedral Group Algebra

open access: yesМоделирование и анализ информационных систем, 2018
Robert McEliece developed an asymmetric encryption algorithm based on the use of binary Goppa codes in 1978 and no effective key attacks has been described yet.
Kirill V. Vedenev, Vladimir M. Deundyak
doaj   +2 more sources

The real genus of cyclic by dihedral and dihedral by dihedral groups [PDF]

open access: yesJournal of Algebra, 2006
Every finite group acts as an automorphism group of several bordered compact Klein surfaces. The minimal genus of these surfaces is called the real genus. At first, the authors of this paper complete May's discussions about the real genus of groups \(C_m\times D_n\) (where \(C_m\) is a cyclic group).
Etayo Gordejuela, José Javier   +1 more
openaire   +3 more sources

Simulations of Cayley graphs of dihedral group [PDF]

open access: yesITM Web of Conferences
Let Γ be a finite group with identity element e and let S ⊆ Γ − {e} which is inverse-closed, i.e., S = S−1 := {s−1 : s ∈ S}. An undirected Cayley graph on a group Γ with connection set S, denoted by Cay(Γ, S), is a graph with vertex set Γ and edges xy ...
Farhan Mohammad   +2 more
doaj   +2 more sources

The connective K theory of semidihedral groups [PDF]

open access: yes, 2010
The real connective K-homology of finite groups ko¤(BG), plays a big role in the Gromov-Lawson-Rosenberg (GLR) conjecture. In order to compute them, we can calculate complex connective K-cohomology, ku¤(BG), first and then follow by computing complex ...
Rodtes, Kijti
core   +7 more sources

A Way to Construct Commutative Hyperstructures

open access: yesComputer Sciences & Mathematics Forum, 2023
This article aims to create commutative hyperstructures, starting with a non-commutative group. Therefore, we consider the starting group to be the dihedral group Dn, where n is a natural number, n>1, and we determine the HX groups associated with the ...
Andromeda Sonea
doaj   +1 more source

Springer Correspondences for Dihedral Groups [PDF]

open access: yesTransformation Groups, 2008
Recent work by a number of people has shown that complex reflection groups give rise to many representation-theoretic structures (e.g., generic degrees and families of characters), as though they were Weyl groups of algebraic groups. Conjecturally, these structures are actually describing the representation theory of as-yet undescribed objects called ''
Achar, P. N., Aubert, A.-M.
openaire   +2 more sources

THE INTERSECTION GRAPH REPRESENTATION OF A DIHEDRAL GROUP WITH PRIME ORDER AND ITS NUMERICAL INVARIANTS

open access: yesBarekeng, 2022
One of the concepts in mathematics that developing rapidly today is Graph Theory. The development of Graph Theory has been combined with Group Theory, that is by representing a group in a graph.
Dewi Santri Ramdani   +2 more
doaj   +1 more source

On the non-commuting graph of dihedral group

open access: yesElectronic Journal of Graph Theory and Applications, 2020
For a nonabelian group G, the non-commuting graph Γ of G is defined as the graph with vertex-set G-Z(G), where Z(G) is the center of G, and two distinct vertices of Γ are adjacent if they do not commute in G.
Sanhan Muhammad Salih Khasraw   +2 more
doaj   +1 more source

Free dihedral actions on abelian varieties

open access: yesCubo, 2021
We give a simple construction for hyperelliptic varieties, defined as the quotient of a complex torus by the action of a finite group $G$ that contains no translations and acts freely, with $G$ any dihedral group. This generalizes a construction given by
Bruno Aguiló Vidal
doaj   +1 more source

Darboux transformation with dihedral reduction group [PDF]

open access: yes, 2014
We construct the Darboux transformation with Dihedral reduction group for the 2-dimensional generalisation of the periodic Volterra lattice. The resulting Bäcklund transformation can be viewed as a nonevolutionary integrable differential difference ...
Papamikos, Georgios   +6 more
core   +1 more source

Home - About - Disclaimer - Privacy