PreprintCC BY 4.0arXiv
Weak Polynomial Completeness Does Not Imply Almost Polynomial Completeness
Abstract
We show that weak polynomial completeness does not imply almost polynomial completeness by constructing an explicit extension of domains D⊆ A such that Int(D)⊆Int(A) but Int(D2)nsubseteqInt(A2).
Related
- Uniform Kreiss boundedness does not imply strong Cesàro boundedness
- Griffiths positivity does not imply positivity of the top Chern form
- Social Optimality Does Not Imply Coalitional Stability in Unweighted Max-k-Cut Games
- Generic Local Identifiability Does Not Imply Generic Global Identifiability in Linear Networks
- Finite-order exponential mixing does not imply the central limit theorem
BibTeX
@misc{tran2026weak,
title = {{Weak Polynomial Completeness Does Not Imply Almost Polynomial Completeness}},
author = {Viet-Hoang Tran and Tan N. Nguyen},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.05891},
eprint = {2609.05891},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.05891},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Weak Polynomial Completeness Does Not Imply Almost Polynomial Completeness
AU - Viet-Hoang Tran
AU - Tan N. Nguyen
PY - 2026
DA - 2026/09/05
PB - arXiv
DO - 10.48550/arxiv.2609.05891
UR - https://arxiv.org/abs/2609.05891
AB - We show that weak polynomial completeness does not imply almost polynomial completeness by constructing an explicit extension of domains D⊆ A such that Int(D)⊆Int(A) but Int(D^2)nsubseteqInt(A^2).
ER -