Related papers: Generating sets for coordinate rings of character …

A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…

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…

Consider the polynomial ring in countably infinitely many variables over a field of characteristic zero, together with its natural action of the infinite general linear group G. We study the algebraic and homological properties of finitely…

We describe the relation between G-character varieties, $X_G(\Gamma)$, and $G/H$-character varieties, where $H$ is a finite, central subgroup of $G.$ In particular, we find finite generating sets of coordinate rings $C[X_{G/H}(\Gamma)]$ for…

Let $G$ be a finite group and let $k$ be a sufficiently large finite field. Let $R(G)$ denote the character ring of $G$ (i.e. the Grothendieck ring of the category of ${\mathbb{C}}G$-modules). We study the structure and the representations…

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…

We determine generators of the coordinate ring of $SL_2$-character varieties. In the case of the free group $F_3$ we obtain an explicit equation of the $SL_2$-character variety. For free groups $F_k$ we find transcendental generators.…

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

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…

For modules over group rings we introduce the following numerical parameter. We say that a module A over a ring R has finite r-generator property if each f.g. (finitely generated) R-submodule of A can be generated exactly by r elements and…

It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case.…

Let X(F,G) be the G-character variety of F where G is a rank 1 complex affine algebraic group and F is a finitely presentable discrete group. We describe an algorithm, which we implement in Mathematica, SageMath, and in Python, that takes a…

This paper presents a novel approach to constructing finite generating sets for infinitely generated ideals. By integrating algebraic and computational techniques, we provide a method to identify finite generators, demonstrated through…

Via counting over finite fields, we derive explicit formulas for the E-polynomials and Euler characteristics of GL(d)- and PGL(d)-character varieties of free groups. We prove a positivity property for these polynomials and relate them to…

Let G be a connected, semisimple Lie group with finite center and let K be a maximal compact subgroup. We investigate a method to compute multiplicities of K-types in the discrete series using a rational expression for a generating function…

Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…

We characterize finite groups G generated by orthogonal transformations in a finite-dimensional Euclidean space V whose fixed point subspace has codimension one or two in terms of the corresponding quotient space V/G with its quotient…

By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…

We define standardized constructions of finite fields, and standardized generators of (multiplicative) cyclic subgroups in these fields. The motivation is to provide a substitute for Conway polynomials which can be used by various software…

Let $K:=\mathbb{Q}(G)$ be the number field generated by the complex character values of a finite group $G$. Let $\mathbb{Z}_K$ be the ring of integers of $K$. In this paper we investigate the suborder $\mathbb{Z}[G]$ of $\mathbb{Z}_K$…