SearcharxivSearch

arXiv · 1310.7608

Symmetric polynomials and non-finitely generated $Sym (\mathbb N)$-invariant ideals

Abstract

Let $K$ be a field and let $\mathbb N = \{1,2, \dots \}$. Let $R_n=K[x_{ij} \mid 1\le i\le n, j\in \mathbb N]$ be the ring of polynomials in $x_{ij}$ $(1 \le i \le n, j \in \mathbb N)$ over $K$. Let $S_n = Sym (\{1,2, \ldots, n \})$ and $Sym (\mathbb N)$ be the groups of the permutations of the sets $\{1,2,\dots, n \}$ and $\mathbb N$, respectively. Then $S_n$ and $Sym (\mathbb N)$ act on $R_n$ in a natural way: $τ(x_{ij})=x_{τ(i)j}$ and $σ(x_{ij})=x_{iσ(j)}$ for all $τ\in S_n$ and $σ\in Sym(\mathbb N)$. Let $\overline{R}_n$ be the subalgebra of the symmetric polynomials in $R_n$, \[ \overline{R}_n = \{f \in R_n \mid τ(f) = f \mbox{for each} τ\in S_n \} . \] In 1992 the second author proved that if $char (K)= 0$ or $char(K)=p > n$ then every $Sym (\mathbb N)$-invariant ideal in $\overline{R}_n$ is finitely generated (as such). In this note we prove that this is not the case if $char (K)=p\le n$. We also survey some results about $Sym (\mathbb N)$-invariant ideals in polynomial algebras and some related results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eudes Antonio da Costa, Alexei Krasilnikov. 2013-10-28. Symmetric polynomials and non-finitely generated $Sym (\mathbb N)$-invariant ideals. https://doi.org/10.1007/s10958-015-2329-1

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA