arXiv:math/0701029 Abstract

Published 2006-12-31Version 1

We construct a random $n$-hypergraph for every $n$, in a given pseudofinite field.

Comments: 16 pages, submitted to the LJM

Categories: math.LO

Subjects: 03C98, 12F10

Keywords: interpreting random hypergraphs, pseudofinite field

Related articles:

arXiv:1912.07223 [math.LO] (Published 2019-12-16)

Counting mod n in pseudofinite fields

Will Johnson

arXiv:2109.10130 [math.LO] (Published 2021-09-21)

On binomials and explicit form of algebraic closure of some pseudofinite fields

arXiv Analytics