Pith. sign in

REVIEW 1 cited by

Commuting Jordan Types: a Survey

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2304.08550 v1 pith:YC7JFNHO submitted 2023-04-17 math.AC

Leila Khatami This is my paper · ORCID
classification math.AC
keywords commutingnilpotentsurveycentralizerfindinggivenintersectsjordan
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this paper, we survey the progress in the problem of finding the maximum commuting nilpotent orbit that intersects the centralizer of a given nilpotent matrix.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Identifying Partitions with maximum commuting orbit $Q=(u,u-r)$

    math.AC 2024-11 conditional novelty 6.0 of 10

    The partition P_{k,l}(Q) in the IKVZ2 table equals the Burge-code partition P^Q_{k,l} for every two-part stable partition Q=(u,u-r).

Pith tools