Young Flattenings in the Schur module basis

04/06/2021
by   Lennart J. Haas, et al.
0

There are several isomorphic constructions for the irreducible polynomial representations of the general linear group in characteristic zero. The two most well-known versions are called Schur modules and Weyl modules. Steven Sam used a Weyl module implementation in 2009 for his Macaulay2 package PieriMaps. This implementation can be used to compute so-called Young flattenings of polynomials. Over the Schur module basis Oeding and Farnsworth describe a simple combinatorial procedure that is supposed to give the Young flattening, but their construction is not equivariant. In this paper we clarify this issue, present the full details of the theory of Young flattenings in the Schur module basis, and give a software implementation in this basis. Using Reuven Hodges' recently discovered Young tableau straightening algorithm in the Schur module basis as a subroutine, our implementation outperforms Sam's PieriMaps implementation by several orders of magnitude on many examples, in particular for powers of linear forms, which is the case of highest interest for proving border Waring rank lower bounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2020

Zero-divisors of Semigroup Modules

Let $M$ be an $R$-module and $S$ a semigroup. Our goal is to discuss zer...
research
12/02/2017

Drinfeld Modules with Complex Multiplication, Hasse Invariants and Factoring Polynomials over Finite Fields

We present a novel randomized algorithm to factor polynomials over a fin...
research
06/02/2016

Factoring Polynomials over Finite Fields using Drinfeld Modules with Complex Multiplication

We present novel algorithms to factor polynomials over a finite field _q...
research
12/21/2020

A variant of van Hoeij's algorithm to compute hypergeometric term solutions of holonomic recurrence equations

Linear homogeneous recurrence equations with polynomial coefficients are...
research
07/06/2023

Algorithms for computing norms and characteristic polynomials on general Drinfeld modules

We provide two families of algorithms to compute characteristic polynomi...
research
02/13/2016

On Gröbner Bases and Krull Dimension of Residue Class Rings of Polynomial Rings over Integral Domains

Given an ideal a in A[x_1, ..., x_n], where A is a Noetherian integral d...
research
09/03/2017

An Improved Algorithm for E-Generalization

E-generalization computes common generalizations of given ground terms w...

Please sign up or login with your details

Forgot password? Click here to reset