Scheme-theoretic multiplicity formula for pullbacks of higher associated varieties

About 7 years old · traced to

Let λ=[λ1,…,λn]\lambda=[\lambda_1,\ldots,\lambda_n] be a partition, let m1(λ)m_1(\lambda) denote the multiplicity of its parts equal to 11, and let Fj(λ)\mathcal{F}_j(\lambda) be the family of descendants defined in the paper. For λ′=[λ1′,…,λn′]∈Fj(λ)\lambda'=[\lambda'_1,\ldots,\lambda'_n]\in\mathcal{F}_j(\lambda), let m(λ′,λ)m(\lambda',\lambda) be the multiplicity defined by

m(λ′,λ)=#{(ι1,…,ιn):ιi∈{0,1}, ι1+⋯+ιn=j, [λ1′+ι1,…,λn′+ιn]=[λ1,…,λn]}.m(\lambda',\lambda)=\#\{(\iota_1,\ldots,\iota_n):\iota_i\in\{0,1\},\ \iota_1+\cdots+\iota_n=j,\ [\lambda'_1+\iota_1,\ldots,\lambda'_n+\iota_n]=[\lambda_1,\ldots,\lambda_n]\}.

Here Ψd,r\varPsi_{d,r} is the apolar map, CHj(Δλ)\mathrm{CH}_j(\Delta_\lambda) is the relevant higher associated variety, and (Δ(λ1′+1,…,λn′+1))∨(\Delta_{(\lambda'_1+1,\ldots,\lambda'_n+1)})^{\vee} denotes the dual variety. Scheme-theoretic multiplicity formula. If j≤n−m1(λ)j\leq n-m_1(\lambda), then

Ψd,r−1(CHj(Δλ))‾=⋃λ′∈Fj(λ)m(λ′,λ) Ψd,r−j−1(CH0(Δλ′))‾=⋃λ′∈Fj(λ)m(λ′,λ) (Δ(λ1′+1,…,λn′+1))∨\overline{\varPsi_{d,r}^{-1}(\mathrm{CH}_j(\Delta_{\lambda}))}=\bigcup_{\lambda'\in\mathcal{F}_j(\lambda)}m(\lambda',\lambda)\,\overline{\varPsi_{d,r-j}^{-1}(\mathrm{CH}_0(\Delta_{\lambda'}))}=\bigcup_{\lambda'\in\mathcal{F}_j(\lambda)}m(\lambda',\lambda)\,(\Delta_{(\lambda'_1+1,\ldots,\lambda'_n+1)})^{\vee}

with equality holding scheme-theoretically. The formula gives a geometric description of the components and their multiplicities in these pullbacks; it is proposed on the basis of experimental verifications and general considerations about singular loci, and its resolution status is not established in the supplied text.

References

Primary source

Maria Chiara Brambilla and Giovanni Staglianò, “Algebraic boundaries among typical ranks for real binary forms of arbitrary degree”, arXiv:1911.01958 (2020).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.