Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 102 tok/s Pro
Kimi K2 166 tok/s Pro
GPT OSS 120B 436 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

The flag upper bound theorem for 3- and 5-manifolds (1512.06958v1)

Published 22 Dec 2015 in math.CO

Abstract: We prove that among all flag 3-manifolds on $n$ vertices, the join of two circles with $\left\lceil{\frac{n}{2}}\right \rceil$ and $\left\lfloor{\frac{n}{2}}\right \rfloor$ vertices respectively is the unique maximizer of the face numbers. This solves the first case of a conjecture due to Lutz and Nevo. Further, we establish a sharp upper bound on the number of edges of flag 5-manifolds and characterize the cases of equality. We also show that the inequality part of the flag upper bound conjecture continues to hold for all flag 3-dimensional Eulerian complexes and find all maximizers of the face numbers in this class.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.