Results 1  10
of
27
Absolute Irreducibility Of Polynomials Via Newton Polytopes
, 1998
"... A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial is absolutely irreducible if its Newton polytope is indecomposable in the sense of Minkowski sum of polytopes. Two general constructions of indecomposable polytopes are given, and they give many simple ..."
Abstract

Cited by 24 (9 self)
 Add to MetaCart
A multivariable polynomial is associated with a polytope, called its Newton polytope. A polynomial is absolutely irreducible if its Newton polytope is indecomposable in the sense of Minkowski sum of polytopes. Two general constructions of indecomposable polytopes are given, and they give many simple irreducibility criteria including the wellknown Eisenstein's criterion. Polynomials from these criteria are over any field and have the property of remaining absolutely irreducible when their coefficients are modified arbitrarily in the field, but keeping certain collection of them nonzero.
Classification of eight dimensional perfect forms
 MATH
, 2007
"... In this paper, we classify the perfect lattices in dimension 8. There are 10916 of them. Our classification heavily relies on exploiting symmetry in polyhedral computations. Here we describe algorithms making the classification possible. ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
In this paper, we classify the perfect lattices in dimension 8. There are 10916 of them. Our classification heavily relies on exploiting symmetry in polyhedral computations. Here we describe algorithms making the classification possible.
On skeletons, diameters and volumes of metric polyhedra
 Combinatorics and Computer Science, Lecture
"... Abstract. We survey and present new geometric and combinatorial propertiez of some polyhedra with application in combinatorial optimization, for example, the maxcut and multicommodity flow problems. Namely we consider the volume, symmetry group, facets, vertices, face lattice, diameter, adjacency a ..."
Abstract

Cited by 15 (10 self)
 Add to MetaCart
Abstract. We survey and present new geometric and combinatorial propertiez of some polyhedra with application in combinatorial optimization, for example, the maxcut and multicommodity flow problems. Namely we consider the volume, symmetry group, facets, vertices, face lattice, diameter, adjacency and incidence relm:ons and connectivity of the metric polytope and its relatives. In partic~dar, using its large symmetry group, we completely describe all the 13 o:bits which form the 275 840 vertices of the 21dimensional metric polytope on 7 nodes and their incidence and adjacency relations. The edge connectivity, the/skeletons and a lifting procedure valid for a large class of vertices of the metric polytope are also given. Finally, we present an ordering of the facets of a polytope, based on their adjacency relations, for the enumeration of its vertices by the double description method. 1
BASIC PROPERTIES OF CONVEX POLYTOPES
, 1997
"... Convex polytopes are fundamental geometric objects that have been investigated since antiquity. The beauty of their theory is nowadays complemented by their importance for many other mathematical subjects, ranging from integration theory, algebraic topology, and algebraic geometry (toric varieties) ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
Convex polytopes are fundamental geometric objects that have been investigated since antiquity. The beauty of their theory is nowadays complemented by their importance for many other mathematical subjects, ranging from integration theory, algebraic topology, and algebraic geometry (toric varieties) to linear and combinatorial
Convex hull realizations of the multiplihedra
, 2007
"... Abstract. We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the n th polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be realized as convex polytopes. Contents ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
Abstract. We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the n th polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be realized as convex polytopes. Contents
Random walks on the vertices of transportation polytopes with constant number of sources
 Proc. 14th Ann. ACMSIAM Symp. Disc. Alg. (Baltimore, MD) 330–339, ACM
, 2003
"... We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on the edgevertex graph of the polytope. The analysis makes use of the multicommodity flow technique of Sinclair [30] toget ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on the edgevertex graph of the polytope. The analysis makes use of the multicommodity flow technique of Sinclair [30] together with ideas developed by Morris and Sinclair [24, 25] for the knapsack problem, and Cryan et al. [3] for contingency tables, to establish that the random walk approaches the uniform distribution in time n O(m2). 1
Equality Set Projection: A new algorithm for the projection of polytopes in halfspace representation
, 2004
"... ..."
Polytope Skeletons And Paths
 Handbook of Discrete and Computational Geometry (Second Edition ), chapter 20
"... INTRODUCTION The kdimensional skeleton of a dpolytope P is the set of all faces of the polytope of dimension at most k. The 1skeleton of P is called the graph of P and denoted by G(P ). G(P ) can be regarded as an abstract graph whose vertices are the vertices of P , with two vertices adjacent i ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
INTRODUCTION The kdimensional skeleton of a dpolytope P is the set of all faces of the polytope of dimension at most k. The 1skeleton of P is called the graph of P and denoted by G(P ). G(P ) can be regarded as an abstract graph whose vertices are the vertices of P , with two vertices adjacent if they form the endpoints of an edge of P . In this chapter, we will describe results and problems concerning graphs and skeletons of polytopes. In Section 17.1 we briefly describe the situation for 3polytopes. In Section 17.2 we consider general properties of polytopal graphs subgraphs and induced subgraphs, connectivity and separation, expansion, and other properties. In Section 17.3 we discuss problems related to diameters of polytopal graphs in connection with the simplex algorithm and t
Polyhedral representation conversion up to symmetries
, 2009
"... We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. In particular we discuss decomposition methods, which reduce the problem to a number of lower dimensional subproblems. These methods have been successfu ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. In particular we discuss decomposition methods, which reduce the problem to a number of lower dimensional subproblems. These methods have been successfully used by different authors in special contexts. Moreover, we sketch an incremental method, which is a generalization of Fourier–Motzkin elimination, and we give some ideas how symmetry can be exploited using pivots.