Related papers: On Goulden-Jackson's determinantal expression for …
We prove a determinantal formula for quantities related to the problem of enumeration of (semi-) meanders, namely the topologically inequivalent planar configurations of non-self-intersecting loops crossing a given (half-) line through a…
We give a new combinatorial explanation for well-known relations between determinants and traces of matrix powers. Such relations can be used to obtain polynomial-time and poly-logarithmic space algorithms for the determinant. Our new…
see the old abstract and the comments here.
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 introduce a new operator $\Gamma$ on symmetric functions, which enables us to obtain a creation formula for Macdonald polynomials. This formula provides a connection between the theory of Macdonald operators initiated by Bergeron,…
We show that certain integral positive definite symmetric tridiagonal matrices of determinant $n$ are in one to one correspondence with elements of $(\mathbb Z/n\mathbb Z)^*$. We study some properties of this correspondence. In a somewhat…
We make progress towards characterizing the algebraic matroid of the determinantal variety defined by the minors of fixed size of a matrix of variables. Our main result is a novel family of base sets of the matroid, which characterizes the…
For a useful class of functions (containing functions whose one finite component is essentially a matrix coefficient of a supercuspidal representation), we establish three results about the unipotent contribution of the Guo-Jacquet relative…
We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding an elementary proof. Our result is…
We derive analytic expressions for infinite products of random 2x2 matrices. The determinant of the target matrix is log-normally distributed, whereas the remainder is a surprisingly complicated function of a parameter characterizing the…
We study the structure of ideals generated by some classes of 2 \times 2 permanents of hypermatrices. This generalizes [9] on 2 x 2 permanental ideal of generic matrices. We compare the obtained structure to that of the corresponding…
Let $k$ be a finite field of characteristic $p$. In the 1960s, Kondo attached non-abelian Gauss sums to irreducible $\mathbb{C}$-representations of $\mathrm{GL}_n(k)$, and computed them in terms of Green parameters. On the other hand, the…
The evaluation of a matrix exponential function is a classic problem of computational linear algebra. Many different methods have been employed for its numerical evaluation [Moler C and van Loan C 1978 SIAM Review 20 4], none of which…
In the space of square matrices, we characterize row-generated subspaces, on which the determinant is an irreducible polynomial. As a corollary, we characterize square systems of polynomial equations with indeterminate coefficients, whose…
The explicit formula for the elements of the successive intermediate matrices of the Gauss-Jordan elimination procedure for the solution of systems of linear equations is applied to error analysis. Stability conditions in terms of relative…
In this (mostly expository) paper I want to share some observations prompted by a class of matrices whose determinants are Catalan numbers. Considering different methods of proof we obtain some generalizations and q-analogues and…
We compute the canonical trace of generic determinantal rings and provide a sufficient condition for the trace to specialize. As an application we determine the canonical trace $\mbox{tr}(\omega_R)$ of a Cohen-Macaulay ring $R$ of…
In this paper we consider pentadiagonal $(n+1)\times(n+1)$ matrices with two subdiagonals and two superdiagonals at distances $k$ and $2k$ from the main diagonal where $1\le k<2k\le n$. We give an explicit formula for their determinants and…
We describe the variety of fixed points of a unipotent operator acting on the space of matrices. We compute the determinant and the rank of a generic (symmetric, or anti-symmetric) matrix in the fixed variety, yielding information about the…
In this paper, we study the complexity of computing the determinant of a matrix over a non-commutative algebra. In particular, we ask the question, "over which algebras, is the determinant easier to compute than the permanent?" Towards…