On the number of zero-patterns of a sequence of polynomials

L. Rónyai, László Babai, Murali K. Ganapathy

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

Let f = (f1, ..., fm) be a sequence of polynomials of degree ≤ d in n variables (m ≥ n) over a field F. The zero-pattern of f at u ∈ Fn is the set of those i (1 ≤ i ≤ m) for which fi(u) = 0. Let ZF(f) denote the number of zero-patterns of f as u ranges over Fn. We prove that ZF(f) ≤ ∑jn=0 (jm) for d = 1 and (1) ZF(f) ≤ (nmd) for d ≥ 2. For m ≥ nd, these bounds are optimal within a factor of (7.25)n. The bound (1) improves the bound (1 + md)n proved by J. Heintz [21] using the dimension theory of affine varieties. Over the field of real numbers, bounds stronger than Heintz's but slightly weaker than (1) follow from results of J. Milnor [28], H. E. Warren [37], and others; their proofs use techniques from real algebraic geometry. In contrast, our half-page proof is a simple application of the elementary "linear algebra bound". Heintz applied his bound to estimate the complexity of his quantifier elimination algorithm for algebraically closed fields. We give several additional applications. The first two establish the existence of certain combinatorial objects. Our first application, motivated by the "branching program" model in the theory of computing, asserts that over any field F, most graphs with v vertices have projective dimension Ω(√v/log v) (the implied constant is absolute). This result was previously known over the reals (Pudlák-Rödl [33]). The second application concerns a lower bound in the span program model for computing Boolean functions. The third application, motivated by a paper by N. Alon [2], gives nearly tight Ramsey bounds for matrices whose entries are defined by zero-patterns of a sequence of polynomials. We conclude the paper with a number of open problems.

Original languageEnglish
Pages (from-to)717-735
Number of pages19
JournalJournal of the American Mathematical Society
Volume14
Issue number3
DOIs
Publication statusPublished - Jul 2001

Fingerprint

Polynomials
Polynomial
Zero
Linear algebra
Boolean functions
Real Algebraic Geometry
Branching Programs
Dimension Theory
Projective Dimension
Quantifier Elimination
Computing
Boolean Functions
Algebraically closed
Open Problems
Geometry
Lower bound
Denote
Graph in graph theory
Model
Estimate

Keywords

  • Affine varieties
  • Algebraically closed fields
  • Asymptotic counting
  • Counting patterns
  • Graph representation
  • Linear algebra bound
  • Polynomials
  • Projective dimension of graphs
  • Quantifier elimination
  • Real algebraic geometry
  • Sign-patterns
  • Zero-patterns

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

On the number of zero-patterns of a sequence of polynomials. / Rónyai, L.; Babai, László; Ganapathy, Murali K.

In: Journal of the American Mathematical Society, Vol. 14, No. 3, 07.2001, p. 717-735.

Research output: Contribution to journalArticle

Rónyai, L. ; Babai, László ; Ganapathy, Murali K. / On the number of zero-patterns of a sequence of polynomials. In: Journal of the American Mathematical Society. 2001 ; Vol. 14, No. 3. pp. 717-735.
@article{5d37df6261df4682841c50764a4a5b81,
title = "On the number of zero-patterns of a sequence of polynomials",
abstract = "Let f = (f1, ..., fm) be a sequence of polynomials of degree ≤ d in n variables (m ≥ n) over a field F. The zero-pattern of f at u ∈ Fn is the set of those i (1 ≤ i ≤ m) for which fi(u) = 0. Let ZF(f) denote the number of zero-patterns of f as u ranges over Fn. We prove that ZF(f) ≤ ∑jn=0 (jm) for d = 1 and (1) ZF(f) ≤ (nmd) for d ≥ 2. For m ≥ nd, these bounds are optimal within a factor of (7.25)n. The bound (1) improves the bound (1 + md)n proved by J. Heintz [21] using the dimension theory of affine varieties. Over the field of real numbers, bounds stronger than Heintz's but slightly weaker than (1) follow from results of J. Milnor [28], H. E. Warren [37], and others; their proofs use techniques from real algebraic geometry. In contrast, our half-page proof is a simple application of the elementary {"}linear algebra bound{"}. Heintz applied his bound to estimate the complexity of his quantifier elimination algorithm for algebraically closed fields. We give several additional applications. The first two establish the existence of certain combinatorial objects. Our first application, motivated by the {"}branching program{"} model in the theory of computing, asserts that over any field F, most graphs with v vertices have projective dimension Ω(√v/log v) (the implied constant is absolute). This result was previously known over the reals (Pudl{\'a}k-R{\"o}dl [33]). The second application concerns a lower bound in the span program model for computing Boolean functions. The third application, motivated by a paper by N. Alon [2], gives nearly tight Ramsey bounds for matrices whose entries are defined by zero-patterns of a sequence of polynomials. We conclude the paper with a number of open problems.",
keywords = "Affine varieties, Algebraically closed fields, Asymptotic counting, Counting patterns, Graph representation, Linear algebra bound, Polynomials, Projective dimension of graphs, Quantifier elimination, Real algebraic geometry, Sign-patterns, Zero-patterns",
author = "L. R{\'o}nyai and L{\'a}szl{\'o} Babai and Ganapathy, {Murali K.}",
year = "2001",
month = "7",
doi = "10.1090/S0894-0347-01-00367-8",
language = "English",
volume = "14",
pages = "717--735",
journal = "Journal of the American Mathematical Society",
issn = "0894-0347",
publisher = "American Mathematical Society",
number = "3",

}

TY - JOUR

T1 - On the number of zero-patterns of a sequence of polynomials

AU - Rónyai, L.

AU - Babai, László

AU - Ganapathy, Murali K.

PY - 2001/7

Y1 - 2001/7

N2 - Let f = (f1, ..., fm) be a sequence of polynomials of degree ≤ d in n variables (m ≥ n) over a field F. The zero-pattern of f at u ∈ Fn is the set of those i (1 ≤ i ≤ m) for which fi(u) = 0. Let ZF(f) denote the number of zero-patterns of f as u ranges over Fn. We prove that ZF(f) ≤ ∑jn=0 (jm) for d = 1 and (1) ZF(f) ≤ (nmd) for d ≥ 2. For m ≥ nd, these bounds are optimal within a factor of (7.25)n. The bound (1) improves the bound (1 + md)n proved by J. Heintz [21] using the dimension theory of affine varieties. Over the field of real numbers, bounds stronger than Heintz's but slightly weaker than (1) follow from results of J. Milnor [28], H. E. Warren [37], and others; their proofs use techniques from real algebraic geometry. In contrast, our half-page proof is a simple application of the elementary "linear algebra bound". Heintz applied his bound to estimate the complexity of his quantifier elimination algorithm for algebraically closed fields. We give several additional applications. The first two establish the existence of certain combinatorial objects. Our first application, motivated by the "branching program" model in the theory of computing, asserts that over any field F, most graphs with v vertices have projective dimension Ω(√v/log v) (the implied constant is absolute). This result was previously known over the reals (Pudlák-Rödl [33]). The second application concerns a lower bound in the span program model for computing Boolean functions. The third application, motivated by a paper by N. Alon [2], gives nearly tight Ramsey bounds for matrices whose entries are defined by zero-patterns of a sequence of polynomials. We conclude the paper with a number of open problems.

AB - Let f = (f1, ..., fm) be a sequence of polynomials of degree ≤ d in n variables (m ≥ n) over a field F. The zero-pattern of f at u ∈ Fn is the set of those i (1 ≤ i ≤ m) for which fi(u) = 0. Let ZF(f) denote the number of zero-patterns of f as u ranges over Fn. We prove that ZF(f) ≤ ∑jn=0 (jm) for d = 1 and (1) ZF(f) ≤ (nmd) for d ≥ 2. For m ≥ nd, these bounds are optimal within a factor of (7.25)n. The bound (1) improves the bound (1 + md)n proved by J. Heintz [21] using the dimension theory of affine varieties. Over the field of real numbers, bounds stronger than Heintz's but slightly weaker than (1) follow from results of J. Milnor [28], H. E. Warren [37], and others; their proofs use techniques from real algebraic geometry. In contrast, our half-page proof is a simple application of the elementary "linear algebra bound". Heintz applied his bound to estimate the complexity of his quantifier elimination algorithm for algebraically closed fields. We give several additional applications. The first two establish the existence of certain combinatorial objects. Our first application, motivated by the "branching program" model in the theory of computing, asserts that over any field F, most graphs with v vertices have projective dimension Ω(√v/log v) (the implied constant is absolute). This result was previously known over the reals (Pudlák-Rödl [33]). The second application concerns a lower bound in the span program model for computing Boolean functions. The third application, motivated by a paper by N. Alon [2], gives nearly tight Ramsey bounds for matrices whose entries are defined by zero-patterns of a sequence of polynomials. We conclude the paper with a number of open problems.

KW - Affine varieties

KW - Algebraically closed fields

KW - Asymptotic counting

KW - Counting patterns

KW - Graph representation

KW - Linear algebra bound

KW - Polynomials

KW - Projective dimension of graphs

KW - Quantifier elimination

KW - Real algebraic geometry

KW - Sign-patterns

KW - Zero-patterns

UR - http://www.scopus.com/inward/record.url?scp=0035632206&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035632206&partnerID=8YFLogxK

U2 - 10.1090/S0894-0347-01-00367-8

DO - 10.1090/S0894-0347-01-00367-8

M3 - Article

VL - 14

SP - 717

EP - 735

JO - Journal of the American Mathematical Society

JF - Journal of the American Mathematical Society

SN - 0894-0347

IS - 3

ER -