Related papers: Algorithm for Lang's Theorem

We give parameterizations of the irreducible representations of finite groups of Lie type in their defining characteristic.

We show that every countable direct system of finite-dimensional real or complex Lie groups has a direct limit in the category of Lie groups modelled on locally convex spaces. This enables us to push all basic constructions of…

We formulate and prove relative versions of several classical decompositions known in the theory of Chevalley groups over commutative rings. As an application we obtain upper estimates for the width of principal congruence subgroups in…

We prove a version of the Chevalley Restriction Theorem for the action of a real reductive group G on a topological space X which locally embeds into a holomorphic representation. Assuming that there exists an appropriate quotient X//G for…

A theorem of Lurie and Pridham establishes a correspondence between formal moduli problems and differential graded Lie algebras in characteristic zero, thereby formalising a well-known principle in deformation theory. We introduce a variant…

We prove a differential analog of a theorem of Chevalley on extending homomorphisms for rings with commuting derivations, generalizing a theorem of Kac. As a corollary, we establish that, under suitable hypotheses, the image of a…

We study the problem of deciding whether or not the image of an irreducible representation of the braid group $\B_3$ of degree $\leq 5$ has finite image if we are only given the eigenvalues of a generator. We provide a partial algorithm…

We provide efficient algorithms to compute convergents of quadratic irrationals. We show that for square roots, provided Galois' refinement of Lagrange's theorem holds, certain decimations of the sequence of convergents are signed Chebyshev…

In this survey, we report on the state of the art of some of the fundamental problems in the Lie theory of Lie groups modeled on locally convex spaces, such as integrability of Lie algebras, integrability of Lie subalgebras to Lie…

We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

We adopt the $p$-group generation algorithm to classify small-dimensional nilpotent Lie algebras over small fields. Using an implementation of this algorithm, we list the nilpotent Lie algebras of dimension at most~9 over $\F_2$ and those…

We generalize the classical construction principles of infinite-dimensional real (and complex) Lie groups to the case of Lie groups over non-discrete topological fields. In particular, we discuss linear Lie groups, mapping groups, test…

We discuss rather systematically the principle, implicit in earlier works, that for a "random" element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic…

We determine the decomposition numbers of the partition algebra when the characteristic of the ground field is zero or larger than the degree of the partition algebra. This will allow us to determine for which exact values of the parameter…

Computing discrete logarithms in finite fields is a main concern in cryptography. The best algorithms in large and medium characteristic fields (e.g., {GF}$(p^2)$, {GF}$(p^{12})$) are the Number Field Sieve and its variants (special,…

We prove the Chevalley restriction theorem for the commuting scheme of symplectic Lie algebras. The key step is the construction of the inverse map of the Chevalley restriction map called the spectral data map. Along the way, we establish a…

A constructive method for decomposing finite dimensional representations of semisimple real Lie algebras is developed. The method is illustrated by an example. We also discuss an implementation of the algorithm in the language of the…

The main result of this paper states that for any group $G$ with an automatic structure $L$ with unique representatives one can construct a uniform partial algorithm which detects $L$-rational subgroups and gives their preimages in $L$.…

Tangle-tree theorems are an important tool in structural graph theory, and abstract separation systems are a very general setting in which tangle-tree theorems can still be formulated and proven. For infinite abstract separation systems, so…