PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
November 9, 20250 citationsOpen Access

A non-iterative straightening algorithm and orthogonality for skew Schur modules

View Full Paper
RHReuven HodgesHYH. Yin

Key Points

  • Orthogonality reveals new insights into skew Schur modules, establishing a formal basis for their structure and computation.
  • The D-basis construction links directly to previously established partition techniques, advancing understanding in the algebraic framework.
  • Application of Gram-Schmidt orthogonalization to the semistandard tableau basis enhances the clarity and utility of skew module representations.
  • These developments suggest more efficient computations in algebraic geometry, with potential implications for related mathematical theories.

Abstract

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Hodges et al. (2025) studied this question.

synapsesocial.com/papers/690fdcdaf60c54d04ea3829fhttps://doi.org/10.48550/arxiv.2511.03702
Ask AI
Helpful
Bookmark
Share
View Full Paper