相关论文: Determinant and Permanent of Hessenberg Matrix and…
In this paper we provide an identity between determinant and generalized matrix function. Also, a criterion of positive semi-definite matrices affirming the permanent dominant conjecture is given. As a consequence, infinitely many infinite…
We develop an abstract look at linear optical networks from the viewpoint of combinatorics and permanents. In particular we show that calculation of matrix elements of unitarily transformed photonic multi-mode states is intimately linked to…
The determinant of a lower Hessenberg matrix (Hessenbergian) is expressed as a sum of signed elementary products indexed by initial segments of nonnegative integers. A closed form alternative to the recurrence expression of Hessenbergians…
A generalized matrix function is a generalization of determinant and permanent function. In this paper, we introduced the formula for the value of a generalized matrix function of a linear sum of permutation matrices. We show that a linear…
We define the convolved h(x)-Fibonacci polynomials as an extension of the classical convolved Fibonacci numbers. Then we give some combinatorial formulas involving the h(x)-Fibonacci and h(x)-Lucas polynomials. Moreover we obtain the…
The permanent of a square matrix is defined in a way similar to the determinant, but without using signs. The exact computation of the permanent is hard, but there are Monte-Carlo algorithms that can estimate general permanents. Given a…
We obtain large n asymptotics for products of powers of the absolute values of the characteristic polynomials in the Gaussian Unitary Ensemble of n\times n matrices. Our results can also be interpreted as asymptotics of the determinant of a…
We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
We prove an identity relating the permanent of a rank $2$ matrix and the determinants of its Hadamard powers. When viewed in the right way, the resulting formula looks strikingly similar to an identity of Carlitz and Levine, suggesting the…
The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…
Quantum determinants and Pfaffians or permanents and Hafnians are introduced on the two parameter quantum general linear group. Fundamental identities among quantum Pf, Hf, and det are proved in the general setting. We show that there are…
We characterize ratios of permanents of (generalized) submatrices which are bounded on the set of all totally positive matrices. This provides a permanental analog of results of Fallat, Gekhtman, and Johnson [{\em Adv.\ Appl.\ Math.} {\bf…
In this paper, firstly, by a determinant of deformed Pascal's triangle, namely the normalized Hessenberg matrix determinant, to count Dyck paths, we give another combinatorial proof of the theorems which are of Catalan numbers determinant…
Let Det_n denote the closure of the GL_{n^2}(C)-orbit of the determinant polynomial det_n with respect to linear substitution. The highest weights (partitions) of irreducible GL_{n^2}(C)-representations occurring in the coordinate ring of…
Starting with some determinants of binomial coefficients which are related to Fibonacci and Lucas polynomials we study similar determinants for some generalizations of these polynomials and their q-analogues.
We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…
We investigate the generalized moment membership problem for matrices, a formulation equivalent to Skolem's problem for linear recurrence sequences. We show decidability for orthogonal, unitary, and real eigenvalue matrices, and…
We establish various certifying determinantal representation results for a polynomial that contains as a factor a prescribed multivariable polynomials that is strictly stable on a tube domain. The proofs use a Cayley transform in…
We report on a computational and experimental study of permanents. On the computational side, we use the GPU to greaatly accelerate the computation of permanents over $\mathbb{C},$ $\mathbb{R},$ $\mathbb{F}_p$ and $\mathbb{Q}.$ First, for…