相关论文: Groebner-Shirshov Basis for the Chinese Monoid
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.
In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…
We first offer a fast method for calculating the Gelfand-Kirillov dimension of a finitely presented commutative algebra by investigating certain finite set. Then we establish a Groebner-Shirshov bases theory for bicommutative algebras, and…
This paper is a survey on the study of the behaviour of the composition of polynomials on the computation of Gr\"obner bases. This survey brings together some works published between 1995 and 2007. The authors of these papers gave answers…
By resorting to sequential constructions of exchangeable random partitions (Pitman, 2006), and exploiting some known facts about generalized Stirling numbers, we derive a generalized Chinese restaurant process construction of exchangeable…
We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the…
We study the relation between Poisson algebras and representations of Lie conformal algebras. We establish a setting for the calculation of a Gr\"obner--Shirshov basis in a module over an associative conformal algebra and apply this…
In this paper, we establish the Composition-Diamond lemma for associative algebras with multiple linear operators. As applications, we obtain Groebner-Shirshov bases of free Rota-Baxter algebra, $\lambda$-differential algebra and…
Exploiting symmetry in Groebner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being…
A simple way of computing the Ap\'ery set of a numerical semigroup (or monoid) with respect to a generator, using Groebner bases, is presented, together with a generalization for affine semigroups. This computation allows us to calculate…
This paper explores the ability of the Chinese Remainder Theorem formalism to model Montgomery-type algorithms. A derivation of CRT based on Qin's Identity gives Montgomery reduction algorithm immediately. This establishes a unified…
D. Bayer and M. Stillman showed that Grobner bases can be used to compute the Castelnuovo-Mumford regularity, which is a measure for the vanishing of graded local cohomology modules. The aim of this paper is to show that the same method can…
Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…
We construct multiple representations relative to different bases of the generalized Tschebyscheff polynomials of second kind. We build the change-of-basis matrices between the generalized Tschebyscheff of the second kind polynomial basis…
In this paper, we give a Gr\"obner-Shirshov basis of the free dendriform algebra as a quotient algebra of an $L$-algebra. As applications, we obtain a normal form of the free dendriform algebra. Moreover, Hilbert series and Gelfand-Kirillov…
We show that the if a sequence of normalized polynomials gives rise to a positive basis of the skein algebra of a surface, then it is sandwiched between the two types of Chebyshev polynomials. For the closed torus, we show that the…
Numerical analysis is conducted for a generalized particle method for a Poisson equation. Unique solvability is derived for the discretized Poisson equation by introducing a connectivity condition for particle distributions. Moreover, by…
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for…
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).
This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.