Related papers: Recursive Polynomial Remainder Sequence and its Su…
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
The Residual Congruent Subset (RCS) is a new method for finding outliers in the linear regression setting. Like many other outlier detection procedures, RCS searches for a subset which minimizes a criterion. The difference is that the new…
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…
Polynomial regression is a basic primitive in learning and statistics. In its most basic form the goal is to fit a degree $d$ polynomial to a response variable $y$ in terms of an $n$-dimensional input vector $x$. This is extremely…
New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…
A recursive random number generator using prime reciprocals is described.
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.…
We present a multidimensional generalization of Zeckendorf's Theorem (any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers) to a large family of linear recurrences. This extends work of Anderson and…
Generalized Pl\"ucker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of…
In high-dimensional prediction problems, where the number of features may greatly exceed the number of training instances, fully Bayesian approach with a sparsifying prior is known to produce good results but is computationally challenging.…
We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…
Polynomial preconditioning is an important tool in solving large linear systems and eigenvalue problems. A polynomial from GMRES can be used to precondition restarted GMRES and restarted Arnoldi. Here we give methods for indefinite matrices…
Sequential Recommender Systems (SRSs) have emerged as a highly efficient approach to recommendation systems. By leveraging sequential data, SRSs can identify temporal patterns in user behaviour, significantly improving recommendation…
In this paper we study scalar multivariate subdivision schemes with general integer expanding dilation matrix. Our main result yields simple algebraic conditions on the symbols of such schemes that characterize their polynomial…
This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…
Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a $(r+2)$-term recurrence relation connecting the type II multiple orthogonal polynomials near the diagonal (the so-called step-line recurrence…
It is known that the common factors in a large panel of data can be consistently estimated by the method of principal components, and principal components can be constructed by iterative least squares regressions. Replacing least squares…
Some changes in a recent convolution formula are performed here in order to clean it up by using more conventional notations and by making use of more referrenced and documented components (namely Sierpi\'nski's polynomials, the Thue-Morse…
Taking a combinatorial point of view on cyclotomic polynomials leads to a larger class of polynomials we shall call the inclusion-exclusion polynomials. This gives a more appropriate setting for certain types of questions about the…
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…