Efficient Representation of Lattice Path Matroids
Combinatorics
2024-07-09 v3
Abstract
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.
Cite
@article{arxiv.2310.10489,
title = {Efficient Representation of Lattice Path Matroids},
author = {Carles Padró},
journal= {arXiv preprint arXiv:2310.10489},
year = {2024}
}