2023
DOI: 10.1007/s40993-022-00401-1
|View full text |Cite
|
Sign up to set email alerts
|

Explicit non-Gorenstein $$R={\mathbb {T}}$$ via rank bounds II: Computational aspects

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 14 publications
0
0
0
Order By: Relevance
“…They require a numerical condition which turns out to force the rank of R and T over Z p to be 3 (cf. [17,Theorem 1.3.3]).…”
Section: Overview Of Q4mentioning
confidence: 99%
“…They require a numerical condition which turns out to force the rank of R and T over Z p to be 3 (cf. [17,Theorem 1.3.3]).…”
Section: Overview Of Q4mentioning
confidence: 99%