Related papers: Computability of Equivariant Gr\"obner bases

Let $K$ be an infinite field and $K< X> =K< X_1,...,X_n>$ the free associative algebra generated by $X=\{X_1,...,X_n\}$ over $K$. It is proved that if $I$ is a two-sided ideal of $K< X>$ such that the $K$-algebra $A=K< X> /I$ is almost…

Let $G$ be an amenable group. We define and study an algebra $\mathcal{A}_{sn}(G)$, which is related to invariant means on the subnormal subgroups of $G$. For a just infinite amenable group $G$, we show that $\mathcal{A}_{sn}(G)$ is…

We define a new type of ideal basis called the proper basis that improves both Gr\"obner basis and Buchberger's algorithm. Let $x_1$ be the least variable of a monomial ordering in a polynomial ring $K[x_1,\dotsc,x_n]$ over a field $K$. The…

The equivariant Hilbert series of an ideal generated by an orbit of a monomial under the action of the monoid $\mbox{Inc}(\mathbb{N})$ of strictly increasing functions is determined. This is used to find the dimension and degree of such an…

We prove a version of the Hilbert basis theorem in the setting of equivariant algebraic geometry: given a group G acting on a finite type morphism of schemes X -> S, if S is topologically G-noetherian, then so is X.

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…

Resultants and Gr\"obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the…

Let $\mathbb{F}[X]$ be the polynomial ring over the variables $X=\{x_1,x_2, \ldots, x_n\}$. An ideal $I=\langle p_1(x_1), \ldots, p_n(x_n)\rangle$ generated by univariate polynomials $\{p_i(x_i)\}_{i=1}^n$ is a \emph{univariate ideal}. We…

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…

Nakajima's graded quiver varieties naturally appear in the study of bases of cluster algebras. One particular family of these varieties, namely the bipartite determinantal varieties, can be defined for any bipartite quiver and gives a vast…

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…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…

Let $K$ be a field, $\mathcal {O}_v$ a valuation ring of $K$ associated to a valuation $v$: $K\rightarrow\Gamma\cup\{\infty\}$, and ${\bf m}_v$ the unique maximal ideal of $\mathcal {O}_v$. Consider an ideal $\mathcal {I}$ of the free…

The ring of invariant polynomials ${\mathbb C}[V]^G$ over a given finite dimensional representation space $V$ of a complex reductive group $G$ is known, by a famous theorem of Hilbert, to be finitely generated. The general proof being…

Gr\"{o}bner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gr\"{o}bner bases is the multivariate polynomial system solving, which enables us to construct…

We consider the ring of coinvariants for modular representations of cyclic groups of prime order. For all cases for which explicit generators for the ring of invariants are known, we give a reduced Gr\"obner basis for the Hilbert ideal and…

Gr\"obner bases can be used for computing the Hilbert basis of a numerical submonoid. By using these techniques, we provide an algorithm that calculates a basis of a subspace of a finite-dimensional vector space over a finite prime field…

In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…

Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…

We study an inductive method of computing initial ideals and Gr\"obner bases for families of ideals in a polynomial ring. This method starts from a given set of pairs $(I,J)$ where $I$ is any ideal and $J$ is a monomial ideal contained in…