Show simple item record

A Basis for the Top Homology of a Generalized Partition Lattice

dc.contributor.authorKerr, Julieen_US
dc.date.accessioned2006-09-11T17:37:10Z
dc.date.available2006-09-11T17:37:10Z
dc.date.issued1999-01en_US
dc.identifier.citationKerr, Julie; (1999). "A Basis for the Top Homology of a Generalized Partition Lattice." Journal of Algebraic Combinatorics 9(1): 47-60. <http://hdl.handle.net/2027.42/46306>en_US
dc.identifier.issn0925-9899en_US
dc.identifier.issn1572-9192en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/46306
dc.description.abstractFor a fixed positive integer k, consider the collection of all affine hyperplanes in n-space given by xi − xj = m, where i, j ∈ [n], i ≠ j, and m ∈ {0, 1,..., k}. Let Ln,k be the set of all nonempty affine subspaces (including the empty space) which can be obtained by intersecting some subset of these affine hyperplanes. Now give Ln,k a lattice structure by ordering its elements by reverse inclusion. The symmetric group Gn acts naturally on Ln,k by permuting the coordinates of the space, and this action extends to an action on the top homology of Ln,k. It is easy to show by computing the character of this action that the top homology is isomorphic as an Gn-module to a direct sum of copies of the regular representation, CGn. In this paper, we construct an explicit basis for the top homology of Ln,k, where the basis elements are indexed by all labelled, rooted, (k + 1)-ary trees on n-vertices in which the root has no 0-child. This construction gives an explicit Gn-equivariant isomorphism between the top homology of Ln,k and a direct sum of copies of CGn.en_US
dc.format.extent116243 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers; Springer Science+Business Mediaen_US
dc.subject.otherMathematicsen_US
dc.subject.otherComputer Science, Generalen_US
dc.subject.otherGroup Theory and Generalizationsen_US
dc.subject.otherOrder, Lattices, Ordered Algebraic Structuresen_US
dc.subject.otherCombinatoricsen_US
dc.subject.otherConvex and Discrete Geometryen_US
dc.subject.otherIntersection Latticeen_US
dc.subject.otherPartition Latticeen_US
dc.subject.otherHomologyen_US
dc.subject.otherRegular Representationen_US
dc.subject.otherRooted Treeen_US
dc.titleA Basis for the Top Homology of a Generalized Partition Latticeen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, Ann Arbor, MI, 48109-1109en_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/46306/1/10801_2004_Article_187203.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1023/A:1018663030935en_US
dc.identifier.sourceJournal of Algebraic Combinatoricsen_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.