Lubin-Tate spaces of dimension one are finite étale covers of the nonarchimedian open unit disk. We compute certain invariants which measure the ramification of this cover over the boundary of the disk.

For any complex polynomial P having all its zeros in the unit disk, we estimate rate of change argument (z) when point z runs through boundary this disk.

Numerous approximation algorithms for unit disk graphs have been proposed in the literature, exhibiting sharp trade-offs between running times and approximation ratios. We propose a method to obtain linear-time approximation algorithms for unit disk graph problems. Our method yields linear-time (4 + ε)-approximations to the maximum-weight independent set and the minimum dominating set, as well ...

We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k. If G is a unit disk graph, the problem is trivial to solve for k = 1. We show that even the slightest deviation from the trivial case (e.g., quasi unit disk graphs or k = 2) lea...

Let Fn(x) be the partition polynomial ∑k=1 pk(n)x where pk(n) is the number of partitions of n with k parts. We emphasize the computational experiments using degrees up to 70,000 to discover the asymptotics of these polynomials. Surprisingly, the asymptotics of Fn(x) have two scales of orders n and √ n and in three different regimes inside the unit disk. Consequently, the zeros converge to netw...

A function theoretic characterization is given of when a composition operator is compact on BMOA, the space of analytic functions on the unit disk having radial limits that are of bounded mean oscillation on the unit circle. When the symbol of the composition operator is univalent, compactness on BMOA is shown to be equivalent to compactness on the Bloch space, and a characterization in terms o...

We present a simple 3-approximation algorithm for minimum-weight dominating set and minimum-weight vertex cover in unit-disk graphs and quasi unit-disk graphs in which each node knows its coordinates. The algorithm is local: the output of a node depends solely on the input within its constantradius neighbourhood. The local horizon of the algorithm is small, both in the worst case and on average.

We present a self-contained discussion of the use of the transfer-matrix formalism to study onedimensional scattering. We elaborate on the geometrical interpretation of this transfer matrix as a conformal mapping on the unit disk. By generalizing to the unit disk the idea of turns, introduced by Hamilton to represent rotations on the sphere, we develop a method to represent transfer matrices by...

Recently, the generalized hypergeometric function is extended by utilizing the Beta function. Based on this type of function, we introduce a new operator in the open unit disk. The present article investigates some subordination and superordination results for certain normalized analytic functions in the open unit disk, which are acted upon by the generalized Noor integral operator. Some of out...

We give a criterion for q-valent analytic functions in the unit disk to belong to Q K , a Möbius-invariant space of functions analytic in the unit disk in the plane for a nonde-creasing function K : [0, ∞) → [0, ∞), and we show by an example that our condition is sharp. As corollaries, classical results on univalent functions, the Bloch space, BMOA, and Q p spaces are obtained. 1. Introduction....