Results 61 to 70 of about 166,026,527 (169)
Elementary abelianp-groups as automorphism groups of infinite groups. I
If G is a group we will write Aut G for the group of all automorphisms of G and Inn G for the normal subgroup of all inner automorphisms of G. Many authors have studied the relationship between the structure of G and that of Aut G, in particular when the latter is finite. This paper is a further contribution to this study.
openaire +2 more sources
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
Fixed points of finite groups acting on generalised Thompson groups
We study centralisers of finite order automorphisms of the generalised Thompson groups Fn, ? and conjugacy classes of finite sub- groups in finite extensions of Fn, ?. In particular we show that centralisers of finite automorphisms in Fn, ? are either of
Nucinkis, B.E.A. +2 more
core +1 more source
A Kazhdan group with an infinite outer automorphism group
D. Kazhdan has introduced in 1967 the Property (T) for local compact groups. In this article we prove that for $n\geq 3$ and $m \in \mathbb{N}$ the group $SL_n(\textbf{K})\ltimes \mathcal{M}_{n,m}(\textbf{K})$ is a Kazhdan group having the outer automorphism group infinite.
openaire +4 more sources
Infinitely generated free nilpotent groups: completeness of the automorphism groups [PDF]
AbstractWe transfer the results of Dyer, Formanek and Kassabov on the automorphism towers of finitely generated free nilpotent groups to infinitely generated free nilpotent groups. We prove that the automorphism groups of infinitely generated free nilpotent groups are complete. By combining the results of Dyer, Formanek and Kassabov with the results in
openaire +2 more sources
Most primitive groups are full automorphism groups of edge-transitive hypergraphs [PDF]
We prove that, for a primitive permutation group G acting on a set X of size n, other than the alternating group, the probability that Aut (X,YG) = G for a random subset Y of X, tends to 1 as n → ∞.
Cameron, Peter Jephson +2 more
core +1 more source
The infinite cyclohedron and its automorphism group
Cyclohedra are a well-known infinite familiy of finite-dimensional polytopes that can be constructed from centrally symmetric triangulations of even-sided polygons. In this article we introduce an infinite-dimensional analogue and prove that the group of symmetries of our construction is a semidirect product of a degree 2 central extension of Thompson ...
Tenas, Ariadna Fossas, McCammond, Jon
openaire +2 more sources
Groups Of Automorphisms Of Hyperelliptic Klein Surfaces Of Genus 3
The order of a group of automorphisms of a compact Klein surface of genus 3 with boundary does not exceed 24 [see C. L. May, Pac. J. Math. 59, 199-210 (1975; Zbl 0422.30037)]. These groups of automorphisms are quotients of NEC groups of isometries of the
Bujalance García, Emilio +2 more
core +1 more source
Finite digraphs with given regular automorphism groups
We prove that, given an infinite group G there is a directed graph X such that its automorphism group A(X) is the regular representation of G. The proof uses combinatorial set theoretic arguments (Erdös-Rado partition calculus). One of the lemmas asserts that, if |G|>2κ then G contains a subset H of power κ+ satisfying x−1y=y−1z⇒x=z (x, y, z ∈ H ...
openaire +3 more sources
Acylindrical hyperbolicity of groups acting on trees
We provide new examples of acylindrically hyperbolic groups arising from actions on simplicial trees. In particular, we consider amalgamated products and HNN-extensions, 1-relator groups, automorphism groups of polynomial algebras, 3-manifold groups and ...
Osin, Denis +3 more
core +1 more source

