Finite Automata of Polynomial Growth do Not Generate A Free Group

A free subgroup of rank 2 of the automorphism group of a regular rooted tree of finite degree cannot be generated by finite-state automorphisms having polynomial growth. This result is in fact proven for rooted trees of infinite degree under some natural additional conditions.     

Dimension and randomness in groups acting on rooted trees

We explore the structure of the -adic automorphism group of the infinite rooted regular tree. We determine the asymptotic order of a typical element, answering an old question of Turán.

We initiate the study of a general dimension theory of groups acting on rooted trees. We describe the relationship between dimension and other properties of groups such as solvability, existence of dense free subgroups and the normal subgroup structure. We show that subgroups of generated by three random elements are full dimensional and that there exist finitely generated subgroups of arbitrary dimension. Specifically, our results solve an open problem of Shalev and answer a question of Sidki.

     

A representation on the labeled rooted forests

We consider the conjugation action of symmetric group on the semigroup of all partial functions and develop a machinery to investigate character formulas and multiplicities. By interpreting these objects in terms of labeled rooted forests, we give a characterization of the labeled rooted trees whose S_n orbit afford the sign representation. Applications to rook theory are offered.     

The Uniqueness of the Actions of Certain Branch Groups on Rooted Trees

It is proved that in many cases of interest the actions of groups on rooted trees can be recovered from the structure of the groups. The results apply to most of the groups introduced by the first author and to the Gupta–Sidki groups; they are proved in the wider context of branch groups satisfying two natural conditions.     

Finite Groups with a Pre-Fixed-Point-Free Power Automorphism

A power automorphism θ of a group G is said to be pre-fixed-point-free if C_G(θ) is an elementary abelian 2-group. G is called an E-group if G has a pre-fixed-point-free power automorphism. In this paper, finite E-groups, together with all their pre-fixed-point-free power automorphisms, are completely determined. Moreover, a characteristic of finite abelian groups is given, which explains some known facts concerning power automorphisms.     

On the Automorphisms of Order 2 with Fixed Points for the Extremal Self-Dual Codes of Length 24"m

It is shown that an extremal self-dual code of length 24">m may have an automorphism of order 2 with fixed points only for ">m = 1,3, or 5. We prove that no self-dual [72, 36, 16] code has such an automorphism in its automorphism group.     

Semicomplete Permutational Wreath Products

A group is called semicomplete if every automorphism which induces the identity on the factor commutator group is inner. In this paper, we study the connection of the semicompleteness of the permutational wreath product W of two groups with the semicompleteness of these groups. We give necessary conditions under which the group W is semicomplete.2000 Mathematics Subject Classification: 20E22, 20E36     

有限ATI-群的类保持Coleman自同构

设G是一个有限群,对G的任意阿贝尔子群A及任意g∈G,若A∩A~g=1或A,则称G为一个ATI-群.本文证明了,对任意p∈τ(G),如果ATI-群G的一个p-方幂阶类保持自同构在G的任意Sylow子群上的限制等于G的某个内自同构的限制,则它必定是一个内自同构.作为该结果的一个直接推论,我们也证明了有限ATI-群G有正规化性质.     

一类推广的Virasoro-like李代数

构造了一类无限维李代数,它是Virasoro-like李代数的推广.研究了这类李代数的两类自同构,这两类自同构均关于映射的合成构成自同构群,一类同构于对称群S3,另一类同构于Klein交换群.得到了这类李代数一些特殊的自同态、中心.证明了这类李代数不是半单李代数.     

On the Combinatorics of Rooted Binary Phylogenetic Trees

We study subtree-prune-and-regraft (SPR) operations on leaf-labelled rooted binary trees, also known as rooted binary phylogenetic trees. This study is motivated by the problem of graphically representing evolutionary histories of biological sequences subject to recombination. We investigate some basic properties of the induced SPR-metric on the space of leaf-labelled rooted binary trees with n leaves. In contrast to the case of unrooted trees, the number |U(T)| of trees in which are one SPR operation away from a given tree depends on the topology of T. In this paper, we construct recursion relations which allow one to determine the unit-neighbourhood size |U(T)| efficiently for any tree topology. In fact, using the recursion relations we are able to derive a simple closed-form formula for the unit-neighbourhood size. As a corollary, we construct sharp upper and lower bounds on the size of unit-neighbourhoods and investigate the diameter of . Lastly, we consider an enumeration problem relevant to population genetics.AMS Subject Classification: 05C05, 92D15.     

The Normalizer Property for Integral Group Rings of Holomorphs of Finite Groups with Trivial Center

Let G=Hol(H) be the holomorph of a finite group H. If there is a prime q dividing |H| such that every q-central automorphism of H is inner and Z(H)=1, then every Coleman automorphism of G is inner. In particular, the normalizer property holds for G.     

On the Marginal Automorphisms of a Group

Let W be a nonempty subset of a free group. We call an automorphism α of a group G a marginal automorphism if x ^?1α(x) ∈ W*(G) for each x ∈ G, where W*(G) is the marginal subgroup of G. In this article, we give some results on marginal automorphisms of a group.     

Groups that are Almost Homogeneous

We classify those groups whose automorphism group has at most three orbits. In other words, we classify those groups whose holomorph is a rank 3 permutation group.     

Automorphisms of higher‐dimensional Hadamard matrices

This article derives from first principles a definition of equivalence for higher‐dimensional Hadamard matrices and thereby a definition of the automorphism group for higher‐dimensional Hadamard matrices. Our procedure is quite general and could be applied to other kinds of designs for which there are no established definitions for equivalence or automorphism. Given a two‐dimensional Hadamard matrix H of order ν, there is a Product Construction which gives an order ν proper n‐dimensional Hadamard matrix P⁽ⁿ⁾(H). We apply our ideas to the matrices P⁽ⁿ⁾(H). We prove that there is a constant c > 1 such that any Hadamard matrix H of order ν > 2 gives rise via the Product Construction to cν inequivalent proper three‐dimensional Hadamard matrices of order ν. This corrects an erroneous assertion made in the literature that ”P⁽ⁿ⁾(H) is equivalent to “P⁽ⁿ⁾(H′) whenever H is equivalent to H′.” We also show how the automorphism group of P⁽ⁿ⁾(H) depends on the structure of the automorphism group of H. As an application of the above ideas, we determine the automorphism group of P⁽ⁿ⁾(Hk) when Hk is a Sylvester Hadamard matrix of order 2^k. For ν = 4, we exhibit three distinct families of inequivalent Product Construction matrices P⁽ⁿ⁾(H) where H is equivalent to H₂. These matrices each have large but non‐isomorphic automorphism groups. © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 507–544, 2008     

On Finite p-Groups Whose IA-Automorphisms Are All Class Preserving

Let G be a finite non-abelian p-group, where p is a prime. An automorphism α of G is called a class preserving automorphism if α(x) ∈ x ^G the conjugacy class of x in G, for all x ∈ G. An automorphism α of G is called an IA-automorphism if x ^?1α(x) ∈ G′ for each x ∈ G. In this paper, we give necessary and sufficient conditions on finite p-group G of nilpotency class 2 such that every IA-automorphism is class preserving.     

Metric ends,fibers and automorphisms of graphs

Several results on the action of graph automorphisms on ends and fibers are generalized for the case of metric ends. This includes results on the action of the automorphisms on the end space, directions of automorphisms, double rays which are invariant under a power of an automorphism and metrically almost transitive automorphism groups. It is proved that the bounded automorphisms of a metrically almost transitive graph with more than one end are precisely the kernel of the action on the space of metric ends. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Gruppi Policiclici Dotati di un Automorfismo Uniforme di Ordinepq

An automorphismϕ of a groupG is said to be uniform il for everyg ∈G there exists anh ∈G such thatG=h ⁻¹ h ^ρ . It is a well-known fact that ifG is finite, an automorphism ofG is uniform if and only if it is fixed-point-free. In [7] Zappa proved that if a polycyclic groupG admits an uniform automorphism of prime orderp thenG is a finite (nilpotent)p′-group. In this paper we continue Zappa’s work considering uniform automorphism of orderpg (p andq distinct prime numbers). In particular we prove that there exists a constantμ (depending only onp andq) such that every torsion-free polycyclic groupG admitting an uniform automorphism of orderpq is nilpotent of class at mostμ. As a consequence we prove that if a polycyclic groupG admits an uniform automorphism of orderpq thenZ _μ (G) has finite index inG.

Al professore Guido Zappa per il suo 90⁰ compleanno