On groups with an interval isomorphic to a projective geometry

This article began as a study of the structure of infinite permutation groups $G$ in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point stabilisers are merely assumed to satisfy min-n, the minimal condition on normal subgroups. The groups $G$ are then of two kinds. Either they have a maximal finite normal subgroup, modulo which they have either one or two minimal nontrivial normal subgroups, or they have a regular normal subgroup $M$ which is a divisible abelian $p$-group of finite rank. In the latter case the point stabilisers are finite and act irreducibly on a $p$-adic vector space associated with $M$. This leads to our second variation, which is a study of the finite linear groups that can arise.

On solvable factors of almost simple groups

We exhibit an interesting new phenomenon concerning certain triangle subgroups Δ of Kleinian groups Γ. Namely the hyperbolic plane Π stabilized by Δ has a precisely invariant tubular neighbourhood. Thus the corresponding 2-orbifoldF 2=∏/Γ ∏ is always embedded in the hyperbolic 3-orbifoldM 3=ℍ3/Γ. We deduce that any two such triangle groups can algebraically intersect only in a finite cyclic subgroup. We give sharp estimates for the radius of these tubular neighbourhoods and present applications concerning the estimation of co-volumes of Kleinian groups containing these triangle subgroups.

We describe the structure of virtually solvable normal subgroups in the automorphism group of a right-angled Artin group Aut ⁢ ( A Γ ) \mathrm{Aut}(A_{\Gamma}) . In particular, we prove that a finite normal subgroup in Aut ⁢ ( A Γ ) \mathrm{Aut}(A_{\Gamma}) has at most order two and if Γ is not a clique, then any finite normal subgroup in Aut ⁢ ( A Γ ) \mathrm{Aut}(A_{\Gamma}) is trivial. This property has implications for automatic continuity and C ∗ C^{\ast} -algebras: every algebraic epimorphism φ : L ↠ Aut ⁢ ( A Γ ) \varphi\colon L\twoheadrightarrow\mathrm{Aut}(A_{\Gamma}) from a locally compact Hausdorff group 𝐿 is continuous if and only if A Γ A_{\Gamma} is not isomorphic to Z n \mathbb{Z}^{n} for any n ≥ 1 n\geq 1 . Furthermore, if Γ is not a join and contains at least two vertices, then the set of invertible elements is dense in the reduced group C ∗ C^{\ast} -algebra of Aut ⁢ ( A Γ ) \mathrm{Aut}(A_{\Gamma}) . We obtain similar results for Aut ⁢ ( G Γ ) \mathrm{Aut}(G_{\Gamma}) , where G Γ G_{\Gamma} is a graph product of cyclic groups. Moreover, we give a description of the center of Aut ⁢ ( G Γ ) \mathrm{Aut}(G_{\Gamma}) in terms of the defining graph Γ.

The behavior of Nil-groups under localization and the relative assembly map

A normal Hall subgroup $N$ of a group $G$ is a normal subgroup with its order coprime with its index. Schur-Zassenhaus theorem states that every normal Hall subgroup has a complement subgroup, that is a set of coset representatives H which also forms a subgroup of G. In this paper, we present a framework to test isomorphism of groups with at least one normal Hall subgroup, when groups are given as multiplication tables. To establish the framework, we first observe that a proof of Schur-Zassenhaus theorem is constructive, and formulate a necessary and sufficient condition for testing isomorphism in terms of the associated actions of the semidirect products, and isomorphisms of the normal parts and complement parts. We then focus on the case when the normal subgroup is abelian. Utilizing basic facts of representation theory of finite groups and a technique by Le Gall [STACS 2009], we first get an efficient isomorphism testing algorithm when the complement has bounded number of generators. For the case when the complement subgroup is elementary abelian, which does not necessarily have bounded number of generators, we obtain a polynomial time isomorphism testing algorithm by reducing to generalized code isomorphism problem. A solution to the latter can be obtained by a mild extension of the singly exponential (in the number of coordinates) time algorithm for code isomorphism problem developed recently by Babai. Enroute to obtaining the above reduction, we study the following computational problem in representation theory of finite groups: given two representations rho and tau of a group $H$ over Z_p^d , p a prime, determine if there exists an automorphism phi:H -> H, such that the induced representation rho_phi=rho o phi and tau are equivalent, in time poly(|H|,p^d).

PROOF. For i =1, 2, * * *, n let hi be the elements of H. Then h7'bhi are all the conjugates of b; for bh-lbhb= h-lbh by virtue of the hypothesis [ [h, b ]b] = e. It follows from the fact that a finite set of conjugates generate a finite normal subgroup (cf. [1]) that b is contained in a finite normal subgroup K of G. But H is finite and hence so also is G/K; and then finally G is finite. Furthermore since b is in the center of K, b is in the nil radical of G as was asserted. We can deduce another result from the fact that [[g, b ]b] =e for every gGG implies that b is in the center of a normal subgroup of G.

Here we consider some problems concerning regular types. In the first place we consider a strongly minimal set D. One can ask what is the strength of the assumption that D has (full) elimination of imaginaries (namely, every definable set X over D has as canonical parameter some tuple from D). We show that D cannot be locally modular. Nontriviality of D is immediate. However, to exclude the locally modular nontrivial case one has to understand structures of the form G/E, where G is a modular strongly minimal group and E is a definable equivalence relation on G with finite classes. We show that the quotient structure G/E can be obtained in two steps. First quotient by a finite subgroup K of G to obtain a strongly minimal group H. Now let Γ be a finite subgroup of the group Aff(H) of definable affine automorphisms of H (namely maps of the form x → αx + a, where α is a definable automorphism of H and a ∈ H), and quotient H by Γ (namely form the orbit space of H under Γ). It can clearly be arranged that Γ contains no nontrivial subgroup of translations.In the second place we look at a nontrivial modular regular type p whose pregeometry is actually a geometry. The geometry is then known to be (infinite-dimensional) projective geometry over a division ring F. We ask whether F is definable (internally to p). If F is finite, this is clear. In fact in this case p must have U-rank 1. So we assume F to be infinite. We are only able to show definability of F in the case where F is a field, using some results on 2-transitive subgroups of PGL [V]. Moreover in the superstable case we also observe that p is isolated.

All groups considered are finite. A group has a trivial Frattini subgroup if and only if every nontrivial normal subgroup has a proper supplement.The property is normal subgroup closed, but neither subgroup nor quotient closed. It is subgroup closed if and only if the group is elementary, i.e. all Sylow subgroups are elementary abelian. If G is solvable, then G and all its quotients have trivial Frattini subgroup if and only if every normal subgroup of G has a complement. For a nilpotent group, every nontrivial normal subgroup has a supplement if and only if the group is elementary abelian. Consequently, the center of a group in which every normal subgroup has a supplement is an elementary abelian direct factor.

Homotopy theory of dihedral and quaternionic sets

The notion ofgenus, applied to finitely generated nilpotent groups or to nilpotent spaces of finite type, was introduced by Mislin; he and the author showed how to introduce the structure of a finite abelian group into the genus if the groupN has finite commutator subgroup. An example is given of a complete genusN0,N1,...,Ns−1, which constitute a cyclic group generated byN1, with the additional property that eachNi embeds in its successor as a normal subgroup with quotient cyclic of orderl; of course,Ns−1 embeds inN0. The construction leads to the description of a family of nilpotent spacesX0,X1,...,Xs−1, all in the same genus, no two of the same homotopy type, such that eachXi covers its successor as a cyclicl-sheeted regular covering; of course,Xs−1 coversX0. Herep is a prime,n ≧ 1, ands=pn−1(p−1)/2, whilel is semiprimitive modulepn.

We prove that if a countable discrete group Γ is w-rigid, i.e. it contains an infinite normal subgroup H with the relative property (T) (e.g. $\Gamma=SL(2,\mathbb{Z})\ltimes\mathbb{Z}^2$ , or Γ=H×H’ with H an infinite Kazhdan group and H’ arbitrary), and $\mathcal{V}$ is a closed subgroup of the group of unitaries of a finite separable von Neumann algebra (e.g. $\mathcal{V}$ countable discrete, or separable compact), then any $\mathcal{V}$ -valued measurable cocycle for a measure preserving action $\Gamma\curvearrowright X$ of Γ on a probability space (X,μ) which is weak mixing on H and s-malleable (e.g. the Bernoulli action $\Gamma\curvearrowright[0,1]^{\Gamma}$ ) is cohomologous to a group morphism of Γ into $\mathcal{V}$ . We use the case $\mathcal{V}$ discrete of this result to prove that if in addition Γ has no non-trivial finite normal subgroups then any orbit equivalence between $\Gamma\curvearrowright X$ and a free ergodic measure preserving action of a countable group Λ is implemented by a conjugacy of the actions, with respect to some group isomorphism Γ≃Λ.

LetG be a finite group andA andB solvable subgroups ofG, such thatG=AB and 2 is the only common prime divisor ofA andB. Under suitable restrictions of the 2-structure ofA andB, it is shown that eitherG is solvable orG contains a solvable normal subgroupN, such thatG/N contains a normal subgroup, which is isomorphic to PGL(2,q),q odd.

Introduction. Basic notions and results on Hyperstructure Theory. 1: Some topics of Geometry. 1. Descriptive geometries and join spaces. 2. Spherical geometries and join spaces. 3. Projective geometries and join spaces. 4. Multivalued loops and projective geometries. 2: Graphs and Hypergraphs. 1. Generalized graphs and hypergroups. 2. Chromatic quasi-canonical hypergroups. 3. Hypergroups induced by paths of a direct graph. 4. Hypergraphs and hypergroups. 5. On the hypergroup HGamma associated with a hypergraph Gamma. 6. Other hyperstructures associated with hypergraphs. 3: Binary Relations. 1. Quasi-order hypergroups. 2. Hypergroups associated with binary relations. 3. Hypergroups associated with union, intersection, direct product, direct limit of relations. 4. Relation beta in semihypergroups. 4: Lattices. 1. Distributive lattices and join spaces. 2. Lattice ordered join space. 3. Modular lattices and join spaces. 4. Direct limit and inverse limit of join spaces associated with lattices. 5. Hyperlattices and join spaces. 5: Fuzzy sets and rough sets. 2. Direct limit and inverse limit of join spaces associated with fuzzy subsets. 3. Rough sets, fuzzy subsets and join spaces. 4. Direct limits and inverse limits of join spaces associated with rough sets. 5. Hyperstructures and Factor Spaces. 6. Hypergroups induced by a fuzzy subset. Fuzzy hypergroups. 7. Fuzzy subhypermodules over fuzzy hyperrings. 8. On Chinese hyperstructures. 6: Automata. 1. Language theory and hyperstructures. 2. Automata and hyperstructures. 3. Automata and quasi-order hypergroups. 7: Cryptography. 1. Algebraic cryptography and hypergroupoids. 2. Cryptographic interpretation of some hyperstructures. 8: Codes. 1. Steiner hypergroupoids and Steiner systems. 2. Some basic notions about codes. 3. Steiner hypergroups and codes. 9: Median algebras, Relation algebras, C-algebras. 1. Median algebras and join spaces. 2. Relation algebras and quasi-canonical hypergroups. 3. C-algebras and quasi-canonical hypergroups. 10: Artificial Intelligence. 1. Generalized intervals. Connections with quasi-canonical hypergroups. 2. Weak representations of interval algebras. 11: Probabilities. Bibliography.

On rectifiable measures in Carnot groups: Marstrand–Mattila rectifiability criterion