相关论文: Algorithm for Lang's Theorem
We use character theory of finite groups of Lie type to establish new results on representation varieties of Fuchsian groups, and also on probabilistic generation of groups of Lie type.
Let $G$ be a split connected reductive group over the ring of integers of a finite unramified extension $K$ of $\mathbf{Q}_p$. Under a standard assumption on the Coxeter number of $G$, we compute the cohomology algebra of $G(\mathcal{O}_K)$…
We propose the method for obtaining invariants of arbitrary representations of Lie groups that reduces this problem to known problems of linear algebra. The basis of this method is the idea of a special extension of the representation…
In this paper, we identify many important properties and develop criteria for the existence of subquasigroups in finite quasigroups. Based on these results, we propose an effective method that concludes the nonexistence of subquasigroup of…
Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many…
The goal of this paper is to introduce a new constructive geometric proof of the affine version of Chevalley's Theorem. This proof is algorithmic and a verbatim implementation resulted in an efficient code for computing the constructible…
The notion of the characteristic Lie algebra of the discrete hyperbolic type equation is introduced. An effective algorithm to compute the algebra for the equation given is suggested. Examples and further applications are discussed.
An analogue of Serre's theorem is established for finite dimensional simple Lie superalgebras, which describes presentations in terms of Chevalley generators and Serre type relations relative to all possible choices of Borel subalgebras.…
We present algorithms to compute generalized root systems of Nichols algebras of diagonal type and of contragredient Lie superalgebras. As a consequence, we obtain an algorithm to compute the Lyndon words in the Kharchenko PBW basis…
We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…
We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for…
We study the algorithmic complexity of fair division problems with a focus on minimizing the number of queries needed to find an approximate solution with desired accuracy. We show for several classes of fair division problems that under…
This article is the third in the series. It is devoted the calculation of the structure constants for the complex simple Lie algebra of type E_6 and Chevalley commutator formulas.
This paper is a continuation of [5]. Using the root categories, we define the compact real forms of the complex semisimple Lie algebras, and maximal compact subgroups of the Chevalley groups over $\mathbb{C}$. In [7], Lusztig used the…
In this paper, a Lie group-based neural network method is proposed for solving initial value problems of non linear dynamics. Due to its single-layer structure (MLP), the approach is substantially cheaper than the multilayer perceptron…
We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…
We discuss a practical algorithm to compute parabolic Kazhdan-Lusztig polynomials. As an application we compute Kazhdan-Lusztig polynomials which are needed to evaluate a character formula for reductive groups due to Lusztig. Some…
In cluster analysis interest lies in probabilistically capturing partitions of individuals, items or observations into groups, such that those belonging to the same group share similar attributes or relational profiles. Bayesian posterior…
We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…
Starting with a finite-dimensional complex Lie algebra, we extend scalars using suitable commutative topological algebras. We study Birkhoff decompositions for the corresponding loop groups. Some results remain valid for loop groups with…