اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدIsoparametric polynomials and sums of squares
145
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The Hilberts 17th problem asks that whether every nonnegative polynomial can be a sum of squares of rational functions. It has been answered affirmatively by Artin. However, as to the question whether a given nonnegative polynomial is a sum of squares of polynomials is still a central question in real algebraic geometry. In this paper, we solve this question completely for the nonnegative polynomials associated with isoparametric polynomials (initiated by E. Cartan) which define the focal submanifolds of the corresponding isoparametric hypersurfaces.
قيم البحث
اقرأ أيضاً
This is a survey on the recent progress in several applications of isoparametric theory, including an affirmative answer to Yaus conjecture on the first eigenvalue of Laplacian in the isoparametric case, a negative answer to Yaus 76th problem in his
Problem Section, new examples of Willmore submanifolds in spheres, a series of examples to Besses problem on the generalization of Einstein condition, isoparametric functions on exotic spheres, counterexamples to two conjectures of Leung, as well as surgery theory on isoparametric foliation.
An isoparametric family in the unit sphere consists of parallel isoparametric hypersurfaces and their two focal submanifolds. The present paper has two parts. The first part investigates topology of the isoparametric families, namely the homotopy, ho
meomorphism, or diffeomorphism types, parallelizability, as well as the Lusternik-Schnirelmann category. This part extends substantially the results of Q.M.Wang in cite{Wa88}. The second part is concerned with their curvatures, more precisely, we determine when they have non-negative sectional curvatures or positive Ricci curvatures with the induced metric.
The Macaulay2 package SumsOfSquares decomposes polynomials as sums of squares. It is based on methods to rationalize sum-of-squares decompositions due to Parrilo and Peyrl. The package features a data type for sums-of-squares polynomials, support for
external semidefinite programming solvers, and optimization over varieties.
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic polynomial
s are sums of squares, we study whether nonnegative SPQ polynomials are (i) the sum of a nonnegative separable and a nonnegative quadratic polynomial, and (ii) a sum of squares. We establish that the answer to question (i) is positive for univariate plus quadratic polynomials and for convex SPQ polynomials, but negative already for bivariate quartic SPQ polynomials. We use our decomposition result for convex SPQ polynomials to show that convex SPQ polynomial optimization problems can be solved by small semidefinite programs. For question (ii), we provide a complete characterization of the answer based on the degree and the number of variables of the SPQ polynomial. We also prove that testing nonnegativity of SPQ polynomials is NP-hard when the degree is at least four. We end by presenting applications of SPQ polynomials to upper bounding sparsity of solutions to linear programs, polynomial regression problems in statistics, and a generalization of Newtons method which incorporates separable higher-order derivative information.
Based on representation theory of Clifford algebra, Ferus, Karcher and M{u}nzner constructed a series of isoparametric foliations. In this paper, we will survey recent studies on isoparametric hypersurfaces of OT-FKM type and investigate related geometric constructions with mean curvature flow.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
