Jeff Dinitz | |
---|---|
Born | 1952 Brooklyn, New York, US |
Alma mater | Carnegie Mellon University, Ohio State University |
Known for | Dinitz conjecture |
Children | 3 |
Scientific career | |
Fields | Mathematics, Combinatorics |
Institutions | University of Vermont |
Doctoral advisor | R. M. Wilson |
Jeffrey Howard Dinitz (born 1952) is an American mathematician who taught combinatorics at the University of Vermont. He is best known for proposing the Dinitz conjecture, which became a major theorem.
Dinitz was born in 1952 in Brooklyn, New York City, New York.
Dinitz is also well known for scheduling the first season of the now-defunct XFL football league. He and a colleague from the Czech Republic, Dalibor Froncek, offered the then-brand-new XFL league their expertise to draft complicated schedules.
The XFL administration quickly agreed, which "surprised" Dinitz greatly. After some time on the computer, Dinitz and Froncek sent the XFL a draft schedule, and the new league gratefully accepted. Although the XFL folded after only one season, Dinitz was happy that "(he and Froncek) got to go to the championship game in Los Angeles". [1]
Dinitz is married to Susan Dinitz and has three children.
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science.
In combinatorics and in experimental design, a Latin square is an n × n array filled with n different symbols, each occurring exactly once in each row and exactly once in each column. An example of a 3×3 Latin square is
In combinatorics, two Latin squares of the same size (order) are said to be orthogonal if when superimposed the ordered paired entries in the positions are all distinct. A set of Latin squares, all of the same order, all pairs of which are orthogonal is called a set of mutually orthogonal Latin squares. This concept of orthogonality in combinatorics is strongly related to the concept of blocking in statistics, which ensures that independent variables are truly independent with no hidden confounding correlations. "Orthogonal" is thus synonymous with "independent" in that knowing one variable's value gives no further information about another variable's likely value.
In combinatorial mathematics, a block design is an incidence structure consisting of a set together with a family of subsets known as blocks, chosen such that frequency of the elements satisfies certain conditions making the collection of blocks exhibit symmetry (balance). Block designs have applications in many areas, including experimental design, finite geometry, physical chemistry, software testing, cryptography, and algebraic geometry.
In combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure. From a collection of points and lines in an incidence geometry or a projective configuration, we form a graph with one vertex per point, one vertex per line, and an edge for every incidence between a point and a line. They are named for Friedrich Wilhelm Levi, who wrote about them in 1942.
In mathematics, a two-graph is a set of unordered triples chosen from a finite vertex setX, such that every unordered quadruple from X contains an even number of triples of the two-graph. A regular two-graph has the property that every pair of vertices lies in the same number of triples of the two-graph. Two-graphs have been studied because of their connection with equiangular lines and, for regular two-graphs, strongly regular graphs, and also finite groups because many regular two-graphs have interesting automorphism groups.
Combinatorial design theory is the part of combinatorial mathematics that deals with the existence, construction and properties of systems of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry. These concepts are not made precise so that a wide range of objects can be thought of as being under the same umbrella. At times this might involve the numerical sizes of set intersections as in block designs, while at other times it could involve the spatial arrangement of entries in an array as in sudoku grids.
In combinatorics, a difference set is a subset of size of a group of order such that every non-identity element of can be expressed as a product of elements of in exactly ways. A difference set is said to be cyclic, abelian, non-abelian, etc., if the group has the corresponding property. A difference set with is sometimes called planar or simple. If is an abelian group written in additive notation, the defining condition is that every non-zero element of can be written as a difference of elements of in exactly ways. The term "difference set" arises in this way.
In mathematics, a conference matrix (also called a C-matrix) is a square matrix C with 0 on the diagonal and +1 and −1 off the diagonal, such that CTC is a multiple of the identity matrix I. Thus, if the matrix has order n, CTC = (n−1)I. Some authors use a more general definition, which requires there to be a single 0 in each row and column but not necessarily on the diagonal.
Kirkman's schoolgirl problem is a problem in combinatorics proposed by Thomas Penyngton Kirkman in 1850 as Query VI in The Lady's and Gentleman's Diary (pg.48). The problem states:
Fifteen young ladies in a school walk out three abreast for seven days in succession: it is required to arrange them daily so that no two shall walk twice abreast.
In mathematics a regular Hadamard matrix is a Hadamard matrix whose row and column sums are all equal. While the order of a Hadamard matrix must be 1, 2, or a multiple of 4, regular Hadamard matrices carry the further restriction that the order must be a square number. The excess, denoted E(H ), of a Hadamard matrix H of order n is defined to be the sum of the entries of H. The excess satisfies the bound |E(H )| ≤ n3/2. A Hadamard matrix attains this bound if and only if it is regular.
In mathematics, the Turán number T(n,k,r) for r-uniform hypergraphs of order n is the smallest number of r-edges such that every induced subgraph on k vertices contains an edge. This number was determined for r = 2 by Turán (1941), and the problem for general r was introduced in Turán (1961). The paper (Sidorenko 1995) gives a survey of Turán numbers.
Herbert John Ryser was a professor of mathematics, widely regarded as one of the major figures in combinatorics in the 20th century. He is the namesake of the Bruck–Ryser–Chowla theorem, Ryser's formula for the computation of the permanent of a matrix, and Ryser's conjecture.
Ernest Tilden Parker (1926–1991) was a professor emeritus of the University of Illinois Urbana-Champaign. He is notable for his breakthrough work along with R. C. Bose and S. S. Shrikhande in their disproof of the famous conjecture made by Leonhard Euler dated 1782 that there do not exist two mutually orthogonal latin squares of order for every . He was at that time employed in the UNIVAC division of Remington Rand, but he subsequently joined the mathematics faculty at t University of Illinois. In 1968, he and a Ph.D. student, K. B. Reid, disproved a conjecture on tournaments by Paul Erdős and Leo Moser.
In combinatorial mathematics, a Latin rectangle is an r × n matrix, using n symbols, usually the numbers 1, 2, 3, ..., n or 0, 1, ..., n − 1 as its entries, with no number occurring more than once in any row or column.
Charles Joseph Colbourn is a Canadian computer scientist and mathematician, whose research concerns graph algorithms, combinatorial designs, and their applications. From 1996 to 2001 he was the Dorothean Professor of Computer Science at the University of Vermont; since then he has been a professor of Computer Science and Engineering at Arizona State University.
In graph-theoretic mathematics, a biregular graph or semiregular bipartite graph is a bipartite graph for which every two vertices on the same side of the given bipartition have the same degree as each other. If the degree of the vertices in is and the degree of the vertices in is , then the graph is said to be -biregular.
Ian Murray Wanless is an Australian mathematician. He is a professor in the School of Mathematics at Monash University in Melbourne, Australia. His research area is combinatorics, principally Latin squares, graph theory and matrix permanents.
Choi Seok-jeong was a Korean politician and mathematician in the Joseon period of Korea.
Mirka Miller was a Czech-Australian mathematician and computer scientist interested in graph theory and data security. She was a professor of electrical engineering and computer science at the University of Newcastle.