A Variation of an Extremal Theorem Due to Woodall

We consider a variation of an extremal theorem due to Woodall [12, or 1, Chapter 3] as follows: Determine the smallest even integer (₃C₁,n), such that every n-term graphic sequence = (d₁, d₂,..., d_n) with term sum () = d₁ + d₂ + ... + d_n (₃C₁,n) has a realization G containing a cycle of length r for each r = 3,4,...,l. In this paper, the values of (₃C_l,n) are determined for l = 2m – 1,n 3m – 4 and for l = 2m,n 5m – 7, where m 4.AMS Mathematics subject classification (1991) 05C35Project supported by the National Natural Science Foundation of China (Grant No. 19971086) and the Doctoral Program Foundation of National Education Department of China     

On G 2 Continuous Spline Interpolation of Curves in ℝ d

In this paper the problem of G ² continuous interpolation of curves in ^d by polynomial splines of degree n is studied. The interpolation of the data points and two tangent directions at the boundary is considered. The case n = r + 2 = d, where r is the number of interior points interpolated by each segment of the spline curve, is studied in detail. It is shown that the problem is uniquely solvable asymptotically, e., when the data points are sampled regularly and sufficiently dense, and lie on a regular, convex parametric curve in ^d . In this case the optimal approximation order is also determined.     

Steiner centers and Steiner medians of graphs

Let G be a connected graph and S a set of vertices of G. The Steiner distance of S is the smallest number of edges in a connected subgraph of G that contains S and is denoted by d_G(S) or d(S). The Steiner n-eccentricity e_n(v) and Steiner n-distance d_n(v) of a vertex v in G are defined as e_n(v)=max{d(S)| SV(G), |S|=n and vS} and d_n(v)=∑{d(S)| SV(G), |S|=n and vS}, respectively. The Steiner n-center C_n(G) of G is the subgraph induced by the vertices of minimum n-eccentricity. The Steiner n-median M_n(G) of G is the subgraph induced by those vertices with minimum Steiner n-distance. Let T be a tree. Oellermann and Tian [O.R. Oellermann, S. Tian, Steiner centers in graphs, J. Graph Theory 14 (1990) 585–597] showed that C_n(T) is contained in C_n+1(T) for all n2. Beineke et al. [L.W. Beineke, O.R. Oellermann, R.E. Pippert, On the Steiner median of a tree, Discrete Appl. Math. 68 (1996) 249–258] showed that M_n(T) is contained in M_n+1(T) for all n2. Then, Oellermann [O.R. Oellermann, On Steiner centers and Steiner medians of graphs, Networks 34 (1999) 258–263] asked whether these containment relationships hold for general graphs. In this note we show that for every n2 there is an infinite family of block graphs G for which C_n(G)C_n+1(G). We also show that for each n2 there is a distance–hereditary graph G such that M_n(G)M_n+1(G). Despite these negative examples, we prove that if G is a block graph then M_n(G) is contained in M_n+1(G) for all n2. Further, a linear time algorithm for finding the Steiner n-median of a block graph is presented and an efficient algorithm for finding the Steiner n-distances of all vertices in a block graph is described.     

On Sobolev and Capacitary Inequalities for Contractive Besov Spaces over d-sets

We derive Sobolev inequalities for Besov spaces B ^p,p (F), 0<<1, 1p< on d-sets F in R ⁿ , dn, from a metric property of the Bessel capacity on R ⁿ . We first extend Kaimanovitch's result on the equivalence of Sobolev and capacitary inequalites for contractive p-norms in a general setting allowing unbounded Lévy kernels. A simple part of the Jonsson–Wallin trace theorem for Besov spaces and some basic properties of Bessel and Besov capacities on R ⁿ are then utilized in getting the desired inequalities. When p=2, the Besov space being considered is a non-local regular Dirichlet space and gives rise to a jump type symmetric Markov process M over the d-set. The upper bound of the transition function of M and metric properties of M -polar sets are then exhibited.     

On the products of cross-ratios on diagonals of polygons

The purpose of this paper is to establish a conjecture of B. Grünbaum, which states that in every n-polygon P in the plane, n 5, some diagonals intersect in a pattern that defines a new n-polygon (P), such that the product of the cross-rations on the diagonals of P is equal to the product of the corresponding cross-ratios on the diagonals of (P).     

Approximation of Distributions by Parametric Sets

Let P be a probability distribution on a separable metric space (S,d). We study the following problem of approximation of a distribution P by a set from a given class A2 ^S : W(A,P) _S (d(x,A))P(dx)min _AA , where is a nondecreasing function. A special case where A is a parametric class A={A():T} is considered in detail. Our main interest is to obtain convergence results for sequences {A ^* _n }, where A ^* _n is an optimal set for a measure P _n satisfying P _n P, as n.     

Approximately Linear Mappings in Banach Modules over a C^＊-algebra

Let X and Y be vector spaces. The authors show that a mapping f ： X →Y satisfies the functional equation 2d f（∑^2d j=1（-1）^j＋1xj/2d）=∑^2dj=1（-1）^j＋1f（xj） with f（0） = 0 if and only if the mapping f ： X→ Y is Cauchy additive, and prove the stability of the functional equation （≠） in Banach modules over a unital C^＊-algebra, and in Poisson Banach modules over a unital Poisson C＊-algebra. Let A and B be unital C^＊-algebras, Poisson C^＊-algebras or Poisson JC^＊- algebras. As an application, the authors show that every almost homomorphism h ： A →B of A into is a homomorphism when h（（2d-1）^nuy） =- h（（2d-1）^nu）h（y） or h（（2d-1）^nuoy） = h（（2d-1）^nu）oh（y） for all unitaries u ∈A, all y ∈ A, n = 0, 1, 2,.... Moreover, the authors prove the stability of homomorphisms in C^＊-algebras, Poisson C^＊-algebras or Poisson JC^＊-algebras.     

Dimension Theory and Nonstable K1 of Quadratic Modules

Employing Bak's dimension theory, we investigate the nonstable quadratic K-group K _1,2n (A, ) = G _2n (A, )/E _2n (A, ), n 3, where G _2n (A, ) denotes the general quadratic group of rank n over a form ring (A, ) and E _2n (A, ) its elementary subgroup. Considering form rings as a category with dimension in the sense of Bak, we obtain a dimension filtration G _2n (A, ) G _2n ⁰(A, ) ; G _2n ¹(A, ) ... E _2n (A, ) of the general quadratic group G _2n (A, ) such that G _2n (A, )/G _2n ⁰(A, ) is Abelian, G _2n ⁰(A, ) G _2n ¹(A, ) ... is a descending central series, and G _2n ^d(A)(A, ) = E _2n (A, ) whenever d(A) = (Bass–Serre dimension of A) is finite. In particular K _1,2n (A, ) is solvable when d(A) < .     

A generalization of Brauer''s map of decomposition

We first reformulate Quillen's localization theorem forG-theory in complicial bi-Waldhausen category setting. Secondly, because of this reformulation, we are able to generalize Brauer's decomposition mapd ₀:G ₀(KG)G ₀(kG) to higherG-theory leveld _n :G _n (KG)G _n (kG),n=0, 1 ..., whereG is a finite group,R a Dedekind domain,m a maximal ideal ofR,K=quotient field ofR andk=R/m.     

Hermitian and Positive Integrated C-cosine Functions on Banach Spaces

Peculiar properties of hermitian and positive n-times integrated C-cosine functions on Banach spaces are investigated. Among them are: (1) Any nondegenerate positiven -times integrated C-cosine function is infinitely differentiable in operator norm; (2) An exponentially bounded, nondegenerateC -cosine function on L ^p () (1L ¹(), C₀ , in case C has dense range) is positive if and only if its generator is bounded, positive, and commutes with C.     

Root n bandwidths selectors in multivariate kernel density estimation

Based on a random sample of size n from an unknown d-dimensional density f, the problem of selecting the bandwidths in kernel estimation of f is investigated. The optimal root n relative convergence rate for bandwidth selection is established and the information bounds in this convergence are given, and a stabilized bandwidth selector (SBS) is proposed. It is known that for all d the bandwidths selected by the least squares cross-validation (LSCV) have large sample variations. The proposed SBS, as an improvement of LSCV, will reduce the variation of LSCV without significantly inflating its bias. The key idea of the SBS is to modify the d-dimensional sample characteristic function beyond some cut-off frequency in estimating the integrated squared bias. It is shown that for all d and sufficiently smooth f and kernel, if the bandwidth in each coordinate direction varies freely, then the multivariate SBS is asymptotically normal with the optimal root n relative convergence rate and achieves the (conjectured) lower bound on the covariance matrix.Part of the research was done while the first author was visiting the Institute of Statistical Science, Academia Sinica, Taipei, Taiwan. This work was supported by grant NSC-89-2118-M-006-011, NSC-90-2118-M-006-013 and NSC-91-2118-M-006-005 of National Science Council of Taiwan, R.O.C.     

Some Upper Bounds on the Covering Radii of Linear Codes Over Fq and Their Applications

We show that the covering radius R of an [n,k,d] code over F_q is bounded above by R n-n _q(k, d/q). We strengthen this bound when R d and find conditions under which equality holds.As applications of this and other bounds, we show that all binary linear codes of lengths up to 15, or codimension up to 9, are normal. We also establish the normality of most codes of length 16 and many of codimension 10. These results have applications in the construction of codes that attain t[n,k,/it>], the smallest covering radius of any binary linear [n,k].We also prove some new results on the amalgamated direct sum (ADS) construction of Graham and Sloane. We find new conditions assuring normality of the ADS; covering radius 1 less than previously guaranteed for ADS of codes with even norms; good covering codes as ADS without the hypothesis of normality, from concepts p- stable and s- stable; codes with best known covering radii as ADS of two, often cyclic, codes (thus retaining structure so as to be suitable for practical applications).     

Infinitesimal obstructions to weakly mixing

Let ^t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M ⁿ , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d ^t and, for each x M, we define a smooth real function _x (t) : (1 + _i (t)), where the _i(t) are the eigenvalues of AA ^T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d^2t , restricted to v at the point _x ^-t M ⁿ.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that _x ^' (t) 0 for all x M and real t; then, if _x ^t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.     

On a Theorem of T. Gneiting on α-Symmetric Multivariate Characteristic Functions

T. Gneiting (1998, J. Multivariate Analysis64, 131–147) proved a relation between the primitives of the classes Φ_d(2) and Φ_d(1) of 2- and 1-symmetric characteristic functions on ^d, respectively. We will give a straightforward proof of his relation, answering a question of his. To do this we use the calculus of generalized hypergeometric functions.     

A generalized Henstock-Stieltjes integral involving division functions

We can consider the Riemann-Stieltjes integral dg as an integral of a point function f with respect to an interval function g. We could extend it to the Henstock-Stieltjes integral. In this paper, we extend it to a generalized Stieltjes integral dg of a point function f with respect to a function g of divisions of an interval. Then we prove for this integral the standard results in the theory of integration, including the controlled convergence theorem.      

Some Criteria for Multivalently Starlikeness

Let S_n(p)(p, n N) be the class of functions f() = ^p + a_p+n^p+n + which are p-valently starlike in the unit disk. Some sufficient conditions for a function f() to be in the class S_n(p) are given.AMS Subject Classification (2000): primary 30C45     

Analysis of Queueing Systems with Synchronous Single Vacation for Some Servers

We study a multi-server M/M/c type queue with a single vacation policy for some idle servers. In this queueing system, if at a service completion instant, any d (d c) servers become idle, these d servers will take one and only one vacation together. During the vacation of d servers, the other c–d servers do not take vacation even if they are idle. Using a quasi-birth-and-death process and the matrix analytic method, we obtain the stationary distribution of the system. Conditional stochastic decomposition properties have been established for the waiting time and the queue length given that all servers are busy.     

Diffusion times and stability exponents for nearly integrable analytic systems

For a positive integer n and R>0, we set . Given R>1 and n≥4 we construct a sequence of analytic perturbations (H _j ) of the completely integrable Hamiltonian on , with unstable orbits for which we can estimate the time of drift in the action space. These functions H _j are analytic on a fixed complex neighborhood V of , and setting the time of drift of these orbits is smaller than (C(1/ɛ _j )^1/2(n-3)) for a fixed constant c>0. Our unstable orbits stay close to a doubly resonant surface, the result is therefore almost optimal since the stability exponent for such orbits is 1/2(n−2). An analogous result for Hamiltonian diffeomorphisms is also proved. Two main ingredients are used in order to deal with the analytic setting: a version of Sternberg's conjugacy theorem in a neighborhood of a normally hyperbolic manifold in a symplectic system, for which we give a complete (and seemingly new) proof; and Easton windowing method that allow us to approximately localize the wandering orbits and estimate their speed of drift.