Algebraic matroids are almost entropic

DOI10.1090/proc/13846zbMath1530.05025OpenAlexW2716422462MaRDI QIDQ6083329

František Matúš

Publication date: 31 October 2023

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/proc/13846

zbMATH Keywords

matroidShannon entropyalgebraic matroidideal secret sharingalmost entropic matroid

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) Measures of information, entropy (94A17) Varieties over finite and local fields (11G25) Authentication, digital signatures and secret sharing (94A62) Transcendental field extensions (12F20)

Related Items (2)

On ideal and weakly-ideal access structures ⋮ Common information, matroid representation, and secret sharing for matroid ports

Cites Work

• Unnamed Item
• Secret-sharing matroids need not be algebraic
• On some combinatorial properties of algebraic matroids
• Matroid representations by partitions
• Classes of matroids closed under minors and principal extensions
• Adhesivity of polymatroids
• Improved explicit estimates on the number of solutions of equations over a finite field
• Entropy Region and Convolution
• Two Constructions on Limits of Entropy Functions
• A Reduction of Algebraic Representations of Matroids
• Non‐Algebraic Matroids exist
• Polymatroidal dependence structure of a set of random variables
• Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
• Number of Points of Varieties in Finite Fields

This page was built for publication: Algebraic matroids are almost entropic