Cited By
View all- Delporte-Gallet CFauconnier HFraigniaud PRajsbaum STravers C(2024)Non-negotiating Distributed ComputingStructural Information and Communication Complexity10.1007/978-3-031-60603-8_12(208-225)Online publication date: 27-May-2024
In the French flag problem, initially uncolored cells on a grid must differentiate to become blue, white or red. The goal is for the cells to color the grid as a French flag, i.e., a three-colored triband, in a distributed manner. To solve a ...
For any flag nestohedron, we define a flag simplicial complex whose f-vector is the ź-vector of the nestohedron. This proves that the ź-vector of any flag nestohedron satisfies the Frankl---Füredi---Kalai inequalities, partially solving a conjecture by ...
We examine linear inequalities satisfied by the flag $f$-vectors of polytopes. One source of these inequalities is the toric $g$-vector; convolutions of its entries are non-negative for rational polytopes. We prove a conjecture of Meisinger about a ...
Springer-Verlag
Berlin, Heidelberg
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in