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