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
.
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.89
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.