On automorphisms of split metacyclic groups

Let D( m, n; k) be the semi-direct product of two finite cyclic groups Z/m = < x > and Z/n = < y >, where the action is given by yxy(-1) = x(k). In particular, this includes the dihedral groups D(2m). We calculate the automorphism group Aut (D(m, n; k)).

On automorphisms of finite abelian p-groups

Let A be a finitely generated abelian group. We describe the automorphism group Aut(A) using the rank of A and its torsion part p-part A(p). For a finite abelian p-group A of type (k(1),..., k(n)), simple necessary and sufficient conditions for an n x n-matrix over integers to be associated with an automorphism of A are presented. Then, the automorphism group Aut(A) for a finite p-group A of type (k(1), k(2)) is analyzed. (C) 2008 Mathematical Institute Slovak Academy of Sciences.

How complex a dynamical network can be?

Positive Lyapunov exponents measure the asymptotic exponential divergence of nearby trajectories of a dynamical system. Not only they quantify how chaotic a dynamical system is, but since their sum is an upper bound for the rate of information production, they also provide a convenient way to quantify the complexity of a dynamical network. We conjecture based on numerical evidences that for a large class of dynamical networks composed by equal nodes, the sum of the positive Lyapunov exponents is bounded by the sum of all the positive Lyapunov exponents of both the synchronization manifold and its transversal directions, the last quantity being in principle easier to compute than the latter. As applications of our conjecture we: (i) show that a dynamical network composed of equal nodes and whose nodes are fully linearly connected produces more information than similar networks but whose nodes are connected with any other possible connecting topology; (ii) show how one can calculate upper bounds for the information production of realistic networks whose nodes have parameter mismatches, randomly chosen: (iii) discuss how to predict the behavior of a large dynamical network by knowing the information provided by a system composed of only two coupled nodes. (C) 2011 Elsevier B.V. All rights reserved.

Symmetry breaking in the genetic code: Finite groups

We investigate the possibility of interpreting the degeneracy of the genetic code, i.e., the feature that different codons (base triplets) of DNA are transcribed into the same amino acid, as the result of a symmetry breaking process, in the context of finite groups. In the first part of this paper, we give the complete list of all codon representations (64-dimensional irreducible representations) of simple finite groups and their satellites (central extensions and extensions by outer automorphisms). In the second part, we analyze the branching rules for the codon representations found in the first part by computational methods, using a software package for computational group theory. The final result is a complete classification of the possible schemes, based on finite simple groups, that reproduce the multiplet structure of the genetic code. (C) 2010 Elsevier Ltd. All rights reserved.

TWISTED CONJUGACY CLASSES IN R. THOMPSON`S GROUP F

In this article, we prove that any automorphism of R. Thompson`s group F has infinitely many twisted conjugacy classes. The result follows from the work of Brin, together with standard facts about R. Thompson`s group F, and elementary properties of the Reidemeister numbers.

Crossed products by twisted partial actions and graded algebras

For a twisted partial action e of a group G on an (associative non-necessarily unital) algebra A over a commutative unital ring k, the crossed product A x(Theta) G is proved to be associative. Given a G-graded k-algebra B = circle plus(g is an element of G) B-g with the mild restriction of homogeneous non-degeneracy, a criteria is established for B to be isomorphic to the crossed product B-1 x(Theta) G for some twisted partial action of G on B-1. The equality BgBg-1 B-g = B-g (for all g is an element of G) is one of the ingredients of the criteria, and if it holds and, moreover, B has enough local units, then it is shown that B is stably isomorphic to a crossed product by a twisted partial action of G. (c) 2008 Elsevier Inc. All rights reserved.

REIDEMEISTER SPECTRUM FOR METABELIAN GROUPS OF THE FORM Q(n) x Z AND Z[1/p](n) x Z, p PRIME

In this paper, we study the Reidemeister spectrum for metabelian groups of the form Q(n) x Z and Z[1/p](n) x Z. Particular attention is given to the R(infinity)-property of a subfamily of these groups.

SIGMA THEORY AND TWISTED CONJUGACY CLASSES

Using Sigma theory we show that for large classes of groups G there is a subgroup H of finite index in Aut(G) such that for phi is an element of H the Reidemeister number R(phi) is infinite. This includes all finitely generated nonpolycyclic groups G that fall into one of the following classes: nilpotent-by-abelian groups of type FP(infinity); groups G/G `` of finite Prufer rank; groups G of type FP(2) without free nonabelian subgroups and with nonpolycyclic maximal metabelian quotient; some direct products of groups; or the pure symmetric automorphism group. Using a different argument we show that the result also holds for 1-ended nonabelian nonsurface limit groups. In some cases, such as with the generalized Thompson`s groups F(n,0) and their finite direct products, H = Aut(G).