The <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-Approximation Order of Surface Spline Interpolation for 1 \leq <Emphasis Type="Italic">p</Emphasis> \leq 2

We show that the L_p-approximation order of surface spline interpolation equals m+1/p for p in the range 1 \leq p \leq 2, where m is an integer parameter which specifies the surface spline. Previously it was known that this order was bounded below by m + &frac; and above by m+1/p. With h denoting the fill-distance between the interpolation points and the domain , we show specifically that the L_p()-norm of the error between f and its surface spline interpolant is O(h^{m + 1/p}) provided that f belongs to an appropriate Sobolev or Besov space and that \subset R^d is open, bounded, and has the C^2m-regularity property. We also show that the boundary effects (which cause the rate of convergence to be significantly worse than O(h^2m)) are confined to a boundary layer whose width is no larger than a constant multiple of h |log h|. Finally, we state numerical evidence which supports the conjecture that the L_p-approximation order of surface spline interpolation is m + 1/p for 2 < p \leq \infty.     

Remarks on the <Emphasis Type="Italic">k</Emphasis>-error linear complexity of <Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>-periodic sequences

Recently the first author presented exact formulas for the number of 2 ⁿ -periodic binary sequences with given 1-error linear complexity, and an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k ≥ 2, of a random 2 ⁿ -periodic binary sequence. A crucial role for the analysis played the Chan–Games algorithm. We use a more sophisticated generalization of the Chan–Games algorithm by Ding et al. to obtain exact formulas for the counting function and the expected value for the 1-error linear complexity for p ⁿ -periodic sequences over prime. Additionally we discuss the calculation of lower and upper bounds on the k-error linear complexity of p ⁿ -periodic sequences over .      

A Bijection for the Alperin Weight Conjecture in <Emphasis Type="Italic">S</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

The Alperin weight conjecture states that if G is a finite group and p is a prime, then the number of irreducible Brauer characters of a group G should be equal to the number of conjugacy classes of p-weights of G. This conjecture is known to be true for the symmetric group S _n , however there is no explicit bijection given between the two sets. In this paper we develop an explicit bijection between the p-weights of S _n and a certain set of partitions that is known to have the same cardinality as the irreducible Brauer characters of S _n . We also develop some properties of this bijection, especially in relation to a certain class of partitions whose corresponding Specht modules over fields of characteristic p are known to be irreducible.     

On approximation of functions by trigonometric polynomials with incomplete spectrum in <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>, 0 < <Emphasis Type="Italic">p</Emphasis> < 1

Let B be a set of integers with certain arithmetic properties. We obtain estimates of the best approximation of functions in the space L _p , 0 < p <1, by trigonometric polynomials that are constructed by the system {e^ikx}_{k ? \mathbbZ\B} \{e^{ikx}\}_{k\in \mathbb{Z}\backslash B} . Bibliography: 13 titles.     

Inequalities for derivatives of functions in the spaces <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

  We obtain a new sharp inequality for the local norms of functions x ∈ L _{∞, ∞} ^r (R), namely,

Polynomials of the best uniform approximation to sgn(<Emphasis Type="Italic">x</Emphasis>) on two intervals

We describe polynomials of best uniform approximation to sgn(x) on the union of two intervals [−A,−1] ⊂ [1, B] in terms of special conformal mappings. This permits us to find the exact asymptotic behavior of the error in this approximation.     

<Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">q</Emphasis></Superscript>-Functional Inequalities and Weighted Porous Media Equations

Using measure-capacity inequalities we study new functional inequalities, namely L ^q -Poincaré inequalities

On the directions problem in <Emphasis Type="Italic">AG</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)

We prove that if q = p ^h , p a prime, do not exist sets U í AG(n,q){U {\subseteq} AG(n,q)}, with |U| = q ^k and 1 < k < n, determining N directions where

The best approximation of Laplace operator by linear bounded operators in the space <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

We obtain close two-sided estimates for the best approximation of Laplace operator by linear bounded operators on the class of functions for which the square of the Laplace operator belongs to the L _p -space. We estimate the best constant in the corresponding Kolmogorov inequality and the error of the optimal recovery of values of the Laplace operator on functions from this class defined with an error. In a particular case (p = 2) we solve all three problems exactly.     

Multivariate Refinement Equations and Convergence of Cascade Algorithms in Lp（0〈p〈1）Spaces

We consider the solutions of refinement equations written in the form

An <Emphasis Type="BoldItalic">O</Emphasis>(<Emphasis Type="BoldItalic">h</Emphasis><Superscript><Emphasis Type="Bold">6</Emphasis></Superscript>) numerical solution of general nonlinear fifth-order two point boundary value problems

A sixth-order numerical scheme is developed for general nonlinear fifth-order two point boundary-value problems. The standard sextic spline for the solution of fifth order two point boundary-value problems gives only O(h ²) accuracy and leads to non-optimal approximations. In order to derive higher orders of accuracy, high order perturbations of the problem are generated and applied to construct the numerical algorithm. O(h ⁶) global error estimates obtained for these problems. The convergence properties of the method is studied. This scheme has been applied to the system of nonlinear fifth order two-point boundary value problem too. Numerical results are given to illustrate the efficiency of the proposed method computationally. Results from the numerical experiments, verify the theoretical behavior of the orders of convergence.     

<Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>-error estimates for Dirichlet and Neumann problems on anisotropic finite element meshes

An L ²-estimate of the finite element error is proved for a Dirichlet and a Neumann boundary value problem on a three-dimensional, prismatic and non-convex domain that is discretized by an anisotropic tetrahedral mesh. To this end, an approximation error estimate for an interpolation operator that is preserving the Dirichlet boundary conditions is given. The challenge for the Neumann problem is the proof of a local interpolation error estimate for functions from a weighted Sobolev space.     

Approximation in the <Emphasis Type="BoldItalic">M</Emphasis><Subscript>2</Subscript>/<Emphasis Type="BoldItalic">G</Emphasis><Subscript>2</Subscript>/1 Queue with Preemptive Priority

The main purpose of this paper is to use the strong stability method to approximate the characteristics of the M ₂/G ₂/1 queue with preemptive priority by those of the classical M/G/1 queue. The latter is simpler and more exploitable in practice. After perturbing the arrival intensity of the priority requests, we derive the stability conditions and next obtain the stability inequalities with an exact computation of constants. From those theoretical results, we elaborate an algorithm allowing us to verify the approximation conditions and to provide the made numerical error. In order to have an idea about the efficiency of this approach, we consider a concrete example whose results are compared with those obtained by simulation.     

Cyclic codes over <Emphasis Type="Italic">R</Emphasis><Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>

Cyclic codes over an infinite family of rings are defined. The general properties of cyclic codes over these rings are studied, in particular nontrivial one-generator cyclic codes are characterized. It is also proved that the binary images of cyclic codes over these rings under the natural Gray map are binary quasi-cyclic codes of index 2 ^k . Further, several optimal or near optimal binary codes are obtained from cyclic codes over R _k via this map.     

Riesz <Emphasis Type="Italic">s</Emphasis>-Equilibrium Measures on <Emphasis Type="Italic">d</Emphasis>-Rectifiable Sets as <Emphasis Type="Italic">s</Emphasis> Approaches <Emphasis Type="Italic">d</Emphasis>

Let A be a compact set in of Hausdorff dimension d. For s ∈ (0,d) the Riesz s-equilibrium measure μ ^s is the unique Borel probability measure with support in A that minimizes

A Noncommutative Version of <Emphasis Type="Italic">H</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> and Characterizations of Subdiagonal Algebras

Let M{\mathcal M} be a σ-finite von Neumann algebra and \mathfrak A{\mathfrak A} a maximal subdiagonal algebra of M{\mathcal M} with respect to a faithful normal conditional expectation F{\Phi} . Based on Haagerup’s noncommutative L ^p space L^p(M){L^p(\mathcal M)} associated with M{\mathcal M} , we give a noncommutative version of H ^p space relative to \mathfrak A{\mathfrak A} . If h ₀ is the image of a faithful normal state j{\varphi} in L¹(M){L^1(\mathcal M)} such that j°F = j{\varphi\circ \Phi=\varphi} , then it is shown that the closure of {\mathfrak Ah₀^\frac1p}{\{\mathfrak Ah_0^{\frac1p}\}} in L^p(M){L^p(\mathcal M)} for 1 ≤ p < ∞ is independent of the choice of the state preserving F{\Phi} . Moreover, several characterizations for a subalgebra of the von Neumann algebra M{\mathcal M} to be a maximal subdiagonal algebra are given.     

Kernels and <Emphasis Type="Italic">p</Emphasis>-Kernels of <Emphasis Type="Italic">p</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript>-ary 1-Perfect Codes

The rank of a q-ary code C is the dimension of the subspace spanned by C. The kernel of a q-ary code C of length n can be defined as the set of all translations leaving C invariant. Some relations between the rank and the dimension of the kernel of q-ary 1-perfect codes, over as well as over the prime field , are established. Q-ary 1-perfect codes of length n=(q^m − 1)/(q − 1) with different kernel dimensions using switching constructions are constructed and some upper and lower bounds for the dimension of the kernel, once the rank is given, are established.Communicated by: I.F. Blake     

Intertwining numbers; The <Emphasis Type="Italic">n</Emphasis>-rowed shapes

A fairly old problem in modular representation theory is to determine the vanishing behavior of the Hom groups and higher Ext groups of Weyl modules and to compute the dimension of the ℤ/(p)-vector space for any partitions λ, μ of r, which is the intertwining number. K. Akin, D. A. Buchsbaum, and D. Flores solved this problem in the cases of partitions of length two and three. In this paper, we describe the vanishing behavior of the groups and provide a new formula for the intertwining number for any n-rowed partition.     

<Emphasis Type="Italic">C</Emphasis><Superscript>*</Superscript>-Subalgebras Generated by a Single Operator in <Emphasis Type="Italic">B</Emphasis>(<Emphasis Type="Italic">H</Emphasis>)

In this paper, we characterize a C ^*-subalgebra C ^*(x) of B(H), generated by a single operator x. We show that if x is polar-decomposed by aq, where a is the partial isometry part and q is the positive operator part of x, then C ^*(x) is *-isomorphic to the groupoid crossed product algebra A_q×_a\mathbbG_a\mathcal{A}_{q}\times_{\alpha }\mathbb{G}_{a} , where A_q=C^*(q)\mathcal{A}_{q}=C^{*}(q) and \mathbbG_a\mathbb{G}_{a} is the graph groupoid induced by a partial isometry part a of x.     

<Emphasis Type="Italic">L</Emphasis><Subscript>1</Subscript> spline fits via sliding window process: continuous and discrete cases

The best L ₁ approximation of the Heaviside function and the best ? ₁ approximation of multiscale univariate datasets by a cubic spline have a Gibbs phenomenon near the discontinuity. We show by numerical experiments that the Gibbs phenomenon can be reduced by using L ₁ spline fits which are the best L ₁ approximations in an appropriate spline space obtained by the union of L ₁ interpolation splines. We prove here the existence of L ₁ spline fits for function approximation which has never previously been done to the best of our knowledge. A major disadvantage of this technique is an increased computation time. Thus, we propose a sliding window algorithm on seven nodes which is as efficient as the global method both for functions and datasets with abrupt changes of magnitude, but within a linear complexity on the number of spline nodes.