Papers
Topics
Authors
Recent
Search
2000 character limit reached

Spectral Gap of The Discrete Laplacian On Triangulations

Published 12 Jul 2019 in math.SP | (1907.05619v1)

Abstract: Our goal in this paper is to find an estimate for the spectral gap of the Laplacian on a 2-simplicial complex consisting on a triangulation of a complete graph. An upper estimate is given by generalizing the Cheeger constant. The lower estimate is obtained from the first non-zero eigenvalue of the discrete Laplacian acting on the functions of certain sub-graphs.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

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

Sign Up to Generate

Open Problems

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

Generate Now

Continue Learning

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

Generate Now

Authors (1)

  1. Yassin Chebbi 

Collections

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

Sign Up