Neighborly polytopes
From MaRDI portal
In this paper the author deals with neighborly 2m-polytopes. A 2m- polytope Q is neighborly if each m vertices of Q determine a face. It is shown that the combinatorial structure of a neighborly 2m-polytope determines the combinatorial structure of every subpolytope. Also the author obtains lower bounds for the number g(v,2m) of combinatorial types of neighborly 2m-polytopes with v vertices. He proves that \(g(2m+4,2m)\) increases superexponentially with m, and g(v,m) tends to infinity superexponentially with v for each fixed \(m\geq 2\).
Recommendations
Cited in
(57)- How many cyclic subpolytopes can a non-cyclic polytope have?
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- Gewisse einfache Polytope sind durch ihren Graph eindeutig bestimmt. (Certain simple polytopes are uniquely determined by their graphs)
- Many triangulated spheres
- Puzzles and polytope isomorphisms
- Polytopal and nonpolytopal spheres. An algorithmic approach
- An infinite family of minor-minimal nonrealizable 3-chirotopes
- Totally positive matrices and cyclic polytopes
- Every simplicial polytope with at most \(d+4\) vertices is a quotient of a neighborly polytope
- Realizability and inscribability for simplicial polytopes via nonlinear optimization
- The flag upper bound theorem for 3- and 5-manifolds
- The universality theorem for neighborly polytopes
- Neighborly inscribed polytopes and Delaunay triangulations
- Hadwiger's covering conjecture and low dimensional dual cyclic polytopes
- Subpolytopes of cyclic polytopes
- Cyclic polytopes and oriented matroids
- Random Gale diagrams and neighborly polytopes in high dimensions
- Small covers and quasitoric manifolds over neighborly polytopes
- Rigidity with few locations
- Ear decomposition and balanced neighborly simplicial manifolds
- Simplicial neighbourly 5-polytopes with nine vertices
- Long monotone paths on simple 4-polytopes
- On weakly-neighbourly polyhedra
- Polytopes with few vertices and few facets
- Intersection patterns of finite sets and of convex sets
- Enumerating neighborly polytopes and oriented matroids
- Neighbourly polytopes with few vertices
- There are asymptotically far fewer polytopes than we thought
- The number of polytopes, configurations and real matroids
- Many neighborly polytopes and oriented matroids
- On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes
- Neighbours on a grid
- New families of highly neighborly centrally symmetric spheres
- scientific article; zbMATH DE number 3892082 (Why is no real title available?)
- Moment curves and cyclic symmetry for positive Grassmannians
- Neighborly 6-polytopes with 10 vertices
- Almost cyclic polytopes
- Neighborly polytopes and oriented matroids
- On the finding of final polynomials
- Many neighborly spheres
- Reconstructing simplicial polytopes from their graphs and affine 2-stresses
- The existence of balanced neighborly polynomials
- Positive Plücker tree certificates for non-realizability
- Face numbers: the upper bound side of the story
- On the numbers of faces of low-dimensional regular triangulations and shellable balls
- Separation in totally-sewn 4-polytopes with the decreasing universal edge property
- Minimal balanced neighborly polynomials
- Transversal numbers of simplicial polytopes, spheres, and pure complexes
- The two higher Stasheff-Tamari orders are equal
- Existence of a small cover over a 15-colorable simple 4-polytope
- On sign-invariance graphs of uniform oriented matroids
- Construction theorems for polytopes
- Construction and analysis of projected deformed products
- Universality theorems for inscribed polytopes and Delaunay triangulations
- Totally splittable polytopes
- A generalized sewing construction for polytopes
- Neighborly cubical polytopes and spheres
This page was built for publication: Neighborly polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079566)
