Searcharxiv⌕ Search

arXiv subjects

Sebastian Jambor

Publications and source records attributed to Sebastian Jambor.

5 recordsLinked to original sources
arXiv2017

On finite simple images of triangle groups

For a simple algebraic group G in characteristic p, a triple (a,b,c) of positive integers is said to be rigid for G if the dimensions of the subvarieties of G of elements of order dividing a,b,c sum to 2dim G. In this paper we complete the proof of a conjecture of the third author, that for a rigid triple (a,b,c) for G with p>0, the triangle group T_{a,b,c} has only finitely many simple images of the form G(p^r). We also obtain further results on the more general form of the conjecture, where the images G(p^r) can be arbitrary quasisimple groups of type G.

math.GR↗
arXiv2014

An L2-quotient algorithm for finitely presented groups on arbitrarily many generators

We generalize the Plesken-Fabia\'nska $\mathrm{L}_2$-quotient algorithm for finitely presented groups on two or three generators to allow an arbitrary number of generators. The main difficulty lies in a constructive description of the invariant ring of $\mathrm{GL}(2, K)$ on $m$ copies of $\mathrm{SL}(2, K)$ by simultaneous conjugation. By giving this description, we generalize and simplify some of the known results in invariant theory. An implementation of the algorithm is available in the computer algebra system Magma.

math.GR↗
arXiv2014

Determining Aschbacher classes using characters

Let $\Delta\colon G \to \mathrm{GL}(n, K)$ be an absolutely irreducible representation of an arbitrary group $G$ over an arbitrary field $K$; let $\chi\colon G \to K\colon g \mapsto \mathrm{tr}(\Delta(g))$ be its character. In this paper, we assume knowledge of $\chi$ only, and study which properties of $\Delta$ can be inferred. We prove criteria to decide whether $\Delta$ preserves a form, is realizable over a subfield, or acts imprimitively on $K^{n \times 1}$. If $K$ is finite, this allows us to decide whether the image of $\Delta$ belongs to certain Aschbacher classes.

math.GR↗
arXiv2013

Fast recognition of alternating groups of unknown degree

We present a constructive recognition algorithm to decide whether a given black-box group is isomorphic to an alternating or a symmetric group without prior knowledge of the degree. This eliminates the major gap in known algorithms, as they require the degree as additional input. Our methods are probabilistic and rely on results about proportions of elements with certain properties in alternating and symmetric groups. These results are of independent interest; for instance, we establish a lower bound for the proportion of involutions with small support.

math.GR↗