Lifting Automorphisms

Let A be a unital nuclear separable C*-algebra which satisfies the Universal Coefficient Theorem and E be a unital essential extension of the form:

Central Automorphisms and Inner Automorphisms in Finitely Generated Groups

Let G be a group and Aut_c(G) be the group of all central automorphisms of G. We know that in a finite p-group G, Aut_c(G) = Inn(G) if and only if Z(G) = G′ and Z(G) is cyclic. But we shown that we cannot extend this result for infinite groups. In fact, there exist finitely generated nilpotent groups of class 2 in which G′ =Z(G) is infinite cyclic and Inn(G) < C* = Aut_c(G). In this article, we characterize all finitely generated groups G for which the equality Aut_c(G) = Inn(G) holds.     

Automorphisms of groups

The survey presents classical assertions due to Nielsen, Whitehead, and others, well-known theorems on automorphisms included in monographs on group theory, and recent results in this area. Attention is focused on the progress in automorphism groups theory for free, solvable, modular, and profinite groups. New tools of investigation using graphs and geometrical ideas are also discussed.     

Irreducible actions

Subdirectly irreducible acts and finitely subdirectly irreducible acts are characterized, for acts over a commutative semigroup that satisfy finiteness conditions.      

Irreducible graphs

The fact that there is exactly one cubic graph irreducibly non-representable on a plane was demonstrated by C. Kuratowski in 1930. This paper gives bounds for the number of nodes in a cubic graph irreducibly non-representable on a surface S in terms of the number of nodes of subgraphs. An upper bound (866) is given for the number of nodes in a cubic graph irreducibly non-representable on a projective plane.     

Twisting geometric codes

The aim of this paper is to explain how, starting from a Goppa code C(X,G,P₁,…,P_n) and a cyclic covering π:Y→X of degree m, one can twist the initial code to another one C(X,G+D_χ,P₁,…,P_n), where D_χ is a non-principal degree 0 divisor on X associated to a character χ of Gal(Y/X), in the hope that ℓ_X(G+D_χ)>ℓ_X(G). We give, using a MAGMA program, several examples where this occurs, and where both the initial and twisted codes have same minimum distance, so that initial codes have been improved.     

X-Inner Automorphisms,Automorphisms, and Isomorphisms of Skew Polynomial Rings

Abstract

In this paper, we examine the X-inner automorphisms, automorphisms, and isomorphisms of skew polynomial rings of the form K[x][y;δ], where K is a field of characteristic 0 and δ is a derivation of K [x] such that x ^δ is a polynomial of degree ≥ 1. We 1.  determine the group of X-inner automorphisms of K [x][ y;δ],

2.  analyze the structure of the group of automorphisms of K [x][ y;δ], and

3.  examine the isomorphism classes of skew polynomial rings of the form K [x][ y;δ].

We also provide several examples which indicate the importance of the base field in computing the X-inner automorphisms, automorphisms, and isomorphism classes of K [x][ y;δ].     

一些(双)代数的不可约表示

本文完全刻画了下列代数k,k,k(x,Y,Z|ZX-qXZ=1-θY2,ZY=qYZ,YX= qXY>和M(p,q)=k的不可约表示．     

Automorphisms of metacyclic groups

A metacyclic group H can be presented as 〈α,β: αⁿ = 1, β^m = α^t, βαβ^?1 = α^r〉 for some n, m, t, r. Each endomorphism σ of H is determined by \(\sigma(\alpha)=\alpha^{x_1}\beta^{y_1}, \sigma(\beta)=\alpha^{x_2}\beta^{y_2}\) for some integers x₁, x₂, y₁, y₂. We give sufficient and necessary conditions on x₁, x₂, y₁, y₂ for σ to be an automorphism.     

Automorphisms of Cayley graphs

The aim of this paper is to characterize subgroups of non-regular automorphism groups of Cayley graphs. Relations between group automorphisms, graph automorphisms and permutations of the edge set of Cayley graphs are investigated.     

Noetherian Automorphisms of Groups

An automorphism α of a group G is called a noetherian automorphism if for each ascending chain

Automorphisms of hyperelliptic GAG-codes

We determine the n-automorphism group of generalized algebraic-geometry codes associated with rational, elliptic and hyperelliptic function fields. Such group is, up to isomorphism, a subgroup of the automorphism group of the underlying function field.     

Automorphisms of lexicographic products

The automorphism group Γ(P) of a partially ordered set P consists of all permutations on P that preserve order (and have order preserving inverses). In this paper we raise, and partially answer, the question: How is the automorphism group of the lexicographic product (P × Q) of two orders (P and Q) related to the automorphism groups of the factors, P and Q?We show that the wreath product Γ(Q) wr ΓP) is always contained in Γ(P × Q). We find necessary and sufficient conditions for Γ(P × Q) to equal Γ(Q) wr Γ(P), and when P and Q are finite, we find a complete characterization of Γ(P × Q) in terms of Γ(P), Γ(Q) and properties of P and Q.