Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Benyamin M.-Alizadeh"'
Publikováno v:
Computer Science Journal of Moldova, Vol 25, Iss 3(75), Pp 278-302 (2017)
In this paper, we consider two main approaches to compute Gr\"obner bases for parametric polynomial ideals, namely the {\sc DisPGB} algorithm developed by Montes \cite{monts1} and the {\sc PGBMain} proposed by Kapur, Sun and Wang \cite{kapur}. The fo
Externí odkaz:
https://doaj.org/article/f727b1579f684457aedd6f9f0acca6ec
Publikováno v:
Journal of Algebra and Its Applications.
Assume that we are given a sequence [Formula: see text] of [Formula: see text] homogeneous polynomials in [Formula: see text] variables of degree at most [Formula: see text] and the ideal [Formula: see text] generated by this sequence. The aim of thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fa43da4fc08c793707eb7897b7c98ec
https://doi.org/10.1142/s0219498824501457
https://doi.org/10.1142/s0219498824501457
Autor:
Amir Hashemi, Benyamin M.-Alizadeh
Publikováno v:
Theoretical Computer Science. 842:50-64
In this paper, we address the problem of transforming an ideal into normal position. We present a deterministic algorithm (based on linear algebra techniques) that finds a suitable linear change of variables to transform a given zero-dimensional (not
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::869625ce29fcd5eb9f68e85c4ff47463
https://doi.org/10.1016/j.tcs.2020.07.025
https://doi.org/10.1016/j.tcs.2020.07.025
Publikováno v:
Bulletin of the Iranian Mathematical Society. 45:1585-1603
In this paper, we present first a new algorithm based on Grobner basis to analyze and/or solve a convex polynomial nonlinear programming problem that is a convex nonlinear programming in which the objective and constraints are algebraic polynomials.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::463ce784bd5edca793df5686f328af6b
https://doi.org/10.1007/s41980-019-00217-3
https://doi.org/10.1007/s41980-019-00217-3
Publikováno v:
Journal of Symbolic Computation. 59:1-20
Faugere's F5 algorithm is the fastest known algorithm to compute Groebner bases. It has a signature-based and an incremental structure that allow to apply the F5 criterion for deletion of unnecessary reductions. In this paper, we present an involutiv
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74d183cc3b714897d75a017288252fc1
https://doi.org/10.1016/j.jsc.2013.08.002
https://doi.org/10.1016/j.jsc.2013.08.002
Publikováno v:
Filomat
Filomat, University of Nis, 2016, 30 (6), pp.1387-1411. ⟨10.2298/fil1606387s⟩
Filomat, University of Nis, 2016, 30 (6), pp.1387-1411. ⟨10.2298/fil1606387s⟩
We consider the significant class of homogeneous CR manifolds represented by some weighted homogeneous polynomials and we derive some plain and useful features which enable us to set up a fast effective algorithm to compute homogeneous components of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ee426efd7505b9a9c1e3244d8f8d01f
https://hal-universite-paris-saclay.archives-ouvertes.fr/hal-03286255
https://hal-universite-paris-saclay.archives-ouvertes.fr/hal-03286255
Publikováno v:
Science China Mathematics. 56:1781-1794
Faugere and Rahmany have presented the invariant F5 algorithm to compute SAGBI-Grobner bases of ideals of invariant rings. This algorithm has an incremental structure, and it is based on the matrix version of F5 algorithm to use F5 criterion to remov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::226f8bb1c44d3ea826e6472404fef14a
https://doi.org/10.1007/s11425-012-4506-8
https://doi.org/10.1007/s11425-012-4506-8
Publikováno v:
Linear and Multilinear Algebra. 61:265-272
In this article, we study the minimal polynomials of parametric matrices. Using the concept of (comprehensive) Grobner systems for parametric ideals, we introduce the notion of a minimal polynomial system for a parametric matrix, i.e. we decompose th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49f45c2ab5368c715210bc842238f9c7
https://doi.org/10.1080/03081087.2012.670235
https://doi.org/10.1080/03081087.2012.670235
Publikováno v:
Advances in Applied Clifford Algebras
Advances in Applied Clifford Algebras, Springer Verlag, 2011, 22, pp.911-937. ⟨10.1007/s00006-011-0319-z⟩
Advances in Applied Clifford Algebras, Springer Verlag, 2011, 22, pp.911-937. ⟨10.1007/s00006-011-0319-z⟩
We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a field \({\mathbb{K}}\) of characteristic zero. In order to reach explicit representatives of some generators of the quoti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be2c9c686fd3a4c32dc9a35110021fa1
https://doi.org/10.1007/s00006-011-0319-z
https://doi.org/10.1007/s00006-011-0319-z
Publikováno v:
Science China Mathematics
Science China Mathematics, Science China Press, 2014, 57 (9), pp.1811-1834. ⟨10.1007/s11425-013-4751-5⟩
Science China Mathematics, Science China Press, 2014, 57 (9), pp.1811-1834. ⟨10.1007/s11425-013-4751-5⟩
We perform detailed computations of Lie algebras of infinitesimal CR-automorphisms associated to three specific model real analytic CR-generic submanifolds in C^9 by employing differential algebra computer tools -- mostly within the Maple package Dif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c934c2866abed095f69b6ef95fc6de2f
https://hal-universite-paris-saclay.archives-ouvertes.fr/hal-03286239/file/k-8.pdf
https://hal-universite-paris-saclay.archives-ouvertes.fr/hal-03286239/file/k-8.pdf