Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Faugère’s F4 is a well-known Gröbner bases algorithm to solve this problem. However, a serious drawback exists in the Gröbner bases based algebraic attacks, namely, any information won’t be got if we couldn’t work out the Gröbner bases of the polynomial equations system. In this paper, we in-dept...

We provide a polynomial time algorithm for computing the universal Gröbner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the state polyhedron of any member of the Hilbert scheme Hilbn of n-long d-variate ideals, enabled by introducing the Hilbert zonotope Hn and showing that it simu...

Let M (f) denote the midpoint rule and T (f) the trapezoidal rule for estimating ∫ b a f(x) dx. Then Simpson’s rule = M (f) + (1 − )T (f), where = 3 . We generalize Simpson’s rule to multiple integrals as follows. Let Dn be some polygonal region in R; let P0; : : : ; Pm denote the vertices of Dn, and let Pm+1 equal the center of mass of Dn. De4ne the linear functionals M (f) =Vol(Dn)f(Pn+1), wh...

Quadratization is a transform of system ODEs with polynomial right-hand side into at most quadratic via the introduction new variables. It has been recently used as pre-processing step for model order reduction methods, so it important to keep number variables small. Several algorithms have designed search quadratization being monomials in original To understand limitations and potential ways i...

We show that the universal Gröbner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity binomial edge ideal and prove this conjecture for the case when the underlying graph is the complete graph.

This paper proves the convergence of applying the radial basis functions as a global spatial approximation method for solving the option pricing models. The computational advantage of this method is illustrated by giving numerical examples on solving both the European and American options pricing models whereas the latter is a free boundary value problem.

Linear codes over any finite field can be associated to binomial ideals. Focussing on two specific instances, called the code ideal and the generalized code ideal, we present how these binomial ideals can be computed from toric ideals by substituting some variables. Drawing on this result we further show how their Graver bases as well as their universal Gröbner bases can be computed.