ON THE NUMBER OF ZERO-PATTERNS OF A SEQUENCE OF POLYNOMIALS

JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY(2001)

引用 45|浏览8
暂无评分
摘要
Remark 1.4. The assumption m n is justied by the observation that form n, the trivial bound Z F (f) 2mcan be attained even for d = deg(f) =1, over every eld (let f i = x i ).
更多
查看译文
关键词
polynomials,zero-patterns,linear algebra bound,sign-patterns,real algebraic geometry,affine varieties,algebraically closed fields,quantifier elimination,asymptotic counting,counting patterns,graph representation,projective dimension of graphs,probabilistic method,nonconstructive proof,Ramsey theory,models of computation,span-programs,extremal combinatorics
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要