Exponent Criterion for Nonredundant String-Cone Inequalities
Status Partially solved · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedPartially solvedOpenStatement
Definitions and mathematical statement
The supplied record asks for an equivalence involving a string cone $S_{\mathbf i}$, its defining inequalities, and a function $W$ restricted to a torus $T_{\mathbf i}^{\vee}$. It does not specify the underlying algebraic data, the admissible indices $\mathbf i$, the function $W$, the torus coordinates, or the particular defining inequalities. The following makes the intended criterion explicit conditionally on those data being supplied.Fix an admissible choice of the intended data and its designated presentation \[ S_{\mathbf i}=\{v\in V:\ell_{\alpha}(v)\geq 0\text{ for every }\alpha\in I\}, \] where $V$ is the real ambient vector space and the $\ell_{\alpha}$ are the linear forms in that presentation. The presentation is nonredundant if deleting any one inequality strictly enlarges the defined set; equivalently, \[ \forall\alpha\in I\ \exists v\in V:\quad \ell_{\alpha}(v)<0 \quad\text{and}\quad \ell_{\beta}(v)\geq0\ \text{for every }\beta\in I\setminus\{\alpha\}. \] Nonredundancy here is a property of the designated presentation, whose identity must be recovered from the source.
Under the intended Laurent-polynomial interpretation, let $x_1,\ldots,x_n$ be the designated coordinates on $T_{\mathbf i}^{\vee}$, and write the restriction, after collecting equal monomials, as \[ \left.W\right|_{T_{\mathbf i}^{\vee}} =\sum_{a\in A}c_a x_1^{a_1}\cdots x_n^{a_n}, \qquad A\subseteq\mathbb Z^n\text{ finite},\qquad c_a\neq0. \] The exponent condition is \[ \forall a\in A\ \forall j\in\{1,\ldots,n\}:\quad |a_j|\leq1, \] that is, $A\subseteq\{-1,0,1\}^n$.
Conjectural target. For every admissible choice of the intended source data, \[ \text{the designated inequalities for }S_{\mathbf i}\text{ are nonredundant} \quad\Longleftrightarrow\quad A\subseteq\{-1,0,1\}^n. \] This is a conditional reconstruction of the supplied question. The admissibility hypotheses, coordinate choice, Laurent-polynomial interpretation, and correspondence between the restriction and the designated inequalities remain unspecified; the equivalence is not asserted for arbitrary independently chosen cones and Laurent polynomials. The supplied dated assessment reports the exponent condition as sufficient for nonredundancy and leaves the converse conjectural; that assessment has not been independently verified.
Short English statement
The question asks whether a particular defining system for a string cone is nonredundant exactly when every variable has exponent $-1$, $0$, or $1$ in every monomial of the restricted function $W$. The algebraic setting, coordinates, and defining system must still be identified from the references. Supplied curation labels the problem partially solved and reports sufficiency of the exponent condition, with the converse remaining conjectural.Sources
- Supplied local UnsolvedMath registry record, permanent ID $30004665$, source problem code
catalogue entry, entitled Exponent Criterion for Nonredundant String-Cone Inequalities; collection: Oberwolfach Reports Open Problems. The record gives proposed year 2021 and names no proposer. - Supplied report citation: Algebraic Groups (2022), Oberwolfach Reports, pp. 1087--1148, DOI
10.4171/owr/2021/20. https://doi.org/10.4171/owr/2021/20. The literature-source label is Oberwolfach Report 20/2021. The supplied year labels differ and have not been reconciled. - Supplied literature reference, attributed to Koshevoy--Schumann and labeled "redundancy in string-cone inequalities": https://arxiv.org/abs/2109.14439.
- Literature assessment dated exactly
2026-08-22: supplied dated curation, not independently verified. It labels the problem partially solved, reports that the exponent condition is sufficient for nonredundancy, and describes the converse as conjectural, with only partial cases and evidence reported in the cited work. The record requests independent verification of time-sensitive status and cited claims. - The supplied registry labels the statement
corrected_verifiedand reports a manual semantic, typographic, and LaTeX review claiming self-containedness and preservation of the target. This is supplied review metadata; it does not resolve the missing mathematical specifications identified here. No external source was visited for this draft.
Statement licence: CC-BY-SA-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.