Algorithms in Linear Algebraic Groups

03/12/2020
by   Sushil Bhunia, et al.
0

This paper presents some algorithms in linear algebraic groups. These algorithms solve the word problem and compute the spinor norm for orthogonal groups. This gives us an algorithmic definition of the spinor norm. We compute the double coset decomposition with respect to a Siegel maximal parabolic subgroup, which is important in computing infinite-dimensional representations for some algebraic groups.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2023

Computation of GIT quotients of semisimple groups

We describe three algorithms to determine the stable, semistable, and to...
research
04/26/2017

Computing representation matrices for the action of Frobenius to cohomology groups

This paper is concerned with the computation of representation matrices ...
research
03/30/2020

Parallel Computation of tropical varieties, their positive part, and tropical Grassmannians

In this article, we present a massively parallel framework for computing...
research
06/29/2023

Formalizing Norm Extensions and Applications to Number Theory

Let K be a field complete with respect to a nonarchimedean real-valued n...
research
03/04/2019

An Adaptive Grid Algorithm for Computing the Homology Group of Semialgebraic Set

Looking for an efficient algorithm for the computation of the homology g...
research
05/29/2018

Groups of automorphisms of p-adic integers and the problem of the existence of fully homomorphic ciphers

In this paper, we study groups of automorphisms of algebraic systems ove...
research
05/02/2019

Learning Algebraic Structures: Preliminary Investigations

We employ techniques of machine-learning, exemplified by support vector ...

Please sign up or login with your details

Forgot password? Click here to reset