Extended centroid and central closure of semiprime normed algebras. a first approach

In this paper, we classify all the multiplicity-free permutation characters of sporadic simple groups and their automorphism groups. This project is an application of the group theory system GAP, its character table library, and its library of tables of marks.     

There are only finitely many finite distance-transitive graphs of given valency greater than two

The result of the title is proved, assuming the truth of Sims’ conjecture on primitive permutation groups (which has recently been established using the classification of finite simple groups). An alternative approach to this result, using less group theory but relying on a theorem of Macpherson on infinite distance-transitive graphs, is explored.     

Minimal permutation representations of finite simple exceptional groups of typesG 2 andF 4

A minimal permutation representation of a group is a faithful permutation representation of least degree. Well-studied to date are the minimal permutation representations of finite sporadic and classical groups for which degrees, point stabilizers, as well as ranks, subdegrees, and double stabilizers, have been found. Here we attempt to provide a similar account for finite simple ezceptional groups of types G₂ and F₄. Supported by RFFR grant No. 96-01-01893, the program “Universities of Russia,” and by International Science Foundation and Government of Russia grant No. RPC300. Translated fromAlgebra i Logika, Vol. 35, No. 6, pp. 663–684, November–December, 1996.     

Irreducibility of unitary group representations and reproducing kernels Hilbert spaces

We discuss unitary representations of groups in Hilbert spaces of functions given together with reproducing kernels, and in particular irreducibility. Our main focus is on examples, including spherical representations of orthogonal groups, distance-transitive finite graphs, irreducibility of induced representations, the discrete series of SL(2, ), and some representations of PGL(2, _p).The appendix contains examples involving groups acting on rooted trees.     

The Multiplicity Free Permutation Representations of the Ree Groups 2 G 2(q), the Suzuki Groups 2 B 2(q), and Their Automorphism Groups

Abstract

Let G a simple group of type ² B ₂(q) or ² G ₂(q), where q is an odd power of 2 or 3, respectively. The main goal of this paper is to determine the multiplicity free permutation representations of G and A ≤ Aut(G) where A is a subgroup containing a copy of G. Let B be a Borel subgroup of G. If G = ² B ₂(q) we show that there is only one non-trivial multiplicity free permutation representation, namely the representation of G associated to the action on G/B. If G = ² G ₂(q) we show that there are exactly two such non-trivial representations, namely the representations of G associated to the action on G/B and the action on G/M, where M = UC with U the maximal unipotent subgroup of B and C the unique subgroup of index 2 in the maximal split torus of B. The multiplicity free permutation representations of A correspond to the actions on A/H where H is isomorphic to a subgroup containing B if G = ² B ₂(q), and containing M if G = ² G ₂(q). The problem of determining the multiplicity free representations of the finite simple groups is important, for example, in the classification of distance-transitive graphs.     

The primitive permutation groups of degree 2 a ·3 b

In this paper, we give a complete classification of all finite simple groups with maximal subgroups of index n, where n = 2^a·3^b for a, b≧ 1. As a consequence, for such n, all primitive permutation groups of degree n are given. The motivation of this work comes also from a study of Cayley graphs of certain valency on a finite simple group. Received: 9 March 2005     

Multiplicity-free representations of symmetric groups

Building on work of Saxl, we classify the multiplicity-free permutation characters of all symmetric groups of degree 66 or more. A corollary is a complete list of the irreducible characters of symmetric groups (again of degree 66 or more) which may appear in a multiplicity-free permutation representation. The multiplicity-free characters in a related family of monomial characters are also classified. We end by investigating a consequence of these results for Specht filtrations of permutation modules defined over fields of prime characteristic.     

Minimal permutation representations of finite simple exceptional twisted groups

A minimal permutation representation of a group is its faithful permutation representation of least degree. Here the minimal permutation representations of finite simple exceptional twisted groups are studied: their degrees and point stabilizers, as well as ranks, subdegrees, and double stabilizers, are found. We can thus assert that, modulo the classification of finite simple groups, the aforesaid parameters are known for all finite simple groups. Supported by RFFR grant No. 96-01-01893, through the program “Universities of Russia”, and by grant No. RPC300 of ISF and the Government of Russia. Translated fromAlgebra i Logika, Vol. 37, No. 1, pp. 17–35, January–February, 1998.     

Geometry of Multiplicity-Free Representations of GL(n), Visible Actions on Flag Varieties, and Triunity

We analyze the criterion of the multiplicity-free theorem of representations [5, 6] and explain its generalization. The criterion is given by means of geometric conditions on an equivariant holomorphic vector bundle, namely, the visibility of the action on a base space and the multiplicity-free property on a fiber.Then, several finite-dimensional examples are presented to illustrate the general multiplicity-free theorem, in particular, explaining that three multiplicity-free results stem readily from a single geometry in our framework. Furthermore, we prove that an elementary geometric result on Grassmann varieties and a small number of multiplicity-free results give rise to all the cases of multiplicity-free tensor product representations of GL(n,C), for which Stembridge [12] has recently classified by completely different and combinatorial methods.     

Reaction Graphs

Chemical reaction graphs (for a fixed type of rearrangement) are orbital graphs for transitive permutation representations of symmetric groups, so algebraic combinatorics and group theory are effective tools for studying such properties as their connectivity and automorphisms. For example, we construct orbital graphs (and, hence, reaction graphs) from Cayley diagrams by contracting edges, and use graph-embeddings in surfaces to determine the automorphism groups of these graphs. We apply these ideas to the rearrangements of the P ₇ ^3- -ion and of bullvalene, together with some purely mathematical examples of reaction graphs.     

Globally irreducible representations of SL3(q) and SU3(q)

The notion ofglobally irreducible representations of finite groups was introduced by B. H. Gross, in order to explain new series of Euclidean lattices discovered by N. Elkies and T. Shioda using Mordell-Weil lattices of elliptic curves. In this paper we classify all globally irreducible representations coming from projective complex representations of the finite simple groups PSL₃(q) and PSU₃(q). The main result is that these representations are essentially those discovered by Gross.     

Distance-transitive representations of the symmetric groups

Let Γ be a graph and G ≤ Aut(Γ). The group G is said to act distance-transitively on Γ if, for any vertices x, y, u, v such that ∂(x, y) = ∂(u, v), there is an element g ϵ G mapping x into u and y into v. If G acts distance-transitively on Γ then the permutation group induced by the action of G on the vertex set of Γ is called the distance-transitive representation of G. In the paper all distance-transitive representations of the symmetric groups S_n are classified. Moreover, all pairs (G, Γ) such that G acts distance-transitively on Γ and G = S_n for some n are described. The classification problem for these pairs was posed by N. Biggs (Ann. N.Y. Acad. Sci. 319 (1979), 71–81). The problem is closely related to the general question about distance-transitive graphs with given automorphism group.     

Unitary Representations of Oligomorphic Groups

We obtain a complete classification of the continuous unitary representations of oligomorphic permutation groups (those include the infinite permutation group S ^??, the automorphism group of the countable dense linear order, the homeomorphism group of the Cantor space, etc.). Our main result is that all irreducible representations of such groups are obtained by induction from representations of finite quotients of open subgroups and, moreover, every representation is a sum of irreducibles. As an application, we prove that many oligomorphic groups have property (T). We also show that the Gelfand?CRaikov theorem holds for topological subgroups of S ^??: for all such groups, continuous irreducible representations separate points in the group.     

Two-Arc Transitive Graphs and Twisted Wreath Products

The paper addresses a part of the problem of classifying all 2-arc transitive graphs: namely, that of finding all groups acting 2-arc transitively on finite connected graphs such that there exists a minimal normal subgroup that is nonabelian and regular on vertices. A construction is given for such groups, together with the associated graphs, in terms of the following ingredients: a nonabelian simple group T, a permutation group P acting 2-transitively on a set , and a map F : Tsuch that x = x ^–1 for all x F() and such that Tis generated by F(). Conversely we show that all such groups and graphs arise in this way. Necessary and sufficient conditions are found for the construction to yield groups that are permutation equivalent in their action on the vertices of the associated graphs (which are consequently isomorphic). The different types of groups arising are discussed and various examples given.     

Antipodal covers of distance-transitive generalized polygons

In an earlier paper, the first two authors found all distance-regular antipodal covers of all known primitive distance-transitive graphs of diameter at least 3 with one possible exception. That remaining case is resolved here with the proof that a primitive and distance-transitive collinearity graph of a finite generalized 2d-gon with \(d\ge 3\) has no distance-regular antipodal cover of diameter 2d.     

Minimal permutation representations of finite simple orthogonal groups

In the paper, nontrivial permutation representations of minimal degree are studied for finite simple orthogonal groups. For them, we find degrees, ranks, subdegrees, point stabilizers and their pairwise intersections.Translated fromAlgebra i Logika, Vol. 33, No. 6, pp. 603–627, November–December, 1994.     

Homogeneous Operators, Jet Construction and Similarity

In this paper we show, starting with the jet construction, how to construct all the irreducible homogeneous operators in the Cowen–Douglas class B_n(\mathbb D){\mathrm {B}_n(\mathbb {D})} whose associated representations are multiplicity-free.     

On the full automorphism group of a graph

While it is easy to characterize the graphs on which a given transitive permutation groupG acts, it is very difficult to characterize the graphsX with Aut (X)=G. We prove here that for the certain transitive permutation groups a simple necessary condition is also sufficient. As a corollary we find that, whenG is ap-group with no homomorphism ontoZ _p wrZ _p , almost all Cayley graphs ofG have automorphism group isomorphic toG.     

Globally Irreducible Representations of Finite Groups and Integral Lattices

The notion of globally irreducible representations of finite groups has been introduced by B. H. Gross, in order to explain new series of Euclidean lattices discovered recently by N. Elkies and T. Shioda using Mordell--Weil lattices of elliptic curves. In this paper we first give a necessary condition for global irreducibility. Then we classify all globally irreducible representations of L ₂(q) and ²B₂(q), and of the majority of the 26 sporadic finite simple groups. We also exhibit one more globally irreducible representation, which is related to the Weil representation of degree (pⁿ-1)/2 of the symplectic group Sp_2n(p) (p 1 (mod 4) is a prime). As a consequence, we get a new series of even unimodular lattices of rank 2(pⁿ–1). A summary of currently known globally irreducible representations is given.