Papers
Topics
Authors
Recent
Search
2000 character limit reached

The discrete Laplacian of a 2-simplicial complex

Published 23 Feb 2018 in math.SP and math.FA | (1802.08422v1)

Abstract: In this paper, we introduce the notion of oriented faces especially triangles in a connected oriented locally finite graph. This framework then permits to define the Laplace operator on this structure of the 2-simplicial complex. We develop the notion of $\chi$-completeness for the graphs, based on the cutoff functions. Moreover, we study essential self-adjointness of the discrete Laplacian from the $\chi$-completeness geometric hypothesis.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.