Abstract
AbstractWe study multivariate polynomials over ‘structured’ grids. Firstly, we propose an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend several results – notably, the Combinatorial Nullstellensatz and the Coefficient Theorem – to polynomials over structured grids. The main point is that the structure of a grid allows the degree constraints on polynomials to be relaxed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.