On arithmetical structures on complete graphs

DOI10.2140/INVOLVE.2020.13.345MaRDI QIDQ2309724zbMATH OpenOpenAlexFDO

Authors Joel Louwsma, Zachary A. Harris

Publication date 1 April 2020

Published in Involve (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1909.02022

zbMATH Keywords

arithmetical structurecomplete graphDiophantine equationLaplacian matrixprime number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Primes (11A41) Rational numbers as sums of fractions (11D68)

Abstract: An arithmetical structure on the complete graph $K_n$ with $n$ vertices is given by a collection of $n$ positive integers with no common factor each of which divides their sum. We show that, for all positive integers $c$ less than a certain bound depending on $n$, there is an arithmetical structure on $K_n$ with largest value $c$. We also show that, if each prime factor of $c$ is greater than $(n+1{)}^2/4$, there is no arithmetical structure on $K_n$ with largest value $c$. We apply these results to study which prime numbers can occur as the largest value of an arithmetical structure on $K_n$.

Review text

One can begin with authors' abstract: ``An arithmetical structure on the complete graph \(K_n\) with \(n\) vertices is given by a collection of \(n\) positive integers with no common factor, each of which divides their sum. We show that, for all positive integers \(c\) less than a certain bound depending on \(n\), there is an arithmetical structure on \(K_n\) with largest value \(c\). We also show that, if each prime factor of \(c\) is greater than \({(n+1)^2}/4\), there is no arithmetical structure on \(K_n\) with largest value \(c\). We apply these results to study which prime numbers can occur as the largest value of an arithmetical structure on \(K_n\). This paper starts with the consideration of the following question: ``How can one have a collection of positive integers, with no common factor, each of which divides their sum? Also, the survey of this paper is devoted to the notion of arithmetical structures. Special attention is given to some conjecture. The results presented are explained.

Recommendations

• Bounding the number of arithmetical structures on graphs
• Arithmetical structures on graphs
• Counting arithmetical structures on paths and cycles
• The extremal spectral radii of the arithmetical structures on paths
• Algorithmic aspects of arithmetical structures

Cites work

• All the solutions of the equation \(\sum ^{11}_{i=1} \frac{1}{x_i}= 1\) in distinct integers of the form \(x_i \in 3^{\alpha} 5^{\beta} 7^{\gamma}\)
• Arithmetical graphs
• Arithmetical structures on graphs
• Counting arithmetical structures on paths and cycles
• scientific article; zbMATH DE number 3675978 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• On the number of solutions of \(\sum^{11}_{i=1}\frac {1}{x_i}=1\) in distinct odd natural numbers
• On the number of solutions of the Diophantine equation \(\sum_{i=1}^n\frac{1}{i}=1\)
• The equation \(\sum ^9_{i=1} \frac {1}{x_i} = 1\) in distinct odd integers has only the five known solutions

Cited in

(10)

• On arithmetic infinite graphs
• Bounding the number of arithmetical structures on graphs
• The extremal spectral radii of the arithmetical structures on paths
• Arithmetical structures on graphs
• Algorithmic aspects of arithmetical structures
• Arithmetical structures on graphs with connectivity one
• scientific article; zbMATH DE number 4033798 (Why is no real title available?)
• scientific article; zbMATH DE number 465440 (Why is no real title available?)
• Arithmetical structures on paths with a doubled edge
• Arithmetical structures on dominated polynomials

This page was built for publication: On arithmetical structures on complete graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2309724)