2007
DOI: 10.1142/s0129055x07003073
|View full text |Cite
|
Sign up to set email alerts
|

Approximations of Singular Vertex Couplings in Quantum Graphs

Abstract: We discuss approximations of the vertex coupling on a star-shaped quantum graph of n edges in the singular case when the wave functions are not continuous at the vertex and no edge-permutation symmetry is present. It is shown that the Cheon-Shigehara technique using δ interactions with nonlinearly scaled couplings yields a 2n-parameter family of boundary conditions in the sense of norm resolvent topology. Moreover, using graphs with additional edges one can approximate the`n +1 2´-parameter family of all time-… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

2008
2008
2015
2015

Publication Types

Select...
6
2
2

Relationship

5
5

Authors

Journals

citations
Cited by 35 publications
(26 citation statements)
references
References 27 publications
0
26
0
Order By: Relevance
“…An extension to vertices of higher degrees was done for the δ s -coupling in [CE04]; Theorem 8.2 is taken from this paper. The method based on adding δ vertices also works in cases without an edge-permutation symmetry giving at most a 2n parameter family of vertex couplings [ET07].…”
Section: Notesmentioning
confidence: 99%
“…An extension to vertices of higher degrees was done for the δ s -coupling in [CE04]; Theorem 8.2 is taken from this paper. The method based on adding δ vertices also works in cases without an edge-permutation symmetry giving at most a 2n parameter family of vertex couplings [ET07].…”
Section: Notesmentioning
confidence: 99%
“…The idea put forward in Ref. 21 was to change locally the graph topology by adding new edges in the vicinity of the vertex whose lengths shrink to zero in the approximation. This yielded a family of couplings with n+1 2 parameters and real matrices A, B.…”
Section: The Convergence Resultsmentioning
confidence: 99%
“…We see from (6) that m is equal to the rank of the matrix applied at Ψ V . We observe that the rank of this matrix, as well as of that applied at Ψ V , is not influences by any of the manipulations mentioned above, hence it is obvious that m = rank(B) and that such a choice is the only possible, i.e.…”
Section: Vertex Coupling In Quantum Graphsmentioning
confidence: 99%