Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 92 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 32 tok/s
GPT-5 High 40 tok/s Pro
GPT-4o 83 tok/s
GPT OSS 120B 467 tok/s Pro
Kimi K2 197 tok/s Pro
2000 character limit reached

On the lengths of zigzags in thin complexes (1602.05401v2)

Published 17 Feb 2016 in math.CO

Abstract: We consider zigzags in thin complexes. The main result states that the sum of the lengths of all zigzags in an $n$-complexe is equal to the sum of the lengths of all zigzags in all $(n-1)$-faces of this complex, and this sum also is the twice of the sum of the lengths of all zigzags in all $(n-2)$-faces. For simplicial and cubical $n$-complexes, the sum depends on the rank $n$ and the number of $(n-1)$-faces only. We also describe the sum of the lengths of all generalized zigzags, it depends on the rank and the number of flags. As an application, we find the number of zigzags in Coxeter complexes.

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

Collections

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

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Authors (2)

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube