Related papers: Pell-Padovan tetranacci numbers and their Hadamard…
Louis W. Shapiro gave a combinatorial proof of a bilinear generating function for Chebyshev polynomials equivalent to the formula 1/(1-ax-x^2) * 1/(1-bx-x^2) = (1-x^2)/(1-abx-(2+a^2+b^2)x^2 -abx^3+x^4), where * denotes the Hadamard product.…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
We characterize a family of number triangles whose production matrices are closely related to the original number triangle. We study a number of such triangles that are of combinatorial significance. For a specific subfamily, these…
In this paper, we explore the relationship between repdigits and associated Pell numbers, specifically focusing on two main aspects: expressing repdigits as the difference of two associated Pell numbers, and identifying which associated…
In this paper we use the double affine Hecke algebra to compute the Macdonald polynomial products $E_\ell P_m$ and $P_\ell P_m$ for type $SL_2$ and type $GL_2$ Macdonald polynomials. Our method follows the ideas of Martha Yip but executes a…
We evaluate some new three parameter families of finite reciprocal sums involving Horadam numbers. We will also be able to state the results for the infinite sums. Some Fibonacci and Lucas sums will be presented as examples.
Bernoulli numbers are usually expressed in terms of their lower index numbers (recursive). This paper gives explicit formulas for Bernoulli numbers of even index. The formulas contain a remarkable sequence of determinants. The value of…
A closed formula multiallelic Walsh (or Hadamard) transform is introduced. Basic results are derived, and a statistical interpretation of some of the resulting linear forms is discussed.
In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…
In this note, we explore two families of sequences associated to a suitable integer sequence: the gap-sum sequence and the gap-product sequence. These are the sums and the products of consecutive numbers not in the original sequence. We…
Numerous novel integral and series representations for Ferrers functions of the first kind (associated Legendre functions on the cut) of arbitrary degree and order, various integral, series and differential relations connecting Ferrers…
In this paper, we introduce the degenerate central factorial polynomials and numbers of the second kind which are degenerate versions of the central factorial polynomials and numbers of the second kind. We derive some properties and…
The computation of matrix functions is a well-studied problem. Of special importance are the exponential and the logarithm of a matrix, where the latter also raises existence and uniqueness questions. This is particularly relevant in the…
A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of…
A new algebraic object is introduced - recurrent fractions, which is an n-dimensional generalization of continued fractions. It is used to describe an algorithm for rational approximations of algebraic irrational numbers. Some…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
The aim of the work is to construct new polynomial systems, which are solutions to certain functional equations which generalize the second-order differential equations satisfied by the so called classical orthogonal polynomial families of…
In this paper, using computations done through the LiE software, we compare the tensor product of irreducible selfdual representations of the special linear group with those of classical groups to formulate some conjectures relating the…
Using a simple recurrence relation we give a new method to compute Jones polynomials of closed braids: we find a general expansion formula and a rational generating function for Jones polynomials. The method is used to estimate degree of…
It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…