The g-theorem matrices are totally nonnegative

DOI10.1016/J.JCTA.2008.07.004zbMATH Open1194.52007OpenAlexW2144281219MaRDI QIDQ1024373FDOQ1024373

Authors: Michael Björklund, Alexander Engström 

Publication date: 17 June 2009

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2008.07.004

Recommendations

• Triangulations of simplicial polytopes
• Ehrhart polynomials, simplicial polytopes, magic squares and a conjecture of Stanley
• Simple convex polytopes and the strong Lefschetz theorem
• Skeletal rigidity of simplicial complexes. II
• Rigidity and the lower bound theorem for doubly Cohen-Macaulay complexes

zbMATH Keywords

\(f\)-vector\(g\)-theoremsimplicial polytopetotally non-negative matrix.

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Cites Work

• Lectures on Polytopes
• Binomial determinants, paths, and hook length formulae
• Total positivity: tests and parametrizations.
• The number of faces of a simplicial convex polytope
• A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
• Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes
• On the Vector Representations of Induced Matroids
• Title not available (Why is that?)
• Title not available (Why is that?)
• A comparison theorem for \(f\)-vectors of simplicial polytopes

Cited In (2)

• The totally nonnegative part of \(G/P\) is a CW complex
• The Dehn-Sommerville relations and the Catalan matroid

This page was built for publication: The \(g\)-theorem matrices are totally nonnegative

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024373)