ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Discrete Mathematics
Volume 159, Issues 1-3, 1 November 1996, Pages 255-259
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (227 K)

Article Toolbox
  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0012-365X(95)00083-9    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1996 Published by Elsevier Science B.V.

Note

Reversible shellings and an inequality for h-vectors

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Manoj K. Chari1

Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803, USA


Received 18 January 1994; 
revised 6 December 1994. 
Available online 20 February 1999.

Abstract

Several important simplicial complexes including matroid complexes and broken circuit complexes are known to be shellable. We show that the lexicographic order of the bases of a matroid can be reversed to obtain a shelling. We prove that the h-vectors of such reversibly shellable complexes of rank d, which have an empty boundary must satisfy the inequality ho + h1 … + hi less-than-or-equals, slant hd + hd−1 + … + hdi for iless-than-or-equals, slant[d/2]. In particular, this gives a necessary condition for the h-vector of matroids without coloops.

Article Outline

• References

1 Work partially supported by LEQSF grant no. (92–94)-RD-A-09 from the Louisiana Board of Regents.


Discrete Mathematics
Volume 159, Issues 1-3, 1 November 1996, Pages 255-259
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.