加载中…
We investigate the number of half-regular squares required to decompose a non-negative function into a sum of squares. Each non-negative function is known to be a finite SOS in , and similar regularity-preserving SOS decompositions have been studied by various authors. Our work refines existing techniques to unify and build upon several known decomposition results, and moreover we provide upper and lower estimates on the number of squares required for SOS decompositions in .

生成讲解博客的中文版本

生成AI智能校验的中文版本