English
Related papers

Related papers: Characterizing face and flag vector pairs for poly…

200 papers

We present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and…

Computational Complexity · Computer Science 2022-05-04 Heng Guo , Mark Jerrum

Mukai proved that most prime Fano fourfolds of degree 10 and index 2 are contained in a Grassmannian G(2,5). They are all unirational and some are rational, as remarked by Roth in 1949. We show that their middle cohomology is of K3 type and…

Algebraic Geometry · Mathematics 2014-02-26 Olivier Debarre , Atanas Iliev , Laurent Manivel

Let $\rho$ be a metric on the set $X=\{1,2,\dots,n+1\}$. Consider the $n$-dimensional polytope of functions $f:X\rightarrow \mathbb{R}$, which satisfy the conditions $f(n+1)=0$, $|f(x)-f(y)|\leq \rho(x,y)$. The question on classifying…

Combinatorics · Mathematics 2016-08-25 J. Gordon , F. Petrov

Through tropical normal idempotent matrices, we introduce isocanted alcoved polytopes, computing their $f$--vectors and checking the validity of the following five conjectures: B\'{a}r\'{a}ny, unimodality, $3^d$, flag and cubical lower…

Combinatorics · Mathematics 2020-09-30 María Jesús de la Puente , Pedro Luis Clavería

Results of Koebe (1936), Schramm (1992), and Springborn (2005) yield realizations of $3$-polytopes with edges tangent to the unit sphere. Here we study the algebraic degrees of such realizations. This initiates the research on constrained…

Combinatorics · Mathematics 2022-03-25 Mara Belotti , Michael Joswig , Marta Panizzut

We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d=6. This implies that for all pairs (d,n) with n-d \leq 6 the diameter of…

Combinatorics · Mathematics 2011-08-24 David Bremner , Lars Schewe

The aim of the paper is to calculate face numbers of simple generalized permutohedra, and study their f-, h- and gamma-vectors. These polytopes include permutohedra, associahedra, graph-associahedra, simple graphic zonotopes, nestohedra,…

Combinatorics · Mathematics 2007-05-23 Alexander Postnikov , Victor Reiner , Lauren Williams

Let $\mu_{\text{2n}}(d,v)$ (respectively, $\mu^{\text{s}}_{\text{2n}}(d,v)$) be the minimal number of facets of a (simplicial) 2-neighborly $d$-polytope with $v$ vertices, $v > d \ge 4$. It is known that $\mu_{\text{2n}}(4,v) = v (v-3)/2$,…

Combinatorics · Mathematics 2019-01-23 Aleksandr Maksimenko

The flag f-vectors of three-colored complexes are characterized. This also characterizes the flag h-vectors of balanced Cohen-Macaulay complexes of dimension two, as well as the flag h-vectors of balanced shellable complexes of dimension…

Combinatorics · Mathematics 2010-06-25 Andrew Frohmader

We give an alternative proof of a (former) conjecture of Bj\"orner stating that the matrix expressing face numbers in terms of g numbers is totally non-negative. We briefly discuss the case of simple flag polytopes.

Combinatorics · Mathematics 2010-12-01 Światosław R. GaL

Neighborly cubical polytopes exist: for any $n\ge d\ge 2r+2$, there is a cubical convex d-polytope $C^n_d$ whose $r$-skeleton is combinatorially equivalent to that of the $n$-dimensional cube. This solves a problem of Babson, Billera &…

Combinatorics · Mathematics 2007-05-23 Michael Joswig , G"unter M. Ziegler

Given an abstract polytope $\cal P$, its flag graph is the edge-coloured graph whose vertices are the flags of $\cal P$ and the $i$-edges correspond to $i$-adjacent flags. Flag graphs of polytopes are maniplexes. On the other hand, given a…

Combinatorics · Mathematics 2016-04-06 Jorge Garza-Vargas , Isabel Hubard

We provide asymptotics for the number of faces of a certain family of Hanner polytopes. As a corollary, we come close to saturating the FLM inequality for a certain family of parameters.

Combinatorics · Mathematics 2026-04-24 Tomer Milo

Characterization of entropy functions is of fundamental importance in information theory. By imposing constraints on their Shannon outer bound, i.e., the polymatroidal region, one obtains the faces of the region and entropy functions on…

Information Theory · Computer Science 2025-12-11 Shaocheng Liu , Qi Chen

We define treetopes, a generalization of the three-dimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet such that every face of dimension greater than one…

Computational Geometry · Computer Science 2020-08-10 David Eppstein

For a lattice polytope $P$, the rank of $P$ is defined by $F-(\dim P+1)$, where $F$ is the number of facets of $P$. In this paper, we study matroid polytopes with small rank. More precisely, we characterize matroid independence polytopes…

Combinatorics · Mathematics 2025-03-31 Masato Konoike , Koji Matsushita

Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…

Combinatorics · Mathematics 2015-01-30 Hiroyuki Miyata , Arnau Padrol

We describe the integral cohomology rings of the flag manifolds of types B_n, D_n, G_2 and F_4 in terms of their Schubert classes. The main tool is the divided difference operators of Bernstein-Gelfand-Gelfand and Demazure. As an…

Algebraic Topology · Mathematics 2008-07-25 Masaki Nakagawa

It is known that every lattice polytope is unimodularly equivalent to a face of some reflexive polytope. A stronger question is to ask whether every $(0,1)$-polytope is unimodularly equivalent to a facet of some reflexive polytope. A large…

Combinatorics · Mathematics 2020-09-08 Takahiro Nagaoka , Akiyoshi Tsuchiya

We prove that every 4-polytope is determined by its edge-polygon incidences, solving an open problem of Gr\"unbaum. For each $d \geq 3$, we show that not every $d$-polytope is determined by its $(d-3)$-skeleton and dual $(d-3)$-skeleton…

Combinatorics · Mathematics 2025-05-21 Joshua Hinman
‹ Prev 1 3 4 5 6 7 10 Next ›