Related papers: An algorithm for invariants of elementary abelian …
Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…
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…
Bounded generation by root elements is a property which has been widely studied for various types of linear algebraic groups defined over rings of integers in algebraic number fields. However, when considering global function fields, there…
We propose the method for obtaining invariants of arbitrary representations of Lie groups that reduces this problem to known problems of linear algebra. The basis of this method is the idea of a special extension of the representation…
This paper presents some algorithmic techniques to compute explicitly the noetherian operators associated to a class of ideals and modules over a polynomial ring. The procedures we include in this work can be easily encoded in computer…
Let $A$ be a commutative Noetherian ring, and let $R = A[X]$ be the polynomial ring in an infinite collection $X$ of indeterminates over $A$. Let ${\mathfrak S}_{X}$ be the group of permutations of $X$. The group ${\mathfrak S}_{X}$ acts on…
We consider the Noether's problem on the noncommutative real rational functions invariant under the linear action of a finite group. For abelian groups the invariant skew-fields are always rational. We show that for a solvable group the…
The purpose of this paper is to characterize one-dimensional local domains, or more in general reduced, in terms of its Macaulay's inverse system. This leads to study almost finitely generated modules in the divided power ring. We…
We develop the theory of agrarian invariants, which are algebraic counterparts to $L^2$-invariants. Specifically, we introduce the notions of agrarian Betti numbers, agrarian acyclicity, agrarian torsion and agrarian polytope for finite…
In this paper we show that for a torsion-free abelian group $G$, $\operatorname{rank}_\mathbb{Z}G<\infty$ if and only if there exists a Noetherian $G$-graded ring $R$ such that the set $\{R_g \neq 0\}$ generates the group $G$. For every $G$…
An algorithm is described to convert Lorentz and gauge invariant expressions in non--Abelian gauge theories with matter into a standard form, consisting of a linear combination of basis invariants. This algorithm is needed for computer…
Let $G$ be a finite abelian group, let $E$ be a subset of $G$, and form the Cayley (directed) graph of $G$ with connecting set $E$. We explain how, for various matrices associated to this graph, the spectrum can be used to give information…
In this paper, we prove that the ring of polynomial invariants of the Weyl group for an indecomposable and indefinite Kac-Moody Lie algebra is generated by invariant symmetric bilinear form or is trivial depending on $A$ is symmetrizable or…
It is well known that if G is a finite group then the group of endotrivial modules is finitely generated. In this paper we investigate endotrivial modules over arbitrary finite group schemes. Our results can be applied to computing the…
A notion of degeneration of elements in groups is introduced. It is used to parametrize the orbits in a finite abelian group under its full automorphism group by a finite distributive lattice. A pictorial description of this lattice leads…
Let $S$ be a submonoid of a free Abelian group of finite rank. We show that if $k$ is a field of prime characteristic such that the monoid $k$-algebra $k[S]$ is split $F$-regular, then $k[S]$ is a finitely generated $k$-algebra, or…
Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…
Given an algebra $F[H]^G$ of polynomial invariants of an action of the group $G$ over the vector space $H$, a subset $S$ of $F[H]^G$ is called separating if $S$ separates all orbits that can be separated by $F[H]^G$. A minimal separating…
A simple way of computing the Ap\'ery set of a numerical semigroup (or monoid) with respect to a generator, using Groebner bases, is presented, together with a generalization for affine semigroups. This computation allows us to calculate…