Diameter lower bounds for Waring graphs and multiloop networks (Q686473): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5598073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Waring's problem in GF (p) / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON WARING'S PROBLEM FOR FINITE FIELDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Related to Multimodule Memory Organizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3755475 / rank
 
Normal rank

Latest revision as of 10:09, 22 May 2024

scientific article
Language Label Description Also known as
English
Diameter lower bounds for Waring graphs and multiloop networks
scientific article

    Statements

    Diameter lower bounds for Waring graphs and multiloop networks (English)
    0 references
    0 references
    0 references
    21 March 1994
    0 references
    The Waring number for the power \(m\) is the smallest positive integer \(s\) such that every positive integer can be expressed as the sum of at most \(s\) numbers which are \(m\)th powers of integers. It may be defined also on the Galois field \(Z_ p\), where \(p\) is a prime number. Then it is denoted by \(g(p,m)\). The number \(g(p,m)\) can be determined with help of a certain graph called Waring graph. The paper presents a lower bound for \(g(p,m)\), using Euler's totient function. Further a theorem on circulant graphs is proved which generalizes that result.
    0 references
    multiloop networks
    0 references
    Waring number
    0 references
    Galois field
    0 references
    Waring graph
    0 references
    lower bound
    0 references
    circulant graphs
    0 references

    Identifiers