What is in #P and what is not?
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:DP3DWTVHrecord.jsonopen to challenge →
read the original abstract
For several classical nonnegative integer functions, we investigate if they are members of the counting complexity class #P or not. We prove #P membership in surprising cases, and in other cases we prove non-membership, relying on standard complexity assumptions or on oracle separations. We initiate the study of the polynomial closure properties of #P on affine varieties, i.e., if all problem instances satisfy algebraic constraints. This is directly linked to classical combinatorial proofs of algebraic identities and inequalities. We investigate #TFNP and obtain oracle separations that prove the strict inclusion of #P in all standard syntactic subclasses of #TFNP-1.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Equality conditions for correlation inequalities
Equality in the Ahlswede–Daykin and FKG inequalities holds if and only if the underlying lattice decomposes as a direct product and the functions cross-factor across the two components.
-
Correlation inequalities for Schur positivity
Generalizes Ahlswede-Daykin inequality to Schur-positive ADS inequality and resolves Mihalcea's conjecture on log-supermodularity of stable Grothendieck polynomials.
-
On Variable-Bounded Non-Linear Expansions of Presburger Arithmetic
Decidability is shown for single-variable Presburger expansions with fixed powers via hyperelliptic Diophantine solvability and with degree-at-most-three polynomials via low-genus curves, with hardness results when re...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.