Cyclically symmetric entropy inequalities

摘要

A cyclically symmetric entropy inequality is of the form hO≥chO', where hO and hO' are two cyclic orbit entropy terms. A computational approach is formulated for bounding the extremal value of c̅, which is denoted by c̅O,O'. For two non-empty orbits O and O' of a cyclic group, it is said that O dominates O' if c̅O,O' = 1. Special attention is paid to characterizing such dominance relationship, and a graphical method is developed for that purpose.