On a problem of Favard concerning algebraic integers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Extremu M Problem concerning Algebraic Polynomials

Let S " he the set of all polynomials whose degree does not exceed n and whose all zeros are real but lie outside (-1, 1). Similarly, we say p"E Q " if p,(x) is a real polynomial whose all zeros lie outside the open disk with center at the origin and radius l. Further we will denote by H " the set of all polynomials of degree-n and of the form k=O where q,,k (x) = (1 +x)k (l-x)"-'. Elements of ...

متن کامل

Algebraic Numbers and Algebraic Integers

c © W W L Chen, 1984, 2013. This chapter originates from material used by the author at Imperial College London between 1981 and 1990. It is available free to all individuals, on the understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied, with or without permission from the author. However, this document may not be kept on any information storage an...

متن کامل

On Z-Modules of Algebraic Integers

Let q be an algebraic integer of degree d ≥ 2. Consider the rank of the multiplicative subgroup of C generated by the conjugates of q. We say q is of full rank if either the rank is d− 1 and q has norm±1, or the rank is d. In this paper we study some properties of Z[q] where q is an algebraic integer of full rank. The special cases of when q is a Pisot number and when q is a Pisot-cyclotomic nu...

متن کامل

DHT algorithm based on encoding algebraic integers

Introduction: The discrete Hartley transform (DHT) is an attractive alternative to the discrete Fourier transform (DFT) because of its real-valued computation and properties similar to those of the DFT [1]. Another interesting property of the DHT is that the same kernel is used for both the transform and its inverse transform. Consequently, since its introduction the DHT has found its way to ma...

متن کامل

On a Sumset Problem for Integers

Let A be a finite set of integers. We show that if k is a prime power or a product of two distinct primes then |A + k ·A| > (k + 1)|A| − dk(k + 2)/4e provided |A| > (k − 1)2k!, where A + k ·A = {a + kb : a, b ∈ A}. We also establish the inequality |A + 4 ·A| > 5|A| − 6 for |A| > 5.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1984

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700001763