Searcharxiv⌕ Search

arXiv subjects

Shahram Khazaei

Publications and source records attributed to Shahram Khazaei.

4 recordsLinked to original sources

Five-Entropic Matroids Are Quinary

A finite matroid is representable over a field if its elements can be assigned vectors over that field such that the rank of every subset equals the dimension of the span of its vectors. For an integer q >= 2, a matroid is q-entropic if there exists a random vector indexed by its ground set, with each coordinate taking values in a common q-element alphabet, such that the entropy of every marginal subvector equals the rank of the corresponding subset multiplied by log q. It remains open to determine for which values of q every q-entropic matroid is representable over a field. For q=2 and q=3, representability over F_q has long been known. More recently, it was established that every 4-entropic matroid is representable over F_4 and that the 6-entropic matroids are precisely the regular matroids, that is, those representable over every field. We settle the previously unresolved five-symbol case, proving that a finite matroid is 5-entropic if and only if it is representable over F_5. For the nontrivial implication, we use Matúš's equivalence between entropic and partition representations. We show that a degree-five partition representation induces, on each embedded U_{2,4}-minor, an F_5-linear representation after coordinatewise relabeling, with a rescaling class independent of the chosen linearization. Using the foundation presentation of Baker and Lorscheid, we verify the compatibility relations among these local classes and thereby obtain a global F_5-representation.

math.CO↗

Four-Entropic Matroids Are Quaternary

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.

math.CO↗

Folded-Algebraic Matroids: Characteristic Rigidity and Almost-Entropic Separation

We introduce folded-algebraic matroids. In such a representation, every matroid element is replaced by a finite tuple of algebraic quantities, and transcendence degree agrees with matroid rank after one uniform scaling. The resulting class contains both algebraic and folded-linear matroids and is contained in the class of almost-entropic matroids, whose rank functions are limits of scaled entropy functions. We prove that the latter containment is proper. Our main result concerns the classical rank-three matroids $M(p)$ of Gordon. For every prime $p$, we show that $M(p)$ has a folded-algebraic representation over a field $K$ if and only if $K$ has characteristic $p$. We then use a point-identification construction that preserves almost-entropicity to obtain a $13$-element rank-three $3$-connected matroid $C_{2,3}$ that is almost entropic but not folded algebraic. Choosing a common element as dealer also yields a connected $12$-participant port with incompatible characteristic requirements. Finally, we record compact explicit witnesses and size bounds for several other separating regions among the representation classes.

math.CO↗

Separating Abelian and Homomorphic Entropy Cones

Chan and Yeung showed that finite groups suffice to determine which homogeneous linear information inequalities are universally valid. We compare two restricted group-characterizable entropy cones: the Abelian cone $\widetildeΓ^{\mathrm{Abl}}_n$ and the homomorphic cone $\widetildeΓ^{\mathrm{Hom}}_n$, the latter generated by coset systems of normal subgroups. We prove \[ \widetildeΓ^{\mathrm{Abl}}_{16}\subsetneq\widetildeΓ^{\mathrm{Hom}}_{16}, \] and, if $n_{\rm AH}$ is the least number of variables for which these cones differ, we show $6\le n_{\rm AH}\le16$. The separating functional is a class-restricted entropy inequality: it is valid on the Abelian cone but is not a universal information inequality. It is obtained by lifting the order dual of the Pálfy--Szabó six-cross identity while quantifying errors at inexact subgroup joins. We then construct sixteen normal subgroups of a class-two $2$-group of order $2^{43}$ for which every join error vanishes while the endpoint containment fails by one bit. Since mixed-linear random variables are Abelian, the same example also separates the mixed-linear and homomorphic entropy cones.

cs.IT↗