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

<Emphasis Type="Italic">∂</Emphasis>-operations and <Emphasis Type="Italic">H</Emphasis><Subscript><Emphasis Type="Italic">V</Emphasis></Subscript>-fields

The hyperoperations, called theta-operations （δ）, are motivated from the usual property, which the derivative has on the derivation of a product of functions. Using any map on a set, one can define δ-operations. In this paper, we continue our study on the δ-operations on groupoids, rings, fields and vector spaces or on the corresponding hyperstructures. Using δ-operations one obtains, mainly, Hwstructures, which form the largest class of the hyperstructures. For representation theory of hyperstructures, by hypermatrices, one needs special Hv-rings or Hy-fields, so these hyperstructures can be used. Moreover, we study the relation of these δ-structures with other classes of hyperstructures, especially with the Hv-structures.     

A note about the cyclotomic polynomial Фpq（x） and some related results

Abstract. The expression of cyclotomic polynomial Фpq （x） is concerned for a long time. A simple and explicit expression of Фpq （x） in Z[x] has been showed. The form of the factors of Фpq （x） over F2 and the upper, lower bounds of their Hamming weight are provided.     

Elements of Small Orders in K2F Ⅱ

In "Elements of small orders in K2(F)" (Algebraic K-Theory, Lecture Notes in Math., 966, 1982, 1-6.), the author investigates elements of the form {a, Φn(a)} in the Milnor group K2F of a field F, where Φn(x) is the n-th cyclotomic polynomial. In this paper, these elements are generalized. Applying the explicit formulas of Rosset and Tate for the transfer homomorphism for K2, the author proves some new results on elements of small orders in K2F.     

Conic Formulation for l p -Norm Optimization

In this paper, we formulate the l _p -norm optimization problem as a conic optimization problem, derive its duality properties (weak duality, zero duality gap, and primal attainment) using standard conic duality and show how it can be solved in polynomial time applying the framework of interior-point algorithms based on self-concordant barriers.     

Existence and Construction of H 1-Splines of Class C k on a Three Directional Mesh

Let be the uniform triangulation generated by the usual three directional mesh of the plane and let H ₁ be the regular hexagon formed by the six triangles of surrounding the origin. We study the space of piecewise polynomial functions in C ^k (R ²) with support H ₁ having a sufficiently high degree n, which are invariant with respect to the group of symmetries of H ₁ and whose sum of integer translates is constant. Such splines are called H ₁-splines. We first compute the dimension of this space in function of n and k. Then we prove the existence of a unique H ₁-spline of minimal degree for any fixed k0. Finally, we describe an algorithm computing the Bernstein–Bézier coefficients of this spline.     

A Polynomial Factorization Approach for the Discrete Time GIX/>G/1/K Queue

This paper proposes a polynomial factorization approach for queue length distribution of discrete time GI ^X /G/1 and GI _X /G/1/K queues. They are analyzed by using a two-component state model at the arrival and departure instants of customers. The equilibrium state-transition equations of state probabilities are solved by a polynomial factorization method. Finally, the queue length distributions are then obtained as linear combinations of geometric series, whose parameters are evaluated from roots of a characteristic polynomial.     

Besov spaces andK-functionals inL p, 0<p<1*

We investigate Besov spaces and their connection with trigonometric polynomial approximation inL _p[−π,π], algebraic polynomial approximation inL _p[−1,1], algebraic polynomial approximation inL _p(S), and entire function of exponential type approximation inL _p(R), and characterizeK-functionals for certain pairs of function spaces including (L _p[−π,π],B _s ^a(L _p[−π,π])), (L _p(R),_s ^a(L_p(R))), , and , where 0<s≤∞, 0<p<1,S is a simple polytope and 0<α<r. This project is supported by the National Science Foundation of China.     

The complexity of anl p method for discrete Tchebycheff approximation in exact arithmetic

A discrete Tchebycheff problem is approximated by a sequence ofl _p norm problems. This is an algorithm to be used if a large number of variables is involved as is the case in the approximation of a function of several variables by a polynomial. The complexity of this procedure is investigated and a lower bound for the number of steps to reach ε-optimality is established. Supported by NIH Grant RR01243 at the University of Washington     

Polynomial algorithms for kernels in comparability, permutation and P 4-free graphs

In this paper, we give three polynomial algorithms which detect a kernel in comparability graphs relatively to an M-orientation, in permutation graphs and in P₄-free graphs with a normal orientation. MSC classification: 05C69, 05C85 Correspondence to: Saoula Youcef     

The Flag-Transitive C 3-Geometries of Finite Order

It is shown that a flag-transitive C ₃-geometry of finite order (x, y) with x2 is either a finite building of type C ₃ (and hence the classical polar space for a 6-dimensional symplectic space, a 6-dimensional orthogonal space of plus type, a 6- or 7-dimensional hermitian space, a 7-dimensional orthogonal space, or an 8-dimensional orthogonal space of minus type) or the sporadic A ₇-geometry with 7 points.     

The Minimality Properties of Chebyshev Polynomials and Their Lacunary Series

By considering four kinds of Chebyshev polynomials, an extended set of (real) results are given for Chebyshev polynomial minimality in suitably weighted Hölder norms on [–1,1], as well as (L ) minimax properties, and best L ₁ sufficiency requirements based on Chebyshev interpolation. Finally we establish best L _p , L and L ₁ approximation by partial sums of lacunary Chebyshev series of the form _i=0 a ⁱ _b ⁱ(x) where _n (x) is a Chebyshev polynomial and b is an odd integer 3. A complete set of proofs is provided.     

On Some Extremal Properties of Lagrange Interpolatory Polynomials

In this paper, we will show that Lagrange interpolatory polynomials are optimal for solving some approximation theory problems concerning the finding of linear widths.In particular, we will show that

Full-size image

, where _n is a set of the linear operators with finite rank n+1 defined on −1,1], and where _n+1 denotes the set of polynomials p=∑_i=0ⁿ⁺¹a_ixⁱ of degreen+1 such that a_n+11. The infimum is achieved for Lagrange interpolatory polynomial for nodes .     

Smooth approximations without critical points

In any separable Banach space containing c ₀ which admits a C ^k-smooth bump, every continuous function can be approximated by a C ^k-smooth function whose range of derivative is of the first category. Moreover, the approximation can be constructed in such a way that its derivative avoids a prescribed countable set (in particular the approximation can have no critical points). On the other hand, in a Banach space with the RNP, the range of the derivative of every smooth bounded bump contains a set residual in some neighbourhood of zero.     

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

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

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

Geometric dual formulation for first-derivative-based univariate cubic <Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript> splines

With the objective of generating “shape-preserving” smooth interpolating curves that represent data with abrupt changes in magnitude and/or knot spacing, we study a class of first-derivative-based -smooth univariate cubic L ₁ splines. An L ₁ spline minimizes the L ₁ norm of the difference between the first-order derivative of the spline and the local divided difference of the data. Calculating the coefficients of an L ₁ spline is a nonsmooth non-linear convex program. Via Fenchel’s conjugate transformation, the geometric dual program is a smooth convex program with a linear objective function and convex cubic constraints. The dual-to-primal transformation is accomplished by solving a linear program.     

The Smallest Degree Sum That Yields Potentially Kr＋1 - K3-Graphic Sequences

Let a（Kr,＋1 - K3,n） be the smallest even integer such that each n-term graphic sequence п= （d1,d2,…dn） with term sum σ（п） = d1 ＋ d2 ＋…＋ dn 〉 σ（Kr＋1 -K3,n） has a realization containing Kr＋1 - K3 as a subgraph, where Kr＋1 -K3 is a graph obtained from a complete graph Kr＋1 by deleting three edges which form a triangle. In this paper, we determine the value σ（Kr＋1 - K3,n） for r ≥ 3 and n ≥ 3r＋ 5.