English
Related papers

Related papers: Generating sets for coordinate rings of character …

200 papers

Given an action of an affine algebraic group with only trivial characters on a factorial variety, we ask for categorical quotients. We characterize existence in the category of algebraic varieties. Moreover, allowing constructible sets as…

Algebraic Geometry · Mathematics 2013-05-15 I. V. Arzhantsev , D. Celik , J. Hausen

The paper presents a new algorithmic construction of a finite generating set of rational invariants for the rational action of an algebraic group on the affine space. The construction provides an algebraic counterpart of the moving frame…

Commutative Algebra · Mathematics 2007-05-23 Evelyne Hubert , Irina A. Kogan

Let $G$ be a finite group. The ring $R_\mathbb{K}(G)$ of virtual characters of $G$ over the field $\mathbb{K}$ is a $\lambda$-ring; as such, it is equipped with the so-called $\Gamma$-filtration, first defined by Grothendieck. We explore…

Representation Theory · Mathematics 2018-11-30 Béatrice I. Chetard

Given a finitely generated subgroup G of a ring R we provide a finite subset of G such that if each element of this set satisfies some cubic polynomial equation in one variable over the center Z of R then the subring generated by G has…

Group Theory · Mathematics 2015-05-12 A. Grishkov , R. Oliveira , S. Sidki

It is well known that the ring of polynomial invariants of a reductive group is finitely generated. However, it is difficult to give strong upper bounds on the degrees of the generators, especially over fields of positive characteristic. In…

Representation Theory · Mathematics 2016-10-24 Harm Derksen , Visu Makam

We compute generating functions for the sum of the real-valued character degrees of the finite general linear and unitary groups, through symmetric function computations. For the finite general linear group, we get a new combinatorial proof…

Group Theory · Mathematics 2013-06-04 Jason Fulman , C. Ryan Vinroot

We obtain tight bounds for the minimal number of generators of an ideal with bounded-degree generators in a polynomial ring $K[X_1,\dots,X_n],$ as well as a sharp quantification of the maximum possible size of a minimal generating set of…

Commutative Algebra · Mathematics 2025-09-23 Andrei Mandelshtam

This paper is a continuation of [GLT], which develops a level theory and establishes strong character bounds for finite simple groups of linear and unitary type in the case that the centralizer of the element has small order compared to…

Representation Theory · Mathematics 2019-04-23 Robert M. Guralnick , Michael Larsen , Pham Huu Tiep

We describe the "generic" part of the character ring of general linear groups over a finite field in terms of quiver representations.

Representation Theory · Mathematics 2014-07-30 Emmanuel Letellier

The W-characteristic set of a polynomial ideal is the minimal triangular set contained in the reduced lexicographical Groebner basis of the ideal. A pair (G,C) of polynomial sets is a strong regular characteristic pair if G is a reduced…

Symbolic Computation · Computer Science 2020-07-02 Rina Dong , Dongming Wang

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

Representation Theory · Mathematics 2018-10-10 Soham Swadhin Pradhan

Let G be an affine algebraic group acting on an affine variety X. We present an algorithm for computing generators of the invariant ring K[X]^G in the case where G is reductive. Furthermore, we address the case where G is connected and…

Commutative Algebra · Mathematics 2007-05-23 Harm Derksen , Gregor Kemper

Under reasonable assumptions, a group action on a module extends to the minimal free resolutions of the module. Explicit descriptions of these actions can lead to a better understanding of free resolutions by providing, for example,…

Commutative Algebra · Mathematics 2021-11-05 Federico Galetto

A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an…

Classical Analysis and ODEs · Mathematics 2019-06-18 K. S. Kazarian

We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…

Commutative Algebra · Mathematics 2011-08-25 Christopher J. Hillar , Seth Sullivant

An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…

Symbolic Computation · Computer Science 2020-03-19 Deepak Kapur , Yiming Yang

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

Combinatorics · Mathematics 2013-11-28 Hye Jung Kim , J. B. Nation , Anne V. Shepler

A C# package is presented that allows a user for an input quantum circuit to generate a set of multivariate polynomials over the finite field Z_2 whose total number of solutions in Z_2 determines the output of the quantum computation…

Quantum Physics · Physics 2009-11-11 Vladimir P. Gerdt , Vasily M. Severyanov

Let $G$ be a finite group. A contravariant functor from the category of finite free $G$-sets to vector spaces has an associated Hilbert series, which records the underlying sequence of $G^n$ representations, $n \in \mathbb N$. We prove that…

Representation Theory · Mathematics 2024-05-01 Philip Tosteson

In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.

Symbolic Computation · Computer Science 2014-06-19 Margreta Kuijper , Anna-Lena Trautmann