Related papers: Permanent versus determinant, obstructions, and Kr…
We explore some properties of a recent representation of permanental vectors which expresses them as sums of independent vectors with components that are independent gamma random variables.
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…
In this paper we present a combinatorial proof of the Kronecker--Weber Theorem for global fields of positive characteristic. The main tools are the use of Witt vectors and their arithmetic developed by H. L. Schmid. The key result is to…
We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…
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…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
We study the time and space complexity of matrix permanents over rings and semirings.
We show that the problem of deciding membership in the moment polytope associated with a finite-dimensional unitary representation of a compact, connected Lie group is in NP and coNP. This is the first non-trivial result on the…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
In this paper, we give some determinantal and permanental representations of Generalized Fibonacci Polynomials by using various Hessenberg matrices. These results are general form of determinantal and permanental representations of k…
We resolve three interrelated problems on \emph{reduced Kronecker coefficients} $\overline{g}(\alpha,\beta,\gamma)$. First, we disprove the \emph{saturation property} which states that $\overline{g}(N\alpha,N\beta,N\gamma)>0$ implies…
We give a partial review of what is known so far on stability of periodically driven quantum systems versus regularity of the bounded driven force. In particular we emphasize the fact that unbounded degeneracies of the unperturbed…
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…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
A class of determinants is introduced. Different kind of mathematical objects, such as Fibonacci, Lucas, Tchebychev, Hermite, Laguerre, Legendre polynomials, sums and covergents are represented as determinants from this class. A closed…
We present and prove closed form expressions for some families of binomial determinants with signed Kronecker deltas that are located along an arbitrary diagonal in the corresponding matrix. They count cyclically symmetric rhombus tilings…
This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs. NP and related problems through algebraic geometry and representation theory. The basic principle behind this approach is called the flip. In…
Translated into the language of representations of quivers, a challenge in matrix pencil theory is to find sufficient and necessary conditions for a Kronecker representation to be a subfactor of another Kronecker representation in terms of…
The aim of this paper is to study linear preservers of the trace of Kronecker sums and their connection with preservers of determinants of Kronecker products. The partial trace and partial determinant play a fundamental role in…
We develop an obstruction theory for Hirsch extensions of cbba's with twisted coefficients. This leads to a variety of applications, including a structural theorem for minimal cbba's, a construction of relative minimal models with twisted…