On immanants of Jacobi-Trudi matrices and permutations with restricted position
dc.contributor.author | Stanley, Richard P. | en_US |
dc.contributor.author | Stembridge, John R. | en_US |
dc.date.accessioned | 2006-04-10T15:52:16Z | |
dc.date.available | 2006-04-10T15:52:16Z | |
dc.date.issued | 1993-03 | en_US |
dc.identifier.citation | Stanley, Richard P., Stembridge, John R. (1993/03)."On immanants of Jacobi-Trudi matrices and permutations with restricted position." Journal of Combinatorial Theory, Series A 62(2): 261-279. <http://hdl.handle.net/2027.42/30946> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6WHS-4CVPXVT-6/2/0f3a0b9ae705f9f997a30959b4db4dfb | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/30946 | |
dc.description.abstract | Let [chi] be a character of the symmetric group Ln. The immanant of an n x n matrix A = [aij] with respect to [chi] is [Sigma]w [epsilon] Sn [chi](w) a1,w(1) ... an,w(n). Goulden and Jackson conjectured, and Greene recently proved, that immanants of Jacobi-Trudi matrices are polynomials with nonnegative integer coefficients. This led one of us (Stembridge) to formulate a series of conjectures involving immanants, some of which amount to stronger versions of the original Goulden-Jackson conjecture. In this paper, we prove some special cases of one of the stronger conjectures. One of the special cases we prove develops from a generalization of the theory of permutations with restricted position which takes into account the cycle structure of the permutations. We also present two refinements of the immanant conjectures, as well as a related conjecture on the number of ways to partition a partially ordered set into chains. | en_US |
dc.format.extent | 829771 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 | On immanants of Jacobi-Trudi matrices and permutations with restricted position | 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, Michigan 48109, USA | en_US |
dc.contributor.affiliationother | Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/30946/1/0000617.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/0097-3165(93)90048-D | en_US |
dc.identifier.source | Journal of Combinatorial Theory, Series A | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information 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.