Lower bounds for polynomials of many variables

被引:0
|
作者
V. N. Margaryan
H. G. Ghazaryan
机构
[1] Russian-Armenian (Slavonic) University,
[2] Institute of Mathematics NAS of Armenia,undefined
关键词
Almost hypoelliptic polynomial (operator); Seidenberg-Tarski number; Newton’s polyhedron; 12E10; 26C05;
D O I
暂无
中图分类号
学科分类号
摘要
A polynomial P(ξ) = P(ξ1,..., ξn) is said to be almost hypoelliptic if all its derivatives DνP(ξ) can be estimated from above by P(ξ) (see [16]). By a theorem of Seidenberg-Tarski it follows that for each polynomial P(ξ) satisfying the condition P(ξ) > 0 for all ξ ∈ Rn, there exist numbers σ > 0 and T ∈ R1 such that P(ξ) ≥ σ(1 + |ξ|)T for all ξ ∈ Rn. The greatest of numbers T satisfying this condition, denoted by ST(P), is called Seidenberg-Tarski number of polynomial P. It is known that if, in addition, P ∈ In, that is, |P(ξ)| → ∞ as |ξ| → ∞, then T = T(P) > 0. In this paper, for a class of almost hypoelliptic polynomials of n (≥ 2) variables we find a sufficient condition for ST(P) ≥ 1. Moreover, in the case n = 2, we prove that ST(P) ≥ 1 for any almost hypoelliptic polynomial P ∈ I2.
引用
收藏
页码:211 / 220
页数:9
相关论文
共 50 条
  • [1] Lower Bounds for Polynomials of Many Variables
    Margaryan, V. N.
    Ghazaryan, H. G.
    JOURNAL OF CONTEMPORARY MATHEMATICAL ANALYSIS-ARMENIAN ACADEMY OF SCIENCES, 2017, 52 (05): : 211 - 220
  • [2] PRODUCTS OF POLYNOMIALS IN MANY VARIABLES
    BEAUZAMY, B
    BOMBIERI, E
    ENFLO, P
    MONTGOMERY, HL
    JOURNAL OF NUMBER THEORY, 1990, 36 (02) : 219 - 245
  • [3] DISCRIMINANTS OF POLYNOMIALS IN MANY VARIABLES
    GELFAND, IM
    ZELEVINSKII, AV
    KAPRANOV, MM
    FUNCTIONAL ANALYSIS AND ITS APPLICATIONS, 1990, 24 (01) : 1 - 4
  • [4] Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing
    Kumar, Mrinal
    Saraf, Shubhangi
    31ST CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2016), 2016, 50
  • [5] Lower bounds for discriminants of polynomials
    Kim, Kwang-Seob
    INTERNATIONAL JOURNAL OF NUMBER THEORY, 2017, 13 (10) : 2765 - 2772
  • [6] LOWER BOUNDS FOR THE COMPLEXITY OF POLYNOMIALS
    STOSS, HJ
    THEORETICAL COMPUTER SCIENCE, 1989, 64 (01) : 15 - 23
  • [7] Quantum lower bounds by polynomials
    Beals, R
    Buhrman, H
    Cleve, R
    Mosca, M
    De Wolf, R
    JOURNAL OF THE ACM, 2001, 48 (04) : 778 - 797
  • [8] Quantum lower bounds by polynomials
    Beals, R
    Buhrman, H
    Cleve, R
    Mosca, M
    de Wolf, R
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 352 - 361
  • [9] On the Mahler measure of polynomials in many variables
    Schinzel, A
    ACTA ARITHMETICA, 1997, 79 (01) : 77 - 81
  • [10] COEFFICIENT APPROXIMATIONS IN POLYNOMIALS WITH MANY VARIABLES
    RACK, HJ
    ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1983, 63 (05): : T371 - T372