Approximation and decomposition in lattices of clutters

DOI10.1016/J.DISC.2023.113445MaRDI QIDQ6041563zbMATH OpenOpenAlexFDO

Authors Jaume Martí-Farré, Anna de Mier

Publication date 31 May 2023

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2023.113445

zbMATH Keywords

latticeclutterclutter decomposition

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Approximate lattices
• Decomposable clutters and a generalization of Simon's conjecture
• On optimal lattice decompositions
• Linearly dependent vectorial decomposition of clutters
• Approximate decomposition of some modulated-Poisson Voronoi tessellations
• Lattice for covering rough approximations
• scientific article; zbMATH DE number 1880292
• scientific article; zbMATH DE number 4047816
• The \(L\)-approximation on lattices
• Improved bounds and schemes for the declustering problem

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 3598539 (Why is no real title available?)
• scientific article; zbMATH DE number 4123667 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• An explication of secret sharing schemes
• Bottleneck extrema
• Completion and decomposition of a clutter into representable matroids
• Decomposition constructions for secret-sharing schemes
• From clutters to matroids
• Graph decompositions and secret sharing schemes
• How to share a secret
• Perfect secret sharing schemes on five participants
• Secret sharing schemes with bipartite access structure
• Secret sharing schemes with three or four minimal qualified subsets
• Tight bounds on the information rate of secret sharing schemes
• Transformation and decomposition of clutters into matroids
• Uniform clutters and dominating sets of graphs

Cited in

(3)

• scientific article; zbMATH DE number 1834641 (Why is no real title available?)
• Linearly dependent vectorial decomposition of clutters
• Completion and decomposition of a clutter into representable matroids

This page was built for publication: Approximation and decomposition in lattices of clutters

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