A Las Vegas Rewriting Algorithm for the Symmetric Square Representation of Classical Groups

2015/07/20 by Brian P. Corr, Brian Philip Corr, Corr, Brian Philip · 1 citation
Mathematics · #Advanced Algebra and Geometry #FOS: Mathematics #Finite Group Theory Research #Geometric and Algebraic Topology #Group Theory (math.GR) #math.GR

paper · pdf · doi:10.48550/arxiv.1507.05671

arxiv created 2015/07/20 · openalex publication_date 2015/07/20 · arxiv updated 2015/07/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In constructive recognition of a representation of a Classical group G, much attention has been paid to the natural representation as well as to generic (Black Box) algorithms that treat all representations uniformly. There are theoretical and practical improvements to be made by giving special treatment to certain non-natural representations that arise frequently. In this paper we present and analyse a Las Vegas algorithm for rewriting the Symmetric Square representation.

Cited by

• Spectral Separation and Eigenvalue Labelling for Polynomial Tensor Representations of General Linear Groups

Related

• A natural representation model for symmetric groups
• Symmetric representation of the elements of finite groups
• Constructive Recognition of Special Linear Groups
• Constructive membership testing in black-box classical groups
• Representation Theory of Symmetric Groups and Related Hecke Algebras