Related papers: The monic integer transfinite diameter
We consider the problem of determining the monic integer transfinite diameter for real intervals $I$ of length less than 4. We show that $t_M([0,x])$, as a function in $x>0$, is continuous, therefore disproving two conjectures due to Hare…
We study the problem of minimizing the supremum norm by monic polynomials with integer coefficients. Let ${\M}_n({\Z})$ denote the monic polynomials of degree $n$ with integer coefficients. A {\it monic integer Chebyshev polynomial} $M_n…
We establish a higher-dimensional irrationality criterion for periods which are presented as Mellin integrals depending on many parameters. The criterion is stated as an upper bound on the multi-variate transfinite diameter of the image of…
The modified Farey sequence consists, at each level k, of rational fractions r_k^{(n)}, with n=1, 2, ...,2^k+1. We consider I_k^{(e)}, the total length of (one set of) alternate intervals between Farey fractions that are new (i.e., appear…
Given a compact set $K$ one may define a transfinite diameter for $K$ via a limiting process involving maximising a Vandermonde determinant over $K$ with respect to a monomial basis. Different transfinite diameters may be obtained by using…
We define $F$-polynomials as linear combinations of dilations by some frequencies of an entire function $F$. In this paper we use Pade interpolation of holomorphic functions in the unit disk by $F$-polynomials to obtain explicitly…
The problem of replacing an integral norm with respect to a given probability measure by the corresponding integral norm with respect to a discrete measure is discussed in the paper. The above problem is studied for elements of finite…
In this note, we consider the monoid $\mathcal{PIM}_{n}$ of all partial monotone transformations on a chain with $n$ elements whose domains and ranges are intervals and its submonoid $\mathcal{IM}_{n}$ constituted by the full…
We study Chebyshev constants and transfinite diameter on the graph of a polynomial mapping $f\colon\mathbb{C}^2\to\mathbb{C}^2$. We show that two transfinite diameters of a compact subset of the graph (i.e., defined with respect to two…
We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…
Given an ideal I in a polynomial ring, we consider the largest monomial subideal contained in I, denoted mono(I). We study mono as an interesting operation in its own right, guided by questions that arise from comparing the Betti tables of…
We provide a general framework and indicate relations between the notions of transfinite diameter, homogeneous transfinite diameter, and weighted transfinite diameter for sets in C^N. An ingredient is a formula of Rumely which relates the…
Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…
In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…
Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…
A monotone function interval is the set of monotone functions that lie pointwise between two fixed monotone functions. We characterize the set of extreme points of monotone function intervals and apply this to a number of economic settings.…
We begin the study of the notion of diameter of an ideal I of a polynomial ring S over a field, an invariant measuring the distance between the minimal primes of I. We provide large classes of Hirsch ideals, i.e. ideals with diameter not…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
We show that minimizing a convex function over the integer points of a bounded convex set is polynomial in fixed dimension.
For a fixed positive integer d, we show the existence of the limiting gap distribution measure for the sets of Farey fractions a/q of order Q with a not divisible by d, and respectively with q relatively prime with d, as Q tends to…