Peter L. Hammer | |
---|---|

Born | |

Died | December 27, 2006 70) | (aged

Known for | Operations Research and Applied Discrete Mathematics |

Awards | "Gheorghe Țițeica" prize of the Romanian Academy of Science (1966), Euler Medal of the Institute of Combinatorics and its Applications (1999) |

Scientific career | |

Fields | Applied Mathematics |

Doctoral advisor | Grigore Moisil |

**Peter Ladislaw Hammer** (December 23, 1936, Timișoara – December 27, 2006, Princeton, New Jersey) was an American mathematician native to Romania. He contributed to the fields of operations research and applied discrete mathematics through the study of pseudo-Boolean functions and their connections to graph theory and data mining.^{ [1] }^{ [2] }^{ [3] }^{ [4] }

Hammer was born in Timișoara, Romania,^{ [1] } into a Hungarian speaking Jewish family.^{ [5] } He did both his undergraduate and graduate studies at the University of Bucharest, earning a diploma in 1958^{ [1] } and a doctorate in 1965 under the supervision of Grigore Moisil.^{ [6] } For a while in the 1960s he published under the name of Petru L. Ivănescu.^{ [1] } In 1967, he and his wife (Anca Ivănescu) escaped Romania and defected to Israel. Hammer taught at the Technion from 1967 to 1969, then moved to Canada at McGill University in Montreal from 1969 to 1972, at the University of Waterloo from 1972 to 1983, and finally at Rutgers University in New Brunswick, New Jersey for the remainder of his career. He was killed in a car accident on December 27, 2006.^{ [1] }

Hammer founded the Rutgers University Center for Operations Research, and created and edited the journals * Discrete Mathematics *, *Discrete Applied Mathematics*, *Discrete Optimization*, *Annals of Discrete Mathematics*, *Annals of Operations Research*, and *SIAM Monographs on Discrete Mathematics and Applications*.^{ [1] }

Hammer's publications include 19 books and over 240 papers. They include:

- Ivănescu, Peter L.; Rudeanu, Sergiu (1968).
*Boolean methods in operations research and related areas*. Econometrics and Operations Research.**VII**. With a preface by Richard E. Bellman. New York: Springer-Verlag. MR 0235830. - 2008.
*Boolean Functions in Computer Science and Engineering*(with Y. Crama). Cambridge University Press. 2008. - 2009.
*Boolean Functions in Pure and Applied Mathematics*(with Y. Crama). Cambridge University Press, 2009. - 2010.
*PseudoBoolean Functions*(with E. Boros and Y. Crama). Cambridge University Press, 2010. - Crama, Yves; Hammer, Peter L. (2011).
*Boolean functions: Theory, algorithms, and applications*. Encyclopedia of Mathematics and its Applications.**142**. Cambridge: Cambridge University Press. doi:10.1017/cbo9780511852008. ISBN 978-0-511-85200-8. MR 2742439.

In 1966, as a recent doctorate, Hammer won the "Gheorghe Țițeica" prize of the Romanian Academy of Science. He became a fellow of the American Association for the Advancement of Science in 1974. In 1986 he was awarded his first honorary doctorate, from the École Polytechnique Fédérale de Lausanne; subsequently, he was awarded two more, by the University of Rome La Sapienza in 1998 and the University of Liège in 1999. He also won the Euler Medal of the Institute of Combinatorics and its Applications in 1999, and was a founding fellow of the institute.^{ [1] }

In abstract algebra, a **Boolean algebra** or **Boolean lattice** is a complemented distributive lattice. This type of algebraic structure captures essential properties of both set operations and logic operations. A Boolean algebra can be seen as a generalization of a power set algebra or a field of sets, or its elements can be viewed as generalized truth values. It is also a special case of a De Morgan algebra and a Kleene algebra.

In abstract algebra, a **semiring** is an algebraic structure similar to a ring, but without the requirement that each element must have an additive inverse.

**Discrete optimization** is a branch of optimization in applied mathematics and computer science.

A **lattice** is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every two elements have a unique supremum and a unique infimum. An example is given by the natural numbers, partially ordered by divisibility, for which the unique supremum is the least common multiple and the unique infimum is the greatest common divisor.

A **Boolean function** is a function in mathematics and logic whose arguments, as well as the function itself, assume values from a two-element set. As a result, it is sometimes referred to as a "switching function".

**Marshall Harvey Stone** was an American mathematician who contributed to real analysis, functional analysis, topology and the study of Boolean algebras.

**Ben Joseph Green** FRS is a British mathematician, specialising in combinatorics and number theory. He is the Waynflete Professor of Pure Mathematics at the University of Oxford.

**Jack R. Edmonds** is an American-born and educated computer scientist and mathematician who lived and worked in Canada for much of his life. He has made fundamental contributions to the fields of combinatorial optimization, polyhedral combinatorics, discrete mathematics and the theory of computing. He was the recipient of the 1985 John von Neumann Theory Prize.

A **logical matrix**, **binary matrix**, **relation matrix**, **Boolean matrix**, or **(0,1) matrix** is a matrix with entries from the Boolean domain **B** = {0, 1}. Such a matrix can be used to represent a binary relation between a pair of finite sets.

**Oded Schramm** was an Israeli-American mathematician known for the invention of the Schramm–Loewner evolution (SLE) and for working at the intersection of conformal field theory and probability theory.

In mathematical optimization, **ordinal optimization** is the maximization of functions taking values in a partially ordered set ("poset"). Ordinal optimization has applications in the theory of queuing networks.

**Martin Charles Golumbic** is a mathematician and computer scientist, best known for his work in algorithmic graph theory and in artificial intelligence. He is the founding editor-in-chief of the journal *Annals of Mathematics and Artificial Intelligence*, published by Springer.

In mathematics and optimization, a **pseudo-Boolean function** is a function of the form

**Egon Balas** was an applied mathematician and a professor of industrial administration and applied mathematics at Carnegie Mellon University. He was the Thomas Lord Professor of Operations Research at Carnegie Mellon's Tepper School of Business and did fundamental work in developing integer and disjunctive programming.

**Endre Boros** is a Hungarian-American mathematician, a Distinguished Professor at Rutgers University in New Brunswick, New Jersey, and the Director of the Center for Operations Research (RUTCOR). He is the author of 15 book chapters and edited volumes, and 165 research papers. He is Associate Editor of the Annals of Mathematics and Artificial Intelligence, and Editor-in-Chief of both the Annals of Operations Research and Discrete Applied Mathematics.

* Discrete Applied Mathematics* is a peer-reviewed scientific journal covering algorithmic and applied areas of discrete mathematics. It is published by Elsevier and the editor-in-chief is Endre Boros. The journal was split off from another Elsevier journal,

In mathematics, a **read-once function** is a special type of Boolean function that can be described by a Boolean expression in which each variable appears only once.

In graph theory, a **universal vertex** is a vertex of an undirected graph that is adjacent to all other vertices of the graph. It may also be called a **dominating vertex**, as it forms a one-element dominating set in the graph.

**Boolean differential calculus** (**BDC**) is a subject field of Boolean algebra discussing changes of Boolean variables and Boolean functions.

- 1 2 3 4 5 6 7 O'Connor, John J.; Robertson, Edmund F., "Peter L. Hammer",
*MacTutor History of Mathematics archive*, University of St Andrews . - ↑ Peter Ladislaw Hammer (Dec. 23, 1936 – Dec. 27, 2006), RUTCOR, retrieved 2013-11-17.
- ↑ Boros, Endre; Crama, Yves; de Werra, Dominique; Hansen, Pierre; Maffray, Frédéric (2011), "The mathematics of Peter L. Hammer (1936–2006): graphs, optimization, and Boolean models" (PDF),
*Annals of Operations Research*,**188**: 1–18, doi:10.1007/s10479-011-0913-4, MR 2823186 . - ↑ Boros, E.; Crama, Y.; Simeone, B. (2007), "Peter L. Hammer (1936–2006)" (PDF),
*4OR*,**5**(1): 1–4, doi:10.1007/s10288-007-0034-8 - ↑ Egon Balas, In Memoriam: Peter Hammer (1936–2006), ORMS, 2007-02-13, retrieved 2014-01-09.
- ↑ Peter L. Hammer at the Mathematics Genealogy Project

- "List of Publications" (PDF).

This page is based on this Wikipedia article

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.