English
Related papers

Related papers: Computing automorphism groups of shifts using atyp…

200 papers

Let $S$ be a set of transpositions that generates the symmetric group $S_n$, where $n \ge 3$. The transposition graph $T(S)$ is defined to be the graph with vertex set $\{1,\ldots,n\}$ and with vertices $i$ and $j$ being adjacent in $T(S)$…

Discrete Mathematics · Computer Science 2015-12-11 Ashwin Ganesan

Among the simplest invariants of the sporadic finite simple groups are their outer automorphism groups. For 12 of the 26 possible isomorphism types of a sporadic simple group G, the outer automorphism group Out(G) has order 2, and in the…

Group Theory · Mathematics 2011-06-21 Richard Lyons

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

Quantum Algebra · Mathematics 2019-07-01 Christian Eder , Viktor Levandovskyy , Julien Schanz , Simon Schmidt , Andreas Steenpass , Moritz Weber

We classify all finite-dimensional connected Hopf algebras with large abelian primitive spaces. We show that they are Hopf algebra extensions of restricted enveloping algebras of certain restricted Lie algebras. For any abelian matched pair…

Rings and Algebras · Mathematics 2015-07-02 Xingting Wang

Bergman has given the following abstract characterisation of the inner automorphisms of a group $G$: they are exactly those automorphisms of $G$ which can be extended functorially along any homomorphism $G \rightarrow H$ to an automorphism…

Category Theory · Mathematics 2019-07-25 Richard Garner

Let $\psi$ be a permutation of a finite set $X$. We define $\lambda(\psi)$ to be the largest fraction of elements of $X$ lying on a single cycle of $\psi$. For a finite group $G$, we define $\lambda(G)$ to be the maximum among the values…

Group Theory · Mathematics 2015-04-01 Alexander Bors

We study the automorphism groups of free-by-cyclic groups and show these are finitely generated in the following cases: (i) when defining automorphism has linear growth and (ii) when the rank of the underlying free group has rank at most 3.…

Group Theory · Mathematics 2022-11-10 Naomi Andrew , Armando Martino

Endowed with the binary operation of set addition carried over from the integers, the family $\mathcal P_{\mathrm{fin}}(\mathbb Z) $ of all non-empty finite subsets of $\mathbb Z$ forms a monoid whose neutral element is the singleton…

Combinatorics · Mathematics 2025-04-18 Salvatore Tringali , Kerou Wen

The paper presents an algorithm for topological classification of nondegenerate saddle-focus singularities of integrable Hamiltonian systems with three degrees of freedom up to semi-local equivalence. In particular, we prove that any…

Differential Geometry · Mathematics 2023-01-26 I. K. Kozlov , A. A. Oshemkov

Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabiliser in $G$ is trivial. In this paper we introduce and study an associated graph $\Sigma(G)$, which we call the Saxl graph of…

Group Theory · Mathematics 2020-02-19 Timothy C. Burness , Michael Giudici

We exhibit a simple construction, based on elementary linear algebra, for a class of examples of finite $p$-groups of nilpotence class $2$ all of whose automorphisms are central.

Group Theory · Mathematics 2014-07-09 A. Caranti

In this paper, we determine the reduced automorphism groups of hyperelliptic curves of a small genus in characteristic $2$, when they are of $2$-rank $0$. Such a curve is an Artin-Schreier curve defined in the form $y^2-y=f(x)$ for a…

Algebraic Geometry · Mathematics 2026-04-21 Kohtaro Yamaguchi , Shushi Harashita

We study some automorphic cohomology classes of degree one on the Griffiths-Schmid varieties attached to some unitary groups in 3 variables. Using partial compactifications of those varieties, constructed by K. Kato and S. Usui, we define…

Number Theory · Mathematics 2007-05-23 Henri Carayol

We develop a theory of generalized presentations of groups. We give generalized presentations of the symmetric group $\Sigma(X)$ for an arbitrary set $X$ and of the automorphism group of the free group of countable rank, $Aut(F_{\omega})$.

Group Theory · Mathematics 2011-07-08 Oleg Bogopolski , Wilhelm Singhof

Let $G$ be a finitely generated polyfree group. If $G$ has nonzero Euler characteristic then we show that $Aut(G)$ has a finite index subgroup in which every automorphism has infinite Reidemeister number. For certain $G$ of length 2, we…

Group Theory · Mathematics 2015-03-13 Alexander Fel'shtyn , Daciberg Gonçalves , Peter Wong

It is known that a group shift on a polycyclic group is necessarily of finite type. We show that, for trivial reasons, if a group does not satisfy the maximal condition on subgroups, then it admits non-SFT abelian group shifts. In…

Group Theory · Mathematics 2018-09-25 Ville Salo

We provide a systematic description of the automorphism groups of specially cocompact CAT(0) cube complexes. We show that these groups are topologically finitely generated, present a method to explicitly obtain generating sets, and prove a…

Group Theory · Mathematics 2023-12-07 Tobias Hartnick , Merlin Incerti-Medici

We investigate quantitative aspects of the LEF property for subgroups of the topological full group $[[ \sigma ]]$ of a two-sided minimal subshift over a finite alphabet, measured via the LEF growth function. We show that the LEF growth of…

Group Theory · Mathematics 2023-07-19 Henry Bradford , Daniele Dona

We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…

Group Theory · Mathematics 2026-05-11 Sam Tertooy

Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…

Computational Complexity · Computer Science 2022-09-29 Justin Cai , Rafael Frongillo