Interpreting Random Hypergraphs in Pseudofinite Fields

2006/12/31 by Ozlem Beyarslan, Beyarslan, Ozlem
Mathematics · #03C98(primary) #12F10(secondary) #FOS: Mathematics #Logic (math.LO) #math.LO

paper · pdf · doi:10.48550/arxiv.math/0701029

16 pages, submitted to the LJM

arxiv created 2006/12/31 · arxiv updated 2009/12/01

Abstract

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

Related

• Pseudo-random graphs
• Random hypergraphs and algorithmics
• Large subgraphs in pseudo-random graphs
• Some examples of asymptotic combinatorial behavior, zero-one and convergence results on random hypergraphs
• Distance graphs in vector spaces over finite fields, coloring and pseudo-randomness