A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions

DOI10.1145/1577190.1577204zbMath1356.15002OpenAlexW2045252454MaRDI QIDQ2959018

Zhengfeng Yang, Erich L. Kaltofen, Lihong Zhi

Publication date: 3 February 2017

Published in: Proceedings of the 2009 conference on Symbolic numeric computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1577190.1577204

zbMATH Keywords

semidefinite programminghybrid methodsum-of-squaresmonotone column permanent conjecture

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Determinants, permanents, traces, other special matrix functions (15A15) Zero sets of holomorphic functions of several complex variables (32A60)

Related Items (4)

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients ⋮ Proof of the Monotone Column Permanent Conjecture ⋮ On exact Reznick, Hilbert-Artin and Putinar's representations ⋮ Smaller SDP for SOS decomposition

Uses Software

• Maple

This page was built for publication: A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions