Non-conflicting ordering cones and vector optimization in inductive limits

Let (E, ξ)= ind (E_n, ξ_n) be an inductive limit of a sequence (E_n, ξ_n)_{n∈ N} of locally convex spaces and let every step (E_n, ξ_n) be endowed with a partial order by a pointed convex (solid) cone S_n. In the framework of inductive limits of partially ordered locally convex spaces, the notions of lastingly efficient points, lastingly weakly efficient points and lastingly globally properly efficient points are introduced. For several ordering cones, the notion of non-conflict is introduced. Under the requirement that the sequence (S_n)_{n∈ N} of ordering cones is non-conflicting, an existence theorem on lastingly weakly efficient points is presented. From this, an existence theorem on lastingly globally properly efficient points is deduced.     

Approximate fixed point sequences and convergence theorems for asymptotically pseudocontractive mappings

Let K be a nonempty closed convex and bounded subset of a real Banach space E and T:K→K be uniformly L-Lipschitzian, uniformly asymptotically regular with sequence {ε_n}, and asymptotically pseudocontractive with constant {k_n}, where {k_n} and {ε_n} satisfy certain mild conditions. Let a sequence {x_n} be generated from x₁∈K by x_n+1:=(1−λ_n)x_n+λ_nTⁿx_n−λ_nθ_n(x_n−x₁), for all integers n?1, where {λ_n} and {θ_n} are real sequences satisfying appropriate conditions, then ‖x_n−Tx_n‖→0 as n→∞. Moreover, if E is reflexive, and has uniform normal structure with coefficient N(E) and L<N(E)^1/2 and has a uniformly Gâteaux differentiable norm, and T satisfies an additional mild condition, then {x_n} also converges strongly to a fixed point of T.     

Viscosity approximation methods for nonexpansive mappings and monotone mappings

Viscosity approximation methods for nonexpansive mappings are studied. Consider the iteration process {xn}, where x₀∈C is arbitrary and xn+1=αnf(xn)+(1−αn)SPC(xn−λnAxn), f is a contraction on C, S is a nonexpansive self-mapping of a closed convex subset C of a Hilbert space H. It is shown that {xn} converges strongly to a common element of the set of fixed points of nonexpansive mapping and the set of solutions of the variational inequality for an inverse strongly-monotone mapping which solves some variational inequality.     

THE EXTREME POINTS OF SEVERAL CLASSES OF ANALYTIC FUNCTIONS

1Intr0ducti0nLetAden0tethesetofallfunctionsanalyticinA={z:Izl<1}.LetB={W:WEAandIW(z)l51}.Aisalocallyconvexlineaztop0l0gicalspacewithrespecttothetopologyofuniformconvergenceon`c0mpact8ubsetsofA-LetTh(c1,'tc.-1)={p(z):p(z)EA,Rop(z)>0,p(z)=1 clz czzz ' c.-lz"-l 4z" ',wherecl,',cn-1areforedcomplexconstants}.LetTh,.(b,,-..,b,-,)={p(z):P(z)'EAwithReP(z)>Oandp(z)=1 blz ' b.-lz"-l 4z" '-,wherebl,-'-jbu-1areffeedrealconstantsanddkarerealnumbersf0rk=n,n 1,'--}-LetTu(l1,'i'tI.-1)={…     

The combinatorial structure of random polytopes

Choose n random points in , let P_n be their convex hull, and denote by f_i(P_n) the number of i-dimensional faces of P_n. A general method for computing the expectation of f_i(P_n), i=0,…,d−1, is presented. This generalizes classical results of Efron (in the case i=0) and Rényi and Sulanke (in the case i=d−1) to arbitrary i. For random points chosen in a smooth convex body a limit law for f_i(P_n) is proved as n→∞. For random points chosen in a polytope the expectation of f_i(P_n) is determined as n→∞. This implies an extremal property for random points chosen in a simplex.     

Recurrent points and non-wandering points of graph maps

Let G be a graph and f:G→G be a continuous map. Denote by P(f), R(f) and Ω(f) the sets of periodic points, recurrent points and non-wandering points of f, respectively. In this paper we show that: (1) If L=(x,y) is an open arc contained in an edge of G such that {fm(x),fk(y)}⊂(x,y) for some m,k∈N, then R(f)∩(x,y)≠∅; (2) Any isolated point of P(f) is also an isolated point of Ω(f); (3) If x∈Ω(f)−Ω(fn) for some n∈N, then x is an eventually periodic point. These generalize the corresponding results in W. Huang and X. Ye (2001) [9] and J. Xiong (1983, 1986) [17] and [19] on interval maps or tree maps.     

Orlicz spaces without extreme points

Orlicz function and sequence spaces unit balls of which have no extreme points are completely characterized for both (the Orlicz and the Luxemburg) norms. Their subspaces of order continuous elements, with the norms induced from the whole Orlicz spaces without extreme points in their unit balls are also characterized. The well-known spaces L₁ and c₀ with unit balls without extreme points are covered by our results. Moreover, a new example of a Banach space without extreme points in its unit ball is given (see Example 1). This is the subspace a(L₁+L_∞) of order continuous elements of the space L₁+L_∞ equipped with the norm whenever 0<a<∞ and μ(T)>1/a.     

Continued fractions with three limit points

On page 45 in his lost notebook, Ramanujan asserts that a certain q-continued fraction has three limit points. More precisely, if A_n/B_n denotes its nth partial quotient, and n tends to ∞ in each of three residue classes modulo 3, then each of the three limits of A_n/B_n exists and is explicitly given by Ramanujan. Ramanujan's assertion is proved in this paper. Moreover, general classes of continued fractions with three limit points are established.     

Pseudospectra, critical points and multiple eigenvalues of matrix polynomials

We develop a general framework for perturbation analysis of matrix polynomials. More specifically, we show that the normed linear space L_m(C^n×n) of n-by-n matrix polynomials of degree at most m provides a natural framework for perturbation analysis of matrix polynomials in L_m(C^n×n). We present a family of natural norms on the space L_m(C^n×n) and show that the norms on the spaces C^m+1 and C^n×n play a crucial role in the perturbation analysis of matrix polynomials. We define pseudospectra of matrix polynomials in the general framework of the normed space L_m(C^n×n) and show that the pseudospectra of matrix polynomials well known in the literature follow as special cases. We analyze various properties of pseudospectra in the unified framework of the normed space L_m(C^n×n). We analyze critical points of backward errors of approximate eigenvalues of matrix polynomials and show that each critical point is a multiple eigenvalue of an appropriately perturbed polynomial. We show that common boundary points of components of pseudospectra of matrix polynomials are critical points. As a consequence, we show that a solution of Wilkinson’s problem for matrix polynomials can be read off from the pseudospectra of matrix polynomials.     

Probabilities of dominant candidates based on first-place votes

Suppose each of an odd number n of voters has a strict preference order on the three ‘candidates’ in {1,2,3} and votes for his most preferred candidate on a plurality ballot. Assume that a voter who votes for i is equally likely to have ijk and ikj as his preference order when {i,j,k} = {1,2,3}.Fix an integer m between $\text{1}\text{2}$(n + 1) and n inclusive. Then, given that n_i of the n voters vote for i, let f_m(n₁,n₂,n₃) be the probability that one of the three candidates is preferred by m or more voters to each of the other two.This paper examines the behavior of f_m over the lattice points in L_n, the set of triples of non-negative integers that sum to n. It identifies the regions in L_n where f_m is 1 and where f_m is 0, then shows that f_m(a,b + 1, c)>f_m(a + 1,b,c) whenever a + b + c + 1 = n, a≤c≤b, a<c<m and c≤n ? m. These results are used to partially identify the points in L_n where f_m is minimized subject to f_m>0. It is shown that at least two of the n_i are equal at minimizing points.     

On bijections for pattern-avoiding permutations

By considering bijections from the set of Dyck paths of length 2n onto each of Sn(321) and Sn(132), Elizalde and Pak in [S. Elizalde, I. Pak, Bijections for refined restricted permutations, J. Combin. Theory Ser. A 105 (2004) 207-219] gave a bijection that preserves the number of fixed points and the number of excedances in each σ∈Sn(321). We show that a direct bijection Γ:Sn(321)→Sn(132) introduced by Robertson in [A. Robertson, Restricted permutations from Catalan to Fine and back, Sém. Lothar. Combin. 50 (2004) B50g] also preserves the number of fixed points and the number of excedances in each σ. We also show that a bijection ?^∗:Sn(213)→Sn(321) studied in [J. Backelin, J. West, G. Xin, Wilf-equivalence for singleton classes, Adv. in Appl. Math. 38 (2007) 133-148] and [M. Bousquet-Melou, E. Steingrimsson, Decreasing subsequences in permutations and Wilf equivalence for involutions, J. Algebraic Combin. 22 (2005) 383-409] preserves these same statistics, and we show that an analogous bijection from Sn(132) onto Sn(213) does the same.     

Characterization and construction of the nearest defective matrix via coalescence of pseudospectral components

Let A be a matrix with distinct eigenvalues and let w(A) be the distance from A to the set of defective matrices (using either the 2-norm or the Frobenius norm). Define Λ_?, the ?-pseudospectrum of A, to be the set of points in the complex plane which are eigenvalues of matrices A+E with ‖E‖<?, and let c(A) be the supremum of all ? with the property that Λ_? has n distinct components. Demmel and Wilkinson independently observed in the 1980s that w(A)?c(A), and equality was established for the 2-norm by Alam and Bora (2005). We give new results on the geometry of the pseudospectrum near points where first coalescence of the components occurs, characterizing such points as the lowest generalized saddle point of the smallest singular value of A-zI over z∈C. One consequence is that w(A)=c(A) for the Frobenius norm too, and another is the perhaps surprising result that the minimal distance is attained by a defective matrix in all cases. Our results suggest a new computational approach to approximating the nearest defective matrix by a variant of Newton’s method that is applicable to both generic and nongeneric cases. Construction of the nearest defective matrix involves some subtle numerical issues which we explain, and we present a simple backward error analysis showing that a certain singular vector residual measures how close the computed matrix is to a truly defective matrix. Finally, we present a result giving lower bounds on the angles of wedges contained in the pseudospectrum and emanating from generic coalescence points. Several conjectures and questions remain open.     

Poisson limits for a hard-core clustering model

Let X_1n,…,X_>nn denote the locations of n points in a bounded, γ-dimensional, Euclidean region D_n which has positive γ-dimensional Lebesgue measure μ(D_n). Let {Y_n(r): r > 0} be the interpoint distance process for these points where Y_n(r) is the number of pairs of points(X_in, X_in) which with i < j have Euclidean distance 6X_in ? X_>in6 < r. In this article we study the limiting distribution of Y_n(r) when n → ∞ and μ(D_n) → ∞, and the joint density of X_1n,…,X_nnis of the form

where r₀ is a positive constant and C_n is a normalizing constant. These joint densities modify the Strauss [11] clustering model densities by introducing a hard-core component (no two points can have 6X_in ? X_in6 < r₀) found in the Matérn [4] models. In our main result we show that the interpoint distance process converges to a non-homogeneous Poisson process for r values in a bounded interval 0 < r₀ < r < r₀₀ provided sparseness conditions discussed by Saunders and Funk [9] hold. The sparseness conditions which require $\text{μ(D}{}_{\mathrm{n}}\text{)}\text{n}{}^2$ converges to a positive constant and the boundary of D_n is negligible are essentially equivalent to requiring that although the number of points n is large the region is large enough so that the points are sparse in this region. That is, it is rare for a point to have another point close to it. These results extend results for v ? 0 given by Saunders and Funk [9] where it is shown that without the hard core component such results do not hold for v > 0. Statistical applications are discussed.     

On empty convex polygons in a planar point set

Let P be a set of n points in general position in the plane. Let X_k(P) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, several equalities and inequalities involving the quantities X_k(P) and several related quantities. Most of these equalities and inequalities are new, except for a few that have been proved earlier using a considerably more complex machinery from matroid and polytope theory, and algebraic topology. Some of these relationships are also extended to higher dimensions. We present several implications of these relationships, and discuss their connection with several long-standing open problems, the most notorious of which is the existence of an empty convex hexagon in any point set with sufficiently many points.     

Contact points of convex bodies

LetB be a convex body in ? ⁿ and let ? be an ellipsoid of minimal volume containingB. By contact points ofB we mean the points of the intersection between the boundaries ofB and ?. By a result of P. Gruber, a generic convex body in ? ⁿ has (n+3)·n/2 contact points. We prove that for every ?>0 and for every convex bodyB ? ? ⁿ there exists a convex bodyK having $$m \leqslant C(\varepsilon ) \cdot n\log ^3 n$$ contact points whose Banach-Mazur distance toB is less than 1+?. We prove also that for everyt>1 there exists a convex symmetric body Γ ? ? ⁿ so that every convex bodyD ? ? ⁿ whose Banach-Mazur distance to Γ is less thant has at least (1+c ₀/t ²)·n contact points for some absolute constantc ₀. We apply these results to obtain new factorizations of Dvoretzky-Rogers type and to estimate the size of almost orthogonal submatrices of an orthogonal matrix.     

Protecting convex sets

A point-setS is protecting a collection F =T ₁,T ₂,..., _n ofn mutually disjoint compact sets if each one of the setsT _i is visible from at least one point inS; thus, for every setT _i ∈F there are points xS andy T _i such that the line segment joining x to y does not intersect any element inF other thanT _i . In this paper we prove that [2(n-2)/3] points are always sufficient and occasionally necessary to protect any family F ofn mutually disjoint compact convex sets. For an isothetic family F, consisting ofn mutually disjoint rectangles, [n/2] points are always sufficient and [n/2] points are sometimes necessary to protect it. IfF is a family of triangles, [4n/7] points are always sufficient. To protect families ofn homothetic triangles, [n/2] points are always sufficient and [n/2] points are sometimes necessary.     

Two characterizations of interchange graphs of complete m-partite graphs

A graph G is m-partite if its points can be partitioned into m subsets V₁,…,V_m such that every line joins a point in V_i with a point in V_j, i ≠ j. A complete m-partite graph contains every line joining V_i with V_j. A complete graph K_p has every pair of its p points adjacent. The nth interchange graph I_n(G) of G is a graph whose points can be identified with the K_n+1's of G such that two points are adjacent whenever the corresponding K_n+1's have a K_n in common.Interchange graphs of complete 2-partite and 3-partite graphs have been characterized, but interchange graphs of complete m-partite graphs for m > 3 do not seem to have been investigated. The main result of this paper is two characterizations of interchange graphs of complete m-partite graphs for m ≥ 2.