Quasideterminant
In mathematics, the quasideterminant is a replacement for the determinant for matrices with noncommutative entries. Example 2 × 2 quasideterminants are as follows: In general, there are n2 quasideterminants defined for an n × n matrix (one for each position in the matrix), but the presence of the inverted terms above should give the reader pause: they are not always defined, and even when they are defined, they do not reduce to determinants when the entries commute. Rather, where means delete the ith row and jth column from A. The examples above were introduced between 1926 and 1928 by Richardson and Heyting, but they were marginalized at the time because they were not polynomials in the entries of . These examples were rediscovered and given new life in 1991 by Israel Gelfand and Vladimir Retakh. There, they develop quasideterminantal versions of many familiar determinantal properties. For example, if is built from by rescaling its -th row (on the left) by , then . Similarly, if is built from by adding a (left) multiple of the -th row to another row, then . They even develop a quasideterminantal version of Cramer's rule. (Wikipedia).
