相关论文: Algorithm for Lang's Theorem

Let i be a homomorphism of the multiplicative group into a connected reductive algebraic group over C. Let G^i be the centralizer of the image i. Let LG be the Lie algebra of G and let L_nG (n integer) be the summands in the direct sum…

Let $K$ be a number field with ring of integers $\mathcal{O}_K$. We describe and classify finite, flat, and linearly reductive subgroup schemes of $\mathrm{SL}_2$ over $\mathrm{Spec}\:\mathcal{O}_K$. We also establish finiteness results for…

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the…

Given an integer $M\geq 2$, we deploy the generating function techniques to compute the number of $M$-th roots of identity in some of the well-known finite groups of Lie type, more precisely for finite general linear groups, symplectic…

The goal of this note is to classify the weakly closed unipotent subgroups in the split Chevalley groups. In an application we show under some mild assumptions on the characteristic that the Lie algebra of a connected simple algebraic group…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

The first aim of this paper is to show that any finite-dimensional reductive Lie algebra and its finite-dimensional completely reducible representation can be embedded into some PC Lie algebra. The second aim is to find the structure of a…

This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.

We explore the graded and filtered formality properties of finitely generated groups by studying the various Lie algebras over a field of characteristic 0 attached to such groups, including the Malcev Lie algebra, the associated graded Lie…

We present a formalization, in the theorem prover Lean, of the classification of solvable Lie algebras of dimension at most three over arbitrary fields. Lie algebras are algebraic objects which encode infinitesimal symmetries, and as such…

One important tool is the optimal clustering of data into useful categories. Dividing similar objects into a smaller number of clusters is of importance in many applications. These include search engines, monitoring of academic performance,…

Let $R$ be a finite commutative ring with identity. In this paper, we give a necessary condition for the existence of an orthogonal decomposition of the special linear Lie algebra over $R$. Additionally, we study orthogonal decompositions…

Following our previous work, we develop an algorithm to compute a presentation of the fundamental group of certain partial compactifications of the complement of a complex arrangement of lines in the projective plane. It applies, in…

We present a general diagrammatic approach to the construction of efficient algorithms for computing a Fourier transform on a semisimple algebra. This extends previous work wherein we derive best estimates for the computation of a Fourier…

In this paper we translate the necessary and sufficient conditions of Tanaka's theorem on the finiteness of effective prolongations of a fundamental graded Lie algebras into computationally effective criteria, involving the rank of some…

Relying on the classification of simple Lie algebras over algebraically closed fields of characteristic $>3$, we show that any finite-dimensional central simple 5-graded Lie algebra over a field $k$ of characteristic $\neq 2,3$ is a simple…

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We obtain several structure results for a class of spherical subgroups of connected reductive complex algebraic groups that extends the class of strongly solvable spherical subgroups. Based on these results, we construct certain…