Transfinite Diameter with Generalized Polynomial Degree
نویسندگان
چکیده
منابع مشابه
Transfinite Diameter
The transfinite diameter is a way of quantifying the size of compact sets in Euclidean space. This quantity is related to the Hausdorff dimension and the Lebesgue measure, but gives a slightly different perspective on the set than either of those do. In this paper, we introduce the transfinite diameter, and outline some attempts to calculate this quantity for three sets in R. For z1, z2, . . . ...
متن کاملThe monic integer transfinite diameter
We study the problem of finding nonconstant monic integer polynomials, normalized by their degree, with small supremum on an interval I. The monic integer transfinite diameter tM(I) is defined as the infimum of all such supremums. We show that if I has length 1, then tM(I) = 1 2 . We make three general conjectures relating to the value of tM(I) for intervals I of length less than 4. We also con...
متن کاملTransfinite Diameter and the Resultant
We prove a formula for the Fekete-Leja transfinite diameter of the pullback of a set E ⊂ C by a regular polynomial map F , expressing it in terms of the resultant of the leading part of F and the transfinite diameter of E. We also establish the nonarchimedean analogue of this formula. A key step in the proof is a formula for the transfinite diameter of the filled Julia set of F .
متن کاملOn some interpolation problems in polynomial spaces with generalized degree
The aim of this paper is to study many interpolation problems in the space of polynomials of w-degree n. In order to do this, some new results concerning the polynomial spaces of w-degree are given. In this article, we consider only the case of functions in two variables. More details are obtained for the weight w = (1, w2). We found a set of conditions for which, Πn,w, the space of polynomials...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Potential Analysis
سال: 2020
ISSN: 0926-2601,1572-929X
DOI: 10.1007/s11118-020-09843-7