The minimal cycles over Brieskorn complete intersection surface singularities (Q515000): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.11650/tjm.20.2016.6434 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.11650/tjm.20.2016.6434 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2326767149 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.11650/TJM.20.2016.6434 / rank
 
Normal rank

Latest revision as of 20:06, 9 December 2024

scientific article
Language Label Description Also known as
English
The minimal cycles over Brieskorn complete intersection surface singularities
scientific article

    Statements

    The minimal cycles over Brieskorn complete intersection surface singularities (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2017
    0 references
    The authors generalise a result of \textit{T. Tomaru} for Brieskorn-Pham singularities [Pac. J. Math. 170, No. 1, 271--295 (1995; Zbl 0848.14017)] to the case of Brieskorn complete intersections. The minimal cycle on a resolution of a normal surface singularity is the smallest cycle with the same genus as the fundamental cycle. It coincides with the fundamental cycle for Brieskorn complete intersections of type \((a_1,\dots,a_m)\) if \(\text{lcm}((a_1,\dots,a_{m-1})\leq a_m < 2 \text{lcm}((a_1,\dots,a_{m-1})\). The proof is based on the explicit description of the resolution graph and the divisor of the function \(z_m\).
    0 references
    0 references
    normal surface singularities
    0 references
    cyclic quotient singularities
    0 references
    Brieskorn complete intersections
    0 references
    fundamental cycle
    0 references
    minimal cycle
    0 references

    Identifiers