• Corpus ID: 173188732

More on Numbers and Graphs

@article{Knill2019MoreON,
  title={More on Numbers and Graphs},
  author={Oliver Knill},
  journal={ArXiv},
  year={2019},
  volume={abs/1905.13387}
}
  • O. Knill
  • Published 31 May 2019
  • Mathematics
  • ArXiv
In this note we revisit a "ring of graphs" Q in which the set of finite simple graphs N extend the role of the natural numbers and the signed graphs Z extend the role of the integers. We point out the existence of a norm which allows to complete Q to a real or complex Banach algebra R or C. 

Figures from this paper

REMARKS ABOUT THE ARITHMETIC OF GRAPHS

The arithmetic of N ⊂ Z ⊂ Q ⊂ R can be extended to a graph arithmetic N ⊂ Z ⊂ Q ⊂ R, where N is the semi-ring of finite simple graphs and where Z,Q are integral domains culminating in a Banach

Extending the vision of Shannon

The arithmetic of N ⊂ Z ⊂ Q ⊂ R can be extended to a graph arithmetic N ⊂ Z ⊂ Q ⊂ R, where N is the semi-ring of finite simple graphs and where Z,Q are integral domains culminating in a Banach

The energy of a simplicial complex

Remarks about the Arithmetic of Graphs

TLDR
This work illustrates the compatibility with topology and spectral theory of multiplicative linear functionals like Euler characteristic, the Poincaré polynomial, zeta functions, which can be extended naturally naturally to graph arithmetic.

References

SHOWING 1-10 OF 10 REFERENCES

On product graphs

In this paper we study product graphs and obtain some results. Wealso indicate the scope of its applications in a variety of fields.

On the arithmetic of graphs

The Zykov ring of signed finite simple graphs with topological join as addition and compatible multiplication is an integral domain but not a unique factorization domain. We know that because by

The strong ring of simplicial complexes

TLDR
The isomorphism of R with a subring of the strong Sabidussi ring shows that the multiplicative primes in R are the simplicial complexes and that every connected element in the strong ring has a unique prime factorization.

Product Graphs: Structure and Recognition

Basic Concepts. Hypercubes. Hamming Graphs. Cartesian Products. Strong and Direct Products. Lexicographic Products. Fast Recognition Algorithms. Invariants. Appendices. Bibliography. Indexes.

THE KÜNNETH FORMULA FOR GRAPHS

We define a Cartesian product G ×H for finite simple graphs which satisfies the Künneth formula H(G × H) = ⊕i+j=kH(G) ⊗ H(G) and so pG×H(x) = pG(x)pH(y) for the Poincaré polynomial pG(x) = ∑ k=0

On numbers and games

  • R. Guy
  • Mathematics
    Proceedings of the IEEE
  • 1978
TLDR
The motivation for ONAG may have been, and perhaps was-and I would like to think that it was-the attempt to bridge the theory gap between nim-like and chess-like games.

On some properties of linear complexes

  • (russian). Mat. Sbornik N.S., 24(66):163– 188
  • 1949

Graph multiplication

On some properties of linear complexes. (russian)

  • Mat. Sbornik N.S
  • 1949

Surreal numbers

  • Addison-Wesley Professional
  • 1974