Characterization of families of rank 3 permutation groups by the subdegrees II

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46712/1/13_2005_Article_BF01220928.pd

On Turing dynamical systems and the Atiyah problem

Main theorems of the article concern the problem of M. Atiyah on possible values of l^2-Betti numbers. It is shown that all non-negative real numbers are l^2-Betti numbers, and that "many" (for example all non-negative algebraic) real numbers are l^2-Betti numbers of simply connected manifolds with respect to a free cocompact action. Also an explicit example is constructed which leads to a simply connected manifold with a transcendental l^2-Betti number with respect to an action of the threefold direct product of the lamplighter group Z/2 wr Z. The main new idea is embedding Turing machines into integral group rings. The main tool developed generalizes known techniques of spectral computations for certain random walk operators to arbitrary operators in groupoid rings of discrete measured groupoids.Comment: 35 pages; essentially identical to the published versio

A simple group of order 44,352,000

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/46258/1/209_2005_Article_BF01110435.pd

Normal subgroups in the Cremona group (long version)

Let k be an algebraically closed field. We show that the Cremona group of all birational transformations of the projective plane P^2 over k is not a simple group. The strategy makes use of hyperbolic geometry, geometric group theory, and algebraic geometry to produce elements in the Cremona group that generate non trivial normal subgroups.Comment: With an appendix by Yves de Cornulier. Numerous but minors corrections were made, regarding proofs, references and terminology. This long version contains detailled proofs of several technical lemmas about hyperbolic space

A Census Of Highly Symmetric Combinatorial Designs

As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v,k,1) designs, mainly for t = 2, admitting groups of automorphisms with sufficiently strong symmetry properties. However, despite the finite simple group classification, for Steiner t-designs with t > 2 most of these characterizations have remained longstanding challenging problems. Especially, the determination of all flag-transitive Steiner t-designs with 2 < t < 7 is of particular interest and has been open for about 40 years (cf. [11, p. 147] and [12, p. 273], but presumably dating back to 1965). The present paper continues the author's work [20, 21, 22] of classifying all flag-transitive Steiner 3-designs and 4-designs. We give a complete classification of all flag-transitive Steiner 5-designs and prove furthermore that there are no non-trivial flag-transitive Steiner 6-designs. Both results rely on the classification of the finite 3-homogeneous permutation groups. Moreover, we survey some of the most general results on highly symmetric Steiner t-designs.Comment: 26 pages; to appear in: "Journal of Algebraic Combinatorics

A software framework for analysing solid-state MAS NMR data

Solid-state magic-angle-spinning (MAS) NMR of proteins has undergone many rapid methodological developments in recent years, enabling detailed studies of protein structure, function and dynamics. Software development, however, has not kept pace with these advances and data analysis is mostly performed using tools developed for solution NMR which do not directly address solid-state specific issues. Here we present additions to the CcpNmr Analysis software package which enable easier identification of spinning side bands, straightforward analysis of double quantum spectra, automatic consideration of non-uniform labelling schemes, as well as extension of other existing features to the needs of solid-state MAS data. To underpin this, we have updated and extended the CCPN data model and experiment descriptions to include transfer types and nomenclature appropriate for solid-state NMR experiments, as well as a set of experiment prototypes covering the experiments commonly employed by solid-sate MAS protein NMR spectroscopists. This work not only improves solid-state MAS NMR data analysis but provides a platform for anyone who uses the CCPN data model for programming, data transfer, or data archival involving solid-state MAS NMR data

On Measuring Non-Recursive Trade-Offs

We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general. We also identify criteria which, in the spirit of abstract language theory, allow us to deduce non-recursive tradeoffs from effective closure properties of language families on the one hand, and differences in the decidability status of basic decision problems on the other. We develop a qualitative classification of non-recursive trade-offs in order to obtain a better understanding of this very fundamental behaviour of descriptional systems

Peripheral fillings of relatively hyperbolic groups

A group theoretic version of Dehn surgery is studied. Starting with an arbitrary relatively hyperbolic group $G$ we define a peripheral filling procedure, which produces quotients of $G$ by imitating the effect of the Dehn filling of a complete finite volume hyperbolic 3--manifold $M$ on the fundamental group $\pi_1(M)$. The main result of the paper is an algebraic counterpart of Thurston's hyperbolic Dehn surgery theorem. We also show that peripheral subgroups of $G$ 'almost' have the Congruence Extension Property and the group $G$ is approximated (in an algebraic sense) by its quotients obtained by peripheral fillings. Various applications of these results are discussed.Comment: The difference with the previous version is that Proposition 3.2 is proved for quasi--geodesics instead of geodesics. This allows to simplify the exposition in the last section. To appear in Invent. Mat

Languages ordered by the subword order

We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the language, the used predicates, and the fragment of the logic, we determine four new combinations that yield decidable theories. These results extend earlier ones where only the language of all words without the cover relation and fragments of first-order logic were considered

Homeomorphic Embedding for Online Termination of Symbolic Methods

Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure the termination of techniques for program analysis, specialisation, transformation, and verification. In this paper we survey and discuss this use of homeomorphic embedding and clarify the advantages of such an approach over one using well-founded orders. We also discuss various extensions of the homeomorphic embedding relation. We conclude with a study of homeomorphic embedding in the context of metaprogramming, presenting some new (positive and negative) results and open problems