A non-iterative straightening algorithm and orthogonality for skew Schur modules
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911250596757504 |
|---|---|
| author | Hodges, Reuven Yin, Hanzhang |
| author_facet | Hodges, Reuven Yin, Hanzhang |
| contents | We generalize Fulton's determinantal construction of Schur modules to the skew setting, providing an explicit and functorial presentation using only elementary linear algebra and determinantal identities, in parallel with the partition case. Building on the non-iterative straightening formula of the first author for partition shapes, we develop a non-iterative straightening algorithm for skew Schur modules that expresses arbitrary elements in a new D-basis with an explicit closed coefficient formula. We then show that this D-basis is the result of applying Gram-Schmidt orthogonalization to the semistandard tableau basis, which identifies a natural inner product on the skew Schur module and recasts straightening as an orthogonal projection. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_03702 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A non-iterative straightening algorithm and orthogonality for skew Schur modules Hodges, Reuven Yin, Hanzhang Combinatorics Representation Theory 05E10 (Primary) 05E40, 05E14 (Secondary) We generalize Fulton's determinantal construction of Schur modules to the skew setting, providing an explicit and functorial presentation using only elementary linear algebra and determinantal identities, in parallel with the partition case. Building on the non-iterative straightening formula of the first author for partition shapes, we develop a non-iterative straightening algorithm for skew Schur modules that expresses arbitrary elements in a new D-basis with an explicit closed coefficient formula. We then show that this D-basis is the result of applying Gram-Schmidt orthogonalization to the semistandard tableau basis, which identifies a natural inner product on the skew Schur module and recasts straightening as an orthogonal projection. |
| title | A non-iterative straightening algorithm and orthogonality for skew Schur modules |
| topic | Combinatorics Representation Theory 05E10 (Primary) 05E40, 05E14 (Secondary) |
| url | https://arxiv.org/abs/2511.03702 |