Two words are cyclically equalizable if and only if they have the same Parikh vector.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A new hierarchy classifies card shuffles by complexity with separation proofs, enabling a measure for protocol evaluation.
citing papers explorer
-
Cyclic Equalizability Characterized by Parikh Vectors
Two words are cyclically equalizable if and only if they have the same Parikh vector.
-
A Complexity Hierarchy of Shuffles in Card-Based Protocols
A new hierarchy classifies card shuffles by complexity with separation proofs, enabling a measure for protocol evaluation.