Complexity, combinatorial positivity, and Newton polytopes

10/24/2018
by   Anshul Adve, et al.
0

The Nonvanishing Problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby, in amenable cases, Nonvanishing is in the complexity class NP∩ coNP of problems with "good characterizations". This suggests a new algebraic combinatorics viewpoint on complexity theory. This paper focuses on the case of Schubert polynomials. These form a basis of all polynomials and appear in the study of cohomology rings of flag manifolds. We give a tableau criterion for Nonvanishing, from which we deduce the first polynomial time algorithm. These results are obtained from new characterizations of the Schubitope, a generalization of the permutahedron defined for any subset of the n x n grid.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/07/2022

Generalized Companion Subresultants of Several Univariate Polynomials in Newton Basis

In this paper, the concept of companion subresultant for polynomials in ...
research
11/09/2020

Graph Homomorphism Polynomials: Algorithms and Complexity

We study homomorphism polynomials, which are polynomials that enumerate ...
research
06/19/2018

Nivat's Conjecture and Pattern Complexity in Algebraic Subshifts

We study Nivat's conjecture on algebraic subshifts and prove that in som...
research
03/15/2021

Combinatorial Resultants in the Algebraic Rigidity Matroid

Motivated by a rigidity-theoretic perspective on the Localization Proble...
research
04/07/2020

Finding polynomial roots by dynamical systems – a case study

We investigate two well known dynamical systems that are designed to fin...
research
04/09/2020

The Weierstrass root finder is not generally convergent

Finding roots of univariate polynomials is one of the fundamental tasks ...
research
11/07/2020

On the Complexity of CSP-based Ideal Membership Problems

In this paper we consider the Ideal Membership Problem (IMP for short), ...

Please sign up or login with your details

Forgot password? Click here to reset