Undecidability of Polynomial Inequalities in Tournaments

Explore the mathematical complexity of polynomial inequalities within tournament structures through this 45-minute conference talk presented at ICBS2025. Delve into advanced theoretical concepts as the speaker demonstrates why certain polynomial inequality problems in tournament theory cannot be algorithmically decided, examining the fundamental limitations of computational approaches in this area of combinatorial mathematics. Gain insights into the intersection of logic, computation, and graph theory while understanding the profound implications of undecidability results for tournament analysis and broader mathematical research.