On outer automorphism groups of coxeter groups

Summary It is shown that the outer automorphism group of a Coxeter groupW of finite rank is finite if the Coxeter graph contains no infinite bonds. A key step in the proof is to show that if the group is irreducible andΠ ₁ andΠ ₂ any two bases of the root system ofW, thenΠ ₂ = ±ωΠ ₁ for some ω εW. The proof of this latter fact employs some properties of the dominance order on the root system introduced by Brink and Howlett. This article was processed by the author using the Springer-Verlag TEX PJour1g macro package 1991.     

Codes with a Certain Weight-preserving Transitive Group of Automorphisms

We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nontrivial cosets of E in C. Michael Giudici - The author holds an Australian Postdoctoral Fellowship.     

Peeling phylogenetic ‘oranges’

We investigate the combinatorics of a topological space that is generated by the set of edge-weighted finite trees. This space arises by multiplying the weights of edges on paths in trees and is closely connected to tree reconstruction problems involving finite state Markov processes. We show that this space is a contractible finite CW-complex whose face poset can be described via a partial order on semilabelled forests. We then describe some combinatorial properties of this poset, showing that, for example, it is pure, thin and contractible.     

Local automorphisms of operator algebras on Banach spaces

In this paper we extend a result of Semrl stating that every 2-local automorphism of the full operator algebra on a separable infinite dimensional Hilbert space is an automorphism. In fact, besides separable Hilbert spaces, we obtain the same conclusion for the much larger class of Banach spaces with Schauder bases. The proof rests on an analogous statement concerning the 2-local automorphisms of matrix algebras for which we present a short proof. The need to get such a proof was formulated in Semrl's paper.

     

The spectrum of BSA(v, 3, λ; α) with α = 2,3

In this article, a kind of auxiliary design BSA^* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA^*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007     

On the isomorphism problem in the class of extensions of a free group by an infinite cyclic group

In the automorphism group of a rank 3 free group we find two nonconjugate automorphisms whose mapping tori are isomorphic groups.     

Explicit formula of holomorphic automorphism group on complex homogeneous bounded domains

We known that the maximal connected holomorphic automorphism group Aut (D)(0) is a semi-direct product of the triangle group T(D) and the maximal connected isotropic subgroup Iso(D)(0) of a fixed point in the complex homogeneous bounded domain D and any complex homogeneous bounded domain is holomorphic isomorphic to a normal Siegel domain D(VN,F). In this paper, we give the explicit formula of any holomorphic automorphism in T(D(VN, F)) and Iso(D(VN,F))(0), where G(0) is the unit connected component of the Lie group G.     

2-（υ，5，1）设计的非可解区传递自同构群

研究了2-(υ，κ，1)设计的区传递自同构群．特别讨论了2-(υ，5，1)设计的非可解区传递自同构群．得到定理：设G是一个2-(υ，5，1)设计Q的区传递．点本原但非旗传递的自同构群．若G是非可解群．则G的基柱Soc(G)不是典型群PSUn(q)，这里q为奇数，n≥3。     

The spectrum of cyclic BSA(ν, 3, λ; α) with α = 2, 3

Balanced sampling plans excluding contiguous units (or BSEC) were first introduced by Hedayat, Rao, and Stufken in 1988. In this paper, we generalize the concept of a cyclic BSEC to a cyclic balanced sampling plan to avoid the selection of adjacent units (or CBSA for short) and use Langford and extended Langford sequences to construct a cyclic BSA(ν, 3, λ; α) with α = 2, 3. We finally establish the necessary and sufficient conditions for the existence of a cyclic BSA(ν, 3, λ; α) where α = 2, 3. © 2005 Wiley Periodicals, Inc. J Combin Designs.