Related papers: Permanents through probability distributions
We give new lower and upper bounds on the permanent of a doubly stochastic matrix. Combined with previous work, this improves on the deterministic approximation factor for the permanent. We also give a combinatorial application of the lower…
In this note we settle two open problems in the theory of permanents by using recent results from other areas of mathematics. Bapat conjectured that certain quotients of permanents, which generalize symmetric function means, are concave. We…
We present a method of representing an element of $\mathbb{F}_3^n$ as an element of $\mathbb{F}_n^2 \times \mathbb{F}_n^2$ which in practice will be a pair of unsigned integers. We show how to do addition, subtraction and pointwise…
We generalize entanglement detection with covariance matrices for an arbitrary set of observables. A generalized uncertainty relation is constructed using the covariance and commutation matrices, then a criterion is established by…
Let $M$ be a random matrix in the orthogonal group $\O_n$, distributed according to Haar measure, and let $A$ be a fixed $n\times n$ matrix over $\R$ such that $\tr(AA^t)=n$. Then the total variation distance of the random variable…
We initiate a study of determinantal representations with symmetry. We show that Grenet's determinantal representation for the permanent is optimal among determinantal representations respecting left multiplication by permutation and…
We consider products of independent random matrices taken from the induced Ginibre ensemble with complex or quaternion elements. The joint densities for the complex eigenvalues of the product matrix can be written down exactly for a product…
We give a probabilistic introduction to determinantal and permanental point processes. Determinantal processes arise in physics (fermions, eigenvalues of random matrices) and in combinatorics (nonintersecting paths, random spanning trees).…
This is a survey of results about permanental processes, real valued positive processes which are a generalization of squares of Gaussian processes. In a certain sense the symmetric positive definite function that determines a Gaussian…
We prove the Wigner-Dyson-Mehta conjecture at fixed energy in the bulk of the spectrum for generalized symmetric and Hermitian Wigner matrices. Previous results concerning the universality of random matrices either require an averaging in…
Continuing the computations of the previous paper,[1], we calculate another approximation to the expectation value of the product of two permanents in the ensemble of 0-1 n x n matrices with like row and column sums equal r uniformly…
The algebraic formulation of Wick's theorem that allows one to present the vacuum or thermal averages of the chronological product of an arbitrary number of field operators as a determinant (permanent) of the matrix is proposed. Each…
We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…
The main purpose of this paper of the paper is an explicite construction of generalized Gaussian process with function $t_b(V)=b^{H(V)}$, where $H(V)=n-h(V)$, $h(V)$ is the number of singletons in a pair-partition $V \in \st{P}_2(2n)$. This…
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…
We study the persistence probabilities of a moving average process of order one with innovations that follow a Laplace distribution. The persistence probabilities can be computed fully explicitly in terms of classical combinatorial…
In this paper, we give some determinantal and permanental representations of Generalized Lucas Polynomials by using various Hessenberg matrices, which are general form of determinantal and permanental representations of ordinary Lucas and…
We design a deterministic polynomial time $c^n$ approximation algorithm for the permanent of positive semidefinite matrices where $c=e^{\gamma+1}\simeq 4.84$. We write a natural convex relaxation and show that its optimum solution gives a…
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…
Let $A\in\mathbb{R}^{n\times n}$ be a random matrix with independent entries, and suppose that the entries are "uniformly anticoncentrated" in the sense that there is a constant $\varepsilon>0$ such that each entry $a_{ij}$ satisfies…