2020/08/05 by Аrtеm N. Shevlyakov, Shevlyakov, A.
Computer Science · #Advanced Algebra and Logic #Advanced Graph Theory Research #Algebraic Geometry (math.AG) #FOS: Mathematics #Polynomial and algebraic computation #Rings and Algebras (math.RA)
paper · pdf · doi:10.48550/arxiv.2008.03296
openalex publication_date 2020/08/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study systems of equations over graphs, posets and matroids. We give the criteria, when a direct power of such algebraic structures is equationally Noetherian. Moreover we prove that any direct power of a finite algebraic structure is weakly equationally Noetherian.