Sharp Bounds on the Number of Scattering Poles in the Two Dimensional Case
β Scribed by Georgi Vodev
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 458 KB
- Volume
- 170
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We consider graphs __G = (V,E)__ with order Ο = |__V__|, size __e__ = |__E__|, and stability number Ξ²~0~. We collect or determine upper and lower bounds on each of these parameters expressed as functions of the two others. We prove that all these bounds are sharp. Β© __1993 by John Wiley
For a class of compactly supported hypoelliptic perturbations of the Laplacian in R n , n 3 odd, we prove that an asymptotic on the number of the eigenvalues of the corresponding reference operator implies a similar asymptotic for the number of the scattering poles.
The interval number of a graph G, denoted by i(G), is the least natural number t such that G is the intersection graph of sets, each of which is the union of at most t intervals. Here we settle a conjecture of Griggs and West about bounding i(G) in terms of e, that is, the number of edges in G. Name
A new method for array pattern synthesis in the presence of near-zone scatterers in the two-dimensional scalar case is presented. The synthesis is based on the minimization of an objecti¨e function using the simulated annealing technique. To take into account the effects of the scatterers, the physi