Related papers: An algorithm for invariants of elementary abelian …

We formulate a notion of "geometric reductivity" in an abstract categorical setting which we refer to as adequacy. The main theorem states that the adequacy condition implies that the ring of invariants is finitely generated. This result…

We determine the rings of invariants in the symmetric algebra on the dual of a vector space V over the field of two elements, for the group G of orthogonal transformations preserving a non-singular quadratic form on V. The invariant ring is…

The present work develops certain analytical tools required to construct and compute invariant kernels on the space of complex covariance matrices. The main result is the $\mathrm{L}^1$--Godement theorem, which states that any invariant…

We display a new family of prime ideals with unbounded minimal number of generators in a three-dimensional power series ring over a field of characteristic zero. These primes are obtained as the kernel of a quasi-monomial algebra…

We investigate the existence problem of group invariant matrices using algebraic approaches. We extend the usual concept of multipliers to group rings with cyclotomic integers as coefficients. This concept is combined with the field descent…

In this series of papers, we propose a theory of enumerative invariants counting self-dual objects in self-dual categories. Ordinary enumerative invariants in abelian categories can be seen as invariants for the structure group $\mathrm{GL}…

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…

We consider the ring I_n of polynomial invariants over weighted graphs on n vertices. Our primary interest is the use of this ring to define and explore algebraic versions of isomorphism problems of graphs, such as Ulam's reconstruction…

We use the gluing construction introduced by Jia Huang to explore the rings of invariants for a range of modular representations. We construct generating sets for the rings of invariants of the maximal parabolic subgroups of a finite…

We describe a new algorithm for computing braid orbits on Nielsen classes. As an application we classify all families of affine genus zero systems; that is all families of coverings of the Riemann sphere by itself such that the monodromy…

Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…

We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…

Given a simple vertex algebra A and a reductive group G of automorphisms of A, the invariant subalgebra A^G is strongly finitely generated in most examples where its structure is known. This phenomenon is subtle, and is generally not true…

Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…

The degree of the generators of invariant polynomial rings of is a long standing open problem since the very initial study of the invariant theory in the 19th century. Motivated by its significant role in characterizing multipartite…

In general the endomorphisms of a non-abelian group do not form a ring under the operations of addition and composition of functions. Several papers have dealt with the ring of functions defined on a group which are endomorphisms when…

We show that elementary abelian direct factors can be disregarded in the study of the modular isomorphism problem. Moreover, we obtain four new series of abelian invariants of the group base in the modular group algebra of a finite…

The invariant theory of finite groups can connect the coding theory to the number theory. In this paper, under this conformity, we obtain the minimal generators of the rings of E-polynomials constructed from the groups related to…

Using evaluation at appropriately chosen points, we propose a Gr\"obner basis free approach for calculating the secondary invariants of a finite permutation group. This approach allows for exploiting the symmetries to confine the…

This is an improved version of the talk of the author given at the Antalya Algebra Days VII on May 21, 2005. We present an introduction to the theory of the invariants under the action of GL(n,C) by simultaneous conjugation of d matrices of…