Zapiski Nauchnykh Seminarov POMI
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



Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find






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


Zapiski Nauchnykh Seminarov POMI, 2014, Volume 421, Pages 133–137 (Mi znsl5755)  

This article is cited in 1 scientific paper (total in 1 paper)

On modular computation of Gröbner bases with integer coefficients

S. Yu. Orevkovab

a Steklov Mathematical Institute of the Russian Academy of Sciences, Moscow, Russia
b Université Paul Sabatier, Toulouse, France
Full-text PDF (186 kB) Citations (1)
References:
Abstract: Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\mathbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gröbner base of $I$ under the assumption that the Gröbner bases of the ideal $\mathbb QI$ of the ring $\mathbb Q[X]$ and the the ideals $I\otimes(\mathbb Z/m\mathbb Z)$ of the rings $(\mathbb Z/m\mathbb Z)[X]$ are known.
Such an algorithmic problem arises, for example, in the construction of Markov and semi-Markov traces on cubic Hecke algebras.
Key words and phrases: Gröbner base, modular computation.
Received: 18.11.2013
English version:
Journal of Mathematical Sciences (New York), 2014, Volume 200, Issue 6, Pages 722–724
DOI: https://doi.org/10.1007/s10958-014-1964-2
Bibliographic databases:
Document Type: Article
UDC: 512.71
Language: Russian
Citation: S. Yu. Orevkov, “On modular computation of Gröbner bases with integer coefficients”, Representation theory, dynamical systems, combinatorial methods. Part XXIII, Zap. Nauchn. Sem. POMI, 421, POMI, St. Petersburg, 2014, 133–137; J. Math. Sci. (N. Y.), 200:6 (2014), 722–724
Citation in format AMSBIB
\Bibitem{Ore14}
\by S.~Yu.~Orevkov
\paper On modular computation of Gr\"obner bases with integer coefficients
\inbook Representation theory, dynamical systems, combinatorial methods. Part~XXIII
\serial Zap. Nauchn. Sem. POMI
\yr 2014
\vol 421
\pages 133--137
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl5755}
\elib{https://elibrary.ru/item.asp?id=22837169}
\transl
\jour J. Math. Sci. (N. Y.)
\yr 2014
\vol 200
\issue 6
\pages 722--724
\crossref{https://doi.org/10.1007/s10958-014-1964-2}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84940244678}
Linking options:
  • https://www.mathnet.ru/eng/znsl5755
  • https://www.mathnet.ru/eng/znsl/v421/p133
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:171
    Full-text PDF :44
    References:28
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024