28:
508:, combines Michel Deza's interests in polyhedral combinatorics and metric spaces; it describes the metric polytope, whose points represent symmetric distance matrices satisfying the triangle inequality. For metric spaces with seven points, for instance, this polytope has 21 dimensions (the 21 pairwise distances between the points) and 275,840 vertices.
289:-element set shared by all the members of the family. Manoussakis writes that Deza is sorry not to have kept and framed the US$ 100 check from Erdős for the prize for solving the problem, and that this result inspired Deza to pursue a lifestyle of mathematics and travel similar to that of Erdős.
218:
The papers from a conference on combinatorics, geometry and computer science, held in Luminy, France in May 2007, have been collected as a special issue of the
European Journal of Combinatorics in honor of Deza's 70th birthday.
206:
until emigrating to France in 1972. In France, he worked at CNRS from 1973 until his 2005 retirement. He has written eight books and about 280 academic papers with 75 different co-authors, including four papers with
628:
writes, this book describes "many interesting connections ... among polyhedral combinatorics, local Banach geometry, optimization, graph theory, geometry of numbers, and probability".
188:
184:
1174:
1169:
710:
497:
971:
948:
911:
889:
870:
847:
824:
801:
779:
744:
482:
1189:
1184:
1179:
703:
651:
606:
192:
978:
633:
1159:
955:
1065:
267:
203:
371:
has the property that it contains all the sets that have nonzero values for some function ƒ of strength at most
1164:
433:
95:
1129:
1081:
559:
distance; this paper is one of many in this line of research. An earlier result of Deza showed that every
719:, p. 57. This book is organized as a list of distances of many types, each with a brief description.
263:
575:
501:
762:
and their generalizations, planar graphs in which all faces are cycles with only two possible lengths.
1154:
1149:
1043:
505:
255:
460:
Deza, A.; Deza, M.; Fukuda, K. (1996), "On skeletons, diameters and volumes of metric polyhedra",
625:
453:
424:
332:
137:
456:
given a complete description of this polytope's facets, such a complete description is unlikely.
731:, Encyclopedia of Mathematics and its Applications, vol. 119, Cambridge University Press,
967:
944:
907:
885:
866:
843:
820:
797:
775:
740:
699:
647:
602:
478:
199:
176:
979:
https://web.archive.org/web/20161022031836/http://www.liga.ens.fr/~deza/InRussian/DEZA-M2.pdf
1093:
1021:
956:
https://web.archive.org/web/20161026002230/http://www.liga.ens.fr/~deza/InRussian/DEZA-M.pdf
732:
639:
594:
528:
470:
408:
316:
238:
187:(CNRS), the vice president of the European Academy of Sciences, a research professor at the
124:
119:
754:
661:
616:
540:
492:
420:
328:
250:
1069:
932:
750:
657:
612:
536:
488:
416:
324:
298:
246:
142:
1012:
Manoussakis, Yannis (2010), "Preface to special issue in honor of Deza's 70th birthday",
294:
212:
469:, Lecture Notes in Computer Science, vol. 1120, Springer-Verlag, pp. 112–128,
725:
441:
365:
532:
1143:
665:
549:
396:
307:
259:
242:
208:
172:
168:
428:
336:
571:
180:
52:
1062:
566:
metric with rational distances could be scaled by an integer and embedded into a
461:
449:
445:
112:
1039:
1025:
899:
858:
835:
812:
789:
767:
691:
621:
598:
736:
474:
759:
567:
643:
545:
437:
27:
412:
388:
320:
1111:
758:. This book describes the graph-theoretic and geometric properties of
165:
85:
74:
48:
1134:
348:
is a small set, the sum of the function values of the supersets of
70:
635:
Scale-isometric polytopal graphs in hypercubes and cubic lattices
161:
277:-element universe, in which the intersection of every pair of
512:
Chepoi, V.; Deza, M.; Grishukhin, V. (1997), "Clin d'oeil on
344:-element universe to integers, with the property that, when
352:
is zero. The strength of the function is the maximum value
229:
Deza, M. (1974), "Solution d'un problème de Erdös-Lovász",
727:
Geometry of chemical graphs: polycycles and two-faced maps
1130:
Deza's web page as of August 17, 2016 on
Wayback Machine
593:, Algorithms and Combinatorics, vol. 15, Springer,
340:. This paper considers functions ƒ from subsets of some
191:, and one of the three founding editors-in-chief of the
933:
http://dc.lib.unc.edu/cdm/item/collection/rbr/?id=30912
552:
metric) and metric spaces into vector spaces with the
1135:
Archived copy of Deza's web page, with note of demise
578:), the scale factor can always be taken to be 2.
570:; this paper shows that for the metrics coming from
880:Deza, M.; Dutour Sikirić, M.; Shtogrin, M. (2015),
269:, p. 406) that a sufficiently large family of
130:
118:
108:
91:
81:
59:
34:
18:
724:
189:Japan Advanced Institute of Science and Technology
387:-dependent families form the dependent sets of a
183:. He was the retired director of research at the
882:Geometric Structure of Chemistry-relevant Graphs
712:Newsletter of the European Mathematical Society
632:Deza, M.; Grishukhin, V.; Shtogrin, M. (2004),
160:(27 April 1939 – 23 November 2016) was a
863:Encyclopedia of Distances, 4th revised edition
840:Encyclopedia of Distances, 3rd revised edition
817:Encyclopedia of Distances, 2nd revised edition
680:, this book concentrates more specifically on
185:French National Centre for Scientific Research
8:
391:, which Deza and his co-authors investigate.
364:or fewer elements have this property. If a
904:Generalizations of Finite Metrics and Cuts
496:. This paper with his son Antoine Deza, a
26:
15:
1007:
1005:
1003:
1001:
999:
997:
995:
231:Journal of Combinatorial Theory, Series B
1094:Erdos0d, Version 2007, September 3, 2008
1112:"Le mathématicien a besoin d'être aimé"
991:
902:; Deza, M.; Dutour Sikirić, M. (2016),
1063:European Academy of Sciences Presidium
202:in 1961, after which he worked at the
723:Deza, M.; Dutour Sikirić, M. (2008),
7:
1175:21st-century French mathematicians
1170:20th-century French mathematicians
1110:Agudo, Pierre (January 24, 1998),
574:(including many graphs arising in
463:Combinatorics and Computer Science
436:describes some of the facets of a
301:(1983), "On functions of strength
14:
1044:"[ITHEA ISS] Michel Deza"
1014:European Journal of Combinatorics
548:embeddings of graphs (with their
504:in Combinatorial Optimization at
193:European Journal of Combinatorics
1096:, from the Erdős number project.
544:. Much of Deza's work concerns
589:Deza, M.; Laurent, M. (1997),
498:fellow of the Fields Institute
395:Deza, M.; Laurent, M. (1992),
1:
533:10.1016/S0166-218X(97)00066-8
678:Geometry of cuts and metrics
591:Geometry of cuts and metrics
521:Discrete Applied Mathematics
519:-embeddable planar graphs",
243:10.1016/0095-8956(74)90059-8
397:"Facets for the cut cone I"
1206:
1190:Mathematicians from Moscow
1185:Soviet emigrants to France
638:, Imperial College Press,
204:Soviet Academy of Sciences
1026:10.1016/j.ejc.2009.03.020
772:Encyclopedia of Distances
599:10.1007/978-3-642-04295-9
452:, but could be solved by
151:
101:
25:
1180:Academic journal editors
1082:Faculty profile at JAIST
737:10.1017/CBO9780511721311
475:10.1007/3-540-61576-8_78
434:polyhedral combinatorics
401:Mathematical Programming
1072:, retrieved 2009-05-23.
966:, Probel-2000, Moscow,
943:, Probel-2000, Moscow,
696:Dictionary of Distances
440:that encodes cuts in a
285:elements, has a common
96:Moscow State University
1160:Russian mathematicians
254:. This paper solved a
644:10.1142/9781860945489
576:chemical graph theory
502:Canada Research Chair
281:-subsets has exactly
941:Poems and interviews
906:, World Scientific,
796:, World Scientific,
198:Deza graduated from
865:, Springer-Verlag,
842:, Springer-Verlag,
819:, Springer-Verlag,
792:; Deza, M. (2011),
774:, Springer-Verlag,
694:; Deza, M. (2006),
506:McMaster University
356:such that all sets
1068:2009-05-02 at the
931:Sintaksis, Paris (
626:Alexander Barvinok
454:linear programming
413:10.1007/BF01580897
321:10.1007/BF02579189
171:, specializing in
973:978-5-98604-555-9
962:Deza, M. (2016),
950:978-5-98604-442-2
939:Deza, M. (2014),
927:Deza, M. (1983),
922:Poetry in Russian
913:978-98-147-4039-5
891:978-81-322-2448-8
872:978-3-662-52844-0
849:978-3-662-44341-5
826:978-3-642-30957-1
803:978-981-4355-48-3
781:978-3-642-00233-5
746:978-0-521-87307-9
484:978-3-540-61576-7
200:Moscow University
177:discrete geometry
158:Michel Marie Deza
155:
154:
131:Doctoral students
103:Scientific career
1197:
1119:
1097:
1091:
1085:
1079:
1073:
1060:
1054:
1053:
1051:
1050:
1036:
1030:
1028:
1009:
976:
953:
916:
894:
875:
852:
829:
806:
794:Figurate Numbers
784:
757:
730:
708:
675:
674:
673:
664:, archived from
619:
543:
495:
468:
432:. This paper in
431:
407:(1–3): 121–160,
383:-dependent; the
339:
315:(3–4): 331–339,
273:-subsets of any
253:
211:, giving him an
125:Roland Dobrushin
120:Doctoral advisor
66:
63:23 November 2016
44:
42:
30:
16:
1205:
1204:
1200:
1199:
1198:
1196:
1195:
1194:
1165:Graph theorists
1140:
1139:
1126:
1109:
1106:
1104:Further reading
1101:
1100:
1092:
1088:
1080:
1076:
1070:Wayback Machine
1061:
1057:
1048:
1046:
1038:
1037:
1033:
1011:
1010:
993:
988:
974:
961:
951:
938:
924:
914:
898:
892:
879:
873:
856:
850:
833:
827:
810:
804:
788:
782:
765:
747:
722:
706:
690:
686:
671:
669:
654:
631:
609:
588:
585:
565:
558:
518:
511:
485:
466:
459:
394:
292:
228:
225:
223:Selected papers
147:
143:Monique Laurent
92:Alma mater
77:
68:
64:
55:
46:
40:
38:
21:
12:
11:
5:
1203:
1201:
1193:
1192:
1187:
1182:
1177:
1172:
1167:
1162:
1157:
1152:
1142:
1141:
1138:
1137:
1132:
1125:
1124:External links
1122:
1121:
1120:
1105:
1102:
1099:
1098:
1086:
1074:
1055:
1042:(2016-12-02).
1031:
990:
989:
987:
984:
983:
982:
972:
959:
949:
936:
923:
920:
919:
918:
912:
896:
890:
877:
871:
854:
848:
831:
825:
808:
802:
786:
780:
763:
745:
720:
709:. Reviewed in
704:
688:
684:
676:. A sequel to
652:
629:
607:
584:
581:
580:
579:
563:
556:
516:
509:
483:
457:
442:complete graph
392:
366:family of sets
290:
237:(2): 166–167,
224:
221:
153:
152:
149:
148:
146:
145:
140:
134:
132:
128:
127:
122:
116:
115:
110:
106:
105:
99:
98:
93:
89:
88:
83:
79:
78:
69:
67:(aged 77)
61:
57:
56:
47:
36:
32:
31:
23:
22:
19:
13:
10:
9:
6:
4:
3:
2:
1202:
1191:
1188:
1186:
1183:
1181:
1178:
1176:
1173:
1171:
1168:
1166:
1163:
1161:
1158:
1156:
1153:
1151:
1148:
1147:
1145:
1136:
1133:
1131:
1128:
1127:
1123:
1117:
1113:
1108:
1107:
1103:
1095:
1090:
1087:
1083:
1078:
1075:
1071:
1067:
1064:
1059:
1056:
1045:
1041:
1035:
1032:
1027:
1023:
1019:
1015:
1008:
1006:
1004:
1002:
1000:
998:
996:
992:
985:
980:
975:
969:
965:
960:
957:
952:
946:
942:
937:
934:
930:
926:
925:
921:
915:
909:
905:
901:
897:
893:
887:
883:
878:
874:
868:
864:
860:
855:
851:
845:
841:
837:
832:
828:
822:
818:
814:
809:
805:
799:
795:
791:
787:
783:
777:
773:
769:
764:
761:
756:
752:
748:
742:
738:
734:
729:
728:
721:
718:
716:
713:
707:
705:0-444-52087-2
701:
697:
693:
689:
683:
679:
668:on 2012-02-25
667:
663:
659:
655:
653:1-86094-421-3
649:
645:
641:
637:
636:
630:
627:
623:
618:
614:
610:
608:3-540-61611-X
604:
600:
596:
592:
587:
586:
582:
577:
573:
572:planar graphs
569:
562:
555:
551:
550:shortest path
547:
542:
538:
534:
530:
526:
522:
515:
510:
507:
503:
499:
494:
490:
486:
480:
476:
472:
465:
464:
458:
455:
451:
447:
443:
439:
435:
430:
426:
422:
418:
414:
410:
406:
402:
398:
393:
390:
386:
382:
378:
374:
370:
367:
363:
359:
355:
351:
347:
343:
338:
334:
330:
326:
322:
318:
314:
310:
309:
308:Combinatorica
304:
300:
299:Singhi, N. M.
296:
291:
288:
284:
280:
276:
272:
268:
265:
264:László Lovász
261:
257:
252:
248:
244:
240:
236:
232:
227:
226:
222:
220:
216:
214:
210:
205:
201:
196:
194:
190:
186:
182:
178:
174:
173:combinatorics
170:
169:mathematician
167:
163:
159:
150:
144:
141:
139:
136:
135:
133:
129:
126:
123:
121:
117:
114:
111:
107:
104:
100:
97:
94:
90:
87:
84:
80:
76:
72:
62:
58:
54:
50:
45:27 April 1939
37:
33:
29:
24:
17:
1115:
1089:
1077:
1058:
1047:. Retrieved
1034:
1017:
1013:
963:
940:
928:
903:
884:, Springer,
881:
862:
839:
816:
793:
771:
726:
714:
711:
698:, Elsevier,
695:
681:
677:
670:, retrieved
666:the original
634:
590:
560:
553:
524:
520:
513:
500:who holds a
462:
404:
400:
384:
380:
376:
372:
368:
361:
357:
353:
349:
345:
341:
312:
306:
302:
286:
282:
278:
274:
270:
234:
230:
217:
213:Erdős number
197:
181:graph theory
157:
156:
138:Gérard Cohen
102:
65:(2016-11-23)
53:Soviet Union
1155:2016 deaths
1150:1939 births
1118:(in French)
1040:Deza, Elena
717:(June 2007)
527:(1): 3–19,
450:NP-complete
448:problem is
446:maximum cut
113:Mathematics
82:Nationality
20:Michel Deza
1144:Categories
1116:l'Humanité
1049:2018-09-01
1020:(2): 419,
986:References
857:Deza, M.;
834:Deza, M.;
811:Deza, M.;
766:Deza, M.;
760:fullerenes
672:2009-05-20
622:MathSciNet
295:Frankl, P.
293:Deza, M.;
260:Paul Erdős
256:conjecture
209:Paul Erdős
41:1939-04-27
624:reviewer
568:hypercube
546:isometric
444:. As the
1066:Archived
900:Deza, E.
861:(2016),
859:Deza, E.
838:(2014),
836:Deza, E.
815:(2013),
813:Deza, E.
790:Deza, E.
770:(2009),
768:Deza, E.
692:Deza, E.
687:metrics.
438:polytope
429:18981099
337:46336677
929:59--62,
755:2429120
662:2051396
617:1460488
541:1489057
493:1448925
421:1183645
389:matroid
329:0729786
251:0337635
86:Russian
970:
964:75--77
947:
910:
888:
869:
846:
823:
800:
778:
753:
743:
702:
660:
650:
615:
605:
539:
491:
481:
427:
419:
335:
327:
249:
215:of 1.
166:French
162:Soviet
109:Fields
75:France
49:Moscow
620:. As
583:Books
467:(PDF)
425:S2CID
333:S2CID
71:Paris
968:ISBN
945:ISBN
908:ISBN
886:ISBN
867:ISBN
844:ISBN
821:ISBN
798:ISBN
776:ISBN
741:ISBN
700:ISBN
648:ISBN
603:ISBN
479:ISBN
266:(in
262:and
179:and
164:and
60:Died
35:Born
1022:doi
733:doi
640:doi
595:doi
529:doi
471:doi
409:doi
379:is
360:of
317:doi
305:",
258:of
239:doi
1146::
1114:,
1018:31
1016:,
994:^
981:).
958:).
935:).
751:MR
749:,
739:,
715:64
658:MR
656:,
646:,
613:MR
611:,
601:,
537:MR
535:,
525:80
523:,
489:MR
487:,
477:,
423:,
417:MR
415:,
405:56
403:,
399:,
375:,
331:,
325:MR
323:,
311:,
297:;
247:MR
245:,
235:16
233:,
195:.
175:,
73:,
51:,
1084:.
1052:.
1029:.
1024::
977:(
954:(
917:.
895:.
876:.
853:.
830:.
807:.
785:,
735::
685:1
682:L
642::
597::
564:1
561:L
557:1
554:L
531::
517:1
514:L
473::
411::
385:t
381:t
377:F
373:t
369:F
362:t
358:A
354:t
350:A
346:A
342:n
319::
313:3
303:t
287:t
283:t
279:k
275:n
271:k
241::
43:)
39:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
