Graph-different permutations
J\'anos K\"orner, Claudia Malvenuto, G\'abor Simonyi
TL;DR
This paper introduces a new non-asymptotic graph invariant to analyze colliding permutations, broadening previous results and providing a deeper understanding of permutation interactions.
Contribution
It presents a novel non-asymptotic invariant for graphs, extending prior work on colliding permutations with a broader perspective.
Findings
New non-asymptotic graph invariant introduced
Broader perspective on colliding permutations achieved
Strengthened previous results with the new invariant
Abstract
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Combinatorial Mathematics · graph theory and CDMA systems