Countable choice and compactness

We work in set-theory without choice ZF. Denoting by the countable axiom of choice, we show in that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak topology in ZF). We prove that this ball is (closely) convex-compact in the convex topology. Given a set I, a real number p1 (respectively p=0), and some closed subset F of [0,1]^I which is a bounded subset of ℓ^p(I), we show that (respectively DC, the axiom of Dependent Choices) implies the compactness of F.     

A non-normal topology generated by a two-point selection

We construct a two-point selection , where is the set of the irrational numbers, such that the space is not normal and it is not collectionwise Hausdorff either. Here, τ_f denotes the topology generated by the two-point selection f. This example answers a question posed by V. Gutev and T. Nogura. We also show that if is a two-point selection such that the topology τ_f has countable pseudocharacter, then τ_f is a Tychonoff topology.     

Peripheral polynomials of hyperbolic knots

If K is a hyperbolic knot in S³, an algebraic component of its character variety containing one holonomy of the complete hyperbolic structure of finite volume of S³K is an algebraic curve . The traces of the peripheral elements of K define polynomial functions in , which are related in pairs by polynomials (peripheral polynomials). These are determined by just two adjacent peripheral polynomials. The curves defined by the peripheral polynomials are all birationally equivalent to , with only one possible exception. The canonical peripheral polynomial relating the trace of the meridian with the trace of the canonical longitude of K, is a factor of the A-polynomial.     

Isovariant maps from free -manifolds to representation spheres

The isovariant version of Borsuk–Ulam type theorems has been studied by Wasserman and the first author. In this paper, first we consider the relation between the existence of C_n-isovariant maps from free C_n-manifolds to representation spheres and Borsuk–Ulam type inequalities for their dimensions. Our main result classifies the C_n-isovariant maps by C_n-isovariant homotopy types when a Borsuk–Ulam type inequality holds. For proving it, we use the multidegree of a C_n-equivariant map developed by the first author.     

Uniform asymptotic expansions of the Pollaczek polynomials

Two uniform asymptotic expansions are obtained for the Pollaczek polynomials P_n(cosθ;a,b). One is for , , in terms of elementary functions and in descending powers of . The other is for , in terms of a special function closely related to the modified parabolic cylinder functions, in descending powers of n. This interval contains a turning point and all possible zeros of P_n(cosθ) in θ(0,π/2].     

Limit shape of convex lattice polygons with minimal perimeter

Let n be a positive integer and · any norm in . Denote by B the unit ball of · and the class of convex lattice polygons with n vertices and least ·-perimeter. We prove that after suitable normalization, all members of tend to a fixed convex body, as n→∞.     

Proximity problems on line segments spanned by points

Finding the closest or farthest line segment (line) from a point are fundamental proximity problems. Given a set S of n points in the plane and another point q, we present optimal O(nlogn) time, O(n) space algorithms for finding the closest and farthest line segments (lines) from q among those spanned by the points in S. We further show how to apply our techniques to find the minimum (maximum) area triangle with a vertex at q and the other two vertices in S{q} in optimal O(nlogn) time and O(n) space. Finally, we give an O(nlogn) time, O(n) space algorithm to find the kth closest line from q and show how to find the k closest lines from q in O(nlogn+k) time and O(n+k) space.     

Sparse geometric graphs with small dilation

Given a set S of n points in , and an integer k such that 0k<n, we show that a geometric graph with vertex set S, at most n−1+k edges, maximum degree five, and dilation O(n/(k+1)) can be computed in time O(nlogn). For any k, we also construct planar n-point sets for which any geometric graph with n−1+k edges has dilation Ω(n/(k+1)); a slightly weaker statement holds if the points of S are required to be in convex position.     

Fractal sets determined by dilation-stable processes

Let be a dilation-stable process on . We determine a Hausdorff measure function (a) such that the fractal set X[0,1]={X(t):0t1} has positive finite -measure. We also investigate the packing measure of X[0,1].     

Nonexistence of a code for

In this paper, we shall prove that there is no [3q⁴-q³-q²-3q-1,5,3q⁴-4q³-2q+1]_q code over the finite field for q11. Thus, we conclude the nonexistence of a [g_q(5,d),5,d]_q code for 3q⁴-4q³-2q+1d3q⁴-4q³-q.