Constrained variational problems on perturbed lattice graphs
Abstract
In this paper, we solve some constrained variational problems on perturbed lattice graphs G. The first problem addresses the existence of ground state normalized solutions to Schr\"odinger equations equation* \ aligned &-G u+λ u= up-2u,x∈ G & ul2(G)2=a. aligned . equation* We prove that if the graph is obtained by deleting finite edges in lattice graphs while maintaining connectivity, then there exists a threshold αG∈[0,∞) such that there do not exist ground state normalized solution if 0<a<αG, and there exists a ground state normalized solution if a>αG. If the graph is obtained by adding finite edges E' to lattice graphs, we prove that there exist E' and a1 such that for all a>a1, there do not exist ground state normalized solutions. The second problem concerns the existence of an extremal function for the Sobolev inequality. If the graph G is obtained by deleting finite edges in lattice graphs while maintaining connectivity, for the Sobolev super-critical regime, we prove that there exists an extremal function. for the Sobolev critical regime, we prove that there exists G such that extremal can be attained. If the graph is obtained by adding finite edges E' to lattice graphs, we prove that there exists E' such that there does not exist an extremal function.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.