Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2509.01634

Help | Advanced Search

Mathematics > Algebraic Geometry

arXiv:2509.01634 (math)
[Submitted on 1 Sep 2025 ]

Title: Transverse slices and Zariski's multiplicity conjecture for quasihomogeneous surfaces

Title: 横截切片和准齐次曲面的扎里斯基重数猜想

Authors:Otoniel Nogueira da Silva, Manoel Messias da Silva Júnior
Abstract: In this work, we study finitely determined, quasihomogeneous, corank 1 map germs $f$ from $(\mathbb{C}^2,0)$ to $(\mathbb{C}^3,0)$. We introduce the notion of the $\mu_{\boldsymbol{m},\boldsymbol{k}}$-minimal transverse slice of $f.$ Since this slice is a plane curve, we provide its (topological) normal form. In the irreducible case, under certain conditions, we prove that the number of characteristic exponents of the curve is upper semicontinuous. Furthermore, we show that every topologically trivial 1-parameter unfolding of $f=(f_1,f_2,f_3)$ (not necessarily with $\mu_{\boldsymbol{m},\boldsymbol{k}}$-minimal transverse slice) is of non-negative degree (i.e., for any additional term $\alpha$ in the deformation of $f_i$, the weighted degree of $\alpha$ is not smaller than the weighted degree of $f_i$). As a consequence, we present a proof of Zariski\' s multiplicity conjecture for families in this setting. Finally, under the $\mu_{\boldsymbol{m},\boldsymbol{k}}$-minimal transverse slice assumption, we show that Ruas\' conjecture holds.
Abstract: 在本工作中,我们研究从$(\mathbb{C}^2,0)$到$(\mathbb{C}^3,0)$的有限确定、准齐次、余数 1 的映射芽$f$。我们引入了$\mu_{\boldsymbol{m},\boldsymbol{k}}$-最小横截面的的概念$f.$由于这个截面是一个平面曲线,我们为其提供其(拓扑)正规形式。在不可约的情况下,在某些条件下,我们证明曲线的特征指数的数量是上半连续的。 此外,我们证明了每个拓扑平凡的1参数展开式 $f=(f_1,f_2,f_3)$ (不一定具有 $\mu_{\boldsymbol{m},\boldsymbol{k}}$-最小横截面) 的次数是非负的(即,对于 $f_i$的形变中的任何额外项 $\alpha$, $\alpha$的加权次数不大于 $f_i$的加权次数)。 作为结果,我们给出了在这个情况下Zariski乘数猜想的一个证明。 最后,在 $\mu_{\boldsymbol{m},\boldsymbol{k}}$-最小横截面假设下,我们证明了Ruas猜想成立。
Subjects: Algebraic Geometry (math.AG) ; Complex Variables (math.CV)
MSC classes: 2020 MSC 14H20, 2020 MSC 14J07
Cite as: arXiv:2509.01634 [math.AG]
  (or arXiv:2509.01634v1 [math.AG] for this version)
  https://doi.org/10.48550/arXiv.2509.01634
arXiv-issued DOI via DataCite

Submission history

From: Manoel Messias da Silva Júnior [view email]
[v1] Mon, 1 Sep 2025 17:25:25 UTC (68 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
math.AG
< prev   |   next >
new | recent | 2025-09
Change to browse by:
math
math.CV

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号