Algorithms in Linear Algebraic Groups
March 12, 2020 Β· Declared Dead Β· π Advances in Applied Clifford Algebras
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Sushil Bhunia, Ayan Mahalanobis, Pralhad Shinde, Anupam Singh
arXiv ID
2003.06292
Category
math.GR
Cross-listed
cs.DS
Citations
1
Venue
Advances in Applied Clifford Algebras
Last Checked
3 months ago
Abstract
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β math.GR
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
A Practical Cryptanalysis of the Algebraic Eraser
R.I.P.
π»
Ghosted
A note on some algebraic trapdoors for block ciphers
R.I.P.
π»
Ghosted
Regular subgroups with large intersection
R.I.P.
π»
Ghosted
On the primitivity of PRESENT and other lightweight ciphers
R.I.P.
π»
Ghosted
Solving the Conjugacy Decision Problem via Machine Learning
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted