Vertex-Facet Assignments For Polytopes

12/20/2018
by   Thomas Jahn, et al.
0

For polytopes in R^d with at least as many facets as vertices, we prove that vertices can be mapped injectively to non-incident facets when 1≤ d≤ 5 and give counterexamples for d≥ 7.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2022

Maximal origami flip graphs of flat-foldable vertices: properties and algorithms

Flat origami studies straight line, planar graphs C=(V,E) drawn on a reg...
research
07/14/2023

Intrinsic Mesh Simplification

This paper presents a novel simplification method for removing vertices ...
research
05/01/2017

Vertex Nomination Via Local Neighborhood Matching

Consider two networks on overlapping, non-identical vertex sets. Given v...
research
10/23/2019

Towards Fast Displaced Vertex Finding

Many Standard Model extensions predict metastable massive particles that...
research
12/06/2019

Topology-Preserving Terrain Simplification

We give necessary and sufficient criteria for elementary operations in a...
research
08/02/2016

Global Vertices and the Noising Paradox

A theoretical and experimental analysis related to the identification of...
research
12/12/2021

An Advanced Parallel PageRank Algorithm

Initially used to rank web pages, PageRank has now been applied in many ...

Please sign up or login with your details

Forgot password? Click here to reset