Hamilton cycles in quasirandom hypergraphs

We show that, for a natural notion of quasirandomness in $k$-uniform hypergraphs, any quasirandom $k$-uniform hypergraph on $n$ vertices with constant edge density and minimum vertex degree $\mathrm{\Omega }(n^{k-1})$ contains a loose Hamilton cycle. We also give a construction to show that a $k$-uniform hypergraph satisfying these conditions need not contain a Hamilton $\mathrm{\ell }$-cycle if $k-\mathrm{\ell }$ divides $k$. The remaining values of $\mathrm{\ell }$ form an interesting open question.