PSEUDO-BOOLEAN FUNCTIONS AND THE MULTIPLICITY OF THE ZEROS OF POLYNOMIALS

被引:4
|
作者
Erdelyi, Tamas [1 ]
机构
[1] Texas A&M Univ, Dept Math, College Stn, TX 77843 USA
来源
关键词
COSINE POLYNOMIALS; THEOREM; RECONSTRUCTION; BOUNDS; ROOTS;
D O I
10.1007/s11854-015-0025-1
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A highlight of this paper states that there is an absolute constant c(1) > 0 such that every polynomial P of the form P(z) = Sigma(n)(j=0) a(j)z(j) , a(j is an element of) C with vertical bar a(0)vertical bar = 1, vertical bar a(j)vertical bar <= M-1((n) (j)), j = 1,2, ... , n, for some 2 <= M <= e(n) has at most n- left perpendicular c(1 root)n log M right perpendicular zeros at 1. This is compared with some earlier similar results reviewed in the introduction and closely related to some interesting Diophantine problems. Our most important tool is an essentially sharp result due to Coppersmith and Rivlin asserting that if F-n = {1, 2, ... , n}, there exists an absolute constant c > 0 such that vertical bar P(0)vertical bar <= exp(cL) max(x is an element of Fn) vertical bar P(x)vertical bar for every polynomial P of degree at most m <= root nL/16 with 1 <= L < 16n. A new proof of this inequality is included in our discussion.
引用
收藏
页码:91 / 108
页数:18
相关论文
共 50 条
  • [31] Comparing variants of MMAS ACO algorithms on pseudo-boolean functions
    Neumann, Frank
    Sudholt, Dirk
    Witt, Carsten
    ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007, 4638 : 61 - +
  • [32] Approximating Pseudo-Boolean Functions on Non-Uniform Domains
    Lax, R. F.
    Ding, Guoli
    Chen, Peter P.
    Chen, J.
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 1754 - 1755
  • [33] Walsh Functions as Surrogate Model for Pseudo-Boolean Optimization Problems
    Lepretre, Florian
    Verel, Sebastien
    Fonlupt, Cyril
    Marion, Virginie
    PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'19), 2019, : 303 - 311
  • [34] Runtime analysis of the (μ+1) EA on simple pseudo-Boolean functions
    Witt, C
    EVOLUTIONARY COMPUTATION, 2006, 14 (01) : 65 - 86
  • [35] On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions
    Wegener, Ingo
    Witt, Carsten
    JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (01) : 61 - 78
  • [36] PSEUDO-BOOLEAN PROGRAMMING WITH CONSTRAINTS
    INAGAKI, Y
    FUKUMURA, T
    ELECTRONICS & COMMUNICATIONS IN JAPAN, 1967, 50 (06): : 26 - &
  • [37] Symmetric approximations of pseudo-Boolean functions with applications to influence indexes
    Marichal, Jean-Luc
    Mathonet, Pierre
    APPLIED MATHEMATICS LETTERS, 2012, 25 (08) : 1121 - 1126
  • [38] Running Time Analysis of MOEA/D on Pseudo-Boolean Functions
    Huang, Zhengxin
    Zhou, Yuren
    Chen, Zefeng
    He, Xiaoyu
    Lai, Xinsheng
    Xia, Xiaoyun
    IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (10) : 5130 - 5141
  • [39] Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions
    Verma, Amit
    Lewis, Mark
    OPTIMIZATION LETTERS, 2020, 14 (06) : 1557 - 1569
  • [40] A Surrogate Model Based on Walsh Decomposition for Pseudo-Boolean Functions
    Verel, Sebastien
    Derbel, Bilel
    Liefooghe, Arnaud
    Aguirre, Hernan
    Tanaka, Kiyoshi
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XV, PT II, 2018, 11102 : 181 - 193