Dual-orthogonal polynomials

Let (x, ) and (x,) be two functions,x[a, b] and { _j } _j=1 and { _j } _j=1 be two sequences where _{i j} and _{i j} whenij. We define the vector spacesU _k =span{(x, _j )} _j=1 ^k andV _k =span{(x, _j )} _j=1 ^k where we assume thatdim(U _k )=dim(V _k )=k,k1. We then look for the generalized polynomialsp _m xU _m+1\U _m so that _a ^b p _m (x)(x, _j )d(x)=0,j=1,2,...,m. If such generalized polynomials exist for allm1 we say that {p _m } _m=1 is a dual-orthogonal polynomial sequence from {(x, _j )} _j=1 to {(x, _j )} _j=1 with respect to the distribution (x),x[a, b]. In this article we present existence theorems for dual-orthogonal polynomials, explicit formulae forp _m(x), theorems about the zeros ofp _m(x), and, in the end, a Gauss-type quadrature formula for dual-orthogonal polynomials.     

Compact interval spaces in which all closed subsets are homeomorphic to clopen ones,I

A topological space X whose topology is the order topology of some linear ordering on X, is called an interval space. A space in which every closed subspace is homeomorphic to a clopen subspace, is called a CO space. We regard linear orderings as topological spaces, by equipping them with their order topology. If L and K are linear orderings, then L ^*, L+K, L·K denote respectively the reverse orderings of L, the ordered sum of L and K and the lexicographic order on L×K (so ·2=+ and 2·=). Ordinals are considered as linear orderings, and cardinals are initial ordinals. For cardinals , 0, let L(, )= + 1 + ^* . Main theorem. Let X be a compact interval space. Then X is a CO space if and only if X is homeomorphic to a space of the form + 1 + _i L( _i , _i ), where is any ordinal, n, for every ii, _i are regular cardinals and _{i i}, and if n>0, then max({ _i: i}) · . This first part is devoted to show the following result. Theorem: If X is a compact interval CO space, then X is a scattered space (that means that every subspace of X has an isolated point).Supported by the Université Claude-Bernard (Lyon-1), the Ben Gurion University of the Negev, and the C.N.R.S.: UPR 9016Supported by the City of Lyon     

Fubini theorem for anticipating stochastic integrals in Hilbert space

Let (X,l,) be a measure space, letW be a cylindrical Hilbert-Wiener process, and let be an anticipating integrable process-valued function onX. We prove, under natural assumptions on, that there exists a measurable version Y_x,x X, of the anticipating integral of(x) such that the integral _x Y_x(dx) is a version of the anticipating integral of _X (x)(dx). We apply this anticipating Fubini theorem to study solutions of a class of stochastic evolution equations in Hilbert space.     

Second Jackson Inequality in a Sign-Preserving Approximation of Periodic Functions

We consider a 2-periodic function f continuous on and changing its sign at 2s points y _i [–, ). For this function, we prove the existence of a trigonometric polynomial T _n of degree n that changes its sign at the same points y _i and is such that the deviation |f(x) – T _n(x)| satisfies the second Jackson inequality.     

Independence in hypergraphs

Suppose an integral function (|A|)q₁ defined on the subsets of edges of a hypergraph (X,u,) satisfies the following two conditions: 1) any set W u such that |A|(|A|) for any AW is matroidally independent; 2) if W is an independent set, then there exists a unique partitionW=T₁+ T₂+...+T_v such that |T ⁱ |=(|T ⁱ |),i1:v, and for any AW, |A|(|A|) there exists a T_i such that AT_i. The form of such a function is found, in terms of parameters of generalized connected components, hypercycles, and hypertrees.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 114, pp. 196–204, 1982.     

On countably compact,locally countable spaces

We study the cardinalities of countably compact, locally countableT ₃ spaces. For alln(<), there exists one of cardinality _n . IfV=L, then there exists one of cardinalityx iffx= orx =x. MA implies that there exists one of cardinality>2.     

On the ω-limit Set Dichotomy of Cooperating Kolmogorov Systems

The authors study the -limit set dichotomy of the Kolmogorov systems _i=x_i f _i(x)x _i0, 1in with the cooperative and irreducible hypotheses and obtain the quasiconvergence almost everywhere when n=3, which gives an affirmative answer to the open problem by Smith [9, p.72] in the case of n=3.     

A Local Approach to 1-Homogeneous Graphs

Let bea distance-regular graph with diameter d. For vertices x and y of at distancei, 1 i d, we define the setsC _i(x,y) = i–1(x) (y), A _i (x,y) = _i (x) (y) and B _i (x,y) = _i+1(x) (y).Then we say has the CAB_j property,if the partition CAB _i (x,y) = {C _i (x,y),A _i (x,y),B _i (x,y)}of the local graph of y is equitable for each pairof vertices x and y of at distance i j. We show that in with the CAB_j property then the parameters ofthe equitable partitions CAB i(x,y) do not dependon the choice of vertices x and y atdistance i for all i j. The graph has the CAB property if it has the CAB _d property. We show the equivalence of the CAB property and the1-homogeneous property in a distance-regular graph with a ₁ 0. Finally, we classify the 1-homogeneous Terwilligergraphs with c ₂ 2.     

Convolution semigroups and central limit theorem associated with a dual convolution structure

We consider hypergroups associated with Jacobi functions ⁽⁾ (x), (–1/2). We prove the existence of a dual convolution structure on [0,+[i(]0,s ₀]{{) =++1,s ₀=min(,–+1). Next we establish a Lévy-Khintchine type formula which permits to characterize the semigroup and the infinitely divisible probabilities associated with this dual convolution, finally we prove a central limit theorem.     

Convergence of epigraphs and of sublevel sets

Let LSC(X) be the set of the proper lower semicontinuous extended real-valued functions defined on a metric spaceX. Given a sequence f _n in LSC(X) and a functionf LSC(X), we show that convergence of f _n tof in several variational convergence modes implies that for each , the sublevel set at height off is the limit, in the same variational sense, of an appropriately chosen sequence of sublevel sets of thef _n, at height _n approaching . The converse holds true whenever a form of stability of the sublevel sets of the limit function is verified. The results are obtained by regarding a hyperspace topology as the weakest topology for which each member of an appropriate family of excess functionals is upper semicontinuous, and each member of an appropriate family of gap functionals is lower semicontinuous. General facts about the representation of hyperspace topologies in this manner are given.     

Minimality of root vectors of operator functions analytic in an angle

We study the minimality of elementsx _h,j,k of canonical systems of root vectors. These systems correspond to the characteristic numbers _k of operator functionsL() analytic in an angle; we assume that operators act in a Hilbert space . In particular, we consider the case whereL()=I+T()c, >0,I is an identity operator,C is a completely continuous operator, (I- C)^–1c for ¦arg¦, 0<<, the operator functionT() is analytic, and T()c for ¦arg¦<. It is proved that, in this case, there exists >0 such that the system of vectorsC ^v x _h,j,k is minimal in for arbitrary positive <1+, provided that ¦_k¦>.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 5, pp. 545–566, May, 1994.This research was partially supported by the Ukrainian State Committee of Science and Technology.     

Mappings that preserve cones in Lobachevskii space

Let ⁿ be n-dimensional Lobachevskii space, and {l_x:x ⁿ} be a family of lines, parallel to a linel ₀, 0ⁿ (in a given direction). Let {c_x:Xⁿ} be a family of circular cones in ⁿ of opening with axes l_X and vertex X. Then, iff:ⁿⁿ(n>2) is a bijective mapping andf(C_x)=C _f(x), it follows thatf is a motion in the space ⁿ.Translated from Matematicheskie Zametki, Vol. 13, No. 5, pp. 687–694, May, 1973.     

A preconditioner for constrained and weighted least squares problems with Toeplitz structure

We study methods for solving the constrained and weighted least squares problem min _x by the preconditioned conjugate gradient (PCG) method. HereW = diag (₁, , _m ) with _{1 m} 0, andA ^T = [T ₁ ^T , ,T _k ^T ] with Toeplitz blocksT _l R ^{n × n} ,l = 1, ,k. It is well-known that this problem can be solved by solving anaugmented linear 2 × 2 block linear systemM +Ax =b, A ^T = 0, whereM =W ^–1. We will use the PCG method with circulant-like preconditioner for solving the system. We show that the spectrum of the preconditioned matrix is clustered around one. When the PCG method is applied to solve the system, we can expect a fast convergence rate.Research supported by HKRGC grants no. CUHK 178/93E and CUHK 316/94E.     

Ergodic properties of Poisson processes with almost periodic intensity

Summary We discuss in this paper a non-homogeneous Poisson process A driven by an almost periodic intensity function. We give the stationary version A ^* and the Palm version A ⁰ corresponding to A ^*. Let (T _i ,i) be the inter-point distance sequence in A and (T _i ⁰ ,i) in A ⁰. We prove that forj, the sequence (T _i+j,i) converges in distribution to (T _i ⁰ ,i). If the intensity function is periodic then the convergence is in variation.     

Localization of a theorem of Ambos-Spies and the strong anti-splitting property

LetA be an r.e. nonrecursive set. We sayA has thestrong antisplitting property if there exists an r.e. setB with 0< _T B< _T A such that ifA ₁ A ₂=A andA ₁A ₂=0 thenA _{1 T} B impliesA _{1 T} 0 andB _T A ₁ impliesA _{1 T} A. It is shown that below any high r.e. degree there exists an r.e. set with the strong antisplitting property. The main ingredient of the proof is a localization of Ambos-Spies' result that the cup or cap theorem fails forW-degrees.Research partially supported by N.U.S. Grant RP 85/83 (Singapore).     

Non polynomial splines and weakly singular two-point boundary value problems

In the present paper we shall consider an application of simple non-polynomial splines to a numerical solution of a weakly singular two-point boundary value problem:x ^– (x y)=f(x,y), (0<x1) subject toy(0)=0,y(1)=c ₁(1) ory(0)=c ₂,y(1)=c ₃(0<<1). Our collocation method gives a continuously differentiable approximation and isO(h ²)-convergent.     

Mouvement moyen et système dynamique gaussien

Summary In the situation of the classical mean motion, we haven planets moving in the plane, planetk+1 being a satellite of planetk. A classcal result then states that planetn has a mean motion,i.e. its mean angular speed between time 0 and timet has a limit whent. We show in this article that any real gaussian dynamical system can be interpreted as the limit of this situation, whenn. From a given nonatomic probability measure on [0,], we construct a transformationT of the complex brownian path (B _u)_0u1 which preserves Wiener measure.T is defined as the limit of a sequenceT _n, whereT _n acts as the motion of 2ⁿ planets. In this way we get a real gaussian dynamical system, whose spectral measure is the symetric probability on [-,] obtained from . The transformationT can be inserted in a flow (T ^t) _t, and the orbitstZ _t=B ₁T ^t still have almost surely a mean motion, which is the mean of .     

Transversally bounded lattices

A problem stemming from a boundedness question for torsion modules and its translation into ideal lattices is explored in the setting of abstract lattices. Call a complete lattice L transversally bounded (resp., uniformly transversally bounded) if for all families (X _i)_iIof nonempty subsets of L with the property that {x _iiI}<1 for all choices of x _iX _i, almost all of the sets X _ihave join smaller than 1 (resp., _jJ X _jhas join smaller than 1 for some cofinite subset J of I). It is shown that the lattices which are transversally bounded, but not uniformly so, correspond to certain ultrafilters with peculiar boundedness properties similar to those studied by Ramsey. The prototypical candidates of the two types of lattices which one is led to construct from ultrafilters (in particular the lattices arising from what will be called Ramsey systems) appear to be of interest beyond the questions at stake.     

Quadratic spline interpolation on uniform meshes

The interpolation problem at uniform mesh points of a quadratic splines(x _i)=f _i,i=0, 1,...,N ands(x ₀)=f₀ is considered. It is known that s–f=O(h ³) and s–f=O(h ²), whereh is the step size, and that these orders cannot be improved. Contrary to recently published results we prove that superconvergence cannot occur for any particular point independent off other than mesh points wheres=f by assumption. Best error bounds for some compound formulae approximatingf _i andf _i ⁽³⁾ are also derived.     

Optimizing a linear function over an efficient set

The problem (P) of optimizing a linear functiond ^T x over the efficient set for a multiple-objective linear program (M) is difficult because the efficient set is typically nonconvex. Given the objective function directiond and the set of domination directionsD, ifd ^T 0 for all nonzero D, then a technique for finding an optimal solution of (P) is presented in Section 2. Otherwise, given a current efficient point , if there is no adjacent efficient edge yielding an increase ind ^T x, then a cutting plane is used to obtain a multiple-objective linear program ( ) with a reduced feasible set and an efficient set . To find a better efficient point, we solve the problem (I_i) of maximizingc _i ^T x over the reduced feasible set in ( ) sequentially fori. If there is a that is an optimal solution of (I_i) for somei and , then we can choosex ⁱ as a current efficient point. Pivoting on the reduced feasible set allows us to find a better efficient point or to show that the current efficient point is optimal for (P). Two algorithms for solving (P) in a finite sequence of pivots are presented along with a numerical example.The authors would like to thank an anonymous referee, H. P. Benson, and P. L. Yu for numerous helpful comments on this paper.