Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Neunhoeffer, Max"'
Autor:
Holt, Derek, Linton, Stephen, Neunhoeffer, Max, Parker, Richard, Pfeiffer, Markus, Roney-Dougal, Colva M.
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 Kampen diagrams, which represent groups as quotients of virtually free gr
Externí odkaz:
http://arxiv.org/abs/1905.09770
Autor:
Bamberg, John, Betten, Anton, Cara, Philippe, De Beule, Jan, Neunhöffer, Max, Lavrauw, Michel
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 spaces to the flat lands of generalised polygons. The algebraic power o
Externí odkaz:
http://arxiv.org/abs/1606.05530
Lehnert and Schweitzer show in [20] that R. Thompson's group $V$ is a co-context-free ($co\mathcal{CF}$) group, thus implying that all of its finitely generated subgroups are also $co\mathcal{CF}$ groups. Also, Lehnert shows in his thesis that $V$ em
Externí odkaz:
http://arxiv.org/abs/1312.1855
Autor:
Neunhoeffer, Max, Praeger, Cheryl E
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 simple two-transitive group of degree v and does not occur in an infin
Externí odkaz:
http://arxiv.org/abs/1308.0398
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 generators, invariance under basic algebraic constructions and algebraic proper
Externí odkaz:
http://arxiv.org/abs/1206.1714
Let $X$ be a finite set such that $|X|=n$. Let $\trans$ and $\sym$ denote respectively the transformation monoid and the symmetric group on $n$ points. Given $a\in \trans\setminus \sym$, we say that a group $G\leq \sym$ is $a$-normalizing if $$
Externí odkaz:
http://arxiv.org/abs/1205.0450
Autor:
Brunat, Olivier, Neunhöffer, Max
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-Schur algebra S_q(n,r) over A. We will associate to every non-degenera
Externí odkaz:
http://arxiv.org/abs/0810.2335
Autor:
Neunhoeffer, Max, Scherotzke, Sarah
In the first part of this paper we present explicit formulas for primitive idempotents in arbitrary Frobenius algebras using the entries of representing matrices coming from projective indecomposable modules with respect to a certain choice of basis.
Externí odkaz:
http://arxiv.org/abs/0803.0534
Autor:
Neunhoeffer, Max, Praeger, Cheryl E.
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical implementation.
Externí odkaz:
http://arxiv.org/abs/0705.0933
Publikováno v:
LMS J. Comput. Math. 8 (2005) 217--250
We present a generalisation of the sifting procedure introduced originally by Sims for computation with finite permutation groups, and now used for many computational procedures for groups, such as membership testing and finding group orders. Our pro
Externí odkaz:
http://arxiv.org/abs/math/0501346