On Well-posed Mutually Nearest and Mutually Furthest Point Problems in Banach Spaces

Let G be a non-empty closed(resp．bounded closed)boundedly relatively weakly compact subset in a strictly convex Kadec Banach space X．Let K(X)denote the space of all non-empty compact convex subsets of X endowed with the Hausdorff distance．Moreover,let KG(X)denote the closure of the set {A∈K(x)：A∩G=0}．We prove that the set of all A∈KG(X)(resp．A∈K(X)),such that the minimization (resp．maximization)problem min(A,G)(resp．max(A,G))is well posed,contains a dense Gδ-subset of KG(X)(resp．K(X))．thus extending the recent results due to Blasi,Myjak and Papini and Li．     

Nearest q-Flat to m Points

Recently, Bradley and Mangasarian studied the problem of finding the nearest plane to m given points in ⁿ in the least square sense. They showed that the problem reduces to finding the least eigenvalue and associated eigenvector of a certain n×n symmetric positive-semidefinite matrix. We extend this result to the general problem of finding the nearest q-flat to m points, with 0qn–1.     

Banach空间中最佳逼近问题的适定性的研究进展

本文就近年来关于Banach空间中非线性逼近问题的存在性和适定性问题及其与Banach空间几何性质关系的研究结果和进展作一系统的介绍和综述,其中包含了一系列作者的近期研究成果．     

Approximation of Nearest Common Fixed Point of Nonexpansive Mappings in Hilbert Spaces

The purpose of this paper is to study the convergence problem of the iteration scheme xn＋l = λn＋1y ＋ （1 - λn＋1）Tn＋1xn for a family of infinitely many nonexpansive mappings T1, T2,... in a Hilbert space. It is proved that under suitable conditions this iteration scheme converges strongly to the nearest common fixed point of this family of nonexpansive mappings. The results presented in this paper extend and improve some recent results.     

A graph-theoretic approach for comparing dimensions of components in simply-graded algebras

Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that in a digraph without parallel edges, the number of pairs of vertices having a common in-neighbor or a common out-neighbor is at least the number of edges. We deduce that for any simple group-grading, the dimension of the trivial component is maximal.     

Weierstrass Pairs and Minimum Distance of Goppa Codes

We prove that elements of the Weierstrassgap set of a pair of points may be used to define a geometricGoppa code which has minimum distance greater than the usuallower bound. We determine the Weierstrass gap set of a pair ofany two Weierstrass points on a Hermitian curve and use thisto increase the lower bound on the minimum distance of particularcodes defined using a linear combination of the two points.     

无限族非扩张映象及非扩张半群的强收敛定理

目的是研究Banach空间中无限族非扩张映象和非扩张半群的强收敛问题.为此提出一个改进的迭代序列,在适当条件下,某些强收敛定理被证明.结果改进和推广了一些人的最新结果.     

Hilbert空间中非扩张映象的最近的公共不动点的逼近问题

本文在Hilbert空间的框架下,研究无限族非扩张映象T_1,T_2,…的迭代程序x_n+1=λ_(n+1)y+(1-λ_(n+1))T_(n+1)x_n的收敛性问题．在适当的条件下,证明了该迭代序列收敛于这一非扩张映象族的最近的公共不动点．其结果改进和推广了引文中相应的结果．     

Mutually independent bipanconnected property of hypercube

A graph is denoted by G with the vertex set V(G) and the edge set E(G). A path P = 〈v₀, v₁, … , v_m〉 is a sequence of adjacent vertices. Two paths with equal length P₁ = 〈 u₁, u₂, … , u_m〉 and P₂ = 〈 v₁, v₂, … , v_m〉 from a to b are independent if u₁ = v₁ = a, u_m = v_m = b, and u_i ≠ v_i for 2 ? i ? m − 1. Paths with equal length from a to b are mutually independent if they are pairwisely independent. Let u and v be two distinct vertices of a bipartite graph G, and let l be a positive integer length, d_G(u, v) ? l ? ∣V(G) − 1∣ with (l − d_G(u, v)) being even. We say that the pair of vertices u, v is (m, l)-mutually independent bipanconnected if there exist m mutually independent paths with length l from u to v. In this paper, we explore yet another strong property of the hypercubes. We prove that every pair of vertices u and v in the n-dimensional hypercube, with d_Qn(u,v)?n-1, is (n − 1, l)-mutually independent bipanconnected for every with (l-d_Qn(u,v)) being even. As for d_Qn(u,v)?n-2, it is also (n − 1, l)-mutually independent bipanconnected if l?d_Qn(u,v)+2, and is only (l, l)-mutually independent bipanconnected if l=d_Qn(u,v).     

Mean characteristics of Gibbsian point processes

This paper deals with the derivation of an exact expression of mean characteristics of planar global Gibbsian point processes having pair potential functions. The method is analogous to that of the Mayer expansion of grand partition functions, i.e., the reciprocal of the normalizing constant of Gibbsian distribution (well-known in statistical physics). The explicit infinite series expansion of a logarithm of a class of mean quantities with respect to the activity parameter z is derived and the expression of its coefficients is given. The validity of this expansion for a range of z is also shown. Examples of mean characteristics to which this expansion can be applied are given. Finally, a simple numerical example is given in order to show the usage of this expansion as a numerical approximant of mean characteristics.     

Sets of orthogonal hypercubes of class r

A (d,n,r,t)-hypercube is an n×n×?×n (d-times) array on nr symbols such that when fixing t coordinates of the hypercube (and running across the remaining d−t coordinates) each symbol is repeated nd−r−t times. We introduce a new parameter, r, representing the class of the hypercube. When r=1, this provides the usual definition of a hypercube and when d=2 and r=t=1 these hypercubes are Latin squares. If d?2r, then the notion of orthogonality is also inherited from the usual definition of hypercubes. This work deals with constructions of class r hypercubes and presents bounds on the number of mutually orthogonal class r hypercubes. We also give constructions of sets of mutually orthogonal hypercubes when n is a prime power.     

Special Pairs in the Generating Subset of the Weierstrass Semigroup at a Pair

We discuss the structure of the Weierstrass semigroup at a pair of points on an algebraic curve. It is known that the Weierstrass semigroup at a pair (P, Q) contains the unique generating subset (P, Q). We find some characterizations of the elements of (P, Q) and prove that, for any point P on a curve, (P, Q) consists of only maximal elements for all except for finitely many points QP on the given curve. Also we obtain more results concerning special and nonspecial pairs.     

Toward Optimal ε-Approximate Nearest Neighbor Algorithms

We combine the recent optimal predecessor algorithm with a recent randomized stratified tree algorithm for an ε-approximate nearest neighbor to give an algorithm for an ε-approximate nearest neighbor in a fixed-dimensional space that is optimal with respect to universe size. We also give a deterministic version of the stratified tree algorithm.     

The Weierstrass semigroup of a pair of GaloisWeierstrass points with prime degree on a curve

We describe the Weierstrass semigroup of a Galois Weierstrass point with prime degree and the Weierstrass semigroup of a pair of Galois Weierstrass points with prime degree, where a Galois Weierstrass point with degree n means a total ramification point of a cyclic covering of the projective line of degree n.*Supported by Korea Research Foundation Grant (KRF-2003-041-C20010).**Partially supported by Grant-in-Aid for Scientific Research (15540051), JSPS.     

Nonlinear Approximation with Dictionaries. II. Inverse Estimates

In this paper, which is the sequel to [16], we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for blockwise incoherent dictionaries in Hilbert spaces, which generalize the notion of joint block-diagonal mutually incoherent bases introduced by Donoho and Huo. The Bernstein inequality obtained for such dictionaries is proved to be sharp, but it has an exponent that does not match that of the corresponding Jackson inequality.     

Mutually orthogonal equitable Latin rectangles

Let ab=n². We define an equitable Latin rectangle as an a×b matrix on a set of n symbols where each symbol appears either or times in each row of the matrix and either or times in each column of the matrix. Two equitable Latin rectangles are orthogonal in the usual way. Denote a set of ka×b mutually orthogonal equitable Latin rectangles as a k– MOELR (a,b;n). When a≠9,18,36, or 100, then we show that the maximum number of k– MOELR (a,b;n)≥3 for all possible values of (a,b).