Loading [MathJax]/jax/output/SVG/config.js
Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika, 2024, Number 64, Pages 7–19
DOI: https://doi.org/10.17223/20710410/64/1
(Mi pdm834)
 

Theoretical Backgrounds of Applied Discrete Mathematics

Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets

A. Yu. Nikitin, N. D. Kudyk

Dostoevsky Omsk State University, Omsk, Russia
References:
Abstract: Results are presented concerning the main problem of algebraic geometry over partially ordered sets from a computational point of view, namely, the solvability problem for systems of equations over a partial order. This problem is solvable in polynomial time if the directed graph corresponding to the partial order is a adjusted interval digraph, and is NP-complete if the base of the directed graph corresponding to the partial order is a cycle of length at least 4. We also present a result characterizing the possibility of transition from infinite systems of equations over partial orders to finite systems. Algebraic systems with this property are called equationally Noetherian. A partially ordered set is equationally Noetherian if and only if any of its upper and lower cones with base are finitely defined.
Keywords: systems of equations, computational complexity, partially ordered set, poset, equationally Noetherian property, cones, solvability.
Document Type: Article
UDC: 512.718
Language: Russian
Citation: A. Yu. Nikitin, N. D. Kudyk, “Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets”, Prikl. Diskr. Mat., 2024, no. 64, 7–19
Citation in format AMSBIB
\Bibitem{NikKud24}
\by A.~Yu.~Nikitin, N.~D.~Kudyk
\paper Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets
\jour Prikl. Diskr. Mat.
\yr 2024
\issue 64
\pages 7--19
\mathnet{http://mi.mathnet.ru/pdm834}
\crossref{https://doi.org/10.17223/20710410/64/1}
Linking options:
  • https://www.mathnet.ru/eng/pdm834
  • https://www.mathnet.ru/eng/pdm/y2024/i2/p7
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:41
    Full-text PDF :42
    References:15
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025