Sajjad Rahmany

In this paper, the concept of the interval Gröbner system together with an algorithm for its computation are proposed to analyze algebraic polynomial systems with interval coefficients (interval polynomial systems). These systems appear in many computational problems arising from both the engineering and mathematical sciences. As opposed to linear interval polynomial systems, there is no method to solve and/or analyze a nonlinear interval polynomial system. Interval Gröbner systems enable us to determine whether an interval polynomial system has any solutions or not. If so, a finite decomposition of the solution set will be constructed by the elements of the computed interval Gröbner system. Furthermore, this concept allows us to verify whether two interval polynomial systems share a common solution or not. The concept of the interval Gröbner system is based on elimination tools on the set of interval polynomials. It is worth noting that this is not a trivial extension of usual techniques, since the set of interval polynomials does not satisfy the distributivity and additive inverse axioms of a ring with usual interval arithmetic. In doing so, we introduce the concept of the ideal family associated to an interval polynomial system which contains an infinite number of (non-interval) polynomial ideals. Then we analyze all of these ideals using an equivalence relation with a finite number of equivalence classes. This method is based on a novel computational algebraic tool, the concept of comprehensive Gröbner system, equipped with an interval-based criterion to omit unnecessary computations. We also provide some applications of interval Grobner systems to analyze interval polynomial systems, nding multiple roots and solving the divisibility problem of interval polynomials. Our algorithm for the computation of interval Grobner systems has been implemented in both Maple and Magma software packages. © 2018 Springer Netherlands. All rights reserved.

Finding solutions for fuzzy polynomial systems has recently received much attention and many efforts have been made to make the available algorithms for solving such problems more and more efficient. In the present paper, Wu's algorithm is introduced as a solution procedure to obtain fuzzy polynomial systems solutions. In this approach, the parametric form of the problem is first obtained from the computation of r-cuts of fuzzy polynomials. Wu's algorithm is then applied in order to convert the parametric form of a fuzzy polynomial system into a finite number of characteristic sets. We then have the right relation between solutions of these sets and those of the polynomial system. The most outstanding advantage of the proposed method lies in the fact that it leads to solve triangular sets amenable to easy solution. © 2016 - IOS Press and the authors. All rights reserved.

In this paper, fuzzy polynomial systems in dual form are considered and an algebraic approach for finding their solutions is presented. A dual fuzzy polynomial system in the form AX + B = CX + D, where A, B, C, and D are fuzzy matrices, is converted to a system with real coefficients and variables first. Then, Wu's algorithm is used as a solution procedure for solving this system. This algorithm leads to solving characteristic sets that are amenable to easy solution. Finally, the accuracy of the presented algorithm is shown via some examples. © 2015 Taiwan Fuzzy Systems Association and Springer-Verlag.

This paper introduces a new algorithm for computing SAGBI-Gröbner bases for ideals of invariant rings of permutation groups. This algorithm is based on F4 algorithm. A first implementation of this algorithm has been made in SAGE and MAPLE computer algebra systems and has been successfully tried on a number of examples. © 2015 Elsevier B.V.

In this paper, a manner to determine the level sets of a fuzzy surface using the benefits of Gröbner basis is presented. Fuzzy surfaces are constructed from incomplete datasets or from data that contain uncertainty which has not statistical nature. The authors firstly define the concept of level sets for the fuzzy surfaces. Then, employing Gröbner bases benefits a criterion is proposed for when the level sets of the fuzzy surface are nonempty sets. Moreover, a new algorithm is designed to determine the level sets. The big advantage of the proposed method lies in the fact that it attains all members of the level sets of the fuzzy surface at a time. Finally, some applied numerical examples are illustrated to demonstrate the proficiency of the given approach. Copyright © 2015, IGI Global.

In this paper, a system of fuzzy polynomial equations is studied. Two solution types are defined for this system, called solution and (Formula presented.)-cut solution. Then sufficient and necessary conditions are proposed for existence of solution and (Formula presented.)-cut solution of the system, respectively. The solution set of the system is also determined. Moreover, a new algorithm is designed to find all the solutions and all the (Formula presented.)-cut solutions of the system based on the eigenvalue method. Finally, some examples are given to illustrate the concepts and the algorithm. © 2014, Springer-Verlag Berlin Heidelberg.

This paper presents a novel approach for finding positive solution of fully fuzzy polynomial equations systems employing Gröbner bases benefits. First, the system of fully fuzzy polynomial equations is converted to an equivalent crisp polynomial equations system. Then, using Gröbner basis properties a criteria for determining existence and finding positive fuzzy solutions of original system is introduced. The big advantage of the proposed method lies in the fact that it attains all positive fuzzy solutions of problem at a time. Finally, some applied numerical examples are illustrated to demonstrate the proficiency of the given approach. © 2013 - IOS Press and the authors. All rights reserved.

The occurrence of imprecision in the real world is inevitable due to some unexpected situations. The imprecision is often involved in any engineering design process. The imprecision and uncertainty are often interpreted as fuzziness. Fuzzy systems have an essential role in the uncertainty modelling, which can formulate the uncertainty in the actual environment. In this paper, a new approach is proposed to solve a system of fuzzy polynomial equations based on the Gröbner basis. In this approach, first, the h-cut of a system of fuzzy polynomial equations is computed, and a parametric form for the fuzzy system with respect to the parameter of h is obtained. Then, a Gröbner basis is computed for the ideal generated by the h-cuts of the system with respect to the lexicographical order using Faugère's algorithm, i.e., F 4 algorithm. The Gröbner basis of the system has an upper triangular structure. Therefore, the system can be solved using the forward substitution. Hence, all the solutions of the system of fuzzy polynomial equations can easily be obtained. Finally, the proposed approach is compared with the current numerical methods. Some theorems together with some numerical examples and applications are presented to show the efficiency of our method with respect to the other methods. © 2012 Elsevier Inc. All rights reserved.

We apply the Grobner basis to the ansatz method in quantum mechanics to obtain the energy eigenvalues and the wave functions in a very simple manner. There are important physical potentials such as the Cornell interaction which play significant roles in particle physics and can be treated via this technique. As a typical example, the algorithm is applied to the semi-relativistic spinless Salpeter equation under the Cornell interaction. Many other applications of the idea in a wide range of physical fields are listed as well. © 2013, Verlag der Zeitschrift für Naturforschung. All rights reserved.

In this paper we will introduce a brief introduction to theory of Gr̈obner bases and some applications of Gr̈obner bases to graph coloring problem, automatic geometric theorem proving and cryptography.

Abstract-The link between Gröbner basis and linear algebra was described by Lazard [4,5] where he realized the Gröbner basis computation could be archived by applying Gaussian elimination over Macaulay's matrix. In this paper, we indicate how same technique may be used to SAGBI- Gröbner basis computations in invariant rings.

The aim of this paper is to review some of standard fact on Miura curves. We give some easy theorem in number theory to define Miura curves, then we present a new implementation of Arita algorithm for Miura curves.

The aim of this paper is to review some of standard fact on Miura curves. We give some easy theorem in number theory to define Miura curves, then we present a new implementation of Arita algorithm for Miura curves.