We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants and pfaffians due to Kuperberg, as well as a determinant of Tsuchiya. The level of generality of our statements render their proofs easy and routine, by using Dodgson condensation and/or Krattenthaler’s factor exhaustion method. All our matrices will be assumed to be embedded inside an infinite matrix. The first theorem adds parameters to the determinant formulas found in Kuperberg [Ku, Theorem 15], as well as older determinants, mentioned there, due to Cauchy, Stembridge, Laksov–Lascoux–Thorup, and Tsuchiya [T]. This way, the formulation is suited to the method of [AZ]. Our proofs are much more succinct and automatable, since their generality e...
Dodgson\u27s condensation method has become a powerful tool in the automation of determinant evaluat...
In this paper, we study the complexity of computing the determinant of a matrix over a non-commutati...
We consider the problem of computing the determinant of a matrix of polynomials. Four algorithms are...
We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants a...
CombinatoricsWe generalize (and hence trivialize and routinize) numerous explicit evaluations of det...
AbstractUsing a recurrence derived from Dodgson's Condensation Method, we provide numerous explicit ...
We present several generalizations of Cauchy’s determinant det (1/(xi + yj)) and Schur’s Pfaffian Pf...
AbstractA new evaluation of deti+j+x2i−j0⩽1,j⩽n−1 is provided. The method of proof is inspired by th...
In 1866, Charles Ludwidge Dodgson published a paper concerning a method for evaluating determinants ...
Olga Taussky-Todd suggested the problem of determining the possible values of integer circulant dete...
AbstractAn alternative to Plemelj-Smithies formulas for the p-regularized quantities d(p)(K) and D(p...
Abstract. The pseudo-determinant Det(A) of a square matrix A is defined as the product of the nonzer...
AbstractDeterminants declined in prestige from the mid-nineteenth century onwards and are now best k...
A variation of Zeilberger’s holonomic ansatz for symbolic de-terminant evaluations is proposed which...
4siLet d(N) (resp. p(N)) be the number of summands in the determinant (resp. permanent) of an N x N ...
Dodgson\u27s condensation method has become a powerful tool in the automation of determinant evaluat...
In this paper, we study the complexity of computing the determinant of a matrix over a non-commutati...
We consider the problem of computing the determinant of a matrix of polynomials. Four algorithms are...
We generalize (and hence trivialize and routinize) numerous explicit evaluations of determinants a...
CombinatoricsWe generalize (and hence trivialize and routinize) numerous explicit evaluations of det...
AbstractUsing a recurrence derived from Dodgson's Condensation Method, we provide numerous explicit ...
We present several generalizations of Cauchy’s determinant det (1/(xi + yj)) and Schur’s Pfaffian Pf...
AbstractA new evaluation of deti+j+x2i−j0⩽1,j⩽n−1 is provided. The method of proof is inspired by th...
In 1866, Charles Ludwidge Dodgson published a paper concerning a method for evaluating determinants ...
Olga Taussky-Todd suggested the problem of determining the possible values of integer circulant dete...
AbstractAn alternative to Plemelj-Smithies formulas for the p-regularized quantities d(p)(K) and D(p...
Abstract. The pseudo-determinant Det(A) of a square matrix A is defined as the product of the nonzer...
AbstractDeterminants declined in prestige from the mid-nineteenth century onwards and are now best k...
A variation of Zeilberger’s holonomic ansatz for symbolic de-terminant evaluations is proposed which...
4siLet d(N) (resp. p(N)) be the number of summands in the determinant (resp. permanent) of an N x N ...
Dodgson\u27s condensation method has become a powerful tool in the automation of determinant evaluat...
In this paper, we study the complexity of computing the determinant of a matrix over a non-commutati...
We consider the problem of computing the determinant of a matrix of polynomials. Four algorithms are...