Related papers: Some algebraic identities for the alpha-permanent

This paper defines the Iris function and provides two formulations of the matrix permanent. The first formulation, valid for arbitrary complex matrices, expresses the permanent of a complex matrix as a contour integral of a second order…

One of the crown jewels of complexity theory is Valiant's 1979 theorem that computing the permanent of an n*n matrix is #P-hard. Here we show that, by using the model of linear-optical quantum computing---and in particular, a universality…

We prove that for any $\lambda > 1$, fixed in advance, the permanent of an $n \times n$ complex matrix, where the absolute value of each diagonal entry is at least $\lambda$ times bigger than the sum of the absolute values of all other…

We introduce symmetric arithmetic circuits, i.e. arithmetic circuits with a natural symmetry restriction. In the context of circuits computing polynomials defined on a matrix of variables, such as the determinant or the permanent, the…

In the stable general linear group over an arbitrary field, we prove that every element with determinant $\pm 1$ is the product of three involutions, and of no less in general. We also obtain several results of the same flavor, with…

We introduce a generalization of immanants of matrices, using partition algebra characters in place of symmetric group characters. We prove that our immanant-like function on square matrices, which we refer to as the recombinant, agrees…

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…

Let $A$ be an $n \times n$ positive definite Hermitian matrix with all eigenvalues between 1 and 2. We represent the permanent of $A$ as the integral of some explicit log-concave function on ${\Bbb R}^{2n}$. Consequently, there is a fully…

This paper considers the properties of Tribonacci numbers on identities, matrices, and determinants. In the first front part, we obtain several symmetric identities of Tribonacci numbers by a matrix-based approach and binomial inversion…

We prove that for writing the 3 by 3 permanent polynomial as a determinant of a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7 matrix is required. Our proof is computer based and uses the enumeration of bipartite…

We present an efficient algorithm for computing the permanent for matrices of size N that can written as a product of L block diagonal matrices with blocks of size at most 2. For fixed L, the time and space resources scale linearly in N,…

Matrix permanents arise naturally in the context of linear optical networks fed with nonclassical states of light. In this letter we tie the computational complexity of a class of multi-dimensional integrals to the permanents of large…

The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…

It was recently shown that the theory of linear stochastic systems can be viewed as a particular case of the theory of linear systems on a certain commutative ring of power series in a countable number of variables. In the present work we…

In this paper, we consider the problem of representing a multivariate polynomial as the determinant of a definite (monic) symmetric/Hermitian linear matrix polynomial (LMP). Such a polynomial is known as determinantal polynomial.…

The principal result is a primary decomposition of ideals generated by the (2x2)-subpermanents of a generic matrix. These permanental ideals almost always have embedded components and their minimal primes are of three distinct heights. Thus…

For arbitrary F-algebra, in which the operation of addition is defined, I explore biring of matrices of mappings. The sum of matrices is determined by the sum in F-algebra, and the product of matrices is determined by the product of…

In this article we provide with combinatorial proofs of some recent identities due to Sury and McLaughlin. We show that, the solution of a general linear recurrence with constant coefficients can be interpreted as a determinant of a matrix.…

We introduce a unified framework for studying persistence phenomena in commutative algebra via filtrations of ideals. For a filtration $\mathcal{F} = \{I_i\}_{i \in \mathbb{N}}$, we define $\mathcal{F}$-persistence and $\mathcal{F}$-strong…

We consider remarkable central elements of the universal enveloping algebra of the general linear algebra which we call quantum immanants. We express them in terms of generators $E_{ij}$ and as differential operators on the space of…