On second maximal subgroups of Sylow subgroups of finite groups

Finite groups in which the second maximal subgroups of the Sylow p-subgroups, p a fixed prime, cover or avoid the chief factors of some of its chief series are completely classified.     

Modular representations of profinite groups

Our aim is to transfer several foundational results from the modular representation theory of finite groups to the wider context of profinite groups. We are thus interested in profinite modules over the completed group algebra of a profinite group G, where k is a finite field of characteristic p.We define the concept of relative projectivity for a profinite -module. We prove a characterization of finitely generated relatively projective modules analogous to the finite case with additions of interest to the profinite theory. We introduce vertices and sources for indecomposable finitely generated -modules and show that the expected conjugacy properties hold—for sources this requires additional assumptions. Finally we prove a direct analogue of Green’s Indecomposability Theorem for finitely generated modules over a virtually pro-p group.     

On uniqueness of characteristic classes

We give an axiomatic characterization of maps from algebraic K-theory. The results apply to a large class of maps from algebraic K-theory to any suitable cohomology theory or to algebraic K-theory. In particular, we obtain comparison theorems for the Chern character and Chern classes and for the Adams operations and λ-operations on higher algebraic K-theory. We show that the Adams operations and λ-operations defined by Grayson agree with the ones defined by Gillet and Soulé.     

Almost fixed-point-free automorphisms of soluble groups

Suppose G is either a soluble (torsion-free)-by-finite group of finite rank or a soluble linear group over a finite extension field of the rational numbers. We consider the implications for G if G has an automorphism of finite order m with only finitely many fixed points. For example, if m is prime then G is a finite extension of a nilpotent group and if m=4 then G is a finite extension of a centre-by-metabelian group. This extends the special cases where G is polycyclic, proved recently by Endimioni (2010); see [3].     

Conjugation in Brauer algebras and applications to character theory

The Brauer algebra has a basis of diagrams and these generate a monoid H consisting of scalar multiples of diagrams. Following a recent paper by Kudryavtseva and Mazorchuk, we define and completely determine three types of conjugation in H. We are thus able to define Brauer characters for Brauer algebras which share many of the properties of Brauer characters defined for finite groups over a field of prime characteristic. Furthermore, we reformulate and extend the theory of characters for Brauer algebras as introduced by Ram to the case when the Brauer algebra is not semisimple.     

Algorithmically finite groups

We call a group Galgorithmically finite if no algorithm can produce an infinite set of pairwise distinct elements of G. We construct examples of recursively presented infinite algorithmically finite groups and study their properties. For instance, we show that the Equality Problem is decidable in our groups only on strongly (exponentially) negligible sets of inputs.     

The Brauer-Manin obstruction for sections of the fundamental group

We introduce the notion of a Brauer-Manin obstruction for sections of the fundamental group extension and establish Grothendieck’s section conjecture for an open subset of the Reichardt-Lind curve.     

Quantum Schur algebras revisited

A geometric construction of quantum Schur algebras was given by Beilinson, Lusztig and MacPherson in terms of pairs of flags in a vector space. By viewing such pairs of flags as representations of a poset, we give a recursive formula for the structure constants of quantum Schur algebras which is related to certain Hall polynomials. As an application, we provide a direct proof of the fundamental multiplication formulas which play a key role in the Beilinson-Lusztig-MacPherson realization of quantum gl_n. In the appendix we show how to groupoidify quantum Schur algebras in the sense of Baez, Hoffnung and Walker.     

Cycle extendability in graphs and digraphs

In 1990, Hendry conjectured that all chordal Hamiltonian graphs are cycle extendable, that is, the vertices of each non-Hamiltonian cycle are contained in a cycle of length one greater. Let A be a symmetric (0,1)-matrix with zero main diagonal such that A is the adjacency matrix of a chordal Hamiltonian graph. Hendry’s conjecture in this case is that every k×k principle submatrix of A that dominates a full cycle permutation k×k matrix is a principle submatrix of a (k+1)×(k+1) principle submatrix of A that dominates a (k+1)×(k+1) full cycle permutation matrix. This article generalizes the concept of cycle-extendability to S-extendable; that is, with S⊆{1,2,…,n} and G a graph on n vertices, G is S-extendable if the vertices of every non-Hamiltonian cycle are contained in a cycle length i greater, where i∈S. We investigate this concept in directed graphs and in particular tournaments, i.e., anti-symmetric matrices with zero main diagonal.