In mid-May, OpenAI announced that an internal AI model had disproved the Erdős unit distance conjecture, a famous problem in discrete geometry that had stumped human mathematicians for the last 80 ...

What if the next new mathematical discovery didn’t come from a human mind, but from an AI? Imagine a machine not just crunching numbers but proposing original solutions to problems that have baffled ...

This paper presents the Secant Optimization Algorithm (SOA), a novel mathematics-inspired metaheuristic derived from the Secant Method. SOA enhances search efficiency by repeating vector updates using ...

A line of engineering research seeks to develop computers that can tackle a class of challenges called combinatorial optimization problems. These are common in real-world applications such as ...

The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin ...