Some problems, I care most (Q966175)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some problems, I care most |
scientific article |
Statements
Some problems, I care most (English)
0 references
27 April 2010
0 references
Michel Deza formulates 10 problems in areas where discrete geometry meets algebra, classical combinatorics, graph theory, number theory, optimization, analysis and applications, especially in organic chemistry (fullerines, viruses). Just enough is spelled out and nice figures are presented to get the reader interested, but to fully understand the problems and get started on their solution, the reader will have to first read the author's books. (See, e.g. \textit{M. Deza} [Perfect matroid designs, Rep., Dep. Math., Univ. Stockh. 8, 27 p. (1984; Zbl 0544.05013)], \textit{M. Deza}, \textit{V. Grishukin}, and \textit{M. Shtogrin} [Scale-isometric polytopal graphs in hypercubes and cubic lattices. Polytopes in hypercubes and \(Z_n\), London: Imperial College Press (2004; Zbl 1054.52007)], \textit{M. Deza} and \textit{M. Dutour Sikirić} [Geometry of chemical graphs. Polycycles and two-faced maps, Encyclopedia of Mathematics and its Applications 119. Cambridge: Cambridge University Press (2008; Zbl 1153.05065)], \textit{M. Deza} and \textit{E. Deza} [Encyclopedia of distances, Berlin: Springer (2009; Zbl 1167.51001)], and \textit{M. Deza} and \textit{M. Laurent} [Geometry of cuts and metrics. Paperback reprint of the 1997 original, Algorithms and Combinatorics 15. Dordrecht: Springer (2010; Zbl 1210.52001)].)
0 references
problems
0 references
discrete geometry
0 references