Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees

We establish a new lower bound on the ll-wise collective minimum degree which guarantees the existence of a perfect matching in akk-uniform hypergraph, where 1≤l