We analyze the optimal behavior of two players who are lost on a planar surface and who want to meet each other in least expected time. They each know the initial distribution of the other’s location, but have no common labeling of points, and so cannot simply go to a location agreed to in advance. They have no compasses, so do not even have a common notion of North. For simplicity, we restrict...

Fekete’s lemma is a well known combinatorial result on number sequences. Here we extend it to the multidimensional case, i.e., to sequences of d-tuples, and use it to study the behaviour of a certain class of dynamical systems.

Let n ≥ 4 be even. It is shown that every set S of n points in the plane can be connected by a (possibly self-intersecting) spanning tour (Hamiltonian cycle) consisting of n straight line edges such that the angle between any two consecutive edges is at most 2π/3. For n = 4 and 6, this statement is tight. It is also shown that every even-element point set S can be partitioned into at most two s...

Paul Larson and Erich Neuhold are previous TCDE chairs and have served TCDE for many years revitalizing its activities. Their valuable experience will be greatly appreciated for promoting TCDE and for serving its members. David Lomet, a previous TCDE chair, has been Chief Editor of Data Engineering Bulletin since 1992. It is his leadership that has been at the heart of the success of IEEE Data ...

We prove that a nonempty, proper subset S of the complex plane can be approximated in a strong sense by polynomial filled Julia sets if and only if S is bounded and Ĉ \ int(S) is connected. The proof that such a set is approximable by filled Julia sets is constructive and relies on Fekete polynomials. Illustrative examples are presented. We also prove an estimate for the rate of approximation i...

1. Abu-Hayyeh, R., Murray, G., Fekete, L. (2014). Swiss referendum: flying the flag for nativism. W: „Race&Class”, Vol. 56(1). Google Scholar

We compute approximate Fekete points for weighted polynomial interpolation by a recent algorithm based on QR factorizations of Vandermonde matrices. We consider in particular the case of univariate and bivariate functions with prescribed poles or other singularities, which are absorbed in the basis by a weight function. Moreover, we apply the method to the construction of real and complex weigh...