The Lascoux, Leclerc and Thibon algorithm and Soergel's tilting algorithm

We generalize Soergel's tilting algorithm to singular weights and deduce from this the validity of the Lascoux-Leclerc-Thibon conjecture on the connection between the canonical basis of the basic submodule of the Fock module and the representation theory of the Hecke-algebras at root of unity. Supported in part by Programa Reticulados y Ecuaciones and by FONDECYT grant 1051024.     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.     

Comparison of higher-order accurate schemes for solving the two-dimensional unsteady Burgers' equation

This paper is devoted to the testing and comparison of numerical solutions obtained from higher-order accurate finite difference schemes for the two-dimensional Burgers' equation having moderate to severe internal gradients. The fourth-order accurate two-point compact scheme, and the fourth-order accurate Du Fort Frankel scheme are derived. The numerical stability and convergence are presented. The cases of shock waves of severe gradient are solved and checked with the fourth-order accurate Du Fort Frankel scheme solutions. The present study shows that the fourth-order two-point compact scheme is highly stable and efficient in comparison with the fourth-order accurate Du Fort Frankel scheme.     

高阶Bernoulli多项式和高阶Euler多项式的关系

利用发生函数的方法，讨论了高阶Bernoulli数和高阶Euler数，高阶Bernoulli多项式和高阶Euler多项式之间的关系，得到了经典Bernoulli数和Euler数，经典Bernoulli多项式和Euler多项式之间的新型关系。     

Evaluation formulas for Tornheim's type of alternating double series

In this paper, we give some evaluation formulas for Tornheim's type of alternating series by an elementary and combinatorial calculation of the uniformly convergent series. Indeed, we list several formulas for them by means of Riemann's zeta values at positive integers.

     

Approximating weak Chebyshev subspaces by Chebyshev subspaces

We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties.     

Determining radii of meromorphy via orthogonal polynomials on the unit circle

Using a convergence theorem for Fourier–Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard's theorem for determining the radius of m-meromorphy of a function analytic on the unit disk and apply this to the location of poles of the reciprocal of Szeg functions.     

Romanovski polynomials in selected physics problems

We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties. We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula.     

Proximality and Chebyshev sets

This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex.     

INJECTIVE PRECOVERS AND MODULES OF GENERALIZED INVERSE POLYNOMIALS

Let (S,≤) be an ordered set. Recall that (S,≤) is artinian if every strictly decreasingsequence of elements of S is ?nite, and that (S,≤) is narrow if every subset of pairwiseorder-incomparable elements of S is ?nite. Let S be a commutative monoid. Unl…