10 citations · 36 across the 25 of their papers we have counts for
30 papers
Generalized cut and metric polytopes of graphs and simplicial complexes
Michel Deza, Mathieu Dutour Sikirić
Given a graph one can define the cut polytope CUTP(G) and the metric polytope METP(G) of this graph and those polytopes encode in a nice way the metric on the graph. According…
On the lengths of zigzags in thin complexes
Michel Deza, Mark Pankov
We consider zigzags in thin complexes. The main result states that the sum of the lengths of all zigzags in an -complexe is equal to the sum of the lengths of all zigzags in all…
The joint weight enumerator of an LCD code and its dual
Adel Alahmadi, Michel Deza, Mathieu Dutour Sikirić +1
A binary linear code is called {\em LCD} if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy line…
Zigzag structure of thin chamber complexes
Michel Deza, Mark Pankov
Zigzags and generalized zigzags in thin chamber complexes are investigated, in particular, all zigzags in the Coxeter complexes are described. Using this description, we show that…
Hypercube emulation of interconnection networks topologies
Adel Alahmadi, Husain Alhazmi, Shakir Ali +3
We address various topologies (de Bruijn, chordal ring, generalized Petersen, meshes) in various ways ( isometric embedding, embedding up to scale, embedding up to a distance) in a…
The hypermetric cone on vertices and some generalizations
Michel Deza, Mathieu Dutour Sikirić
The lists of facets -- in orbits -- and of extreme rays -- in orbits -- of the hypermetric cone are computed. The first generalization…