Lp-Approximable Sequences of Vectors and Limit Distribution of Quadratic Forms of Random Variables

The properties of L₂-approximable sequences established here form a complete toolkit for statistical results concerning weighted sums of random variables, where the weights are nonstochastic sequences approximated in some sense by square-integrable functions and the random variables are “two-wing” averages of martingale differences. The results constitute the first significant advancement in the theory of L₂-approximable sequences since 1976 when Moussatat introduced a narrower notion of L₂-generated sequences. The method relies on a study of certain linear operators in the spaces L_p and l_p. A criterion of L_p-approximability is given. The results are new even when the weight generating function is identically 1. A central limit theorem for quadratic forms of random variables illustrates the method.     

A note on approximation of semigroups of contractions on Hilbert spaces

We show that every contractive C ₀-semigroup on a separable, infinite-dimensional Hilbert space X can be approximated by unitary C ₀-groups in the weak operator topology uniformly on compact subsets of ℝ₊. As a consequence we get a new characterization of a bounded H ^∞-calculus for the negatives of generators of bounded holomorphic semigroups. Applications of our results to the study of a topological structure of the set of (almost) weakly stable contractive C ₀-semigroups on X are also discussed. The author was partially supported by the Marie Curie “Transfer of Knowledge” programme, project “TODEQ”, and by a MNiSzW grant Nr. N201384834.     

Solving ℓ1 Regularization Problems With Piecewise Linear Losses

This article is concerned with the computational aspect of ?₁ regularization problems with a certain class of piecewise linear loss functions. The problem of computing the ?₁ regularization path for a piecewise linear loss can be formalized as a parametric linear programming problem. We propose an efficient implementation method of the parametric simplex algorithm for such a problem. We also conduct a simulation study to investigate the behavior of the number of “breakpoints” of the regularization path when both the number of observations and the number of explanatory variables vary. Our method is also applicable to the computation of the regularization path for a piecewise linear loss and the blockwise ?_∞ penalty. This article has supplementary material online.     

Fitting hyperplanes by minimizing orthogonal deviations

Hyperplanes withm + 1 parameters are fitted by minimizing the sum of weighted orthogonal deviations to a set ofN points. There is no inverse regression incompatibility. For unweighted orthogonall ₁-fits essentially the same number of points are on either side of an optimal hyperplane. The criterion function is neither convex, nor concave, nor even differentiable. The main result is that each orthogonall _p -fit interpolates at leastm + 1 points, for 0 <p 1. This enables the combinatorial strategy of systematically trying all possible hyperplanes which interpolatem + 1 data points.     

A new multivariable <Subscript><Emphasis Type="BoldItalic">6</Emphasis></Subscript><Emphasis Type="BoldItalic">ψ</Emphasis><Subscript><Emphasis Type="BoldItalic">6</Emphasis></Subscript> summation formula

By multidimensional matrix inversion, combined with an A _r extension of Jackson’s ₈ φ ₇ summation formula by Milne, a new multivariable ₈ φ ₇ summation is derived. By a polynomial argument this ₈ φ ₇ summation is transformed to another multivariable ₈ φ ₇ summation which, by taking a suitable limit, is reduced to a new multivariable extension of the nonterminating ₆ φ ₅ summation. The latter is then extended, by analytic continuation, to a new multivariable extension of Bailey’s very-well-poised ₆ ψ ₆ summation formula. Partly supported by FWF Austrian Science Fund grants P17563-N13, and S9607 (the second is part of the Austrian National Research Network “Analytic Combinatorics and Probabilistic Number Theory”).     

Multivariate approximation in the worst case setting over reproducing kernel Hilbert spaces

We study the worst case setting for approximation of d variate functions from a general reproducing kernel Hilbert space with the error measured in the L_∞ norm. We mainly consider algorithms that use n arbitrary continuous linear functionals. We look for algorithms with the minimal worst case errors and for their rates of convergence as n goes to infinity. Algorithms using n function values will be analyzed in a forthcoming paper.We show that the L_∞ approximation problem in the worst case setting is related to the weighted L₂ approximation problem in the average case setting with respect to a zero-mean Gaussian stochastic process whose covariance function is the same as the reproducing kernel of the Hilbert space. This relation enables us to find optimal algorithms and their rates of convergence for the weighted Korobov space with an arbitrary smoothness parameter α>1, and for the weighted Sobolev space whose reproducing kernel corresponds to the Wiener sheet measure. The optimal convergence rates are n^-(α-1)/2 and n^-1/2, respectively.We also study tractability of L_∞ approximation for the absolute and normalized error criteria, i.e., how the minimal worst case errors depend on the number of variables, d, especially when d is arbitrarily large. We provide necessary and sufficient conditions on tractability of L_∞ approximation in terms of tractability conditions of the weighted L₂ approximation in the average case setting. In particular, tractability holds in weighted Korobov and Sobolev spaces only for weights tending sufficiently fast to zero and does not hold for the classical unweighted spaces.     

An analogue of Montel's theorem for some classes of rational functions

For sequences of rational functions, analytic in some domain, a theorem of Montel's type is proved. As an application, sequences of rational functions of the best L _p -approximation with an unbounded number of finite poles are considered.     

Point sets with low <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-discrepancy

In this paper we study the L _p -discrepancy of digitally shifted Hammersley point sets. While it is known that the (unshifted) Hammersley point set (which is also known as Roth net) with N points has L _p -discrepancy (p an integer) of order (log N)/N, we show that there always exists a shift such that the digitally shifted Hammersley point set has L _p -discrepancy (p an even integer) of order which is best possible by a result of W. Schmidt. Further we concentrate on the case p = 2. We give very tight lower and upper bounds for the L ₂-discrepancy of digitally shifted Hammersley point sets which show that the value of the L ₂-discrepancy of such a point set mostly depends on the number of zero coordinates of the shift and not so much on the position of these. This work is supported by the Austrian Research Fund (FWF), Project P17022-N12 and Project S8305.     

<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-mixed intersection bodies

In this paper the author first introduce a new concept of L _p -dual mixed volumes of star bodies which extends the classical dual mixed volumes. Moreover, we extend the notions of L _p intersection body to L _p -mixed intersection body. Inequalities for L _p -dual mixed volumes of L _p -mixed intersection bodies are established and the results established here provide new estimates for these type of inequalities. This work was supported by the Natural Science Foundation of Zhejiang Province of China (Grant No. Y605065) and the Foundation of the Education Department of Zhejiang Province of China (Grant No. 20050392)     

The L p -curvature images of convex bodies and L p -projection bodies

Associated with the L _p -curvature image defined by Lutwak, some inequalities for extended mixed p-affine surface areas of convex bodies and the support functions of L _p -projection bodies are established. As a natural extension of a result due to Lutwak, an L _p -type affine isoperimetric inequality, whose special cases are L _p -Busemann-Petty centroid inequality and L _p -affine projection inequality, respectively, is established. Some L _p -mixed volume inequalities involving L _p -projection bodies are also established.     

The infinite server queue and heuristic approximations to the multi-server queue with and without retrials

In this paper, properties of the time-dependent state probabilities of theM _t /G/∞ queue, when the queue is assumed to start empty are studied. Those results are compared with corresponding time-dependent results for theM/M/1 queue. Approximation to the time-dependent state probabilities of theM/G/m/m queue by means of the corresponding time-dependent state probabilities of theM/G/∞ queue are discussed. Through a decomposition formula it is shown that the main performance characteristics of the ergodicM/M/m/m+d queue are sums of the corresponding random variables for the ergodicM/M/m/m andM/M/1/1+(d−1) queues, respectively, weighted by the 3-rd Erlang formula (stationary probability of waiting or being lost for theM/M/m/m+d queue). Successful exact and approximation extensions of this kind of decomposition formula to theM/M/m/m+d queue with retrials are presented.     

Mean Convergence Theorems for Weighted Sums of Arrays of Residually <Emphasis Type="Italic">h</Emphasis>-integrable Random Variables Concerning the Weights under Dependence Assumptions

From the classical notion of uniform integrability of a sequence of random variables, a new concept called residual h-integrability is introduced for an array of random variables, concerning an array of constants, which is weaker than other previous related notions of integrability. Martingale difference, pairwise negative quadrant dependence, tail φ-mixing property and L _p -mixingale are four special kinds of dependence structures, where 1≤p≤2. By relating the residual h-integrability with such these dependence assumptions, some conditions are formulated under which mean convergence theorems for weighted sums of arrays of random variables are established, and many earlier results are explained as the special cases of the ones appearing in our present work.      

On the b-Coloring of Cographs and <Emphasis Type="Italic">P</Emphasis><Subscript>4</Subscript>-Sparse Graphs

A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned to it. The b-chromatic number of a graph G, denoted by χ _b (G), is the maximum number t such that G admits a b-coloring with t colors. A graph G is b-continuous if it admits a b-coloring with t colors, for every . We define a graph G to be b-monotonic if χ _b (H ₁) ≥ χ _b (H ₂) for every induced subgraph H ₁ of G, and every induced subgraph H ₂ of H ₁. In this work, we prove that P ₄-sparse graphs (and, in particular, cographs) are b-continuous and b-monotonic. Besides, we describe a dynamic programming algorithm to compute the b-chromatic number in polynomial time within these graph classes. Flavia Bonomo: Partially supported by ANPCyT PICT-2007-00533 and PICT-2007-00518, and UBACyT Grants X069 and X606 (Argentina). Guillermo Durán: Partially supported by FONDECyT Grant 1080286 and Millennium Science Institute “Complex Engineering Systems” (Chile), and ANPCyT PICT-2007-00518 and UBACyT Grant X069 (Argentina). Javier Marenco: Partially supported by ANPCyT PICT-2007-00518 and UBACyT Grant X069 (Argentina).     

关于L_p球的几个新不等式和性质(英文)

本文研究了L_p球的相关问题.利用对偶混合体积、球面Radon变换和Fourier变换的方法,获得了关于L_p球的几个新不等式和性质,其中一个不等式与著名的最大切片猜想有关.     

Trade Spectrum of K 4 − e

A K₄ − e trade consists of two disjoint decompositions of some simple graph H into copies of K₄ − e. The number of vertices of H is referred to as the foundation of the trade, while the number of copies of K₄ − e in each of the decompositions is called the volume of the trade. We determine the values of v and s for which there exists a K₄ − e trade of volume s and foundation v.     

Realization of primitive branched coverings over closed surfaces following the hurwitz approach

Let V be a closed surface, H⊑π₁(V) a subgroup of finite index l and D=[A ₁,...,A _m ] a collection of partitions of a given number d≥2 with positive defect v(D). When does there exist a connected branched covering f:W→V of order d with branch data D and f∶W→V It has been shown by geometric arguments [4] that, for l=1 and a surface V different from the sphere and the projective plane, the corresponding branched covering exists (the data D is realizable) if and only if the data D fulfills the Hurwitz congruence v(D)э0 mod 2. In the case l>1, the corresponding branched covering exists if and only if v(D)э0 mod 2, the number d/l is an integer, and each partition A _i ∈D splits into the union of l partitions of the number d/l. Here we give a purely algebraic proof of this result following the approach of Hurwitz [11]. The realization problem for the projective plane and l=1 has been solved in [7,8]. The case of the sphere is treated in [1, 2, 12, 7].     

The decomposition of Kv into K2×K5''''s

The decomposition of the complete graph Kv into Kr×Kc's, the products of Kr and Kc,is originated from the use of DNA library screening. In this paper, we consider the case where r=2 and c = 5, and show that such a decomposition exists if and only if v ≡ 1 (mod 25).     

Map Preserving Local Properties of a Digital Image

In order to study digital topological properties of a k-surface in Z ⁿ , we generalize the topological number in Bertrand (Pattern Recogn. Lett. 15:1003–1011, 1994). Furthermore, we show that a local (k ₀,k ₁)-isomorphism preserves some digital-topological properties, such as a generalized topological number and a simple k ₀-point, and prove that a local (k ₀,k ₁)-isomorphism takes a simple k ₀-surface in into a simple k ₁-surface in .      

Weak Equality and Exact Sequences in H v -modules

The largest class of multivalued systems satisfying the module-like axioms is the H_v-module. H_v-modules first were introduced by Vougiouklis. In this paper we define weak equality between two subsets of an H_v-module and introduced the notion of exact sequences of H_v-modules. Also some results on the weak equality and exact sequences are given.     

An infeasible-interior-point predictor-corrector algorithm for theP *-geometric LCP

AP _*-geometric linear complementarity problem (P _*GP) as a generalization of the monotone geometric linear complementarity problem is introduced. In particular, it contains the monotone standard linear complementarity problem and the horizontal linear complementarity problem. Linear and quadratic programming problems can be expressed in a “natural” way (i.e., without any change of variables) asP _*GP. It is shown that the algorithm of Mizunoet al. [6] can be extended to solve theP _*GP. The extended algorithm is globally convergent and its computational complexity depends on the quality of the starting points. The algorithm is quadratically convergent for problems having a strictly complementary solution. The work of F. A. Potra was supported in part by NSF Grant DMS 9305760