A New Inequality for Weakly （K1, K2）-Quasiregular Mappings

We obtain a new inequality for weakly （K1,K2）-quasiregular mappings by using the McShane extension method. This inequality can be used to derive the self-improving regularity of （K1, K2）-Quasiregular Mappings.     

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”).     

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.     

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).     

<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)     

Properties of Distortion Risk Measures

The current literature does not reach a consensus on which risk measures should be used in practice. Our objective is to give at least a partial solution to this problem. We study properties that a risk measure must satisfy to avoid inadequate portfolio selections. The properties that we propose for risk measures can help avoid the problems observed with popular measures, like Value at Risk (VaR _α ) or Conditional VaR _α (CVaR _α ). This leads to the definition of two new families: complete and adapted risk measures. Our focus is on risk measures generated by distortion functions. Two new properties are put forward for these: completeness, ensuring that the distortion risk measure uses all the information of the loss distribution, and adaptability, forcing the measure to use this information adequately. This research was partially funded by ^1,3 Welzia Management, SGIIC SA, RD Sistemas SA, Comunidad Autónoma de Madrid Grant s-0505/tic/000230, and MEyC Grant BEC2000-1388-C04-03 and by ² the Natural Sciences and Engineering Research Council of Canada (NSERC) Grant 36860-06.     

3-Designs from the Z 4-Goethals Codes via a New Kloosterman Sum Identity

Recently, active research has been performed on constructing t-designs from linear codes over Z ₄. In this paper, we will construct a new simple 3 – (2 ^m , 7, 14/3 (2 ^m – 8)) design from codewords of Hamming weight 7 in the Z ₄-Goethals code for odd m 5. For 3 arbitrary positions, we will count the number of codewords of Hamming weight 7 whose support includes those 3 positions. This counting can be simplified by using the double-transitivity of the Goethals code and divided into small cases. It turns out interestingly that, in almost all cases, this count is related to the value of a Kloosterman sum. As a result, we can also prove a new Kloosterman sum identity while deriving the 3-design.     

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.     

Robust <Emphasis Type="Italic">H</Emphasis><Subscript>∞</Subscript> Output Dynamic Observer-Based Control Design of Uncertain Neutral Systems

In this paper, the robust H _∞ control problem of output dynamic observer-based control for a class of uncertain neutral systems is considered. The linear matrix inequality optimization approach is used to design the new H _∞ output dynamic controls. Three classes of H _∞ observer-based controls are proposed. The minimal H _∞-norm bound and the maximal perturbed bound are given. Based on the result of this paper, the constraint of matrix equality is not necessary for designing the H _∞ observer-based controls. A numerical example is given to stress the usefulness of the proposed results. Communicated by C. T. Leondes The research reported here was supported by the National Science Council of Taiwan, ROC under Grant NSC 94-2213-E-507-002.     

Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems

The purpose of this paper is to derive, in a unified way, second order necessary and sufficient optimality criteria, for four types of nonsmooth minimization problems: thediscrete minimax problem, thediscrete l ₁-approximation, the minimization of theexact penalty function and the minimization of theclassical exterior penalty function. Our results correct and supplement conditions obtained by various authors in recent papers.     

<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> discrepancy of generalized two-dimensional Hammersley point sets

We determine the L _p discrepancy of the two-dimensional Hammersley point set in base b. These formulas show that the L _p discrepancy of the Hammersley point set is not of best possible order with respect to the general (best possible) lower bound on L _p discrepancies due to Roth and Schmidt. To overcome this disadvantage we introduce permutations in the construction of the Hammersley point set and show that there always exist permutations such that the L _p discrepancy of the generalized Hammersley point set is of best possible order. For the L ₂ discrepancy such permutations are given explicitly. F.P. is supported by the Austrian Science Foundation (FWF), Project S9609, that is part of the Austrian National Research Network “Analytic Combinatorics and Probabilistic Number Theory”.     

A Biordered Set Representation of Regular Semigroups

In this paper, for an arbitrary regular biordered set E, by using biorder-isomorphisms between the w-ideals of E, we construct a fundamental regular semigroup WE called NH-semigroup of E, whose idempotent biordered set is isomorphic to E. We prove further that WE can be used to give a new representation of general regular semigroups in the sense that, for any regular semigroup S with the idempotent biordered set isomorphic to E, there exists a homomorphism from S to WE whose kernel is the greatest idempotent-separating congruence on S and the image is a full symmetric subsemigroup of WE. Moreover, when E is a biordered set of a semilattice Eo, WE is isomorphic to the Munn-semigroup TEo; and when E is the biordered set of a band B, WE is isomorphic to the Hall-semigroup WB.     

On the Sears–Slater basic hypergeometric transformations

We introduce the concept of a Jackson integral of type BC ₁ which is a q-series permitting Weyl group symmetry. Using this, we give a simple proof of transformation formulas for a very-well-poised-balanced _2r ψ _2r hypergeometric series discovered by Sears and Slater. This work was supported in part by Grant-in-Aid for Scientific Research (C) No. 17540034 from the Ministry of Education, Culture, Sports, Science and Technology, Japan.     

On potentially K 5-H-graphic sequences

Let K _m -H be the graph obtained from K _m by removing the edges set E(H) of H where H is a subgraph of K _m . In this paper, we characterize the potentially K ₅-P ₄ and K ₅-Y ₄-graphic sequences where Y ₄ is a tree on 5 vertices and 3 leaves. Research was supported by NNSF of China (10271105) and by NSF of Fujian (Z0511034), Fujian Provincial Training Foundation for “Bai-Quan-Wan Talents Engineering”, Project of Fujian Education Department, Project of Zhangzhou Teachers College and by NSERC.     

Global Linear and Quadratic One-step Smoothing Newton Method for P 0-LCP

We propose a new smoothing Newton method for solving the P ₀-matrix linear complementarity problem (P ₀-LCP) based on CHKS smoothing function. Our algorithm solves only one linear system of equations and performs only one line search per iteration. It is shown to converge to a P ₀-LCP solution globally linearly and locally quadratically without the strict complementarity assumption at the solution. To the best of author's knowledge, this is the first one-step smoothing Newton method to possess both global linear and local quadratic convergence. Preliminary numerical results indicate that the proposed algorithm is promising.     

Linear best approximation using a class ofk-majorl p norms

Consideration is given to problems of linear best approximation using a variant of the usuall _p norms referred to ask-majorl _p norms, for the cases when 1<p<. The underlying problem is the minimization of a piecewise smooth function. Best approximations are characterized, and a descent algorithm is developed.     

Reliability Approximation for Markov Chain Imbeddable Systems

In the present article, a simple method is developed for approximating the reliability of Markov chain imbeddable systems. The approximating formula reduces the problem to the reliability assessment of smaller systems with structure similar to the original systems. Two specific reliability structures which have attracted considerable research interest recently (r-within-consecutive-k-out-of-n system and two dimensional r-within-k ₁ × k ₂-out-of-n ₁ × n ₂ system) are studied by the new approach and numerical calculations are carried out, which reveal the high quality of our approximations. Several possible extensions and generalizations are also presented in brief.     

Predictor-corrector algorithm for solvingP *(κ)-matrix LCP from arbitrary positive starting points

A new predictor-corrector algorithm is proposed for solvingP _*(κ)-matrix linear complementarity problems. If the problem is solvable, then the algorithm converges from an arbitrary positive starting point (x ⁰,s ⁰). The computational complexity of the algorithm depends on the quality of the starting point. If the starting point is feasible or close to being feasible, it has -iteration complexity, whereρ ₀ is the ratio of the smallest and average coordinate ofX ⁰ s ⁰. With appropriate initialization, a modified version of the algorithm terminates in O((1+κ)²(n/ρ ₀)L) steps either by finding a solution or by determining that the problem has no solution in a predetermined, arbitrarily large, region. The algorithm is quadratically convergent for problems having a strictly complementary solution. We also propose an extension of a recent algorithm of Mizuno toP _*(κ)-matrix linear complementarity problems such that it can start from arbitrary positive points and has superlinear convergence without a strictly complementary condition. The work of this author was supported in part by NSF, Grant DMS 9305760 and by an Oberman fellowship from the University of Iowa Center for Advanced Studies.     

Askey–Wilson type integrals associated with root systems

A new formula for an Askey–Wilson type integral associated with the root system F ₄ is studied. A simple proof of the evaluation formula for the original Askey–Wilson integral is also stated. 2000 Mathematics Subject Classification Primary—33D67, 33D60 This work was supported in part by Grant-in-Aid for Scientific Research (C) No. 15540045 from the Ministry of Education, Culture, Sports, Science and Technology (Japan).     

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

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