Two models were recently proposed to explore the robust hardness of Gröbner basis computation. Given a polynomial system, both models allow an algorithm to selectively ignore some of the polynomials: the algorithm is only responsible for returning a Gröbner basis for the ideal generated by the remaining polynomials. For the q-Fractional Gröbner Basis Problem the algorithm is allowed to ignore a...

The aim of this paper is to a study of a pathway fractional integral operator associated with the pathway model and pathway probability density for the Aleph function with certain product of H-function and Multivariable’s general class of polynomial.

In this paper, some properties of pseudo-differential operators, SG-elliptic partial differential equations with polynomial coefficients and localization operators on space S ν (R), are studied by using fractional Fourier transform. AMS Mathematics Subject Classification (2010): 35S05, 46F12, 47G30.

Keywords: Fractional-order linear systems Interval uncertainty Necessary and sufficient stability condition a b s t r a c t This paper establishes a necessary and sufficient stability condition of fractional-order interval linear systems. It is supposed that the system matrix A is an interval uncertain matrix and fractional commensurate order belongs to 1 ≤ α < 2. Using the existence condition ...

Given a graph with nonnegative capacities on its edges, it is well known that the capacity of a minimum T -cut is equal to the value of a maximum fractional packing of T -joins. Padberg-Rao’s algorithm finds a minimum capacity T -cut but it does not produce a T -join packing, we present a polynomial combinatorial algorithm for finding an optimal T -join packing.