相关论文: Groebner-Shirshov Basis for the Chinese Monoid

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…

A generalized derivative nonlinear Schr\"odinger equation, \ii q_t + q_{xx} + 2\ii \gamma |q|^2 q_x + 2\ii (\gamma-1)q^2 q^*_x + (\gamma-1)(\gamma-2)|q|^4 q = 0 , is studied by means of Hirota's bilinear formalism. Soliton solutions are…

In this note we show how a generalized Pohozaev-Schoen identity due to Gover and Orsted \cite{GO} can be used to obtain some rigidity results for $V$-static manifolds and generalized solitons. We also obtain an Alexandrov type result for…

We derive Glynn's formula from Ryser's formula for the permanent. We further establish via an orbital argument that Glynn's formula yields an optimal row-homogeneous Chow-decomposition of the permanent. We introduce a method for…

Generalized pseudo-Hamiltonian normal forms (GPHNF) and an effective method of obtaining them are introduced for two-dimensional systems of autonomous ODEs with a Hamiltonian quasi-homogeneous unperturbed part of an arbitrary degree. The…

Every normal toric ideal of codimension two is minimally generated by a Grobner basis with squarefree initial monomials. A polynomial time algorithm is presented for checking whether a toric ideal of fixed codimension is normal.

We generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…

Gromov-Witten invariants for arbitrary projective varieties and arbitrary genus are constructed using the techniques from K. Behrend, B. Fantechi: The intrinsic normal cone.

In this article, we investigate the cardinality of Groebner bases under various monomial orderings. We identify a family of polynomials F and a criterion such that the reduced Groebner basis of F is double exponential in cardinality with…

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 present a formalization of Gr\"obner basis theory in Lean 4, built on top of Mathlib's infrastructure for multivariate polynomials and monomial orders. Our development covers the core foundations of Gr\"obner basis theory, including…

Given a finite group scheme $G$ over a field and a $G$-variety $X$, we obtain a criterion for $X$ to be $G$-normal in the sense of \cite{Br24}. When $G$ is diagonalizable, we describe the local structure of $G$-normal varieties in…

The problem of simplifying tensor expressions is addressed in two parts. The first part presents an algorithm designed to put tensor expressions into a canonical form, taking into account the symmetries with respect to index permutations…

This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows Generalized Minimum Distance decoding of Reed-Solomon codes with a complexity of O(nd).

After fixing a triangulation $L$ of a $k$-dimensional simplex that has no new vertices on the boundary, we introduce a triangulation operation on all simplicial complexes that replaces every $k$-face with a copy of $L$, via a sequence of…

Two fundamental questions in the theory of Groebner bases are decision ("Is a basis G of a polynomial ideal a Groebner basis?") and transformation ("If it is not, how do we transform it into a Groebner basis?") This paper considers the…

Generalized Burniat surfaces are surfaces of general type with $p_g=q$ and Euler number $e=6$ obtained by a variant of Inoue's construction method for the classical Burniat surfaces. I prove a variant of the Bloch conjecture for these…

Signature-based algorithms are a popular kind of algorithms for computing Groebner basis, including the famous F5 algorithm, F5C, extended F5, G2V and the GVW algorithm. In this paper, an efficient method is proposed to solve the…

We prove that seminormality of cut polytopes is equivalent to normality. This settles two conjectures regarding seminormality of cut polytopes.

We show that the monoid of all injective and extensive partial transformations of a chain with three elements admits no finite basis of its identities. This completes solving of the finite basis problem for the monoids in the basic frame of…