Polynomial and special function theory remains a vibrant area of mathematical research, interweaving classical algebra with advanced analysis. At its core, the study concerns algebraic expressions ...

The amount of time it takes for an algorithm to solve a polynomial function, which is a mathematical expression that does not contain fractions or negative numbers. The time is proportional to the ...

Chromatic symmetric functions and combinatorial polynomials are central constructs in modern algebraic combinatorics, extending classical graph invariants into rich algebraic frameworks. Originating ...

Two near minimax norms for polynomial approximation are presented. They are designed for approximation of both a function and its first derivative uniformly by polynomials over a given finite interval ...

Inspired by Rearick's work on logarithm and exponential functions of arithmetic functions, we introduce two new operators, LOG and EXP. The LOG operates on generalized Fibonacci polynomials giving ...