  Efficient deterministic algorithms to construct representations of lattice
path matroids over finite fields are presented. They are built on known
constructions of hierarchical secret sharing schemes, a recent characterization
of hierarchical matroid ports, and the existence of isolating weight functions
for lattice path matroids whose values are polynomial on the size of the ground
set.
