The full-root and maximal-antichain bijection conjecture

At least 21 years old · documented by

Let Φ\Phi be a finite root system of rank nn, with positive roots ordered by root order. A full root is a positive root whose support is the full Dynkin diagram, and an antichain has no two comparable elements. Full-root bijection conjecture. There should be a natural bijection between the full roots and the antichains of cardinality n−1n-1 containing no simple roots. The paper obtains this as a reformulation of the preceding type-preserving duality conjecture, using that antichains of cardinality n−1n-1 have full type exactly when they contain no simple roots. Its status is not resolved in the supplied text.

References

Primary source

Frederic Chapoton, “Sur le nombre de reflexions pleines dans les groupes de Coxeter finis”, arXiv:math/0405371 (2004).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.