We prove that a rank ≥3 Dowling geometry of a group H is partition representable if and only if H is a Frobenius complement. This implies that Dowling group geometries are secret-sharing if and only if they are multilinearly representable., František Matúš and Aner Ben-Efraim., and Obsahuje bibliografické odkazy
We investigate the sets of joint probability distributions that maximize the average multi-information over a collection of margins. These functionals serve as proxies for maximizing the multi-information of a set of variables or the mutual information of two subsets of variables, at a lower computation and estimation complexity. We describe the maximizers and their relations to the maximizers of the multi-information and the mutual information., Thomas Merkh and Guido Montúfar., and Obsahuje bibliografické odkazy
We offer a new approach to the \emph{information decomposition} problem in information theory: given a `target' random variable co-distributed with multiple `source' variables, how can we decompose the mutual information into a sum of non-negative terms that quantify the contributions of each random variable, not only individually but also in combination? We define a new way to decompose the mutual information, which we call the \emph{Information Attribution} (IA), and derive a solution using cooperative game theory. It can be seen as assigning a "fair share'' of the mutual information to each combination of the source variables. Our decomposition is based on a different lattice from the usual `partial information decomposition' (PID) approach, and as a consequence {the IA} has a smaller number of terms {than PID}: it has analogs of the synergy and unique information terms, but lacks separate terms corresponding to redundancy, instead sharing redundant information between the unique information terms. Because of this, it is able to obey equivalents of the axioms known as `local positivity' and `identity', which cannot be simultaneously satisfied by a PID measure., Nihat Ay, Daniel Polani and Nathaniel Virgo., and Obsahuje bibliografické odkazy
Cílem článku je v historickém kontextu analyzovat základy, na nichž stojí dnešní vědní obor kybernetika, a nabídnout takovou definici kybernetiky, která by odpovídala jak jejím původním kořenům, tak i aktuální institucionalizované vědeckovýzkumné a vývojové praxi. Článek klade důraz na hluboce zakořeněnou inženýrskou motivaci kybernetiky, kybernetickou metaforu člověk-stroj, na spřažení mezi člověkem a strojem a na kybernetiku jako diskurzivní praktiku. Historický kontext je zaměřen na rané období americké kybernetiky a proto-kybernetiky., The aim of this article is to analyse in historical context the foundations of contemporary cybernetics and to offer such a definition of cybernetics that corresponds both with cybernetics' original roots as well as its actual institutionalised research and development form. The article stresses deeply rooted engineering motivation of cybernetics, cybernetical man-machine metaphor, man-machine coupling and cybernetics as a discursive practice. The historical context is focused on the early period of American cybernetics and proto-cybernetics., and Jan Romportl.
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