Cyclic Equalizability Characterized by Parikh Vectors

math.CO, cs.CR

Submitted: 2026-04-21

Updated: 2026-10-19

Comments: This paper has appeared at ICTAC 2026

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Related papers

• Exponential random graph models with soft clique constraints
• Two Linear Programs are Better than One
• Exact Enumeration of Phylogenetic Networks: The Tree-Child, Reticulation-Visible and Orchard Hierarchy
• A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs
• Arithmetic Circuits and Neural Networks for Regular Matroids
• On composition and decomposition operations for vector spaces, graphs and matroids