Seifert fibred knot manifolds

We consider the question of when is the closed manifold obtained by elementary surgery on an $n$-knot Seifert fibred over a 2-orbifold. After some observations on the classical case, we concentrate on the cases n=2 and 3. We have found a new family of 2-knots with torsion-free, solvable group, overlooked in earlier work. We know of no higher dimensional examples.Comment: New co-author, stronger restrictions on possible Seifert bases. Final section on 3-knots reduced to a paragraph, as a lemma was misused in the original version. Version 3; minor improvements to first paragraph and notatio

Mapping the potential within a nanoscale undoped GaAs region using a scanning electron microscope

Semiconductor dopant profiling using secondary electron imaging in a scanning electron microscope (SEM) has been developed in recent years. In this paper, we show that the mechanism behind it also allows mapping of the electric potential of undoped regions. By using an unbiased GaAs/AlGaAs heterostructure, this article demonstrates the direct observation of the electrostatic potential variation inside a 90nm wide undoped GaAs channel surrounded by ionized dopants. The secondary electron emission intensities are compared with two-dimensional numerical solutions of the electric potential.Comment: 7 pages, 3 figure

Young's experiment and the finiteness of information

Young's experiment is the quintessential quantum experiment. It is argued here that quantum interference is a consequence of the finiteness of information. The observer has the choice whether that information manifests itself as path information or in the interference pattern or in both partially to the extent defined by the finiteness of information.Comment: 5 pages, 3 figures, typos remove

One Relator Quotients of Graph Products

In this paper, we generalise Magnus' Freiheitssatz and solution to the word problem for one-relator groups by considering one relator quotients of certain classes of right-angled Artin groups and graph products of locally indicable polycyclic groups

The structure of one-relator relative presentations and their centres

Suppose that G is a nontrivial torsion-free group and w is a word in the alphabet G\cup\{x_1^{\pm1},...,x_n^{\pm1}\} such that the word w' obtained from w by erasing all letters belonging to G is not a proper power in the free group F(x_1,...,x_n). We show how to reduce the study of the relative presentation \^G= to the case n=1. It turns out that an "n-variable" group \^G can be constructed from similar "one-variable" groups using an explicit construction similar to wreath product. As an illustration, we prove that, for n>1, the centre of \^G is always trivial. For n=1, the centre of \^G is also almost always trivial; there are several exceptions, and all of them are known.Comment: 15 pages. A Russian version of this paper is at http://mech.math.msu.su/department/algebra/staff/klyachko/papers.htm . V4: the intoduction is rewritten; Section 1 is extended; a short introduction to Secton 5 is added; some misprints are corrected and some cosmetic improvements are mad

Groups of Fibonacci type revisited

This article concerns a class of groups of Fibonacci type introduced by Johnson and Mawdesley that includes Conway?s Fibonacci groups, the Sieradski groups, and the Gilbert-Howie groups. This class of groups provides an interesting focus for developing the theory of cyclically presented groups and, following questions by Bardakov and Vesnin and by Cavicchioli, Hegenbarth, and Repov?s, they have enjoyed renewed interest in recent years. We survey results concerning their algebraic properties, such as isomorphisms within the class, the classification of the finite groups, small cancellation properties, abelianizations, asphericity, connections with Labelled Oriented Graph groups, and the semigroups of Fibonacci type. Further, we present a new method of proving the classification of the finite groups that deals with all but three groups

L^2-Betti numbers of one-relator groups

We determine the L^2-Betti numbers of all one-relator groups and all surface-plus-one-relation groups (surface-plus-one-relation groups were introduced by Hempel who called them one-relator surface groups). In particular we show that for all such groups G, the L^2-Betti numbers b_n^{(2)}(G) are 0 for all n>1. We also obtain some information about the L^2-cohomology of left-orderable groups, and deduce the non-L^2 result that, in any left-orderable group of homological dimension one, all two-generator subgroups are free.Comment: 18 pages, version 3, minor changes. To appear in Math. An

Markov semigroups, monoids, and groups

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating set. This paper considers the natural generalizations of these concepts to semigroups and monoids. Two distinct potential generalizations to monoids are shown to be equivalent. Various interesting examples are presented, including an example of a non-Markov monoid that nevertheless admits a regular language of unique representatives over any generating set. It is shown that all finitely generated commutative semigroups are strongly Markov, but that finitely generated subsemigroups of virtually abelian or polycyclic groups need not be. Potential connections with word-hyperbolic semigroups are investigated. A study is made of the interaction of the classes of Markov and strongly Markov semigroups with direct products, free products, and finite-index subsemigroups and extensions. Several questions are posed.Comment: 40 pages; 3 figure

Largeness and SQ-universality of cyclically presented groups

Largeness, SQ-universality, and the existence of free subgroups of rank 2 are measures of the complexity of a finitely presented group. We obtain conditions under which a cyclically presented group possesses one or more of these properties. We apply our results to a class of groups introduced by Prishchepov which contains, amongst others, the various generalizations of Fibonacci groups introduced by Campbell and Robertson

Large Aperiodic Semigroups

The syntactic complexity of a regular language is the size of its syntactic semigroup. This semigroup is isomorphic to the transition semigroup of the minimal deterministic finite automaton accepting the language, that is, to the semigroup generated by transformations induced by non-empty words on the set of states of the automaton. In this paper we search for the largest syntactic semigroup of a star-free language having $n$ left quotients; equivalently, we look for the largest transition semigroup of an aperiodic finite automaton with $n$ states. We introduce two new aperiodic transition semigroups. The first is generated by transformations that change only one state; we call such transformations and resulting semigroups unitary. In particular, we study complete unitary semigroups which have a special structure, and we show that each maximal unitary semigroup is complete. For $n \ge 4$ there exists a complete unitary semigroup that is larger than any aperiodic semigroup known to date. We then present even larger aperiodic semigroups, generated by transformations that map a non-empty subset of states to a single state; we call such transformations and semigroups semiconstant. In particular, we examine semiconstant tree semigroups which have a structure based on full binary trees. The semiconstant tree semigroups are at present the best candidates for largest aperiodic semigroups. We also prove that $2^n-1$ is an upper bound on the state complexity of reversal of star-free languages, and resolve an open problem about a special case of state complexity of concatenation of star-free languages.Comment: 22 pages, 1 figure, 2 table