Related papers: Improved Formula for the Multi-Section of the Line…
The concept of generalized partial-slice monogenic functions has been recently introduced to include the two theories of monogenic functions and of slice monogenic functions over Clifford algebras. The main purpose of this article is to…
New bispectral polynomials orthogonal on a quadratic bi-lattice are obtained from a truncation of Wilson polynomials. Recurrence relation and difference equation are provided. The recurrence coefficients can be encoded in a perturbed…
Let $m \geq 2$, let $P(x) \in \mathbb{C}[x]$ have simple roots, and let $A = \mathbb{C}[x^{\pm 1},\,u \mid u^m = P(x)]$ be the coordinate ring of the associated superelliptic curve. The derivation algebra $\mathrm{Der}(A)$ and the current…
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…
The purpose of the paper is to introduce two new algorithms. The first one computes a linear recursion for proper hypergeometric multisums, by treating one summation variable at a time, and provides rational certificates along the way. A…
We generalize Gassert-Shor formula for numerical semigroups.
A new explicit closed-form formula for the multivariate $(n, k)$th partial Bell polynomial $B_{n,k} (x_1, x_2, ..., x_{n - k + 1})$ is deduced. The formula involves multiple summations and makes it possible, for the first time, to easily…
Analytic expressions for the Fourier transforms of the Chebyshev and Legendre polynomials are derived, and the latter is used to find a new representation for the half-order Bessel functions. The numerical implementation of the so-called…
We study monic polynomials $Q_n(x)$ generated by a high order three-term recursion $xQ_n(x)=Q_{n+1}(x)+a_{n-p} Q_{n-p}(x)$ with arbitrary $p\geq 1$ and $a_n>0$ for all $n$. The recursion is encoded by a two-diagonal Hessenberg operator $H$.…
New modifications of the methods for simultaneous extraction of all roots of polynomials over an arbitrary Chebyshev system are elaborated. A cubic convergence of iterations is proved. The method presented is a generalisation of the…
A new recurrence relation for exceptional orthogonal polynomials is proposed, which holds for type 1, 2 and 3. As concrete examples, the recurrence relations are given for Xj-Hermite, Laguerre and Jacobi polynomials in j = 1,2 case.
We give a complete investigation of Morley's trisector theorem. If the intersections of the half lines starting from the adjacent vertices of a triangle form an equilateral triangle for an arbitrary triangle, then the half lines are the…
A new type of sl_3 basic hypergeometric series based on Macdonald polynomials is introduced. Besides a pair of Macdonald polynomials attached to two different sets of variables, a key-ingredient in the sl_3 basic hypergeometric series is a…
We describe a recurrence formula for the plethysm $h_3[h_n]$. The proof is based on the original formula by Thrall.
A recursive calculational scheme is developed for matrix elements in the generalized seniority scheme for the nuclear shell model. Recurrence relations are derived which permit straightforward and efficient computation of matrix elements of…
We solve an eigenvalue equation that appears in several papers about a wide range of physical problems. The Frobenius method leads to a three-term recurrence relation for the coefficients of the power series that, under suitable truncation,…
We investigate a relationship between MacMahon's generalized sum-of-divisors functions and Chebyshev polynomials of the first kind. This determines a recurrence relation to compute these functions, as well as proving a conjecture of…
We provide a definition of Multidimensional Chebyshev Systems of order N which is satisfied by the solutions of a wide class of elliptic equations of order 2N. This definition generalizes a very large class of Extended Complete Chebyshev…
Recently, a new class of words, denoted by L_n, was shown to be in bijection with a subset of the Dyck paths of length 2n having cardinality given by the (n-1)-st Catalan number. Here, we consider statistics on L_n recording the number of…
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…