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

Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...

A three-complex-parameter class of orthogonal Laurent polynomials on the unit circle associated with basic hypergeometric or q-hypergeometric functions is considered. To be precise, we consider the ...

The polynomial-solutions of the self-adjoint differential equations $D\left[ {\exp \left( { - x_1^{2k}} \right)Dy} \right] + \lambda {x^{2k - 2}}\exp \left( { - {x ...