Related papers: Algorithmic work with orthogonal polynomials and s…

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Differintegral methods, currently exploited in calculus, provide a fairly unexhausted source of tools to be applied to a wide class of problems involving the theory of special functions and not only. The use of integral transforms of Borel…

This is a survey of some recent developments in the theory of associative and nonassociative dialgebras, with an emphasis on polynomial identities and multilinear operations. We discuss associative, Lie, Jordan, and alternative algebras,…

In the paper we provide some polynomial identities for finite-dimensional algebras. A list of well known single polynomial identities is exposed and the classification of all $2$-dimensional algebras with respect to these identities is…

The software package developed in the MS thesis research implements functions for the intelligent guessing of polynomial sequence formulas based on user-defined expected sequence factors of the input coefficients. We present a specialized…

The so-called polynomial equations play an important role both in algebra and in the theory of functional equations. If the unknown functions in the equation are additive, relatively many results are known. However, even in this case, there…

We propose an algebraic formulation for two distinct quantum algorithms: a quantum classification algorithm and a quantum search algorithm with a non-uniform initial distribution, both based on Clifford algebras and spinorial…

This paper presents a comprehensive survey of 18 distinct polynomials and their potential applications in Kolmogorov-Arnold Network (KAN) models as an alternative to traditional spline-based methods. The polynomials are classified into…

Orthogonal polynomials of two real variables can often be represented in complex variables. We explore the connection between the two types of representations and study the structural relations of complex orthogonal polynomials. The complex…

We prove that functions over the reals computable in polynomial time can be characterised using discrete ordinary differential equations (ODE), also known as finite differences. We also provide a characterisation of functions computable in…

We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial…

We look for spectral type differential equations for the generalized Jacobi polynomials and for the Sobolev-Laguerre polynomials. We use a method involving computeralgebra packages like Maple and Mathematica and we will give some…

We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…

Online Analytical Processing (OLAP) comprises tools and algorithms that allow querying multidimensional databases. It is based on the multidimensional model, where data can be seen as a cube, where each cell contains one or more measures…

These lectures given to graduate students in theoretical particle physics, provide an introduction to the ``inner workings'' of computer algebra systems. Computer algebra has become an indispensable tool for precision calculations in…

Applying Gr\"obner basis theory to concrete problems in Lean 4 remains difficult since the current formalization of multivariate polynomials is based on a non-computable representation and is therefore not suitable for efficient symbolic…

Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…