相关论文: On Calculating the Coefficients of a Polynomial Ge…

Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…

We present a Ritz-Galerkin discretization on sparse grids using pre-wavelets, which allows to solve elliptic differential equations with variable coefficients for dimension $d=2,3$ and higher dimensions $d>3$. The method applies multilinear…

In the preprocessing framework for dealing with uncertain data, one is given a set of regions that one is allowed to preprocess to create some auxiliary structure such that when a realization of these regions is given, consisting of one…

We give the connection between three polynomials that generate triangles in The On-Line Encyclopedia of Integer Sequences (A123192, A137396 and A300453). We show that they are related with the bracket polynomial for the (2,n)-torus knot

The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…

Polytope numbers for a given polytope are an integer sequence defined by the combinatorics of the polytope. Recent work by H. K. Kim and J. Y. Lee has focused on writing polytope number sequences as sums of simplex number sequences. In…

We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…

We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

In this paper we first study the isoperimetric problem in the case of integer triangles, as well as Alcuin's sequence and how it relates to the number of different integer triangles with a given perimeter. We then present and compare two…

A set of orthogonal polynomials on the unit disk $B(0,1)$ known as Zernike polynomials are commonly used in the analysis and evaluation of optical systems. Here Zernike polynomials are used to construct wavelets for polynomial subspaces of…

We introduce a new array of type $D$ Eulerian numbers, different from that studied by Brenti, Chow and Hyatt. We find in particular the recurrence relation, Worpitzky formula and the generating function. We also find the probability…

We give an algorithm which calculates the generating function of the cocharacter sequence of the polynomial identities of the algebra of upper block triangular (p+2q) x (p+2q) matrices over a field of characteristic zero with diagonal…

We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…

In 1938 E. T. Bell introduced "The Iterated Exponential Integers". He proved that these numbers may be expressed by polynomials with rational coefficients. However, Bell gave no formulas for any of the coefficients except the trivial one,…

The sequence $A067549$ of The On-Line Encyclopedia of Integer Sequences is defined as $(a_k)_{k \geq 1}$ with $a_k$ being the determinant of the $k \times k$ matrix whose diagonal contains the first $k$ prime numbers and all other elements…

Only one three-term recurrence relation, namely, $W_{r}=2W_{r-1}-W_{r-4}$, is known for the generalized Tribonacci numbers, $W_r$, $r\in\mathbb{Z}$, defined by $W_{r}=W_{r-1}+W_{r-2}+W_{r-3}$ and \mbox{$W_{-r}=W_{-r+3}-W_{-r+2}-W_{-r+1}$},…

Many identities written by $P=S=C$ are obtained, where $P$ infinite products, $S$ infinite series, and $C$ continued fractions. Such equality is called {\it triplicity}, and it can be used to compute the values of infinite series. It is…

We consider polynomials that are defined as Wronskians of certain sets of Hermite polynomials. Our main result is a recurrence relation for these polynomials in terms of those of one or two degrees smaller, which generalizes the well-known…

We study Wronskians of Hermite polynomials labelled by partitions and use the combinatorial concepts of cores and quotients to derive explicit expressions for their coefficients. These coefficients can be expressed in terms of the…