activity
20002005
most citedZigzag structure of complexes

10 citations · 20 across the 6 of their papers we have counts for

collaborators

8 papers

math.CO2005

Elementary elliptic -polycycles

Michel Deza, Mathieu Dutour, Mikhail Shtogrin

We consider the following generalization of the decomposition theorem for polycycles. A {\em -polycycle} is, roughly, a plane graph, whose faces, besides some disjoint {\em…

math.CO200410 cited

Zigzag structure of complexes

Michel Deza, Mathieu Dutour

Inspired by Coxeter's notion of Petrie polygon for -polytopes (see \cite{Cox73}), we consider a generalization of the notion of zigzag circuits on complexes and compute the zigz…

math.MG20044 cited

Adjacency method for extreme Delaunay polytopes

Mathieu Dutour

The {\em hypermetric cone} is defined as the cone of semimetrics satisfying the {\em hypermetric inequalities}. Every {\em Delaunay polytope} corresponds to a ray of this polyhedra…

math.MG20046 cited

Some six-dimensional rigid forms

Mathieu Dutour, Frank Vallentin

One can always decompose Dirichlet-Voronoi polytopes of lattices non-trivially into a Minkowski sum of Dirichlet-Voronoi polytopes of rigid lattices. In this report we show how one…

math.GT2003

On simplicial and cubical complexes with short links

Michel Deza, Mathieu Dutour, Mikhail Shtogrin

We consider closed simplicial and cubical -complexes in terms of link of their -faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every $(n-2…

math.MG2003

Infinite serie of extreme Delaunay polytopes

M. Dutour

A Delaunay polytope is said to be {\em extreme} if the only (up to isometries) affine bijective transformations of , for which is again a Delaunay polytope, ar…