Orthogonal array
In mathematics, an orthogonal array is a "table" (array) whose entries come from a fixed finite set of symbols (typically, {1,2,...,n}), arranged in such a way that there is an integer t so that for e
Problems in Latin squares
In mathematics, the theory of Latin squares is an active research area with many open problems. As in other areas of mathematics, such problems are often made public at professional conferences and me
Raj Chandra Bose
Raj Chandra Bose (19 June 1901 – 31 October 1987) was an Indian American mathematician and statistician best known for his work in design theory, finite geometry and the theory of error-correcting cod
Small Latin squares and quasigroups
Latin squares and quasigroups are equivalent mathematical objects, although the former has a combinatorial nature while the latter is more algebraic. The listing below will consider the examples of so
Dinitz conjecture
In combinatorics, the Dinitz theorem (formerly known as Dinitz conjecture) is a statement about the extension of arrays to partial Latin squares, proposed in 1979 by Jeff Dinitz, and proved in 1994 by
Latin hypercube sampling
Latin hypercube sampling (LHS) is a statistical method for generating a near-random sample of parameter values from a multidimensional distribution. The sampling method is often used to construct comp
Quasigroup
In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure resembling a group in the sense that "division" is always possible. Quasigroups differ from groups mainly in that
E. T. Parker
Ernest Tilden Parker (1926–1991) was a professor emeritus of the University of Illinois at Urbana–Champaign. He is notable for his breakthrough work along with R. C. Bose and S. S. Shrikhande in their
Latin rectangle
In combinatorial mathematics, a Latin rectangle is an r × n matrix (where r ≤ n), using n symbols, usually the numbers 1, 2, 3, ..., n or 0, 1, ..., n − 1 as its entries, with no number occurring more
Leonhard Euler
Leonhard Euler (/ˈɔɪlər/ OY-lər, German: [ˈɔʏlɐ]; 15 April 1707 – 18 September 1783) was a Swiss mathematician, physicist, astronomer, geographer, logician and engineer who founded the studies of grap
Mathematics of Sudoku
The mathematics of Sudoku refers to the use of mathematics to study Sudoku puzzles to answer questions such as "How many filled Sudoku grids are there?", "What is the minimal number of clues in a vali
Damm algorithm
In error detection, the Damm algorithm is a check digit algorithm that detects all single-digit errors and all adjacent transposition errors. It was presented by H. Michael Damm in 2004.
Mutually orthogonal Latin squares
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
Futoshiki
Futoshiki (不等式, futōshiki), or More or Less, is a logic puzzle game from Japan. Its name means "inequality". It is also spelled hutosiki (using Kunrei-shiki romanization). Futoshiki was developed by T
Sharadchandra Shankar Shrikhande
Sharadchandra Shankar Shrikhande (19 October 1917 – 21 April 2020) was an Indian mathematician with notable achievements in combinatorial mathematics. He was notable for his breakthrough work along wi
Sudoku
Sudoku (/suːˈdoʊkuː, -ˈdɒk-, sə-/; Japanese: 数独, romanized: sūdoku, lit. 'digit-single'; originally called Number Place) is a logic-based, combinatorial number-placement puzzle. In classic Sudoku, the
Circulant matrix
In linear algebra, a circulant matrix is a square matrix in which all row vectors are composed of the same elements and each row vector is rotated one element to the right relative to the preceding ro
Latin square
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