Pseudoaffinity, de Boor algorithm, and blossoms

In order to ensure existence of a de Boor algorithm (hence of a B-spline basis) in a given spline space with (n+1)-dimensional sections, it is important to be able to generate each spline by restriction to the diagonal of a symmetric function of n variables supposed to be pseudoaffine w.r. to each variable. We proved that a way to obtain these three properties (symmetry, n-pseudoaffinity, diagonal property) is to suppose the existence of blossoms on the set of admissible n-tuples, given that blossoms are defined in a geometric way by means of intersections of osculating flats. In the present paper, we examine the converse: do symmetry, n-pseudoaffinity, and diagonal property imply existence of blossoms?     

关于三维各向同性谐振子径向矩阵元计算的讨论

根据广义Laguerre多项式的数学性质，导出了较为简单的三维各向同性谐振子径向矩阵元的普遍公式,并在这基础上计算了一些重要特殊情形的径向矩阵元: 矢径r整数次幂的平均值，电偶极跃迁矩阵元和电四极跃迁矩阵元. 关键词： 三维各向同性谐振子 径向矩阵元 广义Laguerre多项式 偶极跃迁 四极跃迁     

Generalized Christoffel functions and error of positive quadrature

The author gives some upper and lower bounds for the generalized Christoffel functions related to a Ditzian-Totik generalized weight. As an application, an error estimate of Gauss quadrature formula inL ₁-weighted norm is derived.Dedicated to Prof. Luigi Gatteschi on the occasion of his 70th birthdayWork sponsored by MURST 40%.     

Differentiators and the geometry of polynomials

In 1959, Davis introduced the concept of a differentiator of an operator on a finite-dimensional Hilbert space. We prove that every such operator possesses a differentiator. We also use the theory of differentiators to solve several problems in the geometry of polynomials. For instance, we answer in the affirmative a twenty year old unsolved conjecture of Schoenberg, a related conjecture of Katsoprinakis and a fifty year old unsolved conjecture of De Bruijn and Springer.     

Perturbed recurrence relations II the general case

In this paper, we give some new explicit relations between two families of polynomials defined by recurrence relations of all order. These relations allow us to analyze, even in the Sobolev case, how some properties of a family of orthogonal polynomials are affected when the coefficients of the recurrence relation and the order are perturbed. In a paper we have already given a method which allows us to study the polynomials defined by a three-term recurrence relation. Also here some generalizations are given.     

Some inequalities for characteristic functions. II

Recently we established Matysiak and Szablowski's conjecture [V. Matysiak, P.J. Szablowski, Theory Probab. Appl. 45 (2001) 711-713] about a lower bound of real-valued characteristic functions. In this paper, applying an alternative approach we are able to give explicitly the ranges of argument for which the obtained inequalities hold true for general characteristic functions.     

Co-Orthogonal Codes

We define, construct and sketch possible applications of a new class of non-linear codes: co-orthogonal codes, with possible applications in cryptography and parallel processing. We also describe a fast and general method for generating (non-linear) codes with prescribed dot-products with the help of multi-linear polynomials.     

Lattice animals: Supplementation of perimeter polynomial data by graph-theoretic methods

Application of graph-theoretic methods to new perimeter polynomials for connected clusters on a lattice yields extra data on the total number of clusters and for the coefficients in the series expansion for the mean size of clusters at low densities. The lattices studied are the square, the square with next nearest neighbors, the triangular, and the simple cubic.     

（0,1;0）-INTERPOLATION ON INFINITE INTERVAL （-∞, ＋∞）

In this paper, we study the explicit representation and convergence of （0, 1;0）-interpolation on infisite interval, which means to determine a polynomial of degree ≤ 3n - 2 when the function values areprescribed at two set of points namely the zeros of Hn（x） and H′n （x） and the first derivatives at the zerosof H′n（x）.     

Degree distribution of the greatest common divisor of polynomials over 𝔽q

We study the degree distribution of the greatest common divisor of two or more random polynomials over a finite field ??_q. We provide estimates for several parameters like number of distinct common irreducible factors, number of irreducible factors counting repetitions, and total degree of the gcd of two or more polynomials. We show that the limiting distribution of a random variable counting the total degree of the gcd is geometric and that the distributions of random variables counting the number of common factors (with and without repetitions) are very close to Poisson distributions when q is large. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006