Eulerian numbers, tableaux, and the Betti numbers of a toric variety
dc.contributor.author | Stembridge, John R. | en_US |
dc.date.accessioned | 2006-04-10T15:15:58Z | |
dc.date.available | 2006-04-10T15:15:58Z | |
dc.date.issued | 1992-04-02 | en_US |
dc.identifier.citation | Stembridge, John R. (1992/04/02)."Eulerian numbers, tableaux, and the Betti numbers of a toric variety." Discrete Mathematics 99(1-3): 307-320. <http://hdl.handle.net/2027.42/30110> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6V00-45FKVGN-B6/2/c3d56f2dfebfd42674b5e8ae9bdb6a07 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/30110 | |
dc.description.abstract | Let [Sigma] denote the Coxeter complex of Sn, and let X([Sigma]) denote the associated toric variety. Since the Betti numbers of the cohomology of X([Sigma]) are Eulerian numbers, the additional presence of an Sn-module structure permits the definition of an isotypic refinement of these numbers. In some unpublished work, DeConcini and Procesi derived a recurrence for the Sn-character of the cohomology of X([Sigma]), and Stanley later used this to translate the problem of combinatorially describing the isotypic Eulerian numbers into the language of symmetric functions. In this paper, we explicitly solve this problem by developing a new way to use marked sequences to encode permutations. This encoding also provides a transparent explanation of the unimodality of Eulerian numbers and their isotypic refinements. | en_US |
dc.format.extent | 884861 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | Eulerian numbers, tableaux, and the Betti numbers of a toric variety | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mathematics, University of Michigan, Ann Arbor, MI 48109-1003, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/30110/1/0000482.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0012-365X(92)90378-S | en_US |
dc.identifier.source | Discrete Mathematics | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.