Abelian Ramsey Length and Asymptotic Lower Bounds
Vincent Jug\'e
TL;DR
This paper investigates the asymptotic lower bounds of abelian Ramsey lengths, providing insights into their growth behavior and limitations within combinatorial mathematics.
Contribution
It introduces a new evaluation method for asymptotic lower bounds on abelian Ramsey lengths, advancing understanding of their theoretical properties.
Findings
Established a new asymptotic lower bound for abelian Ramsey lengths
Demonstrated limitations of existing bounds in certain cases
Provided a framework for future research in abelian combinatorics
Abstract
This technical note aims at evaluating an asymptotic lower bound on abelian Ramsey lengths.
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 Topology and Set Theory · Computability, Logic, AI Algorithms