Peer Revenue Equity in science

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 24 February

Complex Variables

Stable polynomials and bounded rational functions in the unit ball

We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near a boundary zero. In higher dimensions, we give a partial characterization of a simple boundary zero. Several applications are given including boundedness of rational functions with boundary singularities and constructions of examples with prescribed local properties.
Read the full abstract

Spectral Theory

Higher Degree $t$-Hermitian Forms and Positivity-Preserving Contractions

In this article we introduce higher-degree $t$-Hermitian forms, a tubal analogue of ordinary Hermitian forms of arbitrary degree. Through a synthesis of multilinear matrix multiplication and the $t$-product on third-order tensors, we show that $t$-Hermitian forms are in bijection with odd order tubal tensors satisfying certain symmetry conditions, which we call $t$-conjugate partial symmetry. After applying the Fast Fourier Transform along the tubal mode of the corresponding tubal tensor, $t$-Hermitian forms decompose into a family of classical Hermitian forms. This decomposition enables us to characterize positivity of $t$-Hermitian forms in terms of the spectra of the conjugate partially symmetric Fourier slices of its corresponding tubal tensor, yielding a tubal analogue of the spectral theorem for classical higher degree Hermitian forms. Then, we study classical Hermitian forms induced by contractions along the tubal mode of $t$-conjugate partially symmetric tensors, characterizing when such contractions preserve positivity and deriving quantitative lower bounds for the positivity margin of the resulting classical Hermitian forms.
Read the full abstract

Number Theory

Torsion points on $\rm{GL}_2$-type abelian varieties

It is well known that the order of the torsion group of an abelian variety over a number field divides the greatest common divisor of the sizes of points on the reduction at each prime (except for an explicit finite set). Drawing inspiration from Katz's Inventiones paper (1981), we investigate the converse to this for abelian varieties of \(\rm GL_2\)-type and exhibit a tentative list of possible rational torsion orders for modular abelian varieties over \(\mathbb Q\) of dimension up to \(5\).
Read the full abstract

Analysis of PDEs

Blow-up criteria for the 1D NLS with combined nonlinearities

In this paper we develop two different types of criteria for the finite time blow-up solutions to the combined nonlinear Schrödinger equation in 1D. The first one is a negative energy criterion developed for triple combined nonlinearity and then for a (convergent) infinite sum of combined nonlinearities, including an exponential nonlinearity. The second one is a positive energy criterion for the double nonlinearity with the defocusing-focusing coefficients. We also provide examples of initial data that satisfy either of the criteria.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Maxwell kinematical algebras and 3D gravities

In this paper, we present a Maxwell extension of kinematical Lie algebras by promoting the contraction method underlying the Bacry and Lévy-Leblond cube to a semigroup expansion framework. Within this approach, we show that both non- and ultra-relativistic Maxwell algebras admitting non-degenerate invariant bilinear forms can be systematically obtained from different parent algebras through a unified expansion scheme, leading to a Maxwellian kinematical cube. This construction is further generalized to an infinite hierarchy of kinematical algebras. The expansion method naturally provides the corresponding invariant tensors, allowing for the systematic construction of three-dimensional Chern-Simons gravity theories.
Read the full abstract

All authors Patrick Concha, Nelson Gallegos, Evelyn Rodríguez, Sebastián Salgado

Number Theory

Distributions of unramified extensions of global fields

Given a finite group $\Gamma$, we prove results on the distribution of the prime-to-$q|\Gamma|$ part of fundamental groups of $\Gamma$-covers of the projective line $\mathbb P^1_{\mathbb F_q}$ over a finite field $\mathbb F_q$ as $q\to\infty$. Equivalently, this is a result on the distribution of the Galois groups of maximal unramified extensions of $\Gamma$-extensions of $\mathbb F_q(t)$, and thereby motivates a new conjecture on the distribution of Galois groups of maximal unramified extensions of $\Gamma$-extensions of a number field. In particular, this allows us to see and predict the effect of roots of unity in the base field on such distributions. We introduce the idea to study these groups along with the class in their 3rd homology group that arises from Artin-Verdier Duality. This invariant refines the lifting invariant that, in the function field setting, corresponds to stable components of Hurwitz space. One major input into our function field results is an application of our recently developed methods to determine a distribution of groups (or more general algebraic structures) from its moments. We prove non-existence results in the number field case that support our conjectures in the case where our conjectures predict certain kinds of groups occur with probability zero.
Read the full abstract

Functional Analysis

Linear preserver problems in matrix positivity theory

Linear preserver problems have been a central focus of research in matrix theory and operator theory for more than a century, beginning with Frobenius' 1897 characterization of determinant preserving linear maps on the space of complex matrices. Since this foundational result, considerable work has examined linear preservers of diverse subsets, functions, and relations across different matrix and operator spaces. The purpose of this survey is to present the current state of research on linear preserver problems for several positivity classes of matrices. We provide an overview of recent developments in the literature and, for each positivity class considered, identify gaps that remain to guide future research.
Read the full abstract

Optimization and Control · Cross-listed from stat.AP

On the non-uniformity of the 2026 FIFA World Cup draw

The group stage of a sports tournament is often made more appealing by introducing additional constraints in the group draw that promote an attractive and balanced group composition. For example, the number of intra-regional group matches is minimised in several world championships. Under such constraints, the traditional draw procedure may become non-uniform, meaning that the feasible allocations of the teams into groups are not equally likely to occur. Our paper quantifies this non-uniformity of the 2026 FIFA World Cup draw for the official draw procedure, as well as for 47 reasonable alternatives implied by all permutations of the four pots and two group labelling policies. We show why simulating with a recursive backtracking algorithm is intractable, and propose a workable implementation using integer programming. The official draw mechanism is found to be optimal based on two of five non-uniformity measures, including the average distortion of the 771 non-zero assignment probabilities. Nonetheless, non-uniformity can be more than halved if the organiser aims to treat the best teams drawn from the first pot equally.
Read the full abstract

All authors László Csató, Martin Becker, Karel Devriesere, Dries Goossens

Information Theory · Cross-listed from eess.SP

Optimal QAM Constellation for Over-the-Air Computation in the Presence of Heavy-Tailed Channel Noise

Over-the-air computation (OAC) enables low-latency aggregation over multiple-access channels (MACs) by exploiting the superposition property of the wireless medium to compute functions efficiently in distributed networks. A critical but often overlooked challenge is that electromagnetic interference in practical radio channels frequently exhibits heavy-tailed behavior, causing strong impulsive noise that severely degrades computation performance. This work studies digital OAC with QAM-based signaling under heavy-tailed interference modeled by a Cauchy distribution (lacking a finite second moment). We seek QAM-like constellations that minimize the mean-squared error (MSE) of sum aggregation subject to an average-power constraint. The problem is formulated as a constrained optimization, whose solution yields unique optimality conditions. Numerical results confirm the effectiveness of the proposed design. Notably, the framework extends naturally to nomographic functions, broader constellation families, and alternative noise models.
Read the full abstract

Algebraic Geometry

The Brauer group of a Stein algebra

We investigate the Brauer group of the ring $\mathcal{O}(S)$ of holomorphic functions on a finite-dimensional Stein space S. We provide a purely topological computation of this group and deduce a comparison theorem between the étale cohomology of $\textrm{Spec}(\mathcal{O}(S))$ and the singular cohomology of S in degree 2. Furthermore, we prove a purity theorem when S is nonsingular and study the index of classes in the Brauer group of $\mathcal{O}(S)$.
Read the full abstract

Combinatorics

Robinson spaces and their representation in low-dimensional metric spaces

Robinson spaces are structures equipped with a total order that encodes comparative dissimilarity relationships. We study the problem of representing Robinson dissimilarity spaces into low-dimensional metric spaces. These representations aim to preserve the relative dissimilarity relationships between elements rather than their exact values. While low dimensional Euclidean spaces such as $\mathbb{R}^1$ and $\mathbb{R}^2$ are natural candidates for such embeddings, previous work has shown that not all Robinson spaces admit a valid embedding in the real line that respects their structural constraints. Motivated by this limitation, we explore the broader class of real trees, which retain low-dimensional interpretability while allowing greater flexibility. To address the embedding problem, we develop two key tools: a combinatorial representation of Robinson spaces and a topological characterization of caterpillars, a restricted class of real trees. These tools enable a formulation of the embedding problem as a linear program, providing both computational and theoretical insights. We prove that some subclasses of Robinson spaces always admit embeddings in a caterpillar, and we establish the existence of Robinson spaces that cannot be embedded in any real tree. These results clarify the geometric limitations of representing ordered dissimilarity structures and open new directions for studying the interaction between dissimilarity, order, and metric geometry.
Read the full abstract

Dynamical Systems

Structure and Spectrum of Nonergodic Nilsystems

We study Host-Kra factors and the spectral type of nilsystems, without assuming ergodicity. In the ergodic case, it is known that the spectral type splits into a discrete component and a Lebesgue component of infinite multiplicity. Our main result extends this decomposition to nonergodic nilsystems.
Read the full abstract

Group Theory

Non-linearizable Root Group Data

An RGD system $\mathcal{D}$ is called \emph{linear w.r.t. a root basis $\mathcal{B}$} if the commutation relations between the root groups of $\mathcal{D}$ are `linear' in a certain sense. Moreover, $\mathcal{D}$ is called linearizable, if there exists a root basis $\mathcal{B}$ such that $\mathcal{D}$ is linear w.r.t. $\mathcal{B}$. For many examples of RGD systems it is easy to see that they are linear w.r.t. a concrete root basis. To the best of our knowledge, it was unclear whether RGD systems exist which are not linearizable. In this article we show that there exist uncountably many RGD systems which are not linearizable. In particular, we provide the first explicit example of such an RGD system. This expands the quote from Rémy that axiom (RGD$1$)$_{\mathrm{lin}}$ is not only a strengthening of axiom (RGD$1$), but is in fact stronger than it. We show that non-linearizability appears in examples of universal type, and also in examples of $2$-spherical type. For the examples of universal type we construct an uncountable family of non-linearizable RGD systems, and for the examples of $2$-spherical type we show that the RGD systems of type $(4, 4, 4)$ recently constructed by the author provide uncountably many non-linearizable RGD systems.
Read the full abstract

Operator Algebras

Voltage quantum graphs and a Gross-Tucker theorem for quantum graphs

A voltage graph is a finite directed graph whose edges are labeled by elements of a finite group $G$. A classical construction of Gross and Tucker associates to every voltage graph with vertex set $V$ a so-called derived graph with vertex set $V \times G$. We generalize their construction to quantum graphs and finite abelian groups. Remarkably, the construction can produce true quantum graphs starting from a classical voltage graph. In this case the obtained quantum graph is quantum isomorphic to a classical graph. As a main result we also prove a quantum version of the Gross-Tucker theorem which characterizes precisely which graphs can be written as derived graphs of voltage graphs.
Read the full abstract

Information Theory

Topology-Aware Coordination for Multi-Functional Low-Altitude Wireless Networks

Low-altitude wireless networks (LAWNs) are expected to consist of multi-tier, heterogeneous terrestrial and non-terrestrial devices, where effective coordination is essential to fully unlock the complementary capabilities of diverse systems from different vendors. To address this issue, we propose a novel multi-functional coordination framework that enables seamless cooperation within the LAWN while supporting efficient execution of diverse network functions. In the proposed architecture, each device or infrastructure element is assigned to a specific functional role, namely, edge mobile terminal (E-MT), distributed MT (D-MT), or computing center. E-MTs are equipped with lightweight, independent signal processing and computing capabilities, while D-MTs and the computing center handle regional and global coordination, respectively. To enhance the overall network efficiency, we model the LAWN as a sparse graph, where nodes represent network nodes and edges are defined according to a set of controllable connection rules. This topology-aware (TA) representation allows for efficiently solving various coordination tasks across the network. Numerical results show that the proposed TA coordination framework outperforms baseline approaches that lack topological insights, achieving higher efficiency in multi-task coordination. Finally, we discuss key technical challenges and outline potential solutions for future deployment.
Read the full abstract

All authors Jiajun He, Han Yu, Yiran Guo, Xinping Yi, Fan Liu, Hing Cheung So, Hien Quoc Ngo, Michail Matthaiou, Giuseppe Caire

Algebraic Topology

Comparison of Topologies on Homotopy Groups with Subgroup Topology Viewpoint

By introducing various topologies on the homotopy groups of a topological space, some researchers make these well known notions in algebraic topology more useful and powerful. In this paper, first we recall and review some known topologies on homotopy groups. Then by reviewing some famous subgroups of homotopy groups and using the concept of subgroup topology, we intend to compare these topologies in order to present some results on topologized homotopy groups.
Read the full abstract

Optimization and Control

Asymptotics of solutions to the linear search problem

The exact leading asymptotics of solutions to the symmetric linear search problem are obtained for any positive probability density on the real line with a monotonic, sufficiently regular tail. A similar result holds for densities on a compact interval.

Information Theory · Cross-listed from eess.SP

Cell-Free Massive MIMO-Assisted SWIPT Using Stacked Intelligent Metasurfaces

This study explores a next-generation multiple access (NGMA) framework for cell-free massive MIMO (CF-mMIMO) systems enhanced by stacked intelligent metasurfaces (SIMs), aiming to improve simultaneous wireless information and power transfer (SWIPT) performance. A fundamental challenge lies in optimally selecting the operating modes of access points (APs) to jointly maximize the received energy and satisfy spectral efficiency (SE) quality-of-service constraints. Practical system impairments, including a non-linear harvested energy model, pilot contamination (PC), channel estimation errors, and reliance on long-term statistical channel state information (CSI), are considered. We derive closed-form expressions for both the achievable SE and the average sum harvested energy (sum-HE). A mixed-integer non-convex optimization problem is formulated to jointly optimize the SIM phase shifts, APs mode selection, and power allocation to maximize average sum-HE under SE and average harvested energy constraints. To solve this problem, we propose a centralized training, decentralized execution (CTDE) framework based on deep reinforcement learning (DRL), which efficiently handles high-dimensional decision spaces. A Markovian environment and a normalized joint reward function are introduced to enhance the training stability across on-policy and off-policy DRL algorithms. Additionally, we provide a two-phase convex-based solution as a theoretical robust performance. Numerical results demonstrate that the proposed DRL-based CTDE framework achieves SWIPT performance comparable to convexification-based solution, while significantly outperforming baselines.
Read the full abstract

All authors Thien Duc Hua, Mohammadali Mohammadi, Hien Quoc Ngo, Michail Matthaiou

Group Theory

A generalization of a result of Hegedüs

A famous result of P. Hegedüs describes the structure of finite rational $\{2,5\}$-groups. In this paper, we show how Hegedüs' proof can be used to obtain a similar result for the more general situation of a finite rational $2$-group acting faithfully and with the eigenvector property on a f.d $\mathbb{F}_p$-vector space with $p\geq 5$.
Read the full abstract

Mathematical Physics

Perturbative anomalies in quantum mechanics

In this work, we propose a cohomological approach to studying perturbative anomalies in quantum mechanics. The Hamiltonian $\hat{H}$ together with the symmetry generator $\hat{S}$ forms a unitary representation of the two-dimensional Abelian Lie algebra $\mathfrak{g}\cong \mathbb{R}^{2}$ on the Hilbert space $V$. We show that perturbations of such a system are related to the first Chevalley-Eilenberg cohomology group $H^{1}_{CE}(\mathbb{R}^{2},\mathfrak{u}(V))$. In turn, the perturbative anomalies of the symmetry $\hat{S}$ are related to the second cohomology group $H^{2}_{CE}(\mathbb{R}^{2},\mathfrak{u}(V))$.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Estimating the Partially Linear Zero-Inflated Poisson Regression Model: a Robust Approach Using a EM-like Algorithm

Count data with an excessive number of zeros frequently arise in fields such as economics, medicine, and public health. Traditional count models often fail to adequately handle such data, especially when the relationship between the response and some predictors is nonlinear. To overcome these limitations, the partially linear zero-inflated Poisson (PLZIP) model has been proposed as a flexible alternative. However, all existing estimation approaches for this model are based on likelihood, which is known to be highly sensitive to outliers and slight deviations from the model assumptions. This article presents the first robust estimation method specifically developed for the PLZIP model. An Expectation-Maximization-like algorithm is used to take advantage of the mixture nature of the model and to address extreme observations in both the response and the covariates. Results of the algorithm convergence and the consistency of the estimators are proved. A simulation study under various contamination schemes showed the robustness and efficiency of the proposed estimators in finite samples, compared to classical estimators. Finally, the application of the methodology is illustrated through an example using real data.
Read the full abstract

Number Theory

Rational points on modular curves: parameterization and geometric explanations

We show that, conditional on Zywina's effective version of the Serre uniformity conjecture, there is a natural way to parameterize non-CM $\mathbb{Q}$-rational points on all modular curves in terms of the rational points on finitely many modular curves. Our proof refines Zywina's work to give a (conditional) parameterization of the images of adelic Galois representations of elliptic curves. In particular, we show that there are 41 $j$-invariants of elliptic curves whose associated Galois image does not vary in an infinite family. Using our explicit parameterization, we show that all rational points on all modular curves arise from the geometry of modular curves in a formal sense, confirming a philosophy of Mazur and Ogg.
Read the full abstract

All authors Maarten Derickx, Sachi Hashimoto, Filip Najman, Ari Shnidman

K-Theory and Homology

A KK-theoretic note on the spectral localiser

We review the construction of the spectral localiser (due to Loring and Schulz-Baldes) from a KK-theoretic perspective. We first give a KK-theoretic argument providing a spectral flow expression for the even or odd index pairing in terms of the "infinite volume" spectral localiser. Our approach towards this first step is more direct, treats the even and odd cases on an equal footing, and has the advantage that the construction of the spectral localiser becomes immediately apparent from the computation of the index pairing via a Kasparov product. In a second step of "spectral truncation", we then describe how this spectral flow expression can be computed in terms of the signature of the "finite volume" spectral localiser. Throughout, we do not require invertibility of the operator representing the K-homology class, and the even index pairing then obtains an additional contribution coming from the Fredholm index.
Read the full abstract

Probability

Extreme eigenvalues and eigenvectors for finite rank additive deformations of non-hermitian sparse random matrices

Consider a $n\times n$ sparse non-Hermitian random matrix $X_n$ defined as the Hadamard product between a random matrix with centered independent and identically distributed entries and a sparse Bernoulli matrix with success probability $K_n/n$ where $K_n\le n$ (and possibly $K_n\ll n$) and $K_n\to \infty$ as $n\to \infty$. Let $E_n$ be a deterministic $n\times n$ finite-rank matrix. We prove that the outlier eigenvalues of $Y_n= X_n +E_n$ asymptotically match those of $E_n$. In the special case of a rank-one deformation, assuming further that the sparsity parameter satisfies $K_n \gg \log^9(n)$ and that the entries of the random matrix are sub-Gaussian, we describe the limiting behavior of the projection of the right eigenvector associated with the leading eigenvalue onto the right eigenvector of the rank-one deformation. In particular, we prove that the projection behaves as in the Hermitian case. To that end, we rely on the recent universality results of Brailovskaya and van Handel (2024) relating the singular value spectra of deformations of $X_n$ to Gaussian analogues of these matrices. Our analysis builds upon a recent framework introduced by Bordenave et.al. (2022), and amounts to showing the asymptotic equivalence between the reverse characteristic polynomial of the random matrix and a random analytic function on the unit disc with explicit dependence on the finite-rank deformation.
Read the full abstract

Numerical Analysis

Orthonormal polynomial wavelets associated with de la Vallée Poussin-type interpolation on $[-1,1]$

Starting from de la Vallée Poussin type (VP) interpolation, the authors have recently introduced a family of interpolating polynomial scaling and wavelet bases generating the approximation and detail spaces of a non-standard multiresolution analysis. Motivated by the fact that, in many applications, orthonormal rather than interpolating bases are preferable, the present study develops a new family of scaling and wavelet polynomials that provide well-localized and orthonormal bases for the same approximation and detail spaces. We show that the proposed new bases have a behavior very similar to the interpolating bases already introduced, presenting similar features although they are not interpolating but orthonormal. In particular, we study the Fourier projection corresponding to the proposed orthonormal scaling basis, and introduce a discrete version of it by approximating the Fourier–like coefficients. For both continuous and discrete orthogonal projections, we prove the uniform boundedness of the Lebesgue constants and the uniform convergence with an asymptotic rate comparable with the best uniform polynomial approximation. Numerical experiments confirm the theoretical results and compare the new orthonormal VP scaling and wavelet bases with the interpolating case previously treated by the authors.
Read the full abstract

Numerical Analysis

Lanczos with compression for symmetric eigenvalue problems

The Lanczos method with implicit restarting is one of the most popular methods for finding a few exterior eigenpairs of a large symmetric matrix $A$. Usually based on polynomial filtering, restarting is crucial to limit memory and the cost of orthogonalization. In this work, we propose a novel strategy for the same purpose, called Lanczos with compression. Unlike polynomial filtering, our approach compresses the Krylov subspace using rational approximation and, in doing so, it sacrifices the structure of the associated Krylov decomposition. Nevertheless, it remains compatible with subsequent Lanczos steps and the overall algorithm is still solely based on matrix-vector products with $A$. On the theoretical side, we show that compression introduces only a small error compared to standard (unrestarted) Lanczos and therefore has only a negligible impact on convergence. Comparable guarantees are not available for commonly used implicit restarting strategies, including the Krylov–Schur method. On the practical side, our numerical experiments demonstrate the potential of compression to outperform the Krylov–Schur method in terms of matrix-vector products.
Read the full abstract

Analysis of PDEs

Boundary-driven patterns in elongated convex domains

We consider the heat equation in a smooth bounded convex domain $\Omega \subset \mathbb{R}^2$ with nonlinear Neumann boundary condition $\partial_\nu u = \lambda (u - u^3)$. Stable non-constant stationary solutions do not exist when $\Omega$ is a ball. We show that this behavior is not a consequence of convexity alone. More precisely, if the inradius of $\Omega$ is fixed and its diameter is sufficiently large, then there exists $\lambda>0$ for which the problem admits such a solution. The result reveals a geometric mechanism for the emergence of stable non-constant stationary solutions in elongated convex domains.
Read the full abstract

Probability

Seeing Through Hyperbolic Space: Visibility for $\lambda$-Geodesic Hyperplanes

We study visibility from a fixed point in the presence of a Poisson process of $\lambda$–geodesic hyperplanes in a $d$-dimensional hyperbolic space. The family of $\lambda$–geodesic hyperplanes interpolates between totally geodesic hyperplanes and horospheres. Our main result establishes a universality principle for this model: we prove that the fundamental visibility properties are invariant with respect to the parameter $\lambda\in[0,1]$. Namely, there is a critical intensity $\gamma_{\mathrm{crit}}>0$ such that the visible region is unbounded with positive probability for $\gamma < \gamma_{\mathrm{crit}}$ and almost surely bounded for $\gamma > \gamma_{\mathrm{crit}}$. For $d=2$ we establish almost sure boundedness also at criticality. The value for $\gamma_{\mathrm{crit}}$ is explicit and does not depend on $\lambda$. In the bounded phase, we show that the mean visible volume is identical with the known formula for $\lambda=0$. The key integral-geometric step is an explicit computation showing that the measure of $\lambda$-geodesic hyperplanes hitting a geodesic segment is a linear function of the length of the segment, independent of~$\lambda$.
Read the full abstract

Optimization and Control

A subdifferential characterization via Busemann functions and applications to DC optimization on Hadamard manifolds

This paper investigates the properties of Busemann functions on Hadamard manifolds and their use in optimization algorithms in Riemannian settings. We present a new Busemann-based characterization of the subdifferential, which is particularly well suited to Riemannian optimization. In the classical Hadamard manifold framework, a subgradient provides a global lower model of a convex function expressed through the inverse exponential map. However, this model may fail to exhibit a useful convexity or concavity structure. By contrast, our characterization yields a concave bounding function by exploiting key properties of Busemann functions. We use this concavity to design and analyze difference-of-convex (DC) optimization methods on Hadamard manifolds. In particular, we reformulate the classical DC algorithm (DCA) for Riemannian contexts and study its convergence properties. We also report preliminary numerical experiments comparing the proposed Busemann DCA, which leads to geodesically convex subproblems, with the classical Riemannian DCA.
Read the full abstract

All authors O. P. Ferreira, D. S. Gonçalves, M. S. Louzeiro, S. Z. Németh, J. Zhu

Algebraic Geometry

The Strong Monodromy Conjecture for a class of homogeneous polynomials in three variables

We consider the class of all homogeneous, possibly non-reduced, polynomials $f$ whose associated reduced projective divisor $D_{\text{red}} \subset \mathbb{P}^{n-1}$ has (at worst) quasi-homogeneous isolated singularities. In an arbitrary number of variables $n$ and with $d$ denoting the degree of $f$, we characterize when $-n/d$ is a root of the Bernstein–Sato polynomial of $f$ in terms of elementary data involving logarithmic derivations. When we restrict to three variables, we prove the resulting class of polynomials satisfies the Strong Monodromy Conjecture, in the motivic sense.
Read the full abstract