• Corpus ID: 224707513

Green functions of Energized complexes

@article{Knill2020GreenFO,
  title={Green functions of Energized complexes},
  author={Oliver Knill},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.09152}
}
  • O. Knill
  • Published 19 October 2020
  • Mathematics
  • ArXiv
If h is a ring-valued function on a simplicial complex G we can define two matrices L and g, where the matrix entries are the h energy of homoclinic intersections. We know that the sum over all h values on G is equal to the sum of the Green matrix entries g(x,y). We also have already seen that that the determinants of L or g are both the product of the h(x). In the case where h(x) is the parity of dimension, the sum of the energy values was the standard Euler characteristic and the determinant… 

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

Graph complements of circular graphs

TLDR
There is now a non-trivial 6-periodic Gauss-Bonnet curvature universality in the complement of Barycentric limits, which produces a 12-periodicity of the Lefschetz numbers of all graph automorphisms of Gn.

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

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 13 REFERENCES

The energy of a simplicial complex

Energized simplicial complexes

TLDR
Isospectral multi-graphs defined by adjacency matrices L^++ or L^-- which have identical spectral or Ihara zeta function are obtained.

The McKean-Singer Formula in Graph Theory

TLDR
The McKean-Singer formula chi(G) = str(exp(-t L)) which holds for any complex time t, and is proved to allow to find explicit pairs of non-isometric graphs which have isospectral Dirac operators.

The counting matrix of a simplicial complex

For a finite abstract simplicial complex G with n sets, define the n x n matrix K(x,y) which is the number of subsimplices in the intersection of x and y. We call it the counting matrix of G.

Cauchy-Binet for Pseudo-Determinants

Curvature and the Eigenvalues of the Laplacian

A famous formula of H. Weyl [17] states that if D is a bounded region of R d with a piecewise smooth boundary B, and if 0 > γ1 ≥ γ2 ≥ γ3 ≥ etc. ↓−∞ is the spectrum of the problem

TOPOLOGICAL INVARIANTS OF NEW TYPE OF FINITE POLYHEDRONS

We describe in this paper a general method of deducing from homo-topy invariants of spaces or systems of spaces invariants of a finitepolyhedron which are invariants of the topological type of the

The amazing world of simplicial complexes

Defined by a single axiom, finite abstract simplicial complexes belong to the simplest constructs of mathematics. We look at a a few theorems.

Polytopes, graphs, and complexes