Related papers: Gr{\"o}bner bases over Tate algebras
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…
By changing to an orthogonal basis, we give a short proof that the subfactor of the graded algebra of a planar algebra reproduces the planar algebra.
We begin by defining Temperley-Lieb algebra, in two different ways: as a presented algebra or as a diagrammatic algebra. Next, we look for a basis algorithmically, using rewriting theory. Finally, we introduce a generalization of the…
The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…
We establish a doubly-weighted vertical Sato-Tate law for GL(4) with explicit error terms. The main ingredient is an extension of the orthogonality relation for Maass cusp forms on GL(4) of Goldfeld, Stade, and Woodbury from spherical to…
Characterization of the *-subalgebras in the algebra of bounded operators acting on Hilbert space is presented. Sufficient conditions for the existence of a faithful representation in pre-Hilbert space of a *-algebra in terms of its…
Let $K$ be a field and $R=\oplus_{p\in\mathbb{N}}R_p$ an $\mathbb{N}$-graded $K$-algebra, which has an SM $K$-basis (i.e. a skew multiplicative $K$-basis) such that $R$ holds a Gr\"obner basis theory. It is proved that there is a one-to-one…
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…
Standard noncommutative Gr\"obner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gr\"obner basis procedures for one-sided ideals in finitely presented noncommutative…
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…
We give algorithms for computing multiplier ideals using Gr\"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial.…
In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…
We present basic properties of Gr\"obner bases of submodules of a free module of finite rank over a polynomial ring $R$ with coefficients in a graded truncated discrete valuations ring $A$. As an application, we give a criterion for a…
In this work, we introduce a new class of algebras called skew-Brauer graph algebras, which generalize the well-known Brauer graph algebras. We establish that skew-Brauer graph algebras are symmetric and can be defined using a Brauer graph…
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
In this paper we describe the equations defining the multi-Rees algebra $k[x_1,\dots,x_n][I_1^{a_1}t_1,\dots,I_r^{a_r}t_r]$, where the ideals are generated by subsets of $x_1,\dots,x_n$. We also show that a family of binomials whose leading…
We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…
A motivation to study Gr\"{o}bner theory for fields with valuations comes from tropical geometry, for example, they can be used to compute tropicalization of varieties \citep{maclagan2009introduction}. The computational aspect of this…
This short note is the generalization of Faugere F4-algorithm for polynomial rings with coefficients in Euclidean rings. This algorithm computes successively a Groebner basis replacing the reduction of one single s-polynomial in…
In this paper we will define analogs of Gr\"obner bases for $R$-subalgebras and their ideals in a polynomial ring $R[x_1,\ldots,x_n]$ where $R$ is a noetherian integral domain with multiplicative identity and in which we can determine ideal…