For an integer k >= 2, an ordered k-uniform hypergraph H = (H, 0 such that (R) over bar (H, H) = 2(Omega(n log n)) for some fixed ordered 3-uniform hypergraph H.