Related papers: Gr\"obner bases and syzygies on bimodules
After attaching explicitly to the M\"obius strip an invertible module over the ring of real polynomial functions on the real circle, we expound as directly as possible the many faces and the main algebraic properties of invertible modules.…
The inversion problem for rational B\'ezier curves is addressed by using resultant matrices for polynomials expressed in the Bernstein basis. The aim of the work is not to construct an inversion formula but finding the corresponding value…
A border basis scheme is an affine scheme that can be viewed as an open subscheme of the Hilbert scheme of \mu points of affine n-space. We study syzygies of the generators of a border basis scheme's defining ideal. These generators arise…
Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
The theory of "subalgebra basis" analogous to standard basis (the generalization of Gr\"{o}bner bases to monomial ordering which are not necessarily well ordering \cite{GP1}.) for ideals in polynomial rings over a field is developed. We…
We propose a novel approach to the problem of polynomial approximation of rational B\'ezier triangular patches with prescribed boundary control points. The method is very efficient thanks to using recursive properties of the bivariate dual…
We review some applications of Gr\"obner-Shirshov bases, including PBW theorems, linear bases of free universal algebras, normal forms for groups and semigroups, extensions of groups and algebras, embedding of algebras.
For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…
We study modules for the divided power algebra $D$ in a single variable over a commutative noetherian ring $k$. Our first result states that $D$ is a coherent ring. In fact, we show that there is a theory of Gr\"obner bases for finitely…
We associate bicomplexes with several integrable models in such a way that conserved currents are obtained by a simple iterative construction. Gauge transformations and dressings are discussed in this framework and several examples are…
In this paper we compute Gr\"obner bases for determinantal ideals of the form $I_{1}(XY)$, where $X$ and $Y$ are both matrices whose entries are indeterminates over a field $K$. We use the Gr\"obner basis structure to determine Betti…
We give an introduction to the theory of initial ideals and initial algebras with emphasis on the transfer of structural properties.
The aim of the paper is to introduce an alternative notion of two-scale convergence which gives a more natural modeling approach to the homogenization of partial differential equations with periodically oscillating coefficients: while…
We propose a novel encoding scheme for algebraic codes such as codes on algebraic curves, multidimensional cyclic codes, and hyperbolic cascaded Reed-Solomon codes and present numerical examples. We employ the recurrence from the Gr\"obner…
We present an algorithm for computing Groebner bases of vanishing ideals of points that is optimized for the case when the number of points in the associated variety is less than the number of indeterminates. The algorithm first identifies…
We develop a theory of bicrystalline ideals, synthesizing Gr\"obner basis techniques and Kashiwara's crystal theory. This provides a unified algebraic, combinatorial, and computational approach that applies to ideals of interest, old and…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
This article studies Gauss-Newton-type methods for over-determined systems to find solutions to bilevel programming problems. To proceed, we use the lower-level value function reformulation of bilevel programs and consider necessary…
In this article, we combine the concept of a bipolar fuzzy set and a soft set. We introduce the notion of bipolar fuzzy soft set and study fundamental properties. We study basic operations on bipolar fuzzy soft set. We define exdended…