The automorphism group of a free-by-cyclic group in rank 2

Vegeu el resum a l'inici del document del fitxer adjunt

Maximal compactness, min- imal Hausdor ness and reversibility of frames and a study on automorphism group of frames

One can do research in pointfree topology in two ways. The rst is the contravariant way where research is done in the category Frm but the ultimate objective is to obtain results in Loc. The other way is the covariant way to carry out research in the category Loc itself directly. According to Johnstone [23], \frame theory is lattice theory applied to topology whereas locale theory is topology itself". The most part of this thesis is written according to the rst view. In this thesis, we make an attempt to study about 1. the frame counterparts of maximal compactness, minimal Hausdor - ness and reversibility, 2. the automorphism groups of a nite frame and its relation with the subgroups of the permutation group on the generator set of the frame

On the Closure of the Tame Automorphism Group of Affine Three-Space

We provide explicit families of tame automorphisms of the complex affine three-space which degenerate to wild automorphisms. This shows that the tame subgroup of the group of polynomial automorphisms of C3 is not closed, when the latter is seen as an infinite-dimensional algebraic group.

Novel techniques for automorphism group computation

Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphism group of an input graph. In this work we propose four novel techniques to speed up algorithms that solve the GA problem by exploring a search tree. They increase the performance of the algorithm by allowing to reduce the depth of the search tree, and by effectively pruning it. We formally prove that a GA algorithm that uses these techniques correctly computes the automorphism group of the input graph. We also describe how the techniques have been incorporated into the GA algorithm conauto, as conauto-2.03, with at most an additive polynomial increase in its asymptotic time complexity. We have experimentally evaluated the impact of each of the above techniques with several graph families. We have observed that each of the techniques by itself significantly reduces the number of processed nodes of the search tree in some subset of graphs, which justifies the use of each of them. Then, when they are applied together, their effect is combined, leading to reductions in the number of processed nodes in most graphs. This is also reflected in a reduction of the running time, which is substantial in some graph families.

On the automorphism group of a reduced automaton /

"Supported in part jointly by the Atomic Energy Commission and the Advanced Research Projects Agency under AEC Contract AT(11-1)-1018."

The automorphism group of a strongly connected automaton and its quotient automata /

"February 14, 1966."

The Automorphism Group of the Free Algebra of Rank Two

The theorem of Czerniakiewicz and Makar-Limanov, that all the automorphisms of a free algebra of rank two are tame is proved here by showing that the group of these automorphisms is the free product of two groups (amalgamating their intersection), the group of all affine automorphisms and the group of all triangular automorphisms. The method consists in finding a bipolar structure. As a consequence every finite subgroup of automorphisms (in characteristic zero) is shown to be conjugate to a group of linear automorphisms.

Automorphism Groups of Generalized (Binary) Icosahedral, Tetrahedral and Octahedral Groups

Let G be any of the (binary) icosahedral, generalized octahedral (tetrahedral) groups or their quotients by the center. We calculate the automorphism group Aut(G).

Flexible varieties and automorphism groups

Given an irreducible affine algebraic variety X of dimension n≥2 , we let SAut(X) denote the special automorphism group of X , that is, the subgroup of the full automorphism group Aut(X) generated by all one-parameter unipotent subgroups. We show that if SAut(X) is transitive on the smooth locus X reg , then it is infinitely transitive on X reg . In turn, the transitivity is equivalent to the flexibility of X . The latter means that for every smooth point x∈X reg the tangent space T x X is spanned by the velocity vectors at x of one-parameter unipotent subgroups of Aut(X) . We also provide various modifications and applications.

Holomorphic Automorphisms of Danielewski Surfaces II: Structure of the Overshear Group

We apply Nevanlinna theory for algebraic varieties to Danielewski surfaces and investigate their group of holomorphic automorphisms. Our main result states that the overshear group, which is known to be dense in the identity component of the holomorphic automorphism group, is a free product.

New Symmetric (61,16,4) Designs Invariant Under the Dihedral Group of Order 10

∗ This work has been partially supported by the Bulgarian NSF under Contract No. I-506/1995.

Polynomial automorphisms over finite fields: Mimicking tame maps by the Derksen group

2010 Mathematics Subject Classification: 14L99, 14R10, 20B27.

Contraction groups in complete Kac-Moody groups

Let G be an abstract Kac-Moody group over a finite field and G the closure of the image of G in the automorphism group of its positive building. We show that if the Dynkin diagram associated to G is irreducible and neither of spherical nor of affine type, then the contraction groups of elements in G which are not topologically periodic are not closed. (In those groups there always exist elements which are not topologically periodic.)

Subshifts with Simple Cellular Automata

A subshift is a set of in nite one- or two-way sequences over a xed nite set, de ned by a set of forbidden patterns. In this thesis, we study subshifts in the topological setting, where the natural morphisms between them are ones de ned by a (spatially uniform) local rule. Endomorphisms of subshifts are called cellular automata, and we call the set of cellular automata on a subshift its endomorphism monoid. It is known that the set of all sequences (the full shift) allows cellular automata with complex dynamical and computational properties. We are interested in subshifts that do not support such cellular automata. In particular, we study countable subshifts, minimal subshifts and subshifts with additional universal algebraic structure that cellular automata need to respect, and investigate certain criteria of `simplicity' of the endomorphism monoid, for each of them. In the case of countable subshifts, we concentrate on countable so c shifts, that is, countable subshifts de ned by a nite state automaton. We develop some general tools for studying cellular automata on such subshifts, and show that nilpotency and periodicity of cellular automata are decidable properties, and positive expansivity is impossible. Nevertheless, we also prove various undecidability results, by simulating counter machines with cellular automata. We prove that minimal subshifts generated by primitive Pisot substitutions only support virtually cyclic automorphism groups, and give an example of a Toeplitz subshift whose automorphism group is not nitely generated. In the algebraic setting, we study the centralizers of CA, and group and lattice homomorphic CA. In particular, we obtain results about centralizers of symbol permutations and bipermutive CA, and their connections with group structures.

Generator Matrix Based Search for Extremal Self-Dual Binary Error-Correcting Codes

Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest possible minimum distance for a given length and dimension. The existence of an extremal (72,36,16) Type II code is still open. Previous results show that the automorphism group of a putative code C with the aforementioned properties has order 5 or dividing 24. In this work, we present a method and the results of an exhaustive search showing that such a code C cannot admit an automorphism group Z6. In addition, we present so far unpublished construction of the extended Golay code by P. Becker. We generalize the notion and provide example of another Type II code that can be obtained in this fashion. Consequently, we relate Becker's construction to the construction of binary Type II codes from codes over GF(2^r) via the Gray map.