相关论文: Some facts on Permanents in Finite Characteristics
A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…
Motivated by the recent developments on the complexity of non-com\-mu\-ta\-tive determinant and permanent [Chien et al.\ STOC 2011, Bl\"aser ICALP 2013, Gentry CCC 2014] we attempt at obtaining a tight characterization of hard instances of…
This paper solves the following problem about Hermitian matrices related to the theory of $2$-structures:\emph{ }Let $n$ be a positive integer and $k$ be an integer with $k\in \{3,\ldots,n-3\}$. Characterize the Hermitian matrices $A$ such…
There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial. Then, more generally, we also…
We present a deterministic algorithm, which, for any given 0< epsilon < 1 and an nxn real or complex matrix A=(a_{ij}) such that | a_{ij}-1| < 0.19 for all i, j computes the permanent of A within relative error epsilon in n^{O(ln n -ln…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
Let $\Lambda_n^k$ denote the class of $(0,1)$ square matrices containing in each row and in each column exactly $k$ 1's. The minimal value of $k,$ for which the behavior of the permanent in $\Lambda_n^k$ is not quite studied, is $k=3.$ We…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
This paper is motivated by basic complexity and probability questions about permanents of random matrices over finite fields, and in particular, about properties separating the permanent and the determinant. Fix $q = p^m$ some power of an…
We study the time and space complexity of matrix permanents over rings and semirings.
Computing the distribution of permanents of random matrices has been an outstanding open problem for several decades. In quantum computing, "anti-concentration" of this distribution is an unproven input for the proof of hardness of the task…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
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…
The rank of an n x n matrix A is equal to the size of its largest square submatrix with a nonzero determinant, and it can be computed in O(n^2.37) time. Analogously, the size of the largest square submatrix with nonzero permanent is defined…
Properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph have been studied systematically recently. Motivated by the complexity of these properties, we show that there are such properties for which…
Calculating the permanent of a (0,1) matrix is a #P-complete problem but there are some classes of structured matrices for which the permanent is calculable in polynomial time. The most well-known example is the fixed-jump (0,1) circulant…
Evaluating the permanent of a matrix is a fundamental computation that emerges in many domains, including traditional fields like computational complexity theory, graph theory, many-body quantum theory and emerging disciplines like machine…