On the automorphism group of a cone

Let V be a real finite dimensional vector space, and let C be a full cone in C. In Sec. 3 we show that the group of automorphisms of a compact convex subset of V is compact in the uniform topology, and relate the group of automorphisms of C to the group of automorphisms of a compact convex cross-section of C. This section concludes with an application which generalizes the result that a proper Lorentz transformation has an eigenvector in the light cone. In Sec. 4 we relate the automorphism group of C to that of its irreducible components. In Sec. 5 we show that every compact group of automorphisms of C leaves a compact convex cross-section invariant. This result is applied to show that if C is a full polyhedral cone, then the automorphism group of C is the semidirect product of the (finite) automorphism group of a polytopal cross-section and a vector group whose dimension is equal to the number of irreducible components of C. An example shows that no such result holds for more general cones.     

The automorphism group of the derived category for a weighted projective line

We show that up to a translation each automorphism of the derived category D ^b X of coherent sheaves on a weighted projective line X, equiv-alently of the derived category D ^b A of finite dimensional modules over a derived canonical algebra A, is composed of tubular mutations and automorphisms of X. In the case of genus one this implies that the automorphism group is a semi-direct product of the braid group on three strands by a finite group.

Moreover we prove that most automorphisms lift from the Grothendieck group to the derived category.     

Every group is the automorphism group of a rank-3 matroid

Every group is the automorphism group of a rank-3 extension of a rank-3 Dowling geometry.Partially supported by The George Washington University UFF grant.Partially supported by the National Security Agency under grant MDA904-91-H-0030.     

On the structure of the automorphism group of certain automorphic loop

Automorphic loops, or A-loops, are loops in which all inner mappings are automorphisms. We investigated A-loops arising from a Lie algebra and describe their automorphism group. Also, we identify and describe their inner mapping group.     

Some Minkowski planes with 3-dimensional automorphism group

A new rather large family of 2-dimensional locally compact topological Minkowski planes with an at least 3-dimensional automorphism group is introduced here. Isomorphism classes and automorphisms of these planes are determined.     

Intervals in matroid basis graphs

An interval in a graph is a subgraph induced by all the vertices on shortest paths between two given vertices. Intervals in matroid basis graphs satisfy many nice properties. Key results are: (1) any two vertices of a basis graph are together in some longest interval; (2) every basis graph with the minimum number of vertices for its diameter is an interval, indeed a hypercube. (1) turns out to be a simple case of a theorem in Edmonds' theory of matroid partition.     

Structure of the automorphism group for partially commutative class two nilpotent groups

Let R be a ring, which is either a ring of integers or a field of zero characteristic. For every finite graph Γ, we construct an R-arithmetic linear group H(Γ). The group H(Γ) is realized as the factor automorphism group of a partially commutative class two nilpotent R-group G _Γ. Also we describe the structure of the entire automorphism group of a partially commutative nilpotent R-group of class two.     

Finite quotients of the automorphism group of a free group

The automorphism group AutF_n of a free group F_n of rank n acts on the product of n copies of a group G by substituting n elements of G into the words defining an automorphism of the free group. This gives rise to an antihomomorphism from AutF_nto a permutation group. We determine this antihomomorphic image of AutF_n when G is the semidirect product Z_p x Z_q     

Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices

The theory of voltage graphs has become a standard tool in the study of graphs admitting a semiregular group of automorphisms. We introduce the notion of a cyclic generalised voltage graph to extend the scope of this theory to graphs admitting a cyclic group of automorphisms that may not be semiregular. We use this new tool to classify all cubic graphs admitting a cyclic group of automorphisms with at most three vertex-orbits and we characterise vertex-transitivity for each of these classes. In particular, we show that a cubic vertex-transitive graph admitting a cyclic group of automorphisms with at most three orbits on vertices either belongs to one of 5 infinite families or is isomorphic to the well-known Tutte–Coxeter graph.     

The conjugacy problem for the automorphism group of the random graph

We prove that the conjugacy problem for the automorphism group of the random graph is Borel complete, and discuss the analogous problem for some other countably categorical structures.     

On a matroid defined by ear-decompositions of graphs

A. Frank described in [1] an algorithm to determine the minimum number of edges in a graph G whose contraction leaves a factor-critical graph and he asked if there was an algorithm for the weighted version of the problem. We prove that the minimal critical-making edge-sets form the bases of a matroid and hence the matroid greedy algorithm gives rise to the desired algorithm.Partially supported by OTKA F014919, OTKA T17181 and OTKA T17580.     

The automorphism group of the graph of anR class

IfS is anX generated semigroup andm∈S, then one can represent theR class ofm by a labeled digraph, called theR graph ofm. We show that the Schützenberger group of theH class ofm embeds in the automorphism group of theR graph ofm, and that the embedding is an isomorphism ifm is a regular element.     

Geometric automorphism groups of graphs

Constructing symmetric drawings of graphs is NP-hard. In this paper, we present a new method for drawing graphs symmetrically based on group theory. More formally, we define an n-geometric automorphism group as a subgroup of the automorphism group of a graph that can be displayed as symmetries of a drawing of the graph in n dimensions. Then we present an algorithm to find all 2- and 3-geometric automorphism groups of a given graph. We implement the algorithm using Magma [〈http://magma.maths.usyd.edu.au〉] and the experimental results show that our approach is very efficient in practice. We also present a drawing algorithm to display 2- and 3-geometric automorphism groups.     

Concept of a vertex in a matroid and 3-connected graphs

The concept of a matroid vertex is introduced. The vertices of a matroid of a 3-connected graph are in one-to-one correspondence with vertices of the graph. Thence directly follows Whitney's theorem that cyclic isomorphism of 3-connected graphs implies isomorphism. The concept of a vertex of a matroid leads to an equally simple proof of Whitney's theorem on the unique embedding of a 3-connected planar graph in the sphere. It also leads to a number of new facts about 3-connected graphs. Thus, consideration of a vertex in a matroid that is the dual of the matroid of a graph leads to a natural concept of a nonseparating cycle of a graph. Whitney's theorem on cyclic isomorphism can be strengthened (even if the nonseparating cycles of a graph are considered, the theorem is found to work) and a new criterion for planarity of 3-connected graphs is obtained (in terms of nonseparating cycles).     

Proper holomorphic mappings and related automorphism groups

In this note we determine the automorphism group of complex manifolds which are proper images of a simply connected strictly pseudoconvex domain in ?ⁿ. We also investigate automorphisms of domains invariant under a compact subgroup of complex linear transformations. Furthermore, some regularity and rigidity properties of proper holomorphic mappings are established. In particular we solve a question raised by Hahn and Pflug regarding the nonexistence of proper holomorphic mappings between the euclidian ball and the complex minimal ball of ?ⁿ.     

Random sampling and greedy sparsification for matroid optimization problems

Random sampling is a powerful tool for gathering information about a group by considering only a small part of it. We discuss some broadly applicable paradigms for using random sampling in combinatorial optimization, and demonstrate the effectiveness of these paradigms for two optimization problems on matroids: finding an optimum matroid basis and packing disjoint matroid bases. Application of these ideas to the graphic matroid led to fast algorithms for minimum spanning trees and minimum cuts. An optimum matroid basis is typically found by agreedy algorithm that grows an independent set into an optimum basis one element at a time. This continuous change in the independent set can make it hard to perform the independence tests needed by the greedy algorithm. We simplify matters by using sampling to reduce the problem of finding an optimum matroid basis to the problem of verifying that a givenfixed basis is optimum, showing that the two problems can be solved in roughly the same time. Another application of sampling is to packing matroid bases, also known as matroid partitioning. Sampling reduces the number of bases that must be packed. We combine sampling with a greedy packing strategy that reduces the size of the matroid. Together, these techniques give accelerated packing algorithms. We give particular attention to the problem of packing spanning trees in graphs, which has applications in network reliability analysis. Our results can be seen as generalizing certain results from random graph theory. The techniques have also been effective for other packing problems. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Some of this work done at Stanford University, supported by National Science Foundation and Hertz Foundation Graduate Fellowships, and NSF Young Investigator Award CCR-9357849, with matching funds from IBM, Schlumberger Foundation, Shell Foundation and Xerox Corporation. Also supported by NSF award 962-4239.     

A design and a geometry for the group Fi 22

The Fischer group Fi ₂₂ acts as a rank 3 group of automorphisms of a symmetric 2-(14080,1444,148) design. This design does not have a doubly transitive automorphism group, since there is a partial linear space with lines of size 4 defined combinatorially from the design and preserved by its automorphism group. We investigate this geometry and determine the structure of various subspaces of it.      

Vector representable matroids of given rank with given automorphism group

A simple way of associating a matroid of prescribed rank with a graph is shown. The matroids so constructed are representable over any sufficiency large field. Their use is demonstrated by the following result: Given an integer k?3 and a function G associating a group with each subset of a set S, there is a matroid M(E), representable over any sufficiently large field, such that E ? S, and for any T ?/ S, the rank of M/Tis k, and the automorphine group of MT is isomorphic to G(T).