
TL;DR
This paper explores the combinatorial structures related to permutations, graphs, and mappings, focusing on their theoretical properties and how well existing models match experimental data, while raising open questions.
Contribution
It extends previous work on decomposable combinatorial structures in the exp-log class, analyzing their properties and identifying gaps between theory and experiments.
Findings
Analysis of combinatorial structures in the exp-log class
Assessment of theory versus experimental data
Open questions raised for future research
Abstract
This is a sequel to our paper "Permute, Graph, Map, Derange", involving decomposable combinatorial labeled structures in the exp-log class of type a=1/2, 1, 3/2, 2. As before, our approach is to establish how well existing theory matches experimental data and to raise open questions.
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
Topicsgraph theory and CDMA systems · Advanced Combinatorial Mathematics · Computational Geometry and Mesh Generation
