On the ideals of general binary orbits: the low order cases

Abstract: Let

E

denote a general complex binary form of order

d

(seen as a point in

P^{d}

), and let

O m e g a_{E} s u b s e t e q P^{d}

denote the closure of its

S L_{2}

-orbit. In this note, we calculate the equivariant minimal generators of its defining ideal

I_{E} s u b s e t e q c o m p l e x [a_{0}, ..., a_{d}]

for

4 l e q s l a n t d l e q s l a n t 10

. In order to effect the calculation, we introduce a notion called the `graded threshold character' of

d

. One unexpected feature of the problem is the (rare) occurrence of the so-called `invisible' generators in the ideal, and the resulting dichotomy on the set of integers

d g e q s l a n t 4

.

Review text

Any nonzero complex binary form \(E\) of order \(d\), say \(E=\sum\binom{d} {i}\alpha_{i}x_{1}^{d-i}x_{2}^{i},\) can be identified with the point \(\left[ \alpha_{0},\dots,\alpha_{d}\right] \in\mathbb{P}^{d}\). The group \(\text{SL}_{2}\mathbb{C}\) acts on \(E\) by a natural change of variables on \(x_{1},x_{2}\). The closure of its orbit, denoted \(\Omega_{E},\) is known to be a three dimensional irreducible projective variety of degree \(d\left( d-1\right) \left( d-2\right) \) for \(d>4\); if \(d=4\) then the degree is \(6\). Let \(I_{E}\) be the defining ideal of \(\Omega_{E}\). The objective here is to find a minimal set of equivariant generators for \(I_{E}\). Such generators are found for \(d\leq10.\) Let \(\Gamma\) be the representation ring of \(\text{SL}_{2}\mathbb{C},\) we may express \(\Gamma\) as the free abelian group generated by \(s_{0},s_{1},\dots.\;\)The constructions for \(d\leq10\) are completed through the use of threshold characters. These characters allow the author to construct characters \(\mathbb{B}_{m}\) and \(\mathbb{\tilde{Q}}_{m}\) in \(\Gamma,\) each of which is computed using \(\left\{ \mathbb{B}_{r}\,|\,r<m\right\}\). Because of this, the classification is accomplished starting with \(d=4\) and then letting \(d\) increase, freely using the results from \(r<d\). Having reduced the problem to a computational issue, the final set of generators is found with the help of \texttt{Macaulay 2} and \texttt{Maple}.

Recommendations

Cites work

Cited in

(4)

Describes a project that uses

Uses Software

This page was built for publication: On the ideals of general binary orbits: the low order cases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984993)