Cookies on this website

We use cookies to ensure that we give you the best experience on our website. If you click 'Accept all cookies' we'll assume that you are happy to receive all cookies and you won't see this message again. If you click 'Reject all non-essential cookies' only necessary cookies providing core functionality such as security, network management, and accessibility will be enabled. Click 'Find out more' for information on how to change your cookie settings.

Discrete Fourier analysis is used to obtain simple proofs of certain inequalities about finite number sequences determined by Fan, Taussky, and Todd [Monatsh. Math. 59 (1955), 73-90] and their converses determined by Milovanović and Milovanović [J. Math., Anal. Appl.88 (1992), 378-387]. Using the same techniques, the inequality [formula] is proved for all real numbers 0=b 0 , b 1 , …, b n , b n+1 =0, which answers a question raised by Alzer [J. Math. Anal. Appl.161 (1991), 142-147]. Second, the method is used to obtain the eigenvalues and eigenvectors of matrices (a ij ) that are rotation-invariant, i.e., that obey (a ij )=(a (i+1)(j+1) ). © 1994 Academic Press, Inc.

Original publication




Journal article


Journal of Mathematical Analysis and Applications

Publication Date





464 - 476