On the Automorphism Group of the First Weyl Algebra

Let A ₁: = 𝕜[t, ?] be the first algebra over a field 𝕜 of characteristic zero. Let Aut_𝕜(A ₁) be the automorphism group of the ring A ₁. One can associate to each right ideal I of A ₁ a subgroup of Aut_𝕜(A ₁) called the isomorphism subgroup of I. In this article, we show that each such isomorphism subgroup is equal to its normalizer. For that, we study when the isomorphism subgroup of a right ideal of A ₁ contains a given isomorphism subgroup.     

On Finite n-Acentralizer Groups

Let G be a group and Aut(G) be the group of automorphisms of G. Then the Acentralizer of an automorphism α ∈Aut(G) in G is defined as C _G (α) = {g ∈ G∣α(g) = g}. For a finite group G, let Acent(G) = {C _G (α)∣α ∈Aut(G)}. Then for any natural number n, we say that G is n-Acentralizer group if |Acent(G)| =n. We show that for any natural number n, there exists a finite n-Acentralizer group and determine the structure of finite n-Acentralizer groups for n ≤ 5.     

A result concerning nilpotent values with generalized skew derivations on Lie ideals

ABSTRACT

Let n≥1 be a fixed integer, R a prime ring with its right Martindale quotient ring Q, C the extended centroid, and L a non-central Lie ideal of R. If F is a generalized skew derivation of R such that (F(x)F(y)?yx)ⁿ = 0 for all x,y∈L, then char(R) = 2 and R?M₂(C), the ring of 2×2 matrices over C.     

A classification of tightly attached half-arc-transitive graphs of valency 4

A graph is said to be half-arc-transitive if its automorphism group acts transitively on the set of its vertices and edges but not on the set of its arcs. With each half-arc-transitive graph of valency 4 a collection of the so-called alternating cycles is associated, all of which have the same even length. Half of this length is called the radius of the graph in question. Moreover, any two adjacent alternating cycles have the same number of common vertices. If this number, the so-called attachment number, coincides with the radius, we say that the graph is tightly attached. In [D. Marušič, Half-transitive group actions on finite graphs of valency 4, J. Combin. Theory Ser. B 73 (1998) 41–76], Marušič gave a classification of tightly attached half-arc-transitive graphs of valency 4 with odd radius. In this paper the even radius tightly attached graphs of valency 4 are classified, thus completing the classification of all tightly attached half-arc-transitive graphs of valency 4.     

Symmetry in complex networks

We consider the size and structure of the automorphism groups of a variety of empirical ‘real-world’ networks and find that, in contrast to classical random graph models, many real-world networks are richly symmetric. We construct a practical network automorphism group decomposition, relate automorphism group structure to network topology and discuss generic forms of symmetry and their origin in real-world networks. We also comment on how symmetry can affect network redundancy and robustness.     

On the classification of quartic half-arc-transitive metacirculants

A half-arc-transitive graph is a vertex- and edge- but not arc-transitive graph. Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms ρ and σ, where ρ is (m,n)-semiregular for some integers m≥1 and n≥2, and where σ normalizes ρ, cyclically permuting the orbits of ρ in such a way that σ^m has at least one fixed vertex. In a recent paper Maruši? and the author showed that each connected quartic half-arc-transitive metacirculant belongs to one (or possibly more) of four classes of such graphs, reflecting the structure of the quotient graph relative to the semiregular automorphism ρ. One of these classes coincides with the class of the so-called tightly-attached graphs, which have already been completely classified. In this paper a complete classification of the second of these classes, that is the class of quartic half-arc-transitive metacirculants for which the quotient graph relative to the semiregular automorphism ρ is a cycle with a loop at each vertex, is given.     

On the binary projective codes with dimension 6

All binary projective codes of dimension up to 6 are classified. Information about the number of the codes with different minimum distances and automorphism group orders is given.     

Biplanes with flag-transitive automorphism groups of almost simple type,with exceptional socle of Lie type

In this paper we prove that there is no biplane admitting a flag-transitive automorphism group of almost simple type, with exceptional socle of Lie type. A biplane is a (v,k,2)-symmetric design, and a flag is an incident point-block pair. A group G is almost simple with socle X if X is the product of all the minimal normal subgroups of G, and X⊴G≤Aut (G). Throughout this work we use the classification of finite simple groups, as well as results from P.B. Kleidman’s Ph.D. thesis which have not been published elsewhere.     

量子环面李代数的自同构群, 泛中心扩张与导子

C_q:=C_q[x^±1₁, x^±1₂] 为复数域上的量子环面, 其中q≠ 0是一个非单位根, D(C_q) 为C_q的导子李代数. 记L_q 为C_q ㈩ D(C_q)的导出子代数. 该文研究李代数L_q的自同构群, 泛中心扩张和导子李代数.     

量子环面李代数的自同构群,泛中心扩张与导子

Cq=Cq[x1^±1,x2^±1]为复数域上的量子环面，其中q≠0是一个非单位根，D（Cq）为Cq的导子李代数．记Lq为Cq＋D（Cq）的导出子代数．该文研究李代数Lq的自同构群，泛中心扩张和导子李代数．