On computable automorphisms in formal concept analysis

Under study are the automorphism groups of computable formal contexts. We give a general method to transform results on the automorphisms of computable structures into results on the automorphisms of formal contexts. Using this method, we prove that the computable formal contexts and computable structures actually have the same automorphism groups and groups of computable automorphisms. We construct some examples of formal contexts and concept lattices that have nontrivial automorphisms but none of them could be hyperarithmetical in any hyperarithmetical presentation of these structures. We also show that it could be happen that two formal concepts are automorphic but they are not hyperarithmetically automorphic in any hyperarithmetical presentation.     

The categoricity of the group of all computable automorphisms of the rational numbers

We prove that there is a first-order sentence ϕ such that the group of all computable automorphisms of the ordering of the rational numbers is its only model among the groups that are embeddable in the group of all computable permutations. Supported by a Scheme 2 grant from the London Mathematical Society. __________ Translated from Algebra i Logika, Vol. 46, No. 5, pp. 649–662, September–October, 2007.     

Boolean Algebras with Finite Families of Computable Automorphisms

We prove that each computable Boolean algebra has a computable presentation in which for every computable family of automorphisms the set of atoms moved by at least one of its members is finite. This implies that each computable atomic Boolean algebra has a computable presentation in which its every computable family of automorphisms is finite. The priority argument is not used in the proof.     

On a Hierarchy of Groups of Computable Automorphisms

Basics and results on groups of computable automorphisms are collected in [1].We recall the main definitions. A computable model $$\mathfrak{M} = \langle A,f_0^{n_0 } ,...;P_0^{m_0 } ,...\rangle $$ is a model in which A is a computable subset of the set ! of natural numbers, the mappings i 7! ni(the number of arguments of fi) and i ? mi (the number of arguments of Pi) are computable, andall operations fi and predicates Pi are computable uniformly in i. A computable automorphism ofa computable model M is an automorphism of $\mathfrak{M}$ which is a computable function on its universe. Allsuch automorphisms form a group denoted by Autc $\mathfrak{M}$ .     

On Classifying Subsets of Natural Numbers by Their Computable Permutations

We introduce some alternative definitions of the concept of computable automorphism of a set of natural numbers. We study their relationships and investigate whether some classes of sets having isomorphic groups of automorphisms coincide with other classes of sets usual in computability. Finally, we show that the classification of sets by these groups of automorphisms is nontrivial.     

On a Hierarchy of Groups of Computable Automorphisms

Basics and results on groups of computable automorphisms are collected in [1].We recall the main definitions. A computable model

Automorphisms of certain groups and semigroups of matrices

Characterizations are given for automorphisms of semigroups of nonnegative matrices including doubly stochastic matrices, row (column) stochastic matrices, positive matrices, and nonnegative monomial matrices. The proofs utilize the structure of the automorphisms of the symmetric group (realized as the group of permutation matrices) and alternating group. Furthermore, for each of the above (semi)groups of matrices, a larger (semi)group of matrices is obtained by relaxing the nonnegativity assumption. Characterizations are also obtained for the automorphisms on the larger (semi)groups and their subgroups (subsemigroups) as well.     

Homological Properties of Quantum Polynomials

We study the endomorphim semigroup of a general quantum polynomial ring, its finite groups of automorphisms, and homological properties, as a module over the skew group ring of a finite group of automorphisms. Moreover, properties of the division ring of fractions are considered.     

The direction of an automorphism of a totally disconnected locally compact group

We describe the asymptotic behavior of automorphisms of totally disconnected locally compact groups in terms of a set of `directions' which comes equipped with a natural pseudo-metric. The structure at infinity obtained by completing the induced metric quotient space of the set of directions recovers familiar objects such as: the set of ends of the tree for the group of inner automorphisms of the group of isometries of a regular locally finite tree; and the spherical Bruhat-Tits building for the group of inner automorphisms of the set of rational points of a semisimple group over a local field. Research supported by A.R.C. Grant DP0208137.     

Automorphism Groups of Computably Enumerable Predicates

We study automorphism groups of two important predicates in computability theory: the predicate W_y and the graph of a universal partially computable function. It is shown that all automorphisms of the predicates in question are computable. The actions of the automorphism groups on some index sets are examined, and we establish a number of results on the structure of these. We also look into homomorphisms of the two predicates. In this case the situation changes: all homomorphisms of the universal function are computable, but in each Turing degree, homomorphisms of W_y exist.     

Coleman automorphisms of finite groups and their minimal normal subgroups

In this paper, we show that all Coleman automorphisms of a finite group with self-central minimal non-trivial characteristic subgroup are inner; therefore the normalizer property holds for these groups. Using our methods we show that the holomorph and wreath product of finite simple groups, among others, have no non-inner Coleman automorphisms. As a further application of our theorems, we provide partial answers to questions raised by M. Hertweck and W. Kimmerle. Furthermore, we characterize the Coleman automorphisms of extensions of a finite nilpotent group by a cyclic p-group. Finally, we note that class-preserving Coleman automorphisms of p-power order of some nilpotent-by-nilpotent groups are inner, extending a result by J. Hai and J. Ge, where p is a prime number.     

Elusive groups of automorphisms of digraphs of small valency

A transitive permutation group is called elusive if it contains no semiregular element. We show that no group of automorphisms of a connected graph of valency at most four is elusive and determine all the elusive groups of automorphisms of connected digraphs of out-valency at most three.     

Computable torsion-free nilpotent groups of finite dimension

We find criteria for the computability (constructivizability) of torsion-free nilpotent groups of finite dimension. We prove the existence of a principal computable enumeration of the class of all computable torsion-free nilpotent groups of finite dimension. An example is constructed of a subgroup in the group of all unitriangular matrices of dimension 3 over the field of rationals that is not computable but the sections of any of its central series are computable.     

Groups acting on tree-graded spaces and splittings of relatively hyperbolic groups

Tree-graded spaces are generalizations of R-trees. They appear as asymptotic cones of groups (when the cones have cut-points). Since many questions about endomorphisms and automorphisms of groups, solving equations over groups, studying embeddings of a group into another group, etc. lead to actions of groups on the asymptotic cones, it is natural to consider actions of groups on tree-graded spaces. We develop a theory of such actions which generalizes the well-known theory of groups acting on R-trees. As applications of our theory, we describe, in particular, relatively hyperbolic groups with infinite groups of outer automorphisms, and co-Hopfian relatively hyperbolic groups.     

The structure of skew products with ergodic group automorphisms

We prove that ergodic automorphisms of compact groups are Bernoulli shifts, and that skew products with such automorphisms are isomorphic to direct products. We give a simple geometric demonstration of Yuzvinskii’s basic result in the calculation of entropy for group automorphisms, and show that the set of possible values for entropy is one of two alternatives, depending on the answer to an open problem in algebraic number theory. We also classify those algebraic factors of a group automorphism that are complemented.     

Elliptic K3 Surfaces with Abelian and Dihedral Groups of Symplectic Automorphisms

We analyze K3 surfaces admitting an elliptic fibration ? and a finite group G of symplectic automorphisms preserving this elliptic fibration. We construct the quotient elliptic fibration ?/G comparing its properties to the ones of ?.

We show that if ? admits an n-torsion section, its quotient by the group of automorphisms induced by this section admits again an n-torsion section, and we describe the coarse moduli space of K3 surfaces with a given finite group contained in the Mordell–Weil group.

Considering automorphisms coming from the base of the fibration, we find the Mordell–Weil lattice of a fibration described by Kloosterman, and we find K3 surfaces with dihedral groups as group of symplectic automorphisms. We prove the isometries between lattices described by the author and Sarti and lattices described by Shioda and by Greiss and Lam.     

The braid group of a necklace

We show several geometric and algebraic aspects of a necklace: a link composed with a core circle and a series of (unlinked) circles linked to this core. We first prove that the fundamental group of the configuration space of necklaces (that we will call braid group of a necklace) is isomorphic to the braid group over an annulus quotiented by the square of the center. We then define braid groups of necklaces and affine braid groups of type \(\mathcal {A}\) in terms of automorphisms of free groups and characterize these automorphisms among all automorphisms of free groups. In the case of affine braid groups of type \(\mathcal {A}\) such a representation is faithful.