2019
DOI: 10.1016/j.jpaa.2018.03.014
|View full text |Cite
|
Sign up to set email alerts
|

Invariant polynomials on truncated multicurrent algebras

Abstract: We construct invariant polynomials on truncated multicurrent algebras, which are Lie algebras of the form g ⊗ F F[t1, . . . , t ℓ ]/I, where g is a finite-dimensional Lie algebra over a field F of characteristic zero, and I is a finite-codimensional ideal of F[t1, . . . , t ℓ ] generated by monomials. In particular, when g is semisimple and F is algebraically closed, we construct a set of algebraically independent generators for the algebra of invariant polynomials. In addition, we describe a transversal slice… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(9 citation statements)
references
References 19 publications
0
9
0
Order By: Relevance
“…This result was extended by Raïs and Tauvel [18] to all values of ℓ. More recently, Macedo and Savage [12] proved its multi-parameter generalization, while Panyushev and Yakimova [17] showed that this generalization remains valid for a wide class of Lie algebras g beyond simple Lie algebras.…”
Section: Introductionmentioning
confidence: 81%
“…This result was extended by Raïs and Tauvel [18] to all values of ℓ. More recently, Macedo and Savage [12] proved its multi-parameter generalization, while Panyushev and Yakimova [17] showed that this generalization remains valid for a wide class of Lie algebras g beyond simple Lie algebras.…”
Section: Introductionmentioning
confidence: 81%
“…(This goes back to Chevalley and Kostant.) Therefore, Theorem 0.1 yields another proof and a generalisation of [MS16,Theorem 5.4], see Corollary 2.6. A notable difference between our Theorem 0.1 and results of [AP17] is that we do not impose a constraint on i deg f i , which is a part of the definition of a "good generating system", and do not require the codim-2 property for q (see Section 1 for the definition).…”
Section: Introductionmentioning
confidence: 84%
“…, r. It then follows from (2·1) and the iteration process (2·2) that ξ = (ξ [i 1 ,...,ir] ) ∈q * reg ⇐⇒ ξ [m 1 ,...,mr] ∈ q * reg (see also Prop. 4.1(b) in [MS16]). Assume that q satisfies all the assumptions of Theorem 2.2 and set N = π −1 Q (π Q (0)) ⊂ q * .…”
Section: On the Equidimensionalitymentioning
confidence: 99%
See 2 more Smart Citations