Related papers: On a 2-orthogonal polynomial sequence via quadrati…
Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
Let $k$ be an algebraically closed field, and let $C\subset \mathbb{P}^n_k$ be a reduced closed subscheme with ideal sheaf $\mathcal{I}$. Let $\mathcal{I}^{<2>}$ be the second symbolic power of $\mathcal{I}$. When $C$ is an integral curve,…
This paper studies properties of q-Jacobi polynomials and their duals by means of operators of the discrete series representations for the quantum algebra U_q(su_{1,1}). Spectrum and eigenfunctions of these operators are found explicitly.…
We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
When neural networks are used to solve differential equations, they usually produce solutions in the form of black-box functions that are not directly mathematically interpretable. We introduce a method for generating symbolic expressions…
The aim of this paper is to study harmonic polynomials on the quantum Euclidean space E^N_q generated by elements x_i, i=1,2,...,N, on which the quantum group SO_q(N) acts. The harmonic polynomials are defined as solutions of the equation…
Induced by three gluons symmetry, Mandelstam variables $s$, $t$, $u$ symmetric expressions are widely involved in collider physics, especially in heavy quarkonium physics. In this work we study general form of $s$, $t$, $u$ symmetric…
The main objects of the investigation presented in this paper are branched-continued-fraction representations of ratios of contiguous hypergeometric series and type II multiple orthogonal polynomials on the step-line with respect to linear…
Let $\{\mathbb{P}_n\}_{n\ge 0}$ and $\{\mathbb{Q}_n\}_{n\ge 0}$ be two monic polynomial systems in several variables satisfying the linear structure relation $$\mathbb{Q}_n = \mathbb{P}_n + M_n \mathbb{P}_{n-1}, \quad n\ge 1,$$ where $M_n$…
We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…
We use the Legendre polynomials and the Hermite polynomials as two examples to illustrate a simple and systematic technique on deriving asymptotic formulas for orthogonal polynomials via recurrence relations. Another application of this…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…
In this paper we discuss three symbolic approaches for the generation of a finite difference scheme of a partial differential equation (PDE). We prove, that for a linear PDE with constant coefficients these three approaches are equivalent…
We consider a symbolic coding of linear trajectories in the regular octagon with opposite sides identified (and more generally in regular 2n-gons). Each infinite trajectory gives a cutting sequence corresponding to the sequence of sides…
This paper presents a generalised symbolic algorithm for solving systems of linear algebraic equations with multi-diagonal coefficient matrices. The algorithm is given in a pseudocode. A theorem which gives the condition for correctness of…
The theory of symmetric functions has been extended to the case where each variable is paired with an anticommuting one. The resulting expressions, dubbed superpolynomials, provide the natural N=1 supersymmetric version of the classical…
We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.