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 graph below shows the total number of publications each year in Algorithmic Complexity and Polynomial Threshold Functions.

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

How can the tiniest particles and the vast structure of the universe be explained using the same kind of mathematics? This puzzle is the focus of recent research by mathematicians Claudia Fevola ...

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

The associated Feynman integral can be expressed as a Mellin transform of a power of this graph polynomial, interpreted as a function of its coefficients.

By exploring positive geometry, mathematicians are revealing hidden shapes that may unify particle physics and cosmology, offering new ways to understand both collisions in accelerators and the ...