ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a prime pp, let Fn,n+1∗{\mathcal F}^*_{n,n+1} denote the class of (n+1)(n+1)-nomials in nn variables, and let FEASQp{\text{{\tt FEAS}}}_{\mathbb{Q}_p} be the feasibility problem for rational roots over the pp-adic field Qp\mathbb{Q}_p. The p-adic NP-hardness conjecture. For any fixed prime pp,

FEASQp ⁣(⋃n∈NFn,n+1∗){\text{{\tt FEAS}}}_{\mathbb{Q}_p}\!\left(\bigcup_{n\in\mathbb{N}} {\mathcal F}^*_{n,n+1}\right)

is NP{\mathbf{NP}}-hard. The analogous real feasibility problem is already known to be NP{\mathbf{NP}}-hard for broader families with more than n+1n+1 monomials, and the conjecture predicts the same phenomenon for multivariate (n+1)(n+1)-nomials over Qp\mathbb{Q}_p.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.