Linear Representations of the Automorphism Group of a Free Group

Let F _n be the free group on n ≥ 2 elements and Aut(F _n ) its group of automorphisms. In this paper we present a rich collection of linear representations of Aut(F _n ) arising through the action of finite-index subgroups of it on relation modules of finite quotient groups of F _n . We show (under certain conditions) that the images of our representations are arithmetic groups. Received: November 2006, Accepted: March 2007     

Regular symmetric groups of boolean functions

We show that with the exception of four known cases: C₃, C₄, C₅, and , all regular permutation groups can be represented as symmetric groups of boolean functions. This solves the problem posed by A. Kisielewicz in the paper [A. Kisielewicz, Symmetry groups of boolean functions and constructions of permutation groups, J. Algebra 199 (1998) 379-403]. A slight extension of our proof yields the same result for semiregular groups.     

The Rohlin property for automorphisms of the Jiang-Su algebra

For projectionless C^∗-algebras absorbing the Jiang-Su algebra tensorially, we study a kind of the Rohlin property for automorphisms. We show that the crossed products obtained by automorphisms with this Rohlin property also absorb the Jiang-Su algebra tensorially under a mild technical condition on the C^∗-algebras. In particular, for the Jiang-Su algebra we show the uniqueness up to outer conjugacy of the automorphism with this Rohlin property.     

On the shape of random Pólya structures

Panagiotou and Stufler recently proved an important fact on their way to establish the scaling limits of random Pólya trees: a uniform random Pólya tree of size $n$ consists of a conditioned critical Galton–Watson tree $C_n$ and many small forests, where with probability tending to one, as $n$ tends to infinity, any forest $F_n\left(v\right)$, that is attached to a node $v$ in $C_n$, is maximally of size $\left|F_n\left(v\right)\right|=O(logn)$. Their proof used the framework of a Boltzmann sampler and deviation inequalities.In this paper, first, we employ a unified framework in analytic combinatorics to prove this fact with additional improvements for $\left|F_n\left(v\right)\right|$, namely $\left|F_n\left(v\right)\right|=\Theta (logn)$. Second, we give a combinatorial interpretation of the rational weights of these forests and the defining substitution process in terms of automorphisms associated to a given Pólya tree. Third, we derive the limit probability that for a random node $v$ the attached forest $F_n\left(v\right)$ is of a given size. Moreover, structural properties of those forests like the number of their components are studied. Finally, we extend all results to other Pólya structures.     

On automorphism groups of certain Goppa codes

Goppa codes are linear codes arising from algebraic curves over finite fields. Sufficient conditions are given ensuring that all automorphisms of a Goppa code are inherited from the automorphism group of the curve. In some cases, these conditions are also necessary. The cases of curves with large automorphism groups, notably the Hermitian and the Deligne-Lusztig curves, are investigated in detail. This research was performed within the activity of GNSAGA of the Italian INDAM, with the financial support of the Italian Ministry MIUR, project “Strutture geometriche, combinatorica e loro applicazioni”, PRIN 2006–2007.     

一类不能作为自同构群的有限群

本文证明了阶小于ｐ９的有限交换ｐ－群不能作为有限群的自同构群，从而推进了ＭａｃＨａｌｅ的结果．