Abstract
Suppose that C is a balanced simplicial complex. We show that its flag f-vector contains an interesting multiplicative structure. We define η s (C):= log2 f S (C), and characterize the convex cone in which this flag η-vector may lie. Additionally, we specialize our results to the case when C is a pure balanced simplicial complex, and when C is a graded poset.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. R. K. Chung, R. L. Graham, P. Frankl and J. B. Shearer: Some intersection theorems for ordered sets and graphs, J. Combin. Theory Ser. A 43(1) (1986), 23–37.
Péter Frankl, Zoltán Füredi and Gil Kalai: Shadows of colored complexes, Math. Scand. 63(2) (1988), 169–178.
Gy. Katona: A theorem of finite sets, in: Theory of graphs (Proc. Colloq., Tihany, 1966), Academic Press, Budapest, New York, 1968, pp. 187–207.
Joseph B. Kruskal: The number of simplices in a complex, in: Mathematical optimization techniques, Univ. of California Press, Berkeley, CA, 1963, pp. 251–278.
Alexander Schrijver: Theory of linear and integer programming, Wiley-Interscience Series in Discrete Mathematics, John Wiley & Sons Ltd., Chichester, 1986, A Wiley-Interscience Publication.