Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

Combinatorial counting problems have rich connections to many areas of science including to algebra, probability, and dynamical systems in mathematics as well as to theoretical computer science and ...

Anyone who’s taken classes in geometry, algebra, trigonometry or other advanced math forms has certainly encountered the graphing calculator before. These multi-function devices make incredibly ...

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 ...

In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, ...