Related papers: Zeilberger's Holonomic Ansatz for Pfaffians
We prove determinantal-Pfaffian formulae that simultaneously generalise the Pfaffian minor summation formula of Ishikawa and Wakayama and Byun's recent minor summation formula. These formulae are based on factorisation formulae for the…
We present a symbolic algorithm for treating perturbative expansions of Hamiltonians with general two-body interactions. The method, formally equivalent to determinant Monte Carlo methods, merges well-known analytics with the recently…
We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
In this article, we continue the development of the Riemann-Hilbert formalism for studying the asymptotics of Toeplitz+Hankel determinants with non-identical symbols, which we initiated in \cite{GI}. In \cite{GI}, we showed that the…
This paper treats two topics: matrices with sign patterns and Jacobians of certain mappings. The main topic is counting the number of plus and minus coefficients in the determinant expansion of sign patterns and of these Jacobians. The…
In this paper, in continuation of our work, on the determinants of cubic -matrix of order 2 and order 3, we have analyzed the possibilities of developing the concept of determinant of cubic-matrix with three indexes, studying the…
In the past decades, determinants and Pfaffians were found for eigenvalue correlations of various random matrix ensembles. These structures simplify the average over a large number of ratios of characteristic polynomials to integrations…
We investigate the simplest class of hyperdeterminants defined by Cayley in the case of Hankel hypermatrices (tensors of the form $A_{i_1i_2... i_k}=f(i_1+i_2+...+i_k)$). It is found that many classical properties of Hankel determinants can…
Determinantal polynomials play a crucial role in semidefinite programming problems. Helton-Vinnikov proved that real zero (RZ) bivariate polynomials are determinantal. However, it leads to a challenging problem to compute such a…
In this article, we study and settle several structural questions concerning the exact solvability of the Olshanetsky-Perelomov quantum Hamiltonians corresponding to an arbitrary root system. We show that these operators can be written as…
The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…
We extend Zeilberger's approach to special function identities to cases that are not holonomic. The method of creative telescoping is thus applied to definite sums or integrals involving Stirling or Bernoulli numbers, incomplete Gamma…
We extend the (continuous) multivariate Almkvist-Zeilberger algorithm in order to apply it for instance to special Feynman integrals emerging in renormalizable Quantum field Theories. We will consider multidimensional integrals over…
We develop a unified method to study spectral determinants for several different manifolds, including spheres and hemispheres, and projective spaces. This is a direct consequence of an approach based on deriving recursion relations for the…
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…
We characterize Fredholm determinants of a class of Hankel composition operators via matrix-valued Riemann-Hilbert problems, for additive and multiplicative compositions. The scalar-valued kernels of the underlying integral operators are…
We adapt the Faddeev-LeVerrier algorithm for the computation of characteristic polynomials to the computation of the Pfaffian of a skew-symmetric matrix. This yields a very simple, easy to implement and parallelize algorithm of…
A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…
In this article algorithmic methods are presented that have essentially been introduced into computer algebra systems like Mathematica within the last decade. The main ideas are due to Stanley and Zeilberger. Some of them had already been…