Eigenvalue problem meets Sierpinski triangle: computing the spectrum of a non-self-adjoint random operator

Details Eigenvalue problem meets Sierpinski triangle: computing the spectrum of a non-self-adjoint random operator Eigenvalue problem meets Sierpinski triangle: computing the spectrum of a non-self-adjoint random operator

2010-03-20

arxiv.org/abs/1003.3946v3

Physics

Mathematical Physics

Scientific paper

The purpose of this paper is to prove that the spectrum of the non-self-adjoint one-particle Hamiltonian proposed by J. Feinberg and A. Zee (Phys. Rev. E 59 (1999), 6433--6443) has interior points. We do this by first recalling that the spectrum of this random operator is the union of the set of $\ell^\infty$ eigenvalues of all infinite matrices with the same structure. We then construct an infinite matrix of this structure for which every point of the open unit disk is an $\ell^\infty$ eigenvalue, this following from the fact that the components of the eigenvector are polynomials in the spectral parameter whose non-zero coefficients are $\pm 1$'s, forming the pattern of an infinite discrete Sierpinski triangle.

Affiliated with

Also associated with

No associations

Rating

Eigenvalue problem meets Sierpinski triangle: computing the spectrum of a non-self-adjoint random operator does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Eigenvalue problem meets Sierpinski triangle: computing the spectrum of a non-self-adjoint random operator, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Eigenvalue problem meets Sierpinski triangle: computing the spectrum of a non-self-adjoint random operator will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127375