**Heinrich August Rothe** (1773–1842) was a German mathematician, a professor of mathematics at
Erlangen. He was a student of
Carl Hindenburg and a member of Hindenburg's school of
combinatorics.^{
[1]}^{
[2]}

Rothe was born in 1773 in
Dresden, and in 1793 became a docent at the
University of Leipzig. He became an extraordinary professor at Leipzig in 1796, and in 1804 he moved to Erlangen as a full professor, taking over the chair formerly held by
Karl Christian von Langsdorf. He died in 1842, and his position at Erlangen was in turn taken by Johann Wilhelm Pfaff, the brother of the more famous mathematician
Johann Friedrich Pfaff.^{
[3]}^{
[4]}

The
Rothe–Hagen identity, a
summation formula for
binomial coefficients, appeared in Rothe's 1793 thesis. It is named for him and for the later work of
Johann Georg Hagen.^{
[5]} The same thesis also included a formula for computing the
Taylor series of an
inverse function from the Taylor series for the function itself, related to the
Lagrange inversion theorem.^{
[6]}

In the study of
permutations, Rothe was the first to define the inverse of a permutation, in 1800. He developed a technique for visualizing permutations now known as a
Rothe diagram, a square table that has a dot in each cell (*i*,*j*) for which the permutation maps position *i* to position *j* and a cross in each cell (*i*,*j*) for which there is a dot later in row *i* and another dot later in column *j*. Using Rothe diagrams, he showed that the number of
inversions in a permutation is the same as in its inverse, for the inverse permutation has as its diagram the
transpose of the original diagram, and the inversions of both permutations are marked by the crosses. Rothe used this fact to show that the
determinant of a
matrix is the same as the determinant of the transpose: if one expands a determinant as a
polynomial, each term corresponds to a permutation, and the sign of the term is determined by the
parity of its number of inversions. Since each term of the determinant of the transpose corresponds to a term of the original matrix with the inverse permutation and the same number of inversions, it has the same sign, and so the two determinants are also the same.^{
[7]}

In his 1800 work on permutations, Rothe also was the first to consider permutations that are involutions; that is, they are their own inverse, or equivalently they have symmetric Rothe diagrams. He found the recurrence relation

for counting these permutations, which also counts the number of Young tableaux, and which has as its solution the telephone numbers

Rothe was also the first to formulate the
*q*-binomial theorem, a
*q*-analog of the
binomial theorem, in an 1811 publication.^{
[9]}^{
[10]}

*Formulae De Serierum Reversione Demonstratio Universalis Signis Localibus Combinatorio-Analyticorum Vicariis Exhibita: Dissertatio Academica*, Leipzig, 1793.- "
Ueber Permutationen, in Beziehung auf die Stellen ihrer Elemente. Anwendung der daraus abgeleiteten Satze auf das Eliminationsproblem". In
Hindenburg, Carl, ed.,
*Sammlung Combinatorisch-Analytischer Abhandlungen*, pp. 263–305, Bey G. Fleischer dem jüngern, 1800. *Systematisches Lehrbuch der Arithmetik*, Leipzig, 1811

**^**Bekemeier, Bernd (1987),*Martin Ohm, 1792-1872: Universitäts- und Schulmathematik in der neuhumanistischen Bildungsreform*, Studien zur Wissenschafts-, Sozial- und Bildungsgeschichte der Mathematik (in German), vol. 4, Vandenhoeck & Ruprecht, p. 83, ISBN 9783525403112.**^**Jahnke, Hans Niels (1990),*Mathematik und Bildung in der Humboldtschen Reform*, Studien zur Wissenschafts-, Sozial- und Bildungsgeschichte der Mathematik (in German), vol. 8, Vandenhoeck & Ruprecht, p. 175, ISBN 9783525403150.**^**Gerhardt, Karl Immanuel (1877),*Geschichte der Mathematik in Deutschland*, Geschichte der Wissenschaften in Deutschland: Neuere Zeit (in German), vol. 17, R. Oldenbourg, p. 204.**^**Rowe, David E. (1997), "In search of Steiner's Ghosts : Imaginary elements in the nineteenth-century geometry", in Flament, Dominique (ed.),*Le Nombre : une Hydre à*n*visages, Entre nombres complexes et vecteurs*, Fondation Maison des sciences de l'homme, pp. 193–208.**^**Gould, H. W. (1956), "Some generalizations of Vandermonde's convolution",*The American Mathematical Monthly*,**63**(2): 84–91, doi: 10.1080/00029890.1956.11988763, JSTOR 2306429, MR 0075170.**^**Calinger, Ronald (1996),*Vita Mathematica: Historical Research and Integration With Teaching*, Mathematical Association of America Notes, vol. 40, Cambridge University Press, pp. 146–147, ISBN 9780883850978.**^**Knuth, Donald E. (1973),*The Art of Computer Programming, Volume 3: Sorting and Searching*, Reading, Mass.: Addison-Wesley, pp. 14–15, MR 0445948.**^**Knuth (1973), pp. 48 & 65.**^**Bressoud, D. M. (1981), "Some identities for terminating*q*-series",*Mathematical Proceedings of the Cambridge Philosophical Society*,**89**(2): 211–223, Bibcode: 1981MPCPS..89..211B, doi: 10.1017/S0305004100058114, MR 0600238, S2CID 122524160.**^**Benaoum, H. B. (1998), "*h*-analogue of Newton's binomial formula",*Journal of Physics A: Mathematical and General*,**31**(46): L751–L754, arXiv: math-ph/9812011, Bibcode: 1998JPhA...31L.751B, doi: 10.1088/0305-4470/31/46/001, S2CID 119697596.