Linearly dependent vectorial decomposition of clutters

DOI10.1016/J.ENDM.2014.08.028MaRDI QIDQ283705zbMATH OpenOpenAlexFDO

Authors Jaume Martí-Farré

Publication date 13 May 2016

Full work available at URL http://hdl.handle.net/2117/27557

zbMATH Keywords

decompositionhypergraphmatroidantichainclutter

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Completion and decomposition of a clutter into representable matroids
• From clutters to matroids
• Approximation and decomposition in lattices of clutters
• On the decomposition of vector spaces
• Transformation and decomposition of clutters into matroids

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• From clutters to matroids
• On secret sharing schemes, matroids and polymatroids
• On secret-sharing matroids

Cited in

(3)

• From clutters to matroids
• Approximation and decomposition in lattices of clutters
• Completion and decomposition of a clutter into representable matroids

This page was built for publication: Linearly dependent vectorial decomposition of clutters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283705)