10 citations · 23 across the 4 of their papers we have counts for
5 papers
Polynomial-time proofs that groups are hyperbolic
Derek Holt, Stephen Linton, Max Neunhoeffer +3
It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kam…
FinInG: a package for Finite Incidence Geometry
John Bamberg, Anton Betten, Philippe Cara +3
FinInG is a package for computation in Finite Incidence Geometry. It provides users with the basic tools to work in various areas of finite geometry from the realms of projective s…
Sporadic neighbour-transitive codes in Johnson graphs
Max Neunhoeffer, Cheryl E Praeger
We classify the neighbour-transitive codes in Johnson graphs J(v, k) of minimum distance at least three which admit a neighbour-transitive group of automorphisms that is an almost…
Deciding Word Problems of Semigroups using Finite State Automata
Max Neunhöffer, Markus Pfeiffer, Nik Ruskuc
We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generator…
A new construction of the asymptotic algebra associated to the -Schur algebra
Olivier Brunat, Max Neunhöffer
We denote by A the ring of Laurent polynomials in the indeterminate v and by K its field of fractions. In this paper, we are interested in representation theory of the "generic" q-…