PreprintCC BY-NC-ND 4.0arXiv
A combinatorial criterion for detecting roots of Bernstein-Sato polynomials
Abstract
We give a combinatorial criterion for detecting roots of Bernstein-Sato polynomials of ideals. As applications, we prove the strong monodromy conjecture for determinantal and Pfaffian ideals.
Related
- Analytic Criteria for Detecting Bernstein-Sato Roots
- Filtrations on D-modules and multiplicities of roots of Bernstein-Sato polynomials
- A Polynomial PDE Criterion for the −n/d Root of the Bernstein-Sato polynomial of Homogeneous Ideals
- On the Multiplicative Thom-Sebastiani Property for Bernstein-Sato Polynomials of Ideals
- Sharp Bernstein--Nikolskii inequalities for polynomials and entire functions of exponential type
BibTeX
@misc{shi2026combinatorial,
title = {{A combinatorial criterion for detecting roots of Bernstein-Sato polynomials}},
author = {Quan Shi and Huaiqing Zuo},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.09982},
eprint = {2610.09982},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.09982},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - A combinatorial criterion for detecting roots of Bernstein-Sato polynomials
AU - Quan Shi
AU - Huaiqing Zuo
PY - 2026
DA - 2026/10/07
PB - arXiv
DO - 10.48550/arxiv.2610.09982
UR - https://arxiv.org/abs/2610.09982
AB - We give a combinatorial criterion for detecting roots of Bernstein-Sato polynomials of ideals. As applications, we prove the strong monodromy conjecture for determinantal and Pfaffian ideals.
ER -