Modular Leech trees of order at most 8 (Q471788): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Summary: \textit{J. Leech} [Am. Math. Mon. 82, 923--925 (1975; Zbl 0322.05103)] asked when can the edges of a tree on \(n\) vertices be labeled with positive integers such that the sums along the paths are exactly the integers \(1,2, \dots, {\binom n2}\). He found five such trees, and no additional trees have been discovered since. \textit{D. Leach} and \textit{M. Walsh} [J. Comb. Math. Comb. Comput. 78, 15--22 (2011; Zbl 1234.05056)] introduced the idea of labeling trees with elements of the group \(\mathbb Z_k\) where \(k = {\binom n2} + 1\) and examined the cases for \(n \leq 6\). In this paper we show that no modular Leech trees of order 7 exist, and we find all modular Leech trees of order 8. | |||
Property / review text: Summary: \textit{J. Leech} [Am. Math. Mon. 82, 923--925 (1975; Zbl 0322.05103)] asked when can the edges of a tree on \(n\) vertices be labeled with positive integers such that the sums along the paths are exactly the integers \(1,2, \dots, {\binom n2}\). He found five such trees, and no additional trees have been discovered since. \textit{D. Leach} and \textit{M. Walsh} [J. Comb. Math. Comb. Comput. 78, 15--22 (2011; Zbl 1234.05056)] introduced the idea of labeling trees with elements of the group \(\mathbb Z_k\) where \(k = {\binom n2} + 1\) and examined the cases for \(n \leq 6\). In this paper we show that no modular Leech trees of order 7 exist, and we find all modular Leech trees of order 8. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C07 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6370091 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
edge labelling | |||
Property / zbMATH Keywords: edge labelling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tree | |||
Property / zbMATH Keywords: tree / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
path sum | |||
Property / zbMATH Keywords: path sum / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
labellings from abelian groups | |||
Property / zbMATH Keywords: labellings from abelian groups / rank | |||
Normal rank |
Revision as of 17:50, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Modular Leech trees of order at most 8 |
scientific article |
Statements
Modular Leech trees of order at most 8 (English)
0 references
17 November 2014
0 references
Summary: \textit{J. Leech} [Am. Math. Mon. 82, 923--925 (1975; Zbl 0322.05103)] asked when can the edges of a tree on \(n\) vertices be labeled with positive integers such that the sums along the paths are exactly the integers \(1,2, \dots, {\binom n2}\). He found five such trees, and no additional trees have been discovered since. \textit{D. Leach} and \textit{M. Walsh} [J. Comb. Math. Comb. Comput. 78, 15--22 (2011; Zbl 1234.05056)] introduced the idea of labeling trees with elements of the group \(\mathbb Z_k\) where \(k = {\binom n2} + 1\) and examined the cases for \(n \leq 6\). In this paper we show that no modular Leech trees of order 7 exist, and we find all modular Leech trees of order 8.
0 references
edge labelling
0 references
tree
0 references
path sum
0 references
labellings from abelian groups
0 references