Automorphically rigid group algebras. II. Modular algebras

A deformation-theoretic version of Maschke's theorem for modular group algebras: The commutative case

It is shown that (1) every almost self-injective group algebra is self-injective and (2) if the group algebra KG is continuous, then G is a locally finite group. Furthermore, it follows that the following assertions are equivalent: a CS group algebra KG is continuous; KG is principally self-injective; the group G is locally finite.

We classify, in terms of the structure of the finite group G, all group algebras KG for which all right ideals are right annihilators of principal left ideals. This means in the language of coding theory that we classify code-checkable group algebras KG which have been considered so far only for abelian groups G. Optimality of checkable codes and asymptotic results are discussed.

Let K be any field of characteristic zero. We show that there are at least four ideals in the group algebra KG of every simple locally finite group G of 1-type, thus providing the final step in solving an old question of I. Kaplansky's for locally finite groups. We also determine the ideal lattice in KG for those 1-type groups G which are a direct limit of finite direct products of alternating groups.

Using representation theoretical methods we investigate self-dual group codes and their extensions in characteristic 2. We prove that the existence of a self-dual extended group code heavily depends on a particular structure of the group algebra KG which can be checked by an easy-to-handle criteria in elementary number theory. Surprisingly, in the binary case such a code is doubly even if the converse of Gleason's theorem holds true, i.e., the length of the code is divisible by 8. Furthermore, we give a short representation theoretical proof of an earlier result of Sloane and Thompson which states that a binary self-dual group code is never doubly even if the Sylow 2-subgroups of G are cyclic. It turns out that exactly in the case of a cyclic or Klein four group as Sylow 2-subgroup doubly even group codes do not exist.

On modules with cyclic vertices in the Auslander-Reiten quiver

A cluster tilting module for a representation-infinite block of a group algebra

Lie properties of symmetric elements in group rings

Let K be a field of characteristic p ≠ 2 and let G be any group. A characterization of group algebras KG satisfying the Lie identity [[x,y],[u,v],[z,t]] = 0 for all x,y,u,v,z,t ∈ KG is obtained.

1.1. Let G be a connected reductive algebraic group defined over a finite (prime) field Fp of p elements. For a given rational G-module M one can consider the restrictions of M to the restricted Lie algebra Lie(G) and to the finite group G(Fp) of Fp-rational points. Even though there is no direct functorial connection between the categories of restricted Lie(G)-modules and G(Fp)-modules, the ambient algebraic group G can serve as a bridge linking these two important module categories. Early results of Curtis in the 1960s provided a one-to-one correspondence between the simple restricted modules (over k = Fp) of Lie(G) and those of G(Fp). This correspondence is given by simply restricting certain classes of simple G-modules. More importantly, these results, along with work of Steinberg, allow one to easily transfer the questions pertaining to the computation of irreducible characters among these three categories. For over thirty years, this approach has been one of the main ideas used to relate the representation and cohomology theory of algebraic groups, Lie algebras, and finite groups of Lie type (in the defining characteristic) (see, e.g., [CPSvan], [Jan2], [Hum3], and [Jan1]). Given the previous results in this area, a natural course of investigation should be to find relationships between canonical modules, like projective modules, for Lie(G) and G(Fp). More precisely,

Наведено порівняльний аналіз відомих протоколів узгодження таємного ключа через відкритий канал звʼязку. Запропоновано узагальнення відомого протоколу з використанням некомутативного множення матриць над простим скінченним полем на випадок довільного скінченного поля. A symmetric cryptosystem requires a secret key agreed by both parties. The Diffie-Hellman protocol was originally proposed for its exchange via an open communication channel. It is based on the computational complexity of the discrete logarithm problem in certain finite groups (the multiplicative group of a finite field, the group of points of an elliptic curve over a finite field). The availability of a powerful quantum computer will allow solving the discrete logarithm problem in these groups. Therefore, the issue of construction of secret key exchange protocols that will be resistant to attacks using a quantum computer has become urgent. The paper provides a comparative analysis of known protocols for a secret key exchange via an open communication channel. A generalization of the known protocol using non-commutative matrix multiplication over a prime finite field for the case of an arbitrary finite field is proposed. In this protocol, two high order elements from the general linear group over a finite field should be used, which satisfy an additional condition. It consists in the fact that each of the matrices cannot be reduced to a diagonal form by conjugation transformation. This condition follows from the considerations of avoiding an attack on the protocol. It is shown how to construct such elements. For the proposed generalization of the protocol, the sizes of public and private keys, secret key, the size of the finite field, which ensure the appropriate level of security, are calculated. The dimensions of matrices (elements of the general linear group) that we use are also given. The generalization of the protocol to the case of an arbitrary finite field increases the flexibility of choosing protocol parameters to ensure the desired level of security.

This thesis presents some contributions in additive combinatorics and arithmetic Ramsey theory. More specifically, it deals with the interaction between combinatorics, number theory and additive combinatorics. This area saw a great improvement with the Szemerédi Regularity Lemma and some of the results that followed. The Regularity Lemma and its consequences have become a widely used tool in graph theory, combinatorics and number theory. Furthermore, its language and point of view has deeply changed the face of additive number theory, a fact universally acknowledged by the Abel award given to Szemerédi in 2012. One of the main reasons for the prize has been Szemerédi's theorem, a result regarding the existence of arbitrarily long arithmetic progressions in dense sets of the integers, the proof of which uses the Regularity Lemma in a key step. One of the earlier consequences of the Regularity Lemma was the Removal Lemma for graphs that was used by Ruzsa and Szemerédi to show Roth theorem, regarding the existence of 3-term arithmetic progressions in dense sets of the integers, in a combinatorial way. The Removal Lemma states that in any graph K with few copies of a subgraph, say a triangle, we can remove few edges from K so that the result contains no copy of the subgraph. This has become a key tool in the applications of the so-called Regularity Method, which has extensive literature in combinatorics, graph theory, number theory and computer science. In 2005 Green introduced a regularity lemma for Abelian groups as well as an algebraic removal lemma. The removal lemma for groups states that, for a given finite Abelian group G, if there are o(|G|^3) solution to x+y+z+t=0 with the variables taking values in S, a subset of G, then we can remove o(|G|) elements from S to make the set S solution-free. The main contributions of this work corresponds to extensions of the removal lemma for groups to either more general contexts, like non-necessary Abelian finite groups, or to linear systems of equations for finite Abelian groups. The main goal is to give a comprehensive and more general framework for many results in additive number theory like Szemerédi Theorem. In particular, we show that the removal lemma for groups by Green can be extended to non-necessary Abelian finite groups. Moreover, we prove a removal lemma for linear systems on finite fields: for every e>0 there exists a d>0 such that if A is a (k x m) linear system of equations with coefficients in a finite field F and the number of solutions to Ax=b, where each variable takes values from a subset Si in F is less than d times |F| raised to m-k, then by removing less than e|F| elements in each Si we can make the resulting sets solution-free, thus solving a conjecture by Green to that respect. Even more, if A is an integer linear system, G is a finite Abelian group, and the determinantal of A and |G| are coprime, then a similar statement holds. Let us mention that the last result allows us to characterize those linear systems where any set S with size proportional to G has a nontrivial solution in S, provided |G| is large enough. This extends the validity of Szmerédi's theorem to finite Abelian groups. These extensions of the removal lemma have been used in arithmetic Ramsey theory to obtain counting results for the number of monochromatic solutions of linear systems. The main result from a work by Frankl, Graham and Rödl in '88 states that the number of monochromatic solutions of regular systems in integer intervals is in fact a positive proportion of the total number of solutions. We give analogous results for solutions in Abelian groups with bounded exponent, for which the main tool in the torsion-free case cannot be applied. Density versions of these counting results are also obtained, in this case with a full characterization.

Motivated by the problem of determining all right ideals of a group algebra FG for a finite group G over a finite field F, we explicitly determine the faithful irreducible representations of some finite metacylic groups over finite fields. By using that result, we determine the structure of all right ideals of the group algebra for the symmetric group <TEX>$S_3$</TEX> over a finite field F, as an example.

Informally, essential dimension is the minimal number of parameters required to define an algebraic object. This invariant has numerous connections to Galois cohomology, linear algebraic groups and birational geometry. In particular, the essential dimension of finite groups has connections to the Noether problem, inverse Galois theory and the simplification of polynomials via Tschirnhaus transformations. This thesis studies finite groups of low essential dimension using methods from birational geometry. Specifically, the main results are a classification of finite groups of essential dimension 2, and a proof that the alternating and symmetric groups on 7 letters have essential dimension 4.

Methods and results from the representation theory of finite di- mensional algebras have led to many interactions with other areas of mathe- matics. Such areas include the theory of Lie algebras and quantum groups, commutative algebra, algebraic geometry and topology, and in particular the new theory of cluster algebras. The aim of this workshop was to further de- velop such interactions and to stimulate progress in the representation theory of algebras.