Violations of the Ingleton inequality and revising the four-atom conjecture

Title:

Violations of the Ingleton inequality and revising the four-atom conjecture

Creator:

Boston, Nigel and Nan, Ting-Ting

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:f761f7c2-c11a-42ab-9ac8-9ae3ef092bf3
uuid:f761f7c2-c11a-42ab-9ac8-9ae3ef092bf3
issn:0023-5954
doi:10.14736/kyb-2020-5-0916

Subject:

kybernetika, cybernetics, information inequalities, entropy vectors, subgroup indices, 23, and 007

Type:

model:article and TEXT

Format:

print, bez média, and svazek

Description:

The entropy region is a fundamental object of study in mathematics, statistics, and information theory. On the one hand, it involves pure group theory, governing inequalities satisfied by subgroup indices, whereas on the other hand, computing network coding capacities amounts to a convex optimization over this region. In the case of four random variables, the points in the region that satisfy the Ingleton inequality (corresponding to abelian groups and to linear network codes) form a well-understood polyhedron, and so attention has turned to Ingleton-violating points in the region. How far these points extend is measured by their Ingleton score, where points with positive score are Ingleton-violating. The Four-Atom Conjecture stated that the Ingleton score cannot exceed 0.089373, but this was disproved by Matúš and Csirmaz. In this paper we employ two methods to investigate Ingleton-violating points and thereby produce the currently largest known Ingleton scores. First, we obtain many Ingleton-violating examples from non-abelian groups. Factorizability appears in many of those and is used to propose a systematic way to produce more. Second, we rephrase the problem of maximizing Ingleton score as an optimization question and introduce a new Ingleton score function, which is a limit of Ingleton scores with maximum unchanged. We use group theory to exploit symmetry in these new Ingleton score functions and the relations between them. Our approach yields some large Ingleton scores and, using this methodology, we find that there are entropic points with score 0.09250007770, currently the largest known score., Nigel Boston and Ting-Ting Nan., and Obsahuje bibliografické odkazy

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

916-933

Source:

Kybernetika | 2020 Volume:56 | Number:5

Harvested from:

CDK

Metadata only:

false