English
Related papers

Related papers: Polynomial Invariant Theory of the Classical Group…

200 papers

Let $K$ be an arbitrary field of characteristic zero, $P_n:= K[ x_1, ..., x_n]$ be a polynomial algebra, and $P_{n, x_1}:= K[x_1^{-1}, x_1, ..., x_n]$, for $n\geq 2$. Let $\s' \in {\rm Aut}_K(P_n)$ be given by $$ x_1\mapsto x_1-1, \quad…

Rings and Algebras · Mathematics 2007-05-23 V V Bavula , T H Lenagan

Loop invariants play a very important role in proving correctness of programs. In this paper, we address the problem of generating invariants of polynomial loop programs. We present a new approach, for generating polynomial equation…

Symbolic Computation · Computer Science 2015-03-19 Bin Wu , Liyong Shen , Min Wu , Zhengfeng Yang , Zhenbing Zeng

Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…

Number Theory · Mathematics 2024-07-09 William Duke

We give, in Sections 2 and 3, an english translation of: {\it Classes g\'en\'eralis\'ees invariantes}, J. Math. Soc. Japan, 46, 3 (1994), with some improvements and with notations and definitions in accordance with our book: {\it Class…

Number Theory · Mathematics 2021-08-24 Georges Gras

The paper is devoted to the problem of finding free generators in the fields of invariants for actions of unipotent groups on affine varieties. We consider the case when the unipotent group is the unipotent radical in an arbitrary parabolic…

Representation Theory · Mathematics 2022-03-24 A. N. Panov

A presentation by generators and relations of the $n$th symmetric power $B$ of a commutative algebra $A$ over a field of characteristic zero or greater than $n$ is given. This is applied to get information on a minimal homogeneous…

Commutative Algebra · Mathematics 2016-12-02 M. Domokos

We stress the potential usefulness of renormalization group invariants. Especially particular combinations thereof could for instance be used as probes into patterns of supersymmetry breaking in the MSSM at inaccessibly high energies. We…

High Energy Physics - Phenomenology · Physics 2015-09-11 Wim Beenakker , Tom van Daal , Ronald Kleiss , Rob Verheyen

The category $\bcalNT$ is a category of certain commutative graded algebras over a field. It was introduced in \cite{Lobos2} as a generalization of algebras generated by Jucys-Murphy elements in the many \textbf{End} algebras of the…

Commutative Algebra · Mathematics 2025-12-09 Diego Lobos Maturana

The work proves that, for three-dimensional upper triangular groups over a field of odd characteristic with an abelian unipotent subgroup, the ring of invariants is polynomial if and only if the unipotent subgroup is generated by…

Group Theory · Mathematics 2025-10-24 Abdulkadyr Buchaev

The automatic generation of loop invariants is a fundamental challenge in software verification. While this task is undecidable in general, it is decidable for certain restricted classes of programs. This work focuses on invariant…

Computational Complexity · Computer Science 2024-11-14 Rida Ait El Manssour , George Kenison , Mahsa Shirmohammadi , Anton Varonka

For a prime number p, we construct a generating set for the ring of invariants for the p+1 dimensional indecomposable modular representation of a cyclic group of order p^2. We then use the constructed invariants to describe the…

Commutative Algebra · Mathematics 2007-06-13 R. J. Shank , D. L. Wehlau

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Logic in Computer Science · Computer Science 2026-05-21 Arka Ghosh , Sławomir Lasota

For $\mathfrak{g}$ a simple Lie algebra and $G$ its adjoint group, the Chevalley map and work of Coxeter gives a concrete description of the algebra of $G$-invariant polynomials on $\mathfrak{g}$ in terms of traces over various…

Representation Theory · Mathematics 2015-02-03 Matthew A. Tai

A genus one curve of degree 5 is defined by the 4 x 4 Pfaffians of a 5 x 5 alternating matrix of linear forms on P^4. We describe a general method for investigating the invariant theory of such models. We use it to explain how we found our…

Number Theory · Mathematics 2011-10-18 Tom Fisher

For each subgroup of GL_2(F_p) or order divisible by p, generated by (pseudo-)reflections, we compute the ideals of stable and generalized invariants. These groups and these ideals are related to the cohomology of compact Lie groups,…

Representation Theory · Mathematics 2016-06-30 Jaume Aguadé

Let $\text{GL}(n) = \text{GL}(n, {\mathbb C})$ denote the complex general linear group and let $G \subset \text{GL}(n)$ be one of the classical complex subgroups $\text{O}(n)$, $\text{SO}(n)$, and $\text{Sp}(2k)$ (in the case $n = 2k$). We…

Commutative Algebra · Mathematics 2020-07-03 Vesselin Drensky , Elitza Hristova

Let \q be a simple algebraic group of type A or C over a field of good positive characteristic. We show for any x \in \q =\Lie(Q) that the invariant algebra S(\q_x)^{\q_x} is generated by the p^{th} power subalgebra and the mod p reduction…

Representation Theory · Mathematics 2013-01-29 Lewis Topley

We investigate a certain well-established generalization of the Davenport constant. For $j$ a positive integer (the case $j=1$, is the classical one) and a finite Abelian group $(G,+,0)$, the invariant $\Dav_j(G)$ is defined as the smallest…

Number Theory · Mathematics 2010-07-05 Alain Plagne , Wolfgang A. Schmid

An invariant of a model of genus one curve is a polynomial in the coefficients of the model that is stable under certain linear transformations. The classical example of an invariant is the discriminant, which characterizes the singularity…

Number Theory · Mathematics 2020-09-14 Manh Hung Tran

Loop invariants are software properties that hold before and after every iteration of a loop. As such, invariants provide inductive arguments that are key in automating the verification of program loops. The problem of generating loop…

Logic in Computer Science · Computer Science 2023-05-25 George Kenison , Laura Kovács , Anton Varonka