Show HN: Student attempt at proving P ≠ NP using geometry and lattices

Published August 7, 2025 | Version v1

Preprint Open

• 1. Independent Researcher

This preprint presents a new approach to the separation of complexity classes P and NP. Using geometric, algebraic, and spectral methods, the author constructs a framework that suggests the impossibility of solving NP-complete problems by polynomial-time algorithms. The result includes a proof sketch and several theorems leading to the main claim.

This English version is an automatic translation of the original Russian manuscript. I am not a native English speaker, and some parts may contain linguistic inaccuracies or formatting issues. The Russian version is the primary and more accurate version.

Feedback and corrections are welcome.