Journal article icon

Journal article

Zero-patterns of polynomials and Newton polytopes

Abstract:
We present an upper bound on the number of regions into which affine space or the torus over a field may be partitioned by the vanishing and non-vanishing of a finite collection of multivariate polynomials. The bound is related to the number of lattice points in the Newton polytopes of the polynomials, and is optimal to within a factor depending only on the dimension (assuming suitable inequalities hold amongst the relevant parameters). This refines previous work by different authors.
Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Files:
Publisher copy:
10.1016/S0097-3165(03)00007-4

Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author


More from this funder
Funding agency for:
Lauder, A
Grant:
GR/N35366/01


Publisher:
Elsevier
Journal:
Journal of Combinatorial Theory, Series A More from this journal
Volume:
102
Issue:
1
Pages:
10-15
Publication date:
2003-04-01
Edition:
Publisher's version
DOI:
ISSN:
0009-7316


Language:
English
Keywords:
Subjects:
UUID:
uuid:16f16129-3545-42c3-858a-5d1649f6f823
Local pid:
ora:8743
Deposit date:
2014-07-08
ARK identifier:

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP