Results 51 to 60 of about 3,443,002 (123)
, 2000 Let R be a polynomial ring in n variables over k and f be an element of R. An ideal I of R generated by s polynomials f_(1),···,f_(s) is denoted by ◁수식 삽입▷(원문을 참조하세요) In this thesis, we study definition of Groebner bases of ideals in R and investigate ...
김소영
core +1 more source
Groebner Basis Under Composition II
, 1996 Composition is an operation of replacing variables in a polynomial with other polynomials. The main question of this paper is: When does composition commute with Groebner basis computation (possibly under different term orderings)?
Hoon Hong
core +1 more source
, 2022 In this talk, we briefly compare the NewtonSLRA/1 algorithm against the Cadzow's algorithm for computing a structured Groebner basis approximately, and discuss on a possibility of using signature based algorithms for computing approximate Groebner ...
長坂, 耕作
core
Microtubule motor driven interactions of lipid droplets: Specificities and opportunities. [PDF]
Front Cell Dev Biol, 2022 Singh J, Sanghavi P, Mallik R.
europepmc +1 more source
86th Annual Meeting of the Meteoritical Society (2024)
Meteoritics &Planetary Science, Volume 59, Issue S1, Page A1-A468, August 2024.
wiley +1 more source
Groebner Basis Techniques In Multidimensional Multirate Systems
, 1995 The Euclidean algorithm is a frequently used tool in the analysis of one-dimensional (1D) multirate systems. This tool is however not available for multidimensional (MD) multirate systems.
Hyungju Park +2 more
core
A probabilistic and deterministic modular algorithm for computing Groebner basis over $\Q$.
, 2013 Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among CAS ...
Parisse, Bernard
core +1 more source
An Analysis of Improvements to Buchberger's Algorithm for Groebner Basis Computation [PDF]
, 2004 Improvements to Buchberger's Algorithm generally seek either to define a criterion for the removal of unnecessary S-pairs or to describe a strategy for improving the choices which one must make in the course of the algorithm.
McKay, Clint
core +1 more source
Computing huge Groebner basis like cyclic10 over $\Q$ with Giac. [PDF]
, 2019 We present a short description on how to fine-tune the modular algorithm implemented in the Giac computer algebra system to reconstruct huge Groebner basis over $\Q$.The classical cyclic10 benchmark will serve as ...
Parisse, Bernard
core
The Groebner basis of a polynomial system related to the Jacobian conjecture [PDF]
, 2014 En este artículo calculamos la base de Groebner de un sistema polinomial de ecuaciones relacionada con la conjetura del jacobiano utilizando una fórmula recursiva para los numeros de Catalan.We compute the Groebner basis of a system of polynomial ...
Solórzano, Marco +1 more
core +1 more source