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

The quantum Bruhat graph, which is an extension of the graph formed by covering relations in the Bruhat order, is naturally related to the quantum cohomology ring of G/B. We enhance a result of Fulton ...

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted his claim that the new algorithm ...

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

Proceedings of the American Mathematical Society, Vol. 25, No. 2 (Jun., 1970), pp. 405-412 (8 pages) A new class of generating functions for generalized hypergeometric polynomials is obtained.

Illustration of a set of real zeros of a graph polynomial (middle) and two Feynman diagrams. Credit: Max Planck Institute for Mathematics in the Sciences How can the behavior of elementary particles ...