Graph explorer

Computing Schur complexes

We describe a Macaulay2 package for computing Schur complexes. This package expands on the ChainComplexOperations package by David Eisenbud.

9 nodes8 linksoverview previewComputing Schur complexes
9 nodes8 links
Computing Schur complexes9 visible / 9 total nodes / 29 links
Co-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalAuthorshipAuthorshipAuthorshipWComputing Schur complexespreprint / 2019AMichael K. BrownResearcherAHang HuangResearcherARobert P. LaudoneResearcherAMichael PerlmanResearcherTmath.AC1492 worksAClaudiu RaicuResearcherASteven V SamResearcherAJoão Pedro SantosResearcher
PaperSignal 108 links

Computing Schur complexes

preprint / 2019

Open