Related papers: The Groebner basis of a polynomial system

In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…

List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Groebner bases of modules. The computational complexity of the algorithm…

We introduce a general constructive method to find a p-basis (and the Ulm invariants) of a finite Abelian p-group M. This algorithm is based on Groebner bases theory. We apply this method to determine the additive structure of…

We present an elementary proof of the generalization of the $k$-bonacci Binet formula, a closed form calculation of the $k$-bonacci numbers using the roots of the characteristic polynomial of the $k$-bonacci recursion.

We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on…

In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the…

In this article we produce Groebner bases for the defining ideal of a monomial curve that corresponds to an almost arithmetic sequence of positive integers, correcting previous work of Sengupta,(2003).

In this paper, we introduce two differential equations arising from the generating function of the Catalan numbers which are `inverses' to each other in some sense. From these differential equations, we obtain some new and explicit…

We use the properties of Hermite and Kamp\'e de F\'eriet polynomials to get closed forms for the repeated derivatives of functions whose argument is a quadratic or higher-order polynomial. The results we obtain are extended to product of…

The present paper is about Bernstein-type estimates for Jacobi polynomials and their applications to various branches in mathematics. This is an old topic but we want to add a new wrinkle by establishing some intriguing connections with…

We prove that the polynomial form of the scattering equations is a Macaulay H-basis. We demonstrate that this H-basis facilitates integrand reduction and global residue computations in a way very similar to using a Gr\"obner basis, but…

Recently Hashemi and Kapur published an algorithm [1] for Groebner basis conversion by truncating polynomials according to a source and a target monomial order. Here we present a counterexample to this algorithm.

A formula expressing free cumulants in terms of the Jacobi parameters of the corresponding orthogonal polynomials is derived. It combines Flajolet's theory of continued fractions and Lagrange inversion. For the converse we discuss…

We prove the famous Faber intersection number conjecture and other more general results by using a recursion formula of $n$-point functions for intersection numbers on moduli spaces of curves. We also present some vanishing properties of…

Szmytkowski derived a certain integral with Gegenbauer polynomials. A natural generalization is to derive lookalike integrals with Jacobi polynomials. Six methods are treated to derive the first integral. The first method should be enough…

In the present paper, by extending some fractional calculus to the framework of Cliffors analysis, new classes of wavelet functions are presented. Firstly, some classes of monogenic polynomials are provided based on 2-parameters weight…

Due to the elimination property held by the lexicographic monomial order, the corresponding Groebner bases display strong structural properties from which meaningful informations can easily be extracted. We study these properties for…

The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…

Let K be a field with a valuation and let S be the polynomial ring S:= K[x_1,..., x_n]. We discuss the extension of Groebner theory to ideals in S, taking the valuations of coefficients into account, and describe the Buchberger algorithm in…

Quaternionic polynomials are generated by quaternionic variables and the quaternionic product. This paper proposes the generating ideal of quaternionic polynomials in tensor algebra, finds the Groebner base of the ideal in the case of pure…