A terminal-based, single-variable polynomial function graphing calculator, written in C++ This program implements a variation of the Shunting-Yard algorithm, to convert human written algebraic ...

Fundamental Reduction Theorem :FRT is one of methods for calculating chromatic polynomial of graph G . There exists two types of FRT: Extension version and Subtraction version. The first one is the ...

Combinatorial polynomials, such as the Tutte, U‐ and Schubert polynomials, complement this by systematically organising information about graphs and posets into polynomial expressions.

One of the well-known graph families F for which this is possible is the class of interval graphs, where a longest path can be computed by a dynamic programming algorithm with running time O(n4). 25 ...

Graph transformations Given the graph of a common function, (such as a simple polynomial, quadratic or trig function) you should be able to draw the graph of its related function.

A robust procedure is developed for estimating density functions from data. It requires the existence of a parametric function, called the key function, to give a first approximation to the density ...

Hermite polynomials: A sequence of orthogonal polynomials associated with the weight function exp (–x²), widely used in probability, physics and signal analysis.

The system function of a recursive variable filter (VF) has both numerator and denominator that are parameterized as the polynomial functions of a parameter called tuning parameter. That is, the VF ...

In graph signal processing applications, it is desirable to design a polynomial graph filter with good frequency selective performance. This task can be done by designing a large-order frequency ...

An algorithm is developed for the simultaneous optimization of several response functions that depend on the same set of controllable variables and are adequately represented by polynomial regression ...