Show simple item record

On immanants of Jacobi-Trudi matrices and permutations with restricted position

dc.contributor.authorStanley, Richard P.en_US
dc.contributor.authorStembridge, John R.en_US
dc.date.accessioned2006-04-10T15:52:16Z
dc.date.available2006-04-10T15:52:16Z
dc.date.issued1993-03en_US
dc.identifier.citationStanley, 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.urihttp://www.sciencedirect.com/science/article/B6WHS-4CVPXVT-6/2/0f3a0b9ae705f9f997a30959b4db4dfben_US
dc.identifier.urihttps://hdl.handle.net/2027.42/30946
dc.description.abstractLet [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.extent829771 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleOn immanants of Jacobi-Trudi matrices and permutations with restricted positionen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, Ann Arbor, Michigan 48109, USAen_US
dc.contributor.affiliationotherDepartment of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/30946/1/0000617.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/0097-3165(93)90048-Den_US
dc.identifier.sourceJournal of Combinatorial Theory, Series Aen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

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.