Uniform Families of Polynomial Equations Over a Finite Field and Structures Admitting an Euler Characteristic of Definable Sets

DOI10.1112/S0024611500012557zbMath1034.03045WikidataQ129275531 ScholiaQ129275531MaRDI QIDQ2766366

Jan Krajíček

Publication date: 28 January 2002

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

Euler characteristicsolvabilitypolynomial systempigeonhole principle

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Equations in general fields (12E12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

Related Items (6)

Counting mod \(n\) in pseudofinite fields ⋮ Approximate Euler characteristic, dimension, and weak pigeonhole principles ⋮ O-MINIMALISM ⋮ Approximate counting by hashing in bounded arithmetic ⋮ Definable combinatorics with dense linear orders ⋮ A model-theoretic characterization of the weak pigeonhole principle

This page was built for publication: Uniform Families of Polynomial Equations Over a Finite Field and Structures Admitting an Euler Characteristic of Definable Sets