Jeff Dinitz

Jeffrey "Jeff" Dinitz (* 1952 in Brooklyn , New York ) is an American mathematician who studies combinatorics . He is a professor at the University of Vermont .

Dinitz received his PhD in 1980 from Richard M. Wilson at Ohio State University (Lower Bounds For The Number Of Pairwise Orthogonal Symmetric Latin Squares). He is a professor at the University of Vermont, where he headed the math faculty from 1998 to 2004.

Dinitz is known for the Dinitz conjecture in combinatorics, which he mentioned to Paul Erdős in 1979 and which was proved by Fred Galvin in 1994 . The presumption concerns the question of the existence of an extension of the definition of Latin squares . Color an n × n arrangement with an n-tuple with elements from a set of elements so that no symbol is repeated in a row or column. The conjecture claims that this is possible. ${\displaystyle m\geq n}$

Dinitz is editor of the Journal of Combinatorial Designs.

Fonts

• Editor with Charlie Colbourn: CRC Handbook of Combinatorial Designs, Chapman and Hall / CRC 2006
• with Douglas R. Stinson (Editor): Contemporary Design Theory. A collection of surveys. Wiley 1994
  • In it with Stinson: A brief introduction to design theory

Web links

• Homepage

Individual evidence

1. ↑ Jeff Dinitz in the Mathematics Genealogy Project (English)
2. ↑ See Aigner, Ziegler The Book of Evidence , Chapter 33
3. ^ Weisstein Dinitz problem