  In this note we analyze two algorithms, one for producing a matching and one
for an independent set, on $k$-uniform $d$-regular hypergraphs of large girth.
As a result we obtain new lower bounds on the size of a maximum matching or
independent set in such hypergraphs.
