Results 21 to 30 of about 523 (177)
Groebner basis techniques in multidimensional multirate systems [PDF]
1995 International Conference on Acoustics, Speech, and Signal Processing, 2002 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. The authors discus how Groebner basis techniques can fill this gap.
Kalker, Ton +2 more
openaire +1 more source
Hyperelliptic Covers of Different Degree for Elliptic Curves
Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022 In elliptic curve cryptography (ECC) and hyperelliptic curve cryptography (HECC), the size of cipher‐text space defined by the cardinality of Jacobian is a significant factor to measure the security level. Counting problems on Jacobians of elliptic curve can be solved in polynomial time by Schoof–Elkies–Atkin (SEA) algorithm. However, counting problems
Jing Fan +4 more
wiley +1 more source
The FEBS Journal, Volume 288, Issue 13, Page 4000-4023, July 2021., 2021 The chromatin remodelers CHD3 and SNF2H are central regulators of chromatin structure by repositioning histone octamers on DNA in an ATP‐dependent mechanism. Sequence differences in the ATPase domain make CHD3 a more energy efficient chromatin remodeling enzyme and being less susceptible to competitive inhibition by ADP.
Helen Hoffmeister +9 more
wiley +1 more source
Quantum computation of Groebner basis through F4 and F5 algorithms [PDF]
, 2022 Our main concern in this article is how to apply quantum algorithms to compute Groebner basis through Faugere's F4 and F5 algorithms, which are regarded as the most effective algorithms for this purpose.
Ichio Kikuchi, Akihito Kikuchi
core +1 more source
Minimal basis of the syzygies module of leading terms
Труды Института системного программирования РАН, 2019 Systems of polynomial equations are one of the most universal mathematical objects. Almost all the problems of cryptographic analysis can be reduced to finding solutions to systems of polynomial equations.
A. V. Sokurov
doaj +1 more source
Quantum computation of Groebner basis
, 2021 In this essay, we examine the feasibility of quantum computation of Gr\"obner basis which is a fundamental tool of algebraic geometry. The classical method for computing Gr\"obner basis is based on Buchberger's algorithm, and our question is how to adopt quantum algorithm there.
Ichio Kikuchi, Akihito Kikuchi
openaire +2 more sources
Tropical Differential Groebner Basis
CoRR, 2019 In this paper, the tropical differential Gröbner basis is studied, which is a natural generalization of the tropical Gröbner basis to the recently introduced tropical differential algebra. Like the differential Gröbner basis, the tropical differential Gröbner basis generally contains an infinite number of elements.
Youren Hu, Xiao-Shan Gao
openaire +2 more sources
SOLVING THE INVERSE KINEMATICAL PROBLEM OF A ROBOT ARM BY USING GROEBNER BASIS [PDF]
, 2021 . The inverse kinematical problem of a robot arm is a problem to find some appropriate joint configurations for a pair of position and direction of a robot hand which is represented by a polynomial equations system.
Guswanto, Bambang Hendriya +2 more
core +2 more sources
Computational ideal theory and groebner basis [PDF]
, 2021 For every ideal in a polynomial ring over a field, there exists a finite basis as stated by Hilbert's Basis Theorem. However, as classical proofs of the theorem are nonconstructive, several academics have attempted to develop constructive proofs of the ...
Zheng, Jia Li
core
Bifurcation sets of extended Higgs potential
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2013 One of the most actual problems in modern particle physics is the problem of the baryon charge evidence in the Universe. In the frameworks of supersymmetric models, phase transitions and catastrophe theory it is possible to describe the baryogenesis.
Mikhail V Dolgopolov +2 more
doaj +1 more source