Cover Image

On the number of faces of marked order polytopes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Melikhova, Ekaterina V.
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Metric Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the number of faces of Gelfand-Zetlin polytopes
by: Melikhova, Ekaterina V.
Published: (2017)

Many equiprojective polytopes
by: Buffière, Théophile, et al.
Published: (2023)

Kissing polytopes in dimension 3
by: Deza, Antoine, et al.
Published: (2025)

Flat simplices and kissing polytopes
by: Deza, Antoine, et al.
Published: (2026)

Extremal spherical polytopes and Borsuk's conjecture
by: Katz, Mikhail, et al.
Published: (2023)

Hadwiger's conjecture holds for strongly monotypic polytopes
by: Bui, Vuong
Published: (2024)

Kissing polytopes
by: Deza, Antoine, et al.
Published: (2023)

Small kissing polytopes
by: Deza, Antoine, et al.
Published: (2024)

On the chromatic numbers of 3-dimensional slices
by: Cherkashin, D. D., et al.
Published: (2022)

Upper bounds on chromatic number of $\mathbb{E}^n$ in low dimensions
by: Arman, Andrii, et al.
Published: (2021)

The expansion of half-integral polytopes
by: Cardinal, Jean, et al.
Published: (2024)

The chromatic number of 4-dimensional lattices
by: Vallentin, Frank, et al.
Published: (2024)

Improved Helly numbers of product sets
by: Arun, Srinivas, et al.
Published: (2024)

On the cross-product conjecture for the number of linear extensions
by: Chan, Swee Hong, et al.
Published: (2023)

The fractional chromatic number of the plane is at least 4
by: Matolcsi, Máté, et al.
Published: (2023)

On Helly number for crystals and cut-and-project sets
by: Garber, Alexey
Published: (2016)

Geometric graphs with exponential chromatic number and arbitrary girth
by: Bucić, Matija, et al.
Published: (2023)

Improved kissing numbers in seventeen through twenty-one dimensions
by: Cohn, Henry, et al.
Published: (2024)

A new lower bound for the kissing number in 19 dimensions
by: Ho, Boon Suan
Published: (2026)

Total orders realizable as the distances between two sets of points
by: Maldonado, Gerardo L., et al.
Published: (2023)

Equiprojective polytopes in higher dimension
by: Cousaert, Alice
Published: (2026)

The Lamplighter groups have infinite weak cop number
by: Cornect, Anders, et al.
Published: (2024)

Undecidability of tiling the plane with a fixed number of Wang bars
by: Yang, Chao, et al.
Published: (2024)

Upper Bounds for $s$-Distance Subspaces
by: Wang, LiXia, et al.
Published: (2025)

On the Structure of Frames and Equiangular Lines over Finite Fields and their Connections to Design Theory
by: Jorquera, Ian, et al.
Published: (2025)

Constructions of Large m-Distance Sets on Triangular Lattice
by: Bao, Li-Ren, et al.
Published: (2025)

New upper bound for lattice covering by spheres
by: Gao, Jun, et al.
Published: (2025)

Covering large-dimensional Euclidean spaces by random translates of a given convex body
by: Bukh, Boris, et al.
Published: (2025)

Equilateral n-gons in planar integer lattices
by: Mahabaduge, Ghaura
Published: (2025)

An Intersection Product for the Polytope Algebra
by: Wannerer, Thomas
Published: (2025)

Edge-to-edge Tilings of the Sphere by Angle Congruent Pentagons
by: Barish, Robert, et al.
Published: (2025)

A Structural Condition on Point Sets with Few Distinct Dot Products
by: Gandhi, Anshula
Published: (2025)

Fundamental Notions of Projective and Scale-Translation-Invariant Metrics in Coding Theory
by: Riccardi, Gabor, et al.
Published: (2025)

Hypercube minor-universality
by: Benjamini, Itai, et al.
Published: (2025)

Maximal Equidistant Spacings
by: Puthawala, Michael
Published: (2025)

Quantitative selection theorems
by: Dillon, Travis
Published: (2025)

Asymmetric SICs over finite fields
by: Iverson, Joseph W., et al.
Published: (2025)

Sparsity, Stress-Independence and Globally Linked Pairs in Graph Rigidity Theory
by: Garamvölgyi, Dániel, et al.
Published: (2025)

Borsuk's conjecture for two-distance sets and its equivalent formulation for graphs
by: Musin, Oleg R.
Published: (2025)

No-$(k+1)$-in-line problem for large constant $k$
by: Grebennikov, Alexandr, et al.
Published: (2025)