13,798 research outputs found

    VPSPACE and a transfer theorem over the complex field

    Get PDF
    We extend the transfer theorem of [KP2007] to the complex field. That is, we investigate the links between the class VPSPACE of families of polynomials and the Blum-Shub-Smale model of computation over C. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial space. Our main result is that if (uniform, constant-free) VPSPACE families can be evaluated efficiently then the class PAR of decision problems that can be solved in parallel polynomial time over the complex field collapses to P. As a result, one must first be able to show that there are VPSPACE families which are hard to evaluate in order to separate P from NP over C, or even from PAR.Comment: 14 page

    VPSPACE and a Transfer Theorem over the Reals

    Get PDF
    We introduce a new class VPSPACE of families of polynomials. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial space. Our main theorem is that if (uniform, constant-free) VPSPACE families can be evaluated efficiently then the class PAR of decision problems that can be solved in parallel polynomial time over the real numbers collapses to P. As a result, one must first be able to show that there are VPSPACE families which are hard to evaluate in order to separate over the reals P from NP, or even from PAR.Comment: Full version of the paper (appendices of the first version are now included in the text

    Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids

    Get PDF
    The chromatic polynomial P_G(q) of a loopless graph G is known to be nonzero (with explicitly known sign) on the intervals (-\infty,0), (0,1) and (1,32/27]. Analogous theorems hold for the flow polynomial of bridgeless graphs and for the characteristic polynomial of loopless matroids. Here we exhibit all these results as special cases of more general theorems on real zero-free regions of the multivariate Tutte polynomial Z_G(q,v). The proofs are quite simple, and employ deletion-contraction together with parallel and series reduction. In particular, they shed light on the origin of the curious number 32/27.Comment: LaTeX2e, 49 pages, includes 5 Postscript figure

    Polynomials that Sign Represent Parity and Descartes' Rule of Signs

    Full text link
    A real polynomial P(X1,...,Xn)P(X_1,..., X_n) sign represents f:Anβ†’{0,1}f: A^n \to \{0,1\} if for every (a1,...,an)∈An(a_1, ..., a_n) \in A^n, the sign of P(a1,...,an)P(a_1,...,a_n) equals (βˆ’1)f(a1,...,an)(-1)^{f(a_1,...,a_n)}. Such sign representations are well-studied in computer science and have applications to computational complexity and computational learning theory. In this work, we present a systematic study of tradeoffs between degree and sparsity of sign representations through the lens of the parity function. We attempt to prove bounds that hold for any choice of set AA. We show that sign representing parity over {0,...,mβˆ’1}n\{0,...,m-1\}^n with the degree in each variable at most mβˆ’1m-1 requires sparsity at least mnm^n. We show that a tradeoff exists between sparsity and degree, by exhibiting a sign representation that has higher degree but lower sparsity. We show a lower bound of n(mβˆ’2)+1n(m -2) + 1 on the sparsity of polynomials of any degree representing parity over {0,...,mβˆ’1}n\{0,..., m-1\}^n. We prove exact bounds on the sparsity of such polynomials for any two element subset AA. The main tool used is Descartes' Rule of Signs, a classical result in algebra, relating the sparsity of a polynomial to its number of real roots. As an application, we use bounds on sparsity to derive circuit lower bounds for depth-two AND-OR-NOT circuits with a Threshold Gate at the top. We use this to give a simple proof that such circuits need size 1.5n1.5^n to compute parity, which improves the previous bound of 4/3n/2{4/3}^{n/2} due to Goldmann (1997). We show a tight lower bound of 2n2^n for the inner product function over {0,1}nΓ—{0,1}n\{0,1\}^n \times \{0, 1\}^n.Comment: To appear in Computational Complexit

    Asymptotics of symmetric polynomials with applications to statistical mechanics and representation theory

    Full text link
    We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems concerning characters of infinite-dimensional unitary group and their qq-deformations. We study the behavior of uniformly random lozenge tilings of large polygonal domains and find the GUE-eigenvalues distribution in the limit. We also investigate similar behavior for alternating sign matrices (equivalently, six-vertex model with domain wall boundary conditions). Finally, we compute the asymptotic expansion of certain observables in O(n=1)O(n=1) dense loop model.Comment: Published at http://dx.doi.org/10.1214/14-AOP955 in the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org
    • …
    corecore