Mathematics – Combinatorics
Scientific paper
2000-07-25
Mathematics
Combinatorics
13 pages
Scientific paper
We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $\AA$. The monomial expansion of the symmetrized determinant is obtained from the standard expansion of the commutative determinant by averaging the products of entries of the matrix in all possible orders. We show that for any fixed finite-dimensional associative algebra $\AA$, the symmetrized determinant of an $n\times n$ matrix with the entries in $\AA$ can be computed in polynomial in $n$ time (the degree of the polynomial is linear in the dimension of $\AA$). Then, for every associative algebra $\AA$ endowed with a scalar product and unbiased probability measure, we construct a randomized polynomial time algorithm to estimate the permanent of non-negative matrices. We conjecture that if $\AA=\Mat(d, {\Bbb R})$ is the algebra of $d\times d$ real matrices endowed with the standard scalar product and Gaussian measure, the algorithm approximates the permanent of a non-negative $n \times n$ matrix within $O(\gamma_d^n)$ factor, where $\lim_{d \longrightarrow +\infty} \gamma_d=1$. Finally, we provide some informal arguments why the conjecture might be true.
No associations
LandOfFree
New Permanent Estimators via Non-Commutative Determinants does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with New Permanent Estimators via Non-Commutative Determinants, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Permanent Estimators via Non-Commutative Determinants will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-406787