Results 1  10
of
8,884
THE SYMMETRIC GROUPS Sn?
"... ABSTRACT. In order to answer the question “what is the asymptotic theory of representations of Sn ” we will present two concrete problems. In both cases the solution requires a good understanding of the product (convolution) of conjugacy classes in the symmetric group and we will present a combinato ..."
Abstract
 Add to MetaCart
ABSTRACT. In order to answer the question “what is the asymptotic theory of representations of Sn ” we will present two concrete problems. In both cases the solution requires a good understanding of the product (convolution) of conjugacy classes in the symmetric group and we will present a
A Cryptosystem Based on the Symmetric Group Sn
"... This paper proposes a public key cryptosystem based on the symmetric group Sn, and validates its theoretical foundation. The proposed system benefits from the algebraic properties of Sn such as non commutative, high computational speed and high flexibility in selecting keys which make the Discrete L ..."
Abstract
 Add to MetaCart
This paper proposes a public key cryptosystem based on the symmetric group Sn, and validates its theoretical foundation. The proposed system benefits from the algebraic properties of Sn such as non commutative, high computational speed and high flexibility in selecting keys which make the Discrete
REPRESENTATIONS OF SOME HOPF ALGEBRAS ASSOCIATED TO THE SYMMETRIC GROUP Sn
, 2007
"... In this paper we study the representations of two semisimple Hopf algebras related to the symmetric group Sn, namely the bismash products Hn = k Cn #kSn−1 and its dual Jn = k Sn−1 #kCn = (Hn) ∗ , where k is an algebraically closed field of ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
In this paper we study the representations of two semisimple Hopf algebras related to the symmetric group Sn, namely the bismash products Hn = k Cn #kSn−1 and its dual Jn = k Sn−1 #kCn = (Hn) ∗ , where k is an algebraically closed field of
On the zeroes of Artin Lseries of irreducible characters of the symmetric group S_n
, 1992
"... ..."
REPRESENTATIONS OF THlTI SYMMETRIC GROUP Sn ON K[:cl,···,:I:"l
"... ABSTRACT. The representations of the symmetric group were stndied initially by Frobenius, Sclmr and Young. In more recent work,.Tames ([3] and [4]) ckseribes the irreducible representat.ions of Sn in terms of Specht. modules, and FarahatPeel ([2]) in t.erms of ideals in the group algebra. In this w ..."
Abstract
 Add to MetaCart
ABSTRACT. The representations of the symmetric group were stndied initially by Frobenius, Sclmr and Young. In more recent work,.Tames ([3] and [4]) ckseribes the irreducible representat.ions of Sn in terms of Specht. modules, and FarahatPeel ([2]) in t.erms of ideals in the group algebra
On the distribution of the length of the longest increasing subsequence of random permutations
 J. Amer. Math. Soc
, 1999
"... Let SN be the group of permutations of 1, 2,...,N. If π ∈ SN,wesaythat π(i1),...,π(ik) is an increasing subsequence in π if i1 <i2 <·· · <ikand π(i1) < π(i2) < ···<π(ik). Let lN (π) be the length of the longest increasing subsequence. For example, if N =5andπis the permutation 5 1 ..."
Abstract

Cited by 495 (33 self)
 Add to MetaCart
Let SN be the group of permutations of 1, 2,...,N. If π ∈ SN,wesaythat π(i1),...,π(ik) is an increasing subsequence in π if i1 <i2 <·· · <ikand π(i1) < π(i2) < ···<π(ik). Let lN (π) be the length of the longest increasing subsequence. For example, if N =5andπis the permutation 5 1
The qanalogue of the alternating group and its representations
 J. Algebra
"... Frobenius began the study of representation theory and character theory of the symmetric groups Sn at ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
Frobenius began the study of representation theory and character theory of the symmetric groups Sn at
Dynamic programming algorithm optimization for spoken word recognition
 IEEE TRANSACTIONS ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING
, 1978
"... This paper reports on an optimum dynamic programming (DP) based timenormalization algorithm for spoken word recognition. First, a general principle of timenormalization is given using timewarping function. Then, two timenormalized distance definitions, ded symmetric and asymmetric forms, are der ..."
Abstract

Cited by 788 (3 self)
 Add to MetaCart
This paper reports on an optimum dynamic programming (DP) based timenormalization algorithm for spoken word recognition. First, a general principle of timenormalization is given using timewarping function. Then, two timenormalized distance definitions, ded symmetric and asymmetric forms
Ariadne: a secure ondemand routing protocol for ad hoc networks," in
 Proc. 8th ACM International Conf. Mobile Computing Networking ,
, 2002
"... Abstract An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing prob ..."
Abstract

Cited by 925 (12 self)
 Add to MetaCart
Abstract An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing
How to leak a secret
 PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON THE THEORY AND APPLICATION OF CRYPTOLOGY AND INFORMATION SECURITY: ADVANCES IN CRYPTOLOGY
, 2001
"... In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures, and ..."
Abstract

Cited by 2580 (4 self)
 Add to MetaCart
In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures
Results 1  10
of
8,884