Search arXivSearch

arXiv · 2608.20553

Four-Entropic Matroids Are Quaternary

Abstract

For an integer $q\ge2$, a matroid is $q$-entropic if its rank function, multiplied by $\log q$, is the joint-entropy function of random variables on a $q$-element alphabet. We prove that a matroid is $4$-entropic if and only if it is representable over $\F_4$. The corresponding statements for alphabet sizes two and three were known. The proof combines minor closure and the excluded-minor characterization of quaternary matroids with structural properties of quasigroups of order four. Thus arbitrary four-symbol partition representations yield no matroids beyond the quaternary ones. As an application, every access structure admitting an ideal perfect scheme with a uniform four-symbol secret and four-symbol active shares also admits an ideal $\F_4$-linear scheme.

Explore related subjects

Keep this discovery

BibTeXRIS

Mohammad Hossein Kalantari, Shahram Khazaei. 2026-09-03. Four-Entropic Matroids Are Quaternary. https://arxiv.org/abs/2608.20553

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Multiplicative comparisons of Rényi entropies for weighted Bernoulli sums

We establish improved multiplicative bounds relating the Rényi entropies of different orders for weighted sums of independent Bernoulli random variables. In particular, we prove a logarithmic bound between the zeroth-order and infinity-order Rényi entropies, which yields a polynomial improvement over the square-root bound of Jain, Sah, and Sawhney. Additionally, we obtain explicit constant-factor bounds for comparisons among Rényi entropies of nonzero orders.

math.PR