Related papers: Groebner-Shirshov Basis for the Chinese Monoid
By the Chinese remainder theorem, the canonical map \[\Psi_n: R[X]/(X^n-1)\to \oplus_{d|n} R[X]/\Phi_d(X)\] is an isomorphism when $R$ is a field whose characteristic does not divide $n$ and $\Phi_d$ is the $d$th cyclotomic polynomial. When…
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
In this article we compute a minimal Groebner basis for the symmetric algebra for certain affine Monomial Curves, as an R-module. Keywords: Monomial Curves, Groebner Basis, Symmetric Algebra. Mathematics Subject Classification 2000: 13P10,…
In this paper the absolute value or distance from the origin analogue of the classical Khintchine-Groshev theorem is established for a single linear form with a `slowly decreasing' error function.
This paper is concerned with the derivative nonlinear Schr\"{o}dinger equation with periodic boundary conditions. We obtain complete Birkhoff normal form of order six. As an application, the long time stability for solutions of small…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
We construct an explicit Gr\"obner--Shirshov basis for free associative Rota--Baxter algebras of weight zero with nilpotent operator $R^n=0$, where $n\ge 2$. First, we define a monomial order on the standard linear basis $RS(X)$ of the free…
We consider the Kronecker quiver and determine the relations for the specialisation to q=0 of the generic composition algebra as well as those for Reineke's composition monoid. We also obtain a normal form for the varieties occurring in the…
In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we…
Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…
The main aim of this paper is the presentation of a new methodology to obtain Liouvillian solutions of stationary one dimensional Schr\"odinger equation with quasi-solvable polynomial potentials through the using of differential Galois…
Given a finitely presented monoid and a homotopy base for the monoid, and given an arbitrary Schutzenberger group of the monoid, the main result of this paper gives a homotopy base, and presentation, for the Schutzenberger group. In the…
In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for…
We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…
We construct a Gr\"obner-Shirshov basis of the Temperley-Lieb algebra $\mathfrak{T}(d,n)$ of the complex reflection group $G(d,1,n)$, inducing the standard monomials expressed by the generators $\{E_i\}$ of $\mathfrak{T}(d,n)$. This result…
In this paper, we introduce a new family of codes relevent for rank and sum-rank metrics. These codes are based on an effective Chinese remainders theorem for linearized polynomials over finite fields. We propose a decoding algorithm for…
In this paper, we extend the classical theory of crossed $G$-sets and the crossed Burnside ring from a finite group $G$ to a finite groupoid $\mathcal{G}$. We introduce a natural monoidal structure on the category of crossed…
In this paper we study standard bases for submodules of a mixed power series and polynomial ring $R[[t_1,\ldots,t_m]][x_1,\ldots,x_n]^s$ respectively of their localization with respect to a $t$-local monomial ordering for a certain class of…
Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of…