有向循环图的圈直积分解、哈密顿性及自同构群

本文给出了有向循环图可分解为圈的直积的一个充分条件,基于这一结果,讨论了它们的哈密顿性及自同构群。     

Elementary equivalence for the lattices of subalgebras and automorphism groups of free algebras

We find an elementary equivalence criterion for the lattices of subalgebras of free algebras in regular varieties. The question is addressed of elementary equivalence for the automorphism groups of algebras of this type.     

Finite groups with its power automorphism groups having small indices

In this paper, a finite group G with IAut（G） ： P（G）I ~- p or pq is determined, where P（G） is the power automorphism group of G, and p, q are distinct primes. Especially, we prove that a finite group G satisfies ｜Aut（G） ： P（G）｜= pq if and only if Aut（G）/P（G） ≌S3. Also, some other classes of finite groups are investigated and classified, which are necessary for the proof of our main results.     

The Structure of the (Outer) Automorphism Group of a Bieberbach Group

Referring to Tits alternative, we develop a necessary and sufficient condition to decide whether the normalizer of a finite group of integral matrices is polycyclic-by-finite or is containing a non-Abelian free group. This result is of fundamental importance to conclude whether the (outer) automorphism group of a Bieberbach group is polycyclic-by-finite or has a non-cyclic free subgroup.     

Graph Automorphisms and Cells of Lattices

In this paper we apply the notion of cell of a lattice for dealing with graph automorphisms of lattices (in connection with a problem proposed by G. Birkhoff).     

开关图的几个代数性质

首先对开关图的自同构群进行了研究,随即讨论了它的点传递性,并得到Calyley图的开关图依然是Cayley图.     

Transversal infinitesimal automorphisms of harmonic foliations on complete manifolds

Summary In this paper we study infinitesimal automorphisms of finiteL ²-norm for harmonic Riemannian and Kähler foliations admitting a complete bundle-like metric. The results generalize facts established recently in the compact case.1980 Mathematics Subject Classification: Primary 57 R 30, Secondary 58 E 20.Work supported in part by a grant from the National Science Foundation.     

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.     

New coverings of t-sets with (t + 1)-sets

The minimum number of k-subsets out of a v-set such that each t-set is contained in at least one k-set is denoted by C(v, k, t). In this article, a computer search for finding good such covering designs, leading to new upper bounds on C(v, k, t), is considered. The search is facilitated by predetermining automorphisms of desired covering designs. A stochastic heuristic search (embedded in the general framework of tabu search) is then used to find appropriate sets of orbits. A table of upper bounds on C(v, t + 1, t) for v 28 and t 8 is given, and the new covering designs are listed. © 1999 John Wiley & Sons, Inc. J. Combin Designs 7: 217–226, 1999