Irreducible tensor products of representations of finite quasi-simple groups of Lie type

2012 ◽  
Author(s):  
Kay Magaard ◽  
Ρham Huu Tiep
Keyword(s):  
Tensor Products ◽  
Simple Groups ◽  
Irreducible Tensor ◽  
Groups Of Lie Type

scholarly journals Finite simple exceptional groups of Lie type in which all subgroups of odd index are pronormal

2020 ◽  
Vol 23 (6) ◽  
pp. 999-1016
Author(s):  
Anatoly S. Kondrat’ev ◽  
Natalia V. Maslova ◽  
Danila O. Revin
Keyword(s):  
Simple Groups ◽  
Finite Simple Groups ◽  
Exceptional Groups ◽  
Odd Index ◽  
Groups Of Lie Type

AbstractA subgroup H of a group G is said to be pronormal in G if H and {H^{g}} are conjugate in {\langle H,H^{g}\rangle} for every {g\in G}. In this paper, we determine the finite simple groups of type {E_{6}(q)} and {{}^{2}E_{6}(q)} in which all the subgroups of odd index are pronormal. Thus, we complete a classification of finite simple exceptional groups of Lie type in which all the subgroups of odd index are pronormal.

scholarly journals Walks on graphs as symmetric or asymmetric tools to encrypt data

2002 ◽  
Vol 20 (1) ◽  
pp. 34 ◽  
Author(s):  
V. A. Ustimenko ◽  
Y. M. Khmelevsky
Keyword(s):  
Real Life ◽  
Theoretical Method ◽  
General Idea ◽  
Simple Groups ◽  
Prototype Model ◽  
Encryption Scheme ◽  
Symmetric Encryption ◽  
Encrypt Data ◽  
Rank 2 ◽  
Groups Of Lie Type

New results on graph theoretical method of encryption will be presented. The general idea is to treat vertices of a graph as messages, and walks of a certain length as ecnryption tools. We will construct one-time pad algorithms with a certain resistance to attacks when the adversary knows plaintext and ciphertext. Special linguistic graphs of high girth whose vertices (messages) and walks (encoding tools) could be both naturally identified with vectors over the finite field, and with the so-called parallelotopic graphs, which turn out to be efficient tools for symmetric encryption. We will formulate criteria when parallelotopic graph (or the more general graph of tactical configuration) is a graph of absolutely optimal encryption scheme, producing asymptotic one-time pad algorithm. We will show how to convert one-time pads, which are related to geometries of rank 2 of simple groups of Lie type, to a real-life encryption scheme involving potentially infinite text and flexible passwords. We will discuss families of linguistic and parallelotopic graphs of increasing girth as the source for the generation of asymmetric cryptographic functions and related open key algorithms. We will construct new families of such graphs via group theoretical and geometrical technique. The software for symmetric and asymmetric ecnryption (prototype model of the package) is ready for demonstration.

scholarly journals On the Steinberg Character of a Finite Simple Group of Lie Type

1971 ◽  
Vol 12 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Bhama Srinivasan
Keyword(s):  
Algebraic Group ◽  
Linear Algebraic Group ◽  
Simple Groups ◽  
Closed Field ◽  
Finite Simple Groups ◽  
Reductive Algebraic Group ◽  
Simple Algebraic Group ◽  
Simply Connected ◽  
Groups Of Lie Type ◽  
Steinberg Character

Let K be an algebraically closed field of characteristic ρ >0. If G is a connected, simple connected, semisimple linear algebraic group defined over K and σ an endomorphism of G onto G such that the subgroup Gσ of fixed points of σ is finite, Steinberg ([6] [7]) has shown that there is a complex irreducible character χ of Gσ with the following properties. χ vanishes at all elements of Gσ which are not semi- simple, and, if x ∈ G is semisimple, χ(x) = ±n(x) where n(x)is the order of a Sylow p-subgroup of (ZG(x))σ (ZG(x) is the centraliser of x in G). If G is simple he has, in [6], identified the possible groups Gσ they are the Chevalley groups and their twisted analogues over finite fields, that is, the ‘simply connected’ versions of finite simple groups of Lie type. In this paper we show, under certain restrictions on the type of the simple algebraic group G an on the characteristic of K, that χ can be expressed as a linear combination with integral coefficients of characters induced from linear characters of certain naturally defined subgroups of Gσ. This expression for χ gives an explanation for the occurence of n(x) in the formula for χ (x), and also gives an interpretation for the ± 1 occuring in the formula in terms of invariants of the reductive algebraic group ZG(x).

ON A CONJECTURE ON THE PERMUTATION CHARACTERS OF FINITE PRIMITIVE GROUPS

2019 ◽  
Vol 102 (1) ◽  
pp. 77-90
Author(s):  
PABLO SPIGA
Keyword(s):  
Fixed Point ◽  
Finite Group ◽  
Simple Group ◽  
Simple Groups ◽  
Alternating Group ◽  
Permutation Groups ◽  
Sporadic Simple Group ◽  
Almost Simple Groups ◽  
A Finite Group ◽  
Groups Of Lie Type

Let $G$ be a finite group with two primitive permutation representations on the sets $\unicode[STIX]{x1D6FA}_{1}$ and $\unicode[STIX]{x1D6FA}_{2}$ and let $\unicode[STIX]{x1D70B}_{1}$ and $\unicode[STIX]{x1D70B}_{2}$ be the corresponding permutation characters. We consider the case in which the set of fixed-point-free elements of $G$ on $\unicode[STIX]{x1D6FA}_{1}$ coincides with the set of fixed-point-free elements of $G$ on $\unicode[STIX]{x1D6FA}_{2}$, that is, for every $g\in G$, $\unicode[STIX]{x1D70B}_{1}(g)=0$ if and only if $\unicode[STIX]{x1D70B}_{2}(g)=0$. We have conjectured in Spiga [‘Permutation characters and fixed-point-free elements in permutation groups’, J. Algebra299(1) (2006), 1–7] that under this hypothesis either $\unicode[STIX]{x1D70B}_{1}=\unicode[STIX]{x1D70B}_{2}$ or one of $\unicode[STIX]{x1D70B}_{1}-\unicode[STIX]{x1D70B}_{2}$ and $\unicode[STIX]{x1D70B}_{2}-\unicode[STIX]{x1D70B}_{1}$ is a genuine character. In this paper we give evidence towards the veracity of this conjecture when the socle of $G$ is a sporadic simple group or an alternating group. In particular, the conjecture is reduced to the case of almost simple groups of Lie type.

A conjecture of Frobenius and the simple groups of Lie type, I

1984 ◽  
Vol 42 (4) ◽  
pp. 344-347 ◽  
Author(s):  
Hiroyoshi Yamaki
Keyword(s):  
Simple Groups ◽  
Type I ◽  
Groups Of Lie Type
Sign in / Sign up

Export Citation Format

Share Document