Warning's second theorem with restricted variables

From MaRDI portal



Abstract: We present a restricted variable generalization of Warning's Second Theorem (a result giving a lower bound on the number of solutions of a low degree polynomial system over a finite field, assuming one solution exists). This is analogous to Brink's restricted variable generalization of Chevalley's Theorem (a result giving conditions for a low degree polynomial system not to have exactly one solution). Just as Warning's Second Theorem implies Chevalley's Theorem, our result implies Brink's Theorem. We include several combinatorial applications, enough to show that we have a general tool for obtaining quantitative refinements of combinatorial existence theorems.


The authors present a restricted variable generalization of Warning's Second Theorem which gives a lower bound on the number of solutions of a solveable polynomial system in sufficiently many variables over a finite field. Their result implies a generalization of Chevalley's Theorem. Several applications show how to use the result to refine combinatorial existence theorems into theorems which give explicit lower bounds on the number of combinatorial objects.











This page was built for publication: Warning's second theorem with restricted variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1705824)