This work presents a new framework for Gröbner basis computations with Boolean polynomials. Boolean polynomials can be modelled in a rather simple way, with both coefficients and degree per variable lying in {0, 1}. The ring of Boolean polynomials is, however, not a polynomial ring, but rather the quotient ring of the polynomial ring over the field with two elements modulo the field equations x...

Abstract. We revisit the important paper [D. S. Mackey, N. Mackey, C. Mehl, and V. Mehrmann, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 971–1004] and, by viewing matrices as coefficients for bivariate polynomials, we provide concise proofs for key properties of linearizations for matrix polynomials. We also show that every pencil in the double ansatz space is intrinsically connected to a Bézout...

We describe a recursive algorithm that produces an integral basis for the centre of the Hecke algebra of type A consisting of linear combinations of monomial symmetric polynomials of Jucys–Murphy elements. We also discuss the existence of integral bases for the centre of the Hecke algebra that consist solely of monomial symmetric polynomials of Jucys–Murphy elements. Finally, for n = 3, we show...

In this paper, we summarize our initial experiences in designing head-worn displays with free-form optical surfaces. Typical optical surfaces implemented in raytrace codes today are functions mapping two dimensional vectors to real numbers. The majority of optical designs to date have relied on conic sections and polynomials as the functions of choice. The choice of conic sections is justified ...

This work presents a new framework for Gröbner basis computations with Boolean polynomials. Boolean polynomials can be modeled in a rather simple way, with both coefficients and degree per variable lying in {0, 1}. The ring of Boolean polynomials is, however, not a polynomial ring, but rather the quotient ring of the polynomial ring over the field with two elements modulo the field equations x2...

Algebraic relations between discrete and continuous moments of scaling functions are investigated based on the construction of Bell polynomials. We introduce families of scaling functions which are parametrized by moments. Filter coefficients of scaling functions and wavelets are computed with computer algebra methods (in particular Gröbner bases) using relations between moments. Moreover, we p...

This paper presents a new set of hemispherical basis functions dedicated to hemispherical data representation. These functions are derived from associated Legendre polynomials. We demonstrate the usefulness of this basis for representation of surface reflectance functions, rendering using environment maps and for efficient global illumination computation using radiance caching. We show that our...

Two efficient spectral-element methods, based on Legendre and Laguerre polynomials respectively, are derived for direct approximation of the electronic Schrödinger equation in one spatial dimension. Compared to existing literatures, a spectral-element approach is used to treat the singularity in nucleus-electron Coulomb potential, and with the help of Slater determinant, special basis functions...

Invariants to image scaling composed of Gaussian–Hermite moments are introduced in this paper for the first time. To achieve the invariance, we propose to modulate the Gaussian–Hermite polynomial basis using variable parameter σ, the value of which depends on the input image. The scaling invariance property can be coupled with the rotation invariance presented earlier. This approach is applicab...

The aim of this paper is to apply Galerkin weighted residual method for solving eleventh-order BVPs. In this method, we exploit Bernstein and Legendre polynomials as basis functions which are modified into to a new set of basis functions to satisfy the corresponding homogeneous form of boundary conditions where the essential types of boundary conditions are mentioned. The method is formulated a...