Zobrazeno 1 - 10
of 3 252
pro vyhledávání: '"P. Buchberger"'
Autor:
Hashemi, Amir, Ollivier, François
Publikováno v:
Comptes Rendus Math\'ematique 360 (2022) 255-264
We generalize the analog of Buchberger's first criterion, stated by Boulier et al., for detecting useless S-polynomials reductions in the computation of characteristic sets of differential ideals. The original version assumes linear polynomials; this
Externí odkaz:
http://arxiv.org/abs/2107.01909
Autor:
Fajardo, W.
Publikováno v:
Fundamenta Informaticae, Volume 184, Issue 2 (January 13, 2022) fi:7142
In this paper we present a right version of the algorithms developed for to compute Gr\"obner bases over bijective skew PBW extensions in the left case given in [3]. In particular, we adapt the theory of reduction and we build a right division algori
Externí odkaz:
http://arxiv.org/abs/2101.12563
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ceria, Michela
We present Buchberger Theory and Algorithm of Gr\"obner bases for multivariate Ore extensions of rings presented as modules over a principal ideal domain. The algorithms are based on M\"oller Lifting Theorem.
Externí odkaz:
http://arxiv.org/abs/1701.01899
Autor:
Hashemi, Amir, Ollivier, François
Publikováno v:
Comptes Rendus. Mathématique, Vol 360, Iss G3, Pp 255-264 (2022)
We generalize the analog of Buchberger’s first criterion, stated by Boulier et al., for detecting useless S-polynomials reductions in the computation of characteristic sets of differential ideals. The original version assumes linear polynomials; th
Externí odkaz:
https://doaj.org/article/13c20835a5c34cfa8d448ff12836bee0
Autor:
Ceria, Michela
We present here a new approach for computing Gr\"obner bases for bilateral modules over an effective ring. Our method is based on Weispfenning notion of restricted Gr\"obner bases and related multiplication.
Externí odkaz:
http://arxiv.org/abs/1611.08846
Autor:
Madden, James J., McGuire, Trevor
The present paper is motivated by the need to generalize the construction of the Scarf complex in order to give combinatorial resolutions of a much broader class of modules than just the monomial ideals. For any subset $A\subseteq \mathbb{R}^n$, let
Externí odkaz:
http://arxiv.org/abs/1511.08224
Autor:
Wang, Dongming
For any polynomial ideal $I$, let the minimal triangular set contained in the reduced Buchberger-Gr\"obner basis of $I$ with respect to the purely lexicographical term order be called the W-characteristic set of $I$. In this paper, we establish a str
Externí odkaz:
http://arxiv.org/abs/1506.08994
Autor:
Olteanu, Anda, Welker, Volkmar
We define the Buchberger resolution, which is a graded free resolution of a monomial ideal in a polynomial ring. Its construction uses a generalization of the Buchberger graph and encodes much of the combinatorics of the Buchberger algorithm. The Buc
Externí odkaz:
http://arxiv.org/abs/1409.2041