نتایج جستجو برای: symmetric group

تعداد نتایج: 1052001  

Journal: :bulletin of the iranian mathematical society 2011
m. shahryari

in this article, we introduce monomial irreducible representations of the special linear lie algebra $sln$. we will show that this kind of representations have bases for which the action of the chevalley generators of the lie algebra on the basis elements can be given by a simple formula.

The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.

Journal: :Pacific Journal of Mathematics 2010

Journal: :Comptes Rendus Mathematique 2018

Journal: :CoRR 2015
Quoc-Cuong To Benjamin Nguyen Philippe Pucheral

The aim of this technical report is to complement the work in [To et al. 2014] by proposing a Group Key Exchange protocol so that the Querier and TDSs (and TDSs themselves) can securely create and exchange the shared key. Then, the security of this protocol is formally proved using the game-based model. Finally, we perform the comparison between this protocol and other related works.

Journal: :CoRR 2016
Mohamed Baouch Juan Antonio López-Ramos Reto Schnyder Blas Torrecillas

In this work, we introduce an active attack on a Group Key Exchange protocol by Burmester and Desmedt. The attacker obtains a copy of the shared key, which is created in a collaborative manner with the legal users in a communication group.

Journal: :علوم 0

let be a set and let be the set of subsets of . the pair in which is a collection of elements of (blocks) is called a design if every element of appears in , times. is called a symmetric design if . in a symmetric design, each element of appears times in blocks of . a mapping between two designs and is an isomorphism if is a one-to-one correspondence and . every isomorphism of a design, , to it...

Let $G$ be a finite group and $Gamma(G)$ the prime graph of $G$‎. ‎Recently people have been using prime graphs to study simple groups‎. ‎Naturally we pose a question‎: ‎can we use prime graphs to study almost‎ ‎simple groups or non-simple groups? In this paper some results in‎ ‎this respect are obtained and as follows‎: ‎$Gcong S_p$ if and only‎ ‎if $|G|=|S_p|$ and $Gamma(G)=Gamma(S_p)$‎, ‎whe...

Journal: :Journal of Algebra 2009

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید