{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T08:13:43Z","timestamp":1772439223032,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We give a short proof of the Littlewood-Richardson rule using a sign-reversing involution.<\/jats:p>","DOI":"10.37236\/1666","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:27:02Z","timestamp":1578709622000},"source":"Crossref","is-referenced-by-count":16,"title":["A Concise Proof of the Littlewood-Richardson Rule"],"prefix":"10.37236","volume":"9","author":[{"given":"John R.","family":"Stembridge","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2002,3,15]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v9i1n5\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v9i1n5\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T05:15:09Z","timestamp":1579324509000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v9i1n5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3,15]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2002,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1666","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,3,15]]},"article-number":"N5"}}