Abstract:We consider the resonances of the self-adjoint three-dimensional Schrödinger operator with point interactions of constant strength supported on the set X = {xn} N n=1 . The size of X is defined by VX = maxπ∈Π N N n=1 |xn−x π(n) |, where ΠN is the family of all the permutations of the set {1, 2, . . . , N }. We prove that the number of resonances counted with multiplicities and lying inside the disc of radius R behaves asymptotically linearwhere the constant WX ∈ [0, VX ] can be seen as the effective size of X.… Show more
“…The logic behind this is that the equality s 1 := (s 2 + s 0 )/2 simplifies the formulation of Theorem 4.4. The N-size s N was called in [40] the size of Y and used to define Weyl and non-Weyl types of asymptototics for N H a,Y (·) (see the beginning of Section 4).…”
Section: Overview Of Main Results and Methods Of The Papermentioning
confidence: 99%
“…However this theorem give a hint how one can define the structural parameters even if the decomposition of Σ(H) into asymptotic sequences is not available. With this aim we use counting functions in 'shaped strips' similar to that of [47,48] The above definition of Ad log (+∞) is natural because, for H a,Y and for quantum graphs, this limit exists and has a finite value that was studied in [14,13,40,6] in connection with Weyl-type asymptotics of N H (·). For H a,Y and for quantum graphs, the function Ad log : (−∞, +∞] → [0, +∞) is bounded, nondecreasing and satisfies Ad log (µ) = 0 for µ < 0 and Ad log (µ) = Ad log (+∞) for large enough µ (this follows from the definition, results of [13,14,40], and Theorem 3.4).…”
Section: Overview Of Main Results and Methods Of The Papermentioning
confidence: 99%
“…Recall that the counting function N H (·) for resonances is defined by N H (R) := #{k ∈ Σ(H) : |k| ≤ R}, (1.2) where #E is the number of elements of a multiset E. The study of the asymptotics of N(R) as R → ∞ for scattering poles associated with compactly supported potentials in R m with odd m ≥ 3 was initiated in [41] (for the relation between the notions of scattering poles and resonances, see [17,56]). This study was continued [53,23,45,11,50] and extended to a geometric scattering (see reviews in [55,17,56]), to quantum graphs [13,14,39,22], and to point interaction Hamiltonians H a,Y [40,6]. For any unbounded set S ⊂ C, one can define a restricted version of the counting function N S H (R) := #{k ∈ S ∪ Σ(H) : |k| ≤ R}.…”
Section: Main Goals and Related Studiesmentioning
confidence: 99%
“…In the process of summation of exp-monomials of (2.3) some of the terms may cancel so that, for a certain permutation σ ∈ S N , α(σ) is not a frequency of D. If this is the case, we say that there is frequency cancellation for the pair {a, Y } (for two different examples of frequency cancellation see [40] and Section 4.3).…”
Section: Logarithmic Asymptotic Chains Of Resonances 31 the Distribumentioning
confidence: 99%
“…For the following considerations let us recall that the m-sizes s m of Y were defined in Section 1 and that the value s N was introduced in [40] and called the size of Y . Let N H a,Y (·) be the resonance counting function defined by (1.2) with H = H a,Y .…”
Section: Geometry Of Y and Parameters Of Asymptoticsmentioning
We prove that the asymptotic distribution of resonances has a multilevel internal structure for the following classes of Hamiltonians H: Schrödinger operators with point interactions in R 3 , quantum graphs, and 1-D photonic crystals. In the case of N ≥ 2 point interactions, the set of resonances Σ(H) essentially consists of a finite number of sequences with logarithmic asymptotics. We show how the leading parameters µ of these sequences are connected with the geometry of the set Y = {y j } N j=1 of interaction centers y j ∈ R 3 . The minimal parameter µ min corresponds to the sequences with 'more narrow' and so more observable resonances. The asymptotic density of such narrow resonances can be expressed via the multiplicity of µ min , which occurs to be connected with the symmetries of Y and naturally introduces a finite number of classes of configurations of Y . In the case of quantum graphs and 1-D photonic crystals, the decomposition of Σ(H) into a finite number of asymptotic sequences is proved under additional commensurability conditions. To address the case of a general quantum graph, we introduce families of special asymptotic density functions for two classes of strips in C. The obtained results and effects are compared with those of obstacle scattering.
“…The logic behind this is that the equality s 1 := (s 2 + s 0 )/2 simplifies the formulation of Theorem 4.4. The N-size s N was called in [40] the size of Y and used to define Weyl and non-Weyl types of asymptototics for N H a,Y (·) (see the beginning of Section 4).…”
Section: Overview Of Main Results and Methods Of The Papermentioning
confidence: 99%
“…However this theorem give a hint how one can define the structural parameters even if the decomposition of Σ(H) into asymptotic sequences is not available. With this aim we use counting functions in 'shaped strips' similar to that of [47,48] The above definition of Ad log (+∞) is natural because, for H a,Y and for quantum graphs, this limit exists and has a finite value that was studied in [14,13,40,6] in connection with Weyl-type asymptotics of N H (·). For H a,Y and for quantum graphs, the function Ad log : (−∞, +∞] → [0, +∞) is bounded, nondecreasing and satisfies Ad log (µ) = 0 for µ < 0 and Ad log (µ) = Ad log (+∞) for large enough µ (this follows from the definition, results of [13,14,40], and Theorem 3.4).…”
Section: Overview Of Main Results and Methods Of The Papermentioning
confidence: 99%
“…Recall that the counting function N H (·) for resonances is defined by N H (R) := #{k ∈ Σ(H) : |k| ≤ R}, (1.2) where #E is the number of elements of a multiset E. The study of the asymptotics of N(R) as R → ∞ for scattering poles associated with compactly supported potentials in R m with odd m ≥ 3 was initiated in [41] (for the relation between the notions of scattering poles and resonances, see [17,56]). This study was continued [53,23,45,11,50] and extended to a geometric scattering (see reviews in [55,17,56]), to quantum graphs [13,14,39,22], and to point interaction Hamiltonians H a,Y [40,6]. For any unbounded set S ⊂ C, one can define a restricted version of the counting function N S H (R) := #{k ∈ S ∪ Σ(H) : |k| ≤ R}.…”
Section: Main Goals and Related Studiesmentioning
confidence: 99%
“…In the process of summation of exp-monomials of (2.3) some of the terms may cancel so that, for a certain permutation σ ∈ S N , α(σ) is not a frequency of D. If this is the case, we say that there is frequency cancellation for the pair {a, Y } (for two different examples of frequency cancellation see [40] and Section 4.3).…”
Section: Logarithmic Asymptotic Chains Of Resonances 31 the Distribumentioning
confidence: 99%
“…For the following considerations let us recall that the m-sizes s m of Y were defined in Section 1 and that the value s N was introduced in [40] and called the size of Y . Let N H a,Y (·) be the resonance counting function defined by (1.2) with H = H a,Y .…”
Section: Geometry Of Y and Parameters Of Asymptoticsmentioning
We prove that the asymptotic distribution of resonances has a multilevel internal structure for the following classes of Hamiltonians H: Schrödinger operators with point interactions in R 3 , quantum graphs, and 1-D photonic crystals. In the case of N ≥ 2 point interactions, the set of resonances Σ(H) essentially consists of a finite number of sequences with logarithmic asymptotics. We show how the leading parameters µ of these sequences are connected with the geometry of the set Y = {y j } N j=1 of interaction centers y j ∈ R 3 . The minimal parameter µ min corresponds to the sequences with 'more narrow' and so more observable resonances. The asymptotic density of such narrow resonances can be expressed via the multiplicity of µ min , which occurs to be connected with the symmetries of Y and naturally introduces a finite number of classes of configurations of Y . In the case of quantum graphs and 1-D photonic crystals, the decomposition of Σ(H) into a finite number of asymptotic sequences is proved under additional commensurability conditions. To address the case of a general quantum graph, we introduce families of special asymptotic density functions for two classes of strips in C. The obtained results and effects are compared with those of obstacle scattering.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.