On Arithmetical Structures on Complete Graphs
Zachary Harris, Joel Louwsma

TL;DR
This paper characterizes the possible largest values in arithmetical structures on complete graphs, establishing bounds and prime factor conditions, and explores which primes can occur as maximum values.
Contribution
It provides bounds and prime factor conditions for the largest values in arithmetical structures on complete graphs, advancing understanding of their possible configurations.
Findings
Existence of arithmetical structures with largest value less than a certain bound
Non-existence of structures when prime factors exceed a threshold
Characterization of primes that can be largest values
Abstract
An arithmetical structure on the complete graph with vertices is given by a collection of positive integers with no common factor each of which divides their sum. We show that, for all positive integers less than a certain bound depending on , there is an arithmetical structure on with largest value . We also show that, if each prime factor of is greater than , there is no arithmetical structure on with largest value . We apply these results to study which prime numbers can occur as the largest value of an arithmetical structure on .
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.
