ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be the characteristic of the field, and let 0≤j<a≤b0\leq j<a\leq b. For e≥0e\geq 0, set

q′=pe−1<a≤q=pe,q'=p^{e-1}<a\leq q=p^e,

and let rr satisfy

rq≤a+b−1−j<(r+1)q.rq\leq a+b-1-j<(r+1)q.

If b−j>rqb-j>rq, choose mm such that mq′≤a<(m+1)q′mq'\leq a<(m+1)q', set a′=a−mq′a'=a-mq', and choose ii such that iq′≤j≤(i+1)q′−1iq'\leq j\leq (i+1)q'-1.

Recursive description of the integers cjc_j. If b−j≤rqb-j\leq rq, then cj(a,b)=rqc_j(a,b)=rq. Otherwise,

cj(a,b)=cj−iq′(a′,b+(m−2i)q′)c_j(a,b)=c_{j-iq'}(a',b+(m-2i)q')

when j≤iq′+a′−1j\leq iq'+a'-1, while

cj(a,b)=cj−iq′−a′(q′−a′,b+(m−1−2i)q′)c_j(a,b)=c_{j-iq'-a'}(q'-a',b+(m-1-2i)q')

when j≥iq′+a′j\geq iq'+a'.

This recursive description is used to compute the two-fold products δaδb\delta_a\delta_b and hence the products δa1⋯δan\delta_{a_1}\cdots\delta_{a_n} that determine the Jordan type of the Artinian complete intersection A=k[T1,…,Tn]/⟨T1a1,…,Tnan⟩A={\mathbf k}[T_1,\ldots,T_n]/\langle T_1^{a_1},\ldots,T_n^{a_n}\rangle with respect to T1+⋯+TnT_1+\cdots+T_n. Its status is not resolved in the supplied material.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.