Cubic graphs with most automorphisms

We give a sharp bound for the order of the automorphism group of a connected simple cubic graph on a given number of vertices. For each number of vertices we construct a graph, unique in special cases, attaining the bound. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 99–115, 2010     

Eigenvalues of the derangement graph

We consider the Cayley graph on the symmetric group Sn generated by derangements. It is well known that the eigenvalues of this graph are indexed by partitions of n. We investigate how these eigenvalues are determined by the shape of their corresponding partitions. In particular, we show that the sign of an eigenvalue is the parity of the number of cells below the first row of the corresponding Ferrers diagram. We also provide some lower and upper bounds for the absolute values of these eigenvalues.     

Near automorphisms of cycles

Let f be a permutation of V(G). Define δ_f(x,y)=|d_G(x,y)-d_G(f(x),f(y))| and δ_f(G)=∑δ_f(x,y) over all the unordered pairs {x,y} of distinct vertices of G. Let π(G) denote the smallest positive value of δ_f(G) among all the permutations f of V(G). The permutation f with δ_f(G)=π(G) is called a near automorphism of G. In this paper, we study the near automorphisms of cycles C_n and we prove that π(C_n)=4⌊n/2⌋-4, moreover, we obtain the set of near automorphisms of C_n.     

Weakly power automorphisms of groups

An automorphism α of a group G is called a weakly power automorphism if it maps every non-periodic subgroup of G onto itself. The aim of this paper is to investigate the behavior of weakly power automorphisms. In particular, among other results, it is proved that all weakly power automorphisms of a soluble non-periodic group G of derived length at most 3 are power automorphisms, i.e. they fix all subgroups of G. This result is best possible, as there exists a soluble non-periodic group of derived length 4 admitting a weakly power automorphism, which is not a power automorphism.     

Commutativity of automorphisms of subfactors modulo inner automorphisms

We introduce a new algebraic invariant of a subfactor . We show that this is an abelian group and that if the subfactor is strongly amenable, then the group coincides with the relative Connes invariant introduced by Y. Kawahigashi. We also show that this group is contained in the center of in many interesting examples such as quantum subfactors with level , but not always contained in the center. We also discuss its relation to the most general setting of the orbifold construction for subfactors.

     

Automorphism group and diameter of a graph

Given a connected graph Γ of order n and diameter d, we establish a tight upper bound for the order of the automorphism group of Γ as a function of n and d, and determine the graphs for which the bound is attained. © 2011 Wiley Periodicals, Inc. J Graph Theory.     

Measurability of automorphisms of topological groups

Relations between the measurability and continuity of algebraic automorphisms of topological groups depending on the types of groups are examined. Various cases are considered and theorems on the continuity of measurable automorphisms are proved; for instance, such theorems are proved for separable locally compact groups and automorphisms measurable with respect to nonnegative Haar measures. On the other hand, examples of nonmetrizable nonseparable compact groups with Haar measures and of non-locally-compact separable metrizable groups with measures μ quasi-invariant with respect to dense subgroups admittings μ-measurable discontinous automorphisms are given. Translated fromMatenmaticheskie Zametki, Vol. 68, No. 1, pp. 105–112, July, 2000. An erratum to this article can be found online at .     

Quadratic and cubic invariants of unipotent affine automorphisms

Let K be an arbitrary field of characteristic zero, P_n:=K[x₁,…,x_n] be a polynomial algebra, and , for n2. Let σ^′Aut_K(P_n) be given by

It is proved that the algebra of invariants, , is a polynomial algebra in n−1 variables which is generated by quadratic and cubic (free) generators that are given explicitly.Let σAut_K(P_n) be given by

It is well known that the algebra of invariants, , is finitely generated (theorem of Weitzenböck [R. Weitzenböck, Über die invarianten Gruppen, Acta Math. 58 (1932) 453–494]), has transcendence degree n−1, and that one can give an explicit transcendence basis in which the elements have degrees 1,2,3,…,n−1. However, it is an old open problem to find explicit generators for F_n. We find an explicit vector space basis for the quadratic invariants, and prove that the algebra of invariants is a polynomial algebra over in n−2 variables which is generated by quadratic and cubic (free) generators that are given explicitly.The coefficients of these quadratic and cubic invariants throw light on the ‘unpredictable combinatorics’ of invariants of affine automorphisms and of SL₂-invariants.     

On the group of conjugating automorphisms of a free group

The group of conjugating automorphisms of a free group and certain subgroups of this group, namely, the group of McCool basis-conjugating automorphisms and the Artin braid group are considered. The Birman theorem on the representation of a braid group by matrices is sharpened. Translated fromMatematicheskie Zametki, Vol. 60, No. 1, pp. 92–108, July, 1996.     

A note on local automorphisms

Let H be an infinite-dimensional almost separable Hilbert space. We show that every local automorphism of ℬ(H), the algebra of all bounded linear operators on a Hilbert space H, is an automorphism.     

Main eigenvalues and automorphisms of a graph

We study some aspects of the relationship between algebras associated with graphs and automorphism groups. We study an algebra generated by the adjacent matrix of a graph and the all ones matrix, and derive a lower bound for the rank of the automorphism group of a graph. If a graph attains the equality in the above bound, it is calledextremal. We also describe some properties and examples of extremal graphs.     

Main eigenvalues and automorphisms of a graph

We study some aspects of the relationship between algebras associated with graphs and automorphism groups. We study an algebra generated by the adjacent matrix of a graph and the all ones matrix, and derive a lower bound for the rank of the automorphism group of a graph. If a graph attains the equality in the above bound, it is calledextremal. We also describe some properties and examples of extremal graphs.     

Slender partial quadrangles and their automorphisms

The partial quadrangle PQ(s, t, μ) is an incidence system consisting of points and lines in which every line contains s + 1 points, every point sits on t + 1 lines (two lines meet in at most one point), and the meet of the neighborhoods of any two non-adjacent points in the collinearity graph is a μ-coclique. We provide a classification for partial quadrangles PQ(s, t, μ) with t ⩽ 6, and study into their automorphisms. Supported by RFBR grant No. 05-01-00046 and by RFBR-NSFC grant No. 05-01-39000. __________ Translated from Algebra i Logika, Vol. 45, No. 5, pp. 603–619, September–October, 2006.     

完全等部二分图kn,n的迭线图Lm(kn,n)的谱特征

研究了完全等部二分图Ｋｎ,ｎ的迭线图Ｌ＾ｍ（Ｋｎ,ｎ）的谱特征,证明了当ｎ≥７时,Ｌ＾ｍ（Ｋｎ,ｎ）以谱为特征。     

Eigenvalues of a graph and its imbeddings

A graph H is imbedded in a graph G if a subset of the vertices of G determines a subgraph isomorphic to H. If λ(G) is the least eigenvalue of G and k_R(H) = lim sup_d→∞ {λ(G)| H imbedded in G; G regular and connected; diam(G) > d; deg(G) > d}, then λ(H) ? 2 ≤ k_R(H) ≤ λ(H) with these bounds being the best possible. Given a graph H, there exist arbitrarily large families of isospectral graphs such that H can be imbedded in each member of the family.     

On automorphisms of A-groups

Let G be an A-group (i.e. a group in which xx ^α  = x ^α x for all and let denote the subgroup of Aut(G) consisting of all automorphisms that leave invariant the centralizer of each element of G. The quotient is an elementary abelian 2-group and natural analogies exist to suggest that it might always be trivial. It is shown that, in fact, for any odd prime p and any positive integer r, there exist infinitely many finite pA-groups G for which has rank r. Received: 23 March 2008, Revised: 20 May 2008     

Eigenvalues of the k‐th power of a graph

The k‐th power of a graph G, denoted by , is a graph with the same set of vertices as G such that two vertices are adjacent in if and only if their distance in G is at most k. In this paper, we give the bounds on the spectral radius of and . The Nordhaus–Gaddum‐type inequality for the spectral radius of the graph is also presented. Moreover, we obtain an upper bound on the energy of the second power of graphs.     

Sporadic groups and automorphisms of linear spaces

This article is a contribution to the study of the automorphism groups of finite linear spaces. In particular we look at almost simple groups and prove the following theorem: Let G be an almost simple group and let 𝒮 be a finite linear space on which G acts as a line‐transitive automorphism group. Then the socle of G is not a sporadic group. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 353–362, 2000     

On noninner automorphisms of 2-generator finite p-groups

A longstanding conjecture asserts that every finite nonabelian p-group admits a noninner automorphism of order p. In this paper we give some necessary conditions for a possible counterexample G to this conjecture, in the case when G is a 2-generator finite p-group. Then we show that every 2-generator finite p-group with abelian Frattini subgroup has a noninner automorphism of order p.