Magic permutations for covering clutters
Let be a covering clutter, let be its magic subspace, and let a magic permutation be a permutation of realizable by a positive point in . For a permutation of , define the reverse dominance order on by declaring when, after writing and in decreasing order according to , their cardinalities and corresponding indices satisfy the inequalities in the definition above. Magic permutations conjecture. A permutation of is realizable by a positive point in the magic subspace of the covering clutter if and only if is an antichain in the reverse dominance order due to . The archetype is magic squares; the conjecture was verified for magic and semimagic squares, while the general characterization remains open.
References
- Matthias Beck and Thomas Zaslavsky, “An Enumerative Geometry for Magic and Magilatin Labellings”, arXiv:math/0506315 (2005).
Progress summary
A posted construction claims the conjecture is false, but the proposed counterexample has not been independently verified.
Beck formulated the magic permutations conjecture in 2005: realizability of a permutation should be equivalent to an antichain condition on the covering clutter. The general characterization was left open.
Known results
- Beck, 2005: the conjecture was verified for magic squares.
- Beck, 2005: it was also verified for semimagic squares.
Posted attempt
A proposed uniform covering clutter gives three four-element lines that form the required reverse-dominance antichain, while a positive linear identity shows the identity permutation cannot occur in the magic subspace. The construction also supplies a distinct positive labeling with equal line sums, so it claims a complete counterexample; it has not been independently verified.
Current status (as of August 2026): The conjecture is not settled; an unverified construction claims to disprove the general characterization, while the magic and semimagic cases remain verified.
Sources
Solutions 1
This solution needs a summarySee full solution
The conjecture is false even for a uniform covering clutter that possesses a strongly magic labeling.
Take , , and the three four-element lines
They cover , and, having equal cardinality, form a covering clutter. Their elements in decreasing -order are
These three tuples are pairwise incomparable coordinatewise: differ in opposite directions at their first and third entries; likewise; and differ in opposite directions at their first and second entries. Thus the three lines form an antichain in the required reverse-dominance order.
Write
If the identity permutation were realizable in the magic subspace, there would exist
with
But these equalities imply
a contradiction.
The example is nondegenerate: the pairwise-distinct positive labeling
satisfies
Hence the clutter does admit strongly magic labelings, but its identity permutation is not realizable despite satisfying the antichain criterion.