Article contents
Random hypergraphs in pseudofinite fields
Published online by Cambridge University Press: 03 June 2009
Abstract
We prove that n-hypergraphs can be interpreted in e-free perfect PAC fields in particular in pseudofinite fields. We use methods of function field arithmetic, more precisely we construct generic polynomials with alternating groups as Galois groups over a function field.
MSC classification
- Type
- Research Article
- Information
- Journal of the Institute of Mathematics of Jussieu , Volume 9 , Issue 1 , January 2010 , pp. 29 - 47
- Copyright
- Copyright © Cambridge University Press 2010
References
- 5
- Cited by