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

In 2015, the poet-turned-mathematician June Huh helped solve a problem posed about 50 years earlier. The problem was about complex mathematical objects called “matroids” and combinations of points and ...

In a recent article, mathematicians explain the use of tools from the branch of mathematics called graph theory to systematically analyze Sudoku puzzles. They also find that analyzing Sudokus leads to ...

Chromatic derivatives and series expansions of bandlimited functions have recently been introduced as an alternative representation to the Taylor series, and they have been shown to be more useful in ...

Conjecture 1 (Tutte [2]): If G is a 2-edge-connected graph, then G admits a nowhere-zero 5-flow. If true, Conjecture 1 would imply that for every integer k > 4, the flow polynomial of any ...

The quantum computing revolution draws ever nearer, but the need for a computer that makes correctable errors continues to hold it back. Subscribe to our newsletter for the latest sci-tech news ...