Counting vertices of integer polytopes defined by facets

05/04/2021
by   Heng Guo, et al.
0

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 half-integral polytopes.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/02/2021

Ramsey Numbers of Trails

We initiate the study of Ramsey numbers of trails. Let k ≥ 2 be a positi...
07/14/2018

Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration

In this paper, we address the problem of counting integer points in a ra...
10/25/2020

How to Find the Convex Hull of All Integer Points in a Polyhedron?

We propose a cut-based algorithm for finding all vertices and all facets...
10/01/2017

The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices

In this paper, we will show that the width of simplices defined by syste...
06/18/2020

New Bounds for the Vertices of the Integer Hull

The vertices of the integer hull are the integral equivalent to the well...
10/04/2021

Faster algorithm for counting of the integer points number in Δ-modular polyhedra

Let a polytope 𝒫 be defined by one of the following ways: (i) 𝒫 = {x ∈...
08/17/2020

Binary scalar products

Let A,B ⊆ℝ^d both span ℝ^d such that ⟨ a, b ⟩∈{0,1} holds for all a ∈ A,...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.