Analysis of PDEs
The Conformal Fractional–Logarithmic Laplacian on the Sphere: Yamabe Problems and Sharp Inequalities
Huyuan Chen, Rui Chen and Daniel Hauer
In this paper, we introduce the conformal fractional–logarithmic
Laplacian on the unit sphere, defined as the derivative of the conformal fractional
Laplacian with respect to the order parameter \(s\in(0,1)\). We investigate its fundamental analytic and spectral properties, including its relation to the conformal logarithmic
Laplacian, its spectral representation, and the explicit form of its
eigenvalues and eigenfunctions. We further establish its conformal covariance law and derive the associated Yamabe-type equation, proving its equivalence to the corresponding conformal equation in \(\mathbb R^N\) through stereographic projection. Finally, we apply this framework to sharp Sobolev-type inequalities, recovering the sharp logarithmic Sobolev inequality, revealing the failure of a naive fractional–logarithmic analogue, and establishing new sharp fractional–logarithmic inequalities.
Read the full abstract ▾
Numerical Analysis
Tucker Tensor Train Taylor Series
Nick Alger, Blake Christierson, Peng Chen et al. (+1 more)
Learning derivative-accurate surrogates for implicit simulators is a key challenge in scientific machine learning. High-order Taylor surrogates have long been considered intractable in high dimensions, because the derivative tensors are enormous and accessible only through probes. We make such surrogates tractable with the Tucker tensor train Taylor series (T4S), a local surrogate that represents each derivative tensor of a truncated Taylor expansion as a Tucker tensor train. T4S targets a different learning problem than global operator learning: rather than training from input-output pairs at many parameter values, it is trained from random directionally symmetric derivative probes at a single expansion point. Computing $m$ probes of the $k$th derivative requires only $O(mk)$ linearized solves sharing one operator, cheaper than the $O(m)$ nonlinear solves for function evaluations or $O(m\,2^k)$ linearized solves for asymmetric probes. We develop derivative-informed dimension reduction, Riemannian Gauss-Newton and Cauchy SGD fitting
algorithms with rank continuation, requiring little hyperparameter tuning, and fast sweeping routines for the Riemannian Jacobian. We prove representational guarantees under spectral decay of the input covariance. Experiments show that our methods match quasi-optimal T3-SVD accuracy on random tensors from probes alone, up to data-limited ranks, and recover high-order Taylor structure in Poisson PDE examples.
Read the full abstract ▾
All authors Nick Alger, Blake Christierson, Peng Chen, Omar Ghattas
Numerical Analysis
An Explicit Symmetric Exponential Integrator and Its Error Estimate for the Relativistic Charged-Particle Dynamics
Zhirui Shen and Bin Wang
This paper investigates the equations of motion for a relativistic charged particle in a general
magnetic field. By reformulating the dynamics in four-dimensional spacetime and separating the linear and nonlinear parts, we construct an explicit symmetric exponential integrator based on Lie splitting. Rigorous analysis establishes its unconditional stability and second-order convergence. Numerical experiments confirm its superior performance, including accuracy, effciency and long-time
Hamiltonian conservation.
Read the full abstract ▾
Analysis of PDEs
Removing small wavenumber constraints in Side B of the Probe Method
Masaru Ikehata
The Probe Method is an analytical reconstruction scheme for inverse obstacle problems utilizing the Dirichlet-to-Neumann map associated with the governing partial differential equation. It consists of two distinct parts: Side A and Side B. Both are based on the indicator sequence which is calculated from the Dirichlet-to-Neumann map acting on "needle-like" specialized solution of the governing equation for the background medium, whose energy is concentrated on an arbitrary given needle inside. In Side A, the limit of the indicator sequence-referred to as the indicator function-is computed before the needles touch the obstacle, and the boundary is identified as the point where this function first blows up. In contrast, Side B states the blow-up of the indicator sequence after the needles have come into contact with the obstacle. For the Helmholtz equation, the validity of Side B has long required a small wavenumber constraint. This paper finally removes this long-standing restriction, establishing the method's applicability for broader cases.
Read the full abstract ▾
Analysis of PDEs
Weak Harnack inequality and Cartan property for nonlocal $W^{s,1}$-minimizers
Panu Lahti, Yuxin Li and Khanh Nguyen
We establish a weak Harnack inequality for nonlocal $W^{s,1}$-subminimizers in a complete, connected, doubling metric measure space where $0<s<1$. As a corollary, we prove that $W^{s,1}$-subminimizers are semicontinuous, up to a suitable choice of pointwise representative. We then prove Cartan-type properties for $W^{s,1}$-superminimizers. The theory turns out to be mostly analogous with the local case of BV super- and subminimizers. Our results seem to be new even in the classical Euclidean setting.
Read the full abstract ▾
Algebraic Topology
Buchstaber, Ochanine, Krichever, and Witten Genera
Mikhail Kornev
We introduce a new class of one-dimensional commutative formal group laws with formal inverse $\bar u=-u$ whose modulus square construction yields Buchstaber's family of
polynomials, and prove that the formal group law $F_{\mathrm{Bc}}(u,v)$ is universal for this class over commutative $\mathbb{Z}[1/2]$-
algebras. This class is related to, but does not coincide with, the family of formal group laws associated with the Krichever genus. We compute the values of the corresponding Hirzebruch genus $\mathrm{Bc}$ on theta divisors and complex projective spaces, describe its relation to the Ochanine, Krichever, and Witten genera, and show how this construction gives examples not arising from Hirzebruch's
elliptic genera of level $n$. We construct a complex-oriented multiplicative
cohomology theory $\mathrm{Buc}^*$ such that the complex orientation $\mathrm{U}^*\to\mathrm{Buc}^*$ induces the genus $\mathrm{Bc}$ on coefficient rings, and prove that its localization at the discriminant is naturally isomorphic to the Landweber-exact
elliptic cohomology theory $\mathrm{U}^*(-)\otimes_{\Omega_{\mathrm{U}}}\mathbb{Z}[1/2,a_1,a_2,a_3,\Delta^{-1}]$. Finally, we prove that $\mathbb{Z}[a_1,12a_2,360a_3]$ is the smallest subring of $\mathbb{Q}[a_1,a_2,a_3]$ over which the Buchstaber exponential $f_{\mathrm{Bc}}(u)$ is a Hurwitz series. As a corollary, we prove the Hurwitz-integrality statement predicted by Bunkova's coefficient-divisibility
conjecture and show that $\mathbb{Z}[g_2/2,6g_3]$ is the minimal Hurwitz coefficient ring of the Weierstrass sigma-function.
Read the full abstract ▾
Algebraic Geometry
Solid Amoebas of Maximally Sparse Polynomials
Mounir Nisse
The
topology of amoebas of complex algebraic hypersurfaces is deeply connected to the combinatorics of the Newton polytope and the convex geometry of the Ronkin function. A long-standing
conjecture of Passare and Rullgard asserts that the amoeba of a maximally sparse Laurent
polynomial, whose support consists exactly of the vertices of its Newton polytope, must be solid, meaning that the complement of the amoeba has precisely as many connected components as the number of vertices of the Newton polytope. In this paper we prove this
conjecture. The proof is based on a detailed analysis of the stability of the linearity domains of the Ronkin function under tropical degenerations of Laurent
polynomials. We show that in the maximally sparse case no new slopes corresponding to interior
lattice points can appear, forcing the amoeba complement to have the minimal possible
topology. In addition, we establish stability results for the spines of degenerating amoebas, prove that the associated Newton subdivision stabilizes and coincides with the tropical subdivision for sufficiently small parameters, and derive
geometric criteria controlling the appearance of
lattice points in the dual subdivision. These results lead to a classification of three distinct regimes governing the
topology of amoeba complements according to the position of the support relative to the Newton polytope.
Read the full abstract ▾
Mathematical Physics
Scattering for anisotropic potentials
Evgeny Korotyaev
We consider the scattering for the operator $H=H_o+V$, where the unperturbed operator $H_o$ is not assumed to be
elliptic and the potential $V$ is anisotropic. Under some conditions on $H_o$ and $V$ we show that the wave operators for $H_o, H$ exist and are complete, $H$ has no singular continuous spectrum and the
eigenvalues of $H$ can accumulate only to zero. For stronger conditions on $V$ the operator $H$ has finite number of
eigenvalues only. Moreover, these results are applied to the invariance principle and for time-dependent potentials.
Read the full abstract ▾
Mathematical Physics · Cross-listed from cond-mat.soft
Isometric Incompatibility in Growing Elastic Sheets
Yafei Zhang, Michael Moshe and Eran Sharon
Geometric incompatibility, the inability of a material's rest state to be realized in Euclidean space, underlies shape formation in natural and synthetic thin sheets. Classical Gauss and Mainardi-Codazzi-Peterson (MCP) incompatibilities explain many patterns in nature, but they do not exhaust the mechanisms that frustrate thin elastic sheets. We identify a new incompatibility that forbids smooth stretching-free configurations, even when the rest state of the elastic sheet locally satisfies the Gauss and MCP compatibility conditions. We demonstrate this principle in a model of surface growth with positive Gaussian
curvature, where a
geometric horizon forms, leading to the onset of frustration. Experiments, simulations, and theory show that the sheet responds by nucleating periodic d-cone-like dimples. We show that this obstruction to stretching-free configurations is topological, and we point to open questions concerning the origin of frustration.
Read the full abstract ▾
Commutative Algebra
Generalizing Saito's Criterion for Nonfree Arrangements
Junyan Chu
Saito's criterion is a foundational result that algebraically characterizes free hyperplane arrangements via the determinant of a square
matrix of logarithmic derivations. It is natural to ask whether this criterion can be generalized to the non-free setting. To address this, we formulate a general problem concerning the maximal minors of a $p \times \ell$ ($p \geq \ell$) derivation
matrix and the algebraic relations among their associated coefficients. Focusing on strictly plus-one generated (SPOG) arrangements, we completely solve this minor-based recognition problem under the assumption that $\operatorname{pd} D(\mathcal{A}) \leq 1$. As a direct consequence, we obtain a purely algebraic, necessary and sufficient characterization of SPOG arrangements in dimension three. Ultimately, this framework provides a computable bridge to post-free arrangement theory.
Read the full abstract ▾
Differential Geometry
Higher spin Killing spinors on 3-dimensional manifolds
Yasushi Homma, Natsuki Imada and Soma Ohno
We define higher
spin Killing spinors on Riemannian
spin manifolds in arbitrary dimension and study them in detail in dimension three. We prove a
rigidity result for 3-dimensional
manifolds admitting higher
spin Killing spinors and give expressions for higher
spin Killing spinors on the 3-sphere and the 3-
hyperbolic space explicitly. We also investigate the Killing spinor type equation on integral
spin bundles.
Read the full abstract ▾
Probability · Cross-listed from stat.ML
Stochastic approximation in non-markovian environments revisited
Vivek Shripad Borkar
Based on some recent work of the author on
stochastic approximation in non-markovian environments, the situation when the driving random process is non-ergodic in addition to being non-markovian is considered. Using this, we propose an analytic framework for understanding
transformer based learning, specifically, the `
attention' mechanism, and continual learning, both of which depend on the entire past in principle.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Approximate Dynamic Programming for Degradation-aware Market Participation of Battery Energy Storage Systems: Bridging Market and Degradation Timescales
Flemming Holtorf and Sungho Shin
We present an approximate dynamic programming framework for designing degradation-aware
market participation policies for battery energy storage systems. The approach employs a tailored value function approximation that reduces the state space to state of charge and battery health, while performing dynamic programming along a pseudo-time axis encoded by state of health. This formulation enables an offline/online computation split that separates long-term degradation dynamics (months to years) from short-term
market dynamics (seconds to minutes) – a timescale mismatch that renders conventional predictive control and dynamic programming approaches computationally intractable. The main computational effort occurs offline, where the value function is approximated via coarse-grained backward induction along the health dimension. Online decisions then reduce to a real-time tractable one-step predictive control problem guided by the precomputed value function. This decoupling allows the integration of high-fidelity physics-informed degradation models without sacrificing real-time feasibility. Backtests on historical
market data show that the resulting policy outperforms several
benchmark strategies with optimized hyperparameters.
Read the full abstract ▾
Numerical Analysis
Error Analysis of the Explicit Splitting Scheme for Fluid-Poroelastic Structure Interaction Problems
Yifan Wang, Jeonghun Lee and Suncica Canic
We present a priori error analysis for a fully discrete, parallelizable, explicit loosely coupled scheme for the time-dependent Stokes-Biot problem. The method decouples the fluid and poroelastic subproblems in a fully explicit fashion, allowing each problem to be solved independently at each time step, with a consistent treatment of the interface conditions that provides stability and convergence of the scheme. The error analysis is carried out in a discrete energy framework. More specifically, we introduce Ritz-type projections in each subdomain, and subtract the fully discrete scheme from the time-discrete continuous formulation. This yields reduced error equations in which the dominant interpolation contributions cancel. The remaining consistency terms stem primarily from time discretization residuals and lagged interface data inherent to the explicit splitting. The main result of this manuscript is the derivation of a discrete error energy identity, and establishment of unconditional error estimates in a combined energy-dissipation norm via a Gronwall-type argument. These estimates demonstrate first-order accuracy in time and optimal spatial convergence rates, as determined by the degree of the finite element
polynomials. Numerical experiments based on a manufactured solution corroborate the theory, confirming first-order temporal convergence for all variables, and spatial convergence orders consistent with the chosen approximation spaces.
Read the full abstract ▾
Dynamical Systems · Cross-listed from eess.SY
Multidimensional Opinion Dynamics with Confirmation Bias: A Multi-Layer Framework
M.Hossein Abedinzadeh and Emrah Akyol
We study multidimensional opinion dynamics under confirmation bias in social networks. Each
agent holds a vector of correlated opinions across multiple topic layers. Peer interaction is modeled through a static, informationally symmetric social channel, while external information enters through a dynamic, informationally asymmetric source channel. Source influence is described by nonnegative state-dependent functions of
agent–source opinion mismatch, which captures confirmation bias without hard thresholds. For general Lipschitz source-influence functions, we give sufficient conditions under which the dynamics are contractive and converge to a unique steady state independent of the initial condition. For affine confirmation-bias functions, we show that the steady state can be computed through a finite sign-consistency search and identify a regime in which it admits a closed form. For broader classes of bounded nonlinear source-influence functions, we derive explicit lower and upper bounds on the fixed point. Numerical examples and a study on a real-world adolescent lifestyle network illustrate the role of multidimensional coupling and show that source-design conclusions can change qualitatively when confirmation bias is ignored.
Read the full abstract ▾
Number Theory
Effective count of integer points on ternary affine quadrics and effective equidistribution
Runlin Zhang
We study the effective equidistribution of certain infinite homogeneous measures and related counting problems through mixing. In this way, we obtain smooth versions of counting
theorems studied by Oh-Shah and later by Kelmer-Kontorovich over a number field. In the appendix, we apply the meromorphic continuation of
Hilbert-Asai Eisenstein series to obtain the authentic counting.
Read the full abstract ▾
Number Theory
Integral Representations for Multiple Apéry-Like Series
Jorge Antonio González Layja
We derive integral representations for six families of multiple Apéry-like series using repeated integration by parts and
Fourier expansions. The resulting formulas are expressed in terms of polylogarithms, Legendre chi functions, and inverse tangent integrals. As applications, we recover several known evaluations as special cases of our results, expressed in terms of Dirichlet eta, beta, and lambda functions. In addition, we obtain a new identity expressing a family of such series as linear combinations of products of Dirichlet eta values.
Read the full abstract ▾
Number Theory
An analytic approach to $P$-adic diffeomorphism group and Teichmüller theory
Yuxiu Lu
We consider a specific class of infinite dimensional $p$-adic Lie groups, i.e., a sort of diffeomorphism groups on $p$-adic ball $\operatorname{Diff}^{\operatorname{an}}(B_\epsilon)$. It turns out that this group has a natural logarithmic structure that leads to a $p$-adic version of Teichmüller theory on diffeomorphism groups, which also presents some remarkable hydrodynamic facets. We further apply this framework to Mochizuki's $p$-adic Teichmüller theory and Inter-universal Teichmüller theory (IUT), and give a new reformulation of IUT as a Teichmüller theory on
automorphisms of two-dimensional group schemes.
Read the full abstract ▾
Number Theory
Analytic Study of $p$-Bessel Functions: Fractional Calculus, Integral Representations, and Complex Extensions
Masaya Kitajima
We present a systematic analytic study of the $p$-Bessel functions $\mathcal{J}_{\omega,\varphi}^{[p]}$, a novel class of generalized Bessel functions arising from
Fourier analysis on planar domains bounded by $p$-circles, including astroid-type shapes with $0<p\le2$ satisfying $(2/p)\in\mathbb{N}$. While previous work established Hardy-type oscillatory identities for these domains, expressing
lattice point discrepancies via $p$-Bessel functions, the present paper focuses on the intrinsic analytic properties of the functions themselves. In particular, we (i) construct a hierarchical structure of $\{\mathcal{J}_{\omega,\varphi}^{[p]}\}_{\omega\ge0}$ using Erdélyi-Kober-type fractional derivatives, (ii) derive explicit real-analytic integral representations and obtain asymptotic formulas on the coordinate axes, and (iii) extend the functions to the complex domain through Poisson-type integral formulas. These results establish $p$-Bessel functions as genuinely new oscillatory kernels, providing a rigorous framework for studying anisotropic oscillatory phenomena and laying the analytic foundation for applications in $p$-circle
lattice point problems.
Read the full abstract ▾
Information Theory
On generalized covering radii of binary primitive double-error-correcting BCH codes
Maosheng Xiong and Chi Hoi Yip
The generalized covering radii (GCR) of linear codes are a fundamental higher-dimensional extension of the classical covering radius. While the second and third GCR of binary primitive double-error-correcting BCH codes, $\text{BCH}(2,m)$, were recently determined, their proofs relied on highly complex combinatorial arguments, and the behavior of the GCR hierarchy for larger orders $k$ has remained largely unexplored. In this paper, we introduce the Generalized Supercode Lemma, which lower-bounds the GCR of a code using the generalized Hamming weights of an appropriate supercode. Applying this lemma, we significantly streamline and simplify the proofs for the known lower bounds of $\rho_2(\text{BCH}(2,m))$ and $\rho_3(\text{BCH}(2,m))$, and we establish a new lower bound for $\rho_4(\text{BCH}(2,m))$. Furthermore, by combining combinatorial arguments with Weil-type exponential sum estimates, we investigate the GCR hierarchy for general $k$, proving that $2k \le \rho_k(\text{BCH}(2,m)) \le 2k+1$ whenever $m$ is sufficiently large compared to $k$.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ML
Gradient Descent with Projection Finds Over-Parameterized Neural Networks for Learning Low-Degree Polynomials with Nearly Minimax Optimal Rate
Yingzhen Yang and Ping Li
We study the problem of learning a low-degree spherical
polynomial of degree $k_0 = \Theta(1) \ge 1$ defined on the unit sphere in $\RR^d$ by training an over-parameterized two-layer neural network with augmented feature in this paper. Our main result is the significantly improved sample complexity for learning such low-degree
polynomials. We show that, for any regression risk $\eps \in (0, \Theta(d^{-k_0})]$, an over-parameterized two-layer neural network trained by a novel Gradient Descent with Projection (GDP) requires a sample complexity of $n \asymp \Theta( \log(4/\delta) \cdot d^{k_0}/\eps)$ with probability $1-\delta$ for $\delta \in (0,1)$, in contrast with the representative sample complexity $\Theta(d^{k_0} \max\set{\eps^{-2},\log d})$. Moreover, such sample complexity is nearly unimprovable since the trained network renders a nearly optimal rate of the nonparametric regression risk of the order $\log({4}/{\delta}) \cdot \Theta(d^{k_0}/{n})$ with probability at least $1-\delta$. On the other hand, the minimax optimal rate for the regression risk with a kernel of rank $\Theta(d^{k_0})$ is $\Theta(d^{k_0}/{n})$, so that the rate of the nonparametric regression risk of the network trained by GDP is nearly minimax optimal. In the case that the ground truth degree $k_0$ is unknown, we present a novel and provable adaptive degree selection
algorithm which identifies the true degree and achieves the same nearly optimal regression rate. To the best of our knowledge, this is the first time that a nearly optimal risk bound is obtained by training an over-parameterized neural network with a popular activation function (ReLU) and algorithmic guarantee for learning low-degree spherical
polynomials. Due to the feature learning capability of GDP, our results are beyond the regular Neural Tangent Kernel (NTK) limit.
Read the full abstract ▾
Analysis of PDEs
Well-posedness issues for the generalized Benjamin–Bona–Mahony equation
Seunghyun Kim and Chulkwang Kwak
In this paper, we consider the one-dimensional generalized Benjamin–Bona–Mahony (gBBM) equation \[(1-\partial_x^2)u_t+(u+u^p)_x=0,\qquad p=2,3,4,\dots,\] posed either on the real line $\mathbb R$ or on the
torus $\mathbb T$. This equation may be viewed as a regularized model for the propagation of long-crested surface water waves. The main results of this work are threefold: \medskip First, we establish unconditional local well-posedness in the class $C([0,T];H^s)$ without imposing any auxiliary spaces for \[s\ge \frac{p-2}{2p},\] which is sharp in the sense that the multilinear estimate in $H^s$ is optimal. In addition, we prove unconditional uniqueness for all distributional solutions in $L^\infty((0,T);H^s)$. \medskip Second, we show that below this regularity threshold, the flow map cannot be of class $C^p$. Precisely, if the flow map is well-defined and continuous near the origin from $H^s$ to $C([0,T];H^s)$ for every $s<\frac{p-2}{2p}$, then it cannot be of class $C^p$ at the origin. The proof is based on a high-to-low frequency interaction, implemented differently on $\mathbb R$ and $\mathbb T$. \medskip Third, in the odd-power case, we prove global well-posedness below $H^1$ in the following cases: $p=3$ with $s\ge \frac14$, and $p=5$ with $s>\frac12$. To the best of our knowledge, these are the first global well-posedness results in the Sobolev framework for the generalized BBM equation below $H^1$. The argument is based on the Bona–Tzvetkov approach \cite{BT}, while being initially inspired by Bourgain's high–low method \cite{Bourgain1998, Bourgain1999}. A key new ingredient is the use of a
Hamiltonian conservation law below the $H^1$ energy level. This allows us to control the higher-degree nonlinear contributions in the energy estimate, thereby preventing the Grönwall iteration from blowing up.
Read the full abstract ▾
Combinatorics
The Erdős-Ginzburg-Ziv theorem constant of finite groups
Yang Zhao and Guoqing Wang
Let $G$ be a multiplicatively written finite group of order $n$. The Erdős-Ginzburg-Ziv
Theorem constant of the group $G$, denoted $\mathsf E(G)$, is defined as the smallest positive integer $\ell$ with the following property: for any given sequence $(g_1,\ldots,g_{\ell})$ over $G$, there exist $n$ distinct integers $i_1,\ldots,i_n\in \{1,\ldots,\ell\}$ such that the product of $g_{i_1},\ldots,g_{i_n}$, in some order, is the identity element of $G$. The Erdős-Ginzburg-Ziv
Theorem constant originates from the celebrated additive
theorem proved by Erdős, Ginzburg and Ziv in 1961, which amounts to proving $\mathsf E(G)\leq 2|G|-1$ holds in case that $G$ is abelian. It is also well-known that $\mathsf E(G)=2|G|-1$ holds for all finite cyclic groups. In 2010, Gao and Li [J. Pure Appl.
Algebra] conjectured that $\mathsf E(G)\leq \frac{3|G|}{2}$ for every finite non-cyclic group $G$. In this paper, we confirm the
conjecture for all non-cyclic groups $G$ whose order is not divisible by four, and characterize the groups achieving the equality $\mathsf E(G)=\frac{3|G|}{2}$ as those with a cyclic subgroup of index two.
Read the full abstract ▾
Geometric Topology
Generalized formulas for the Jones polynomial of a rational link
Yuanan Diao and Gábor Hetyei
We derive new formulas for the Jones
polynomial and the Kauffman bracket
polynomial of a rational link represented by a standard diagram that is not necessarily alternating. These formulas generalize the results of Qazaqzeh, Yasein, and Abu-Qamar for the Tutte
polynomial of the Tait graph of an alternating diagram of a rational link, as well as the
matrix formulas of Lawrence and Rosenstein for the Jones
polynomial of a rational link. Our approach uses the colored version of Brylawski's tensor product formula for Tutte
polynomials of colored graphs, due to Diao, Hetyei, and Hinson. Furthermore, generalizing the formulas of Qazaqzeh, Yasein, and Abu-Qamar, we present a finite automaton that computes the crossing signs, thereby enabling the calculation of the writhe of a standard diagram of a rational link.
Read the full abstract ▾
Mathematical Physics · Cross-listed from gr-qc
Isotropic Coordinates for Generalized Schwarzschild-like Solutions
Zeyu Zeng and Elena Kopteva
We consider a broad class of static, spherically symmetric generalized Schwarzschild-like solutions with multiple non-interacting anisotropic fluid sources and derive the coordinate transformation from Schwarzschild-like (
curvature) to isotropic coordinates with conformally flat spatial slices. The isotropic form removes spatial-sector coordinate pathologies at the horizon, clarifies
geometric quantities (e.g., ADM mass and
curvature invariants), and enables the construction of well-posed initial data on t=const hypersurfaces, suitable for the
Hamiltonian and conformal formulations of numerical relativity and for perturbation theory. The backgrounds in isotropic coordinates we develop make it straightforward to separate environmental effects from intrinsic strong-
gravity signals and meet the growing interest in non-
vacuum black hole phenomenology across scattering,
lensing, and waveform modeling.
Read the full abstract ▾
Geometric Topology
Caratheodory metrics on Teichmuller spaces
Yiran Lin and Vladimir Markovic
Let $S$ be an arbitrary Riemann surface whose Teichmüller space $T(S)$ has dimension at least two. A long standing problem is to determine whether the Carathéodory metric $d_C$ agrees with the Teichmüller metric $d_T$ on $T(S)$. It was shown that $d_C\ne d_T$ when $S$ is a closed surface of genus at least two. In this paper we study the general case, and prove that $d_C\ne d_T$ on $T(S)$ except possibly on the following seven Teichmüller spaces: $T^1_{0,0}$, $T^1_{0,1}$, $T^2_{0,0}$, $T^1_{0,2}$, $T^2_{0,1}$, $T^3_{0,0}$, and $T^3_{0,1}$.
Read the full abstract ▾
Differential Geometry
A Proof of the Eigenvalue Ratio Bound for Embedded Surfaces
Ricardo Gloria-Picazzo, Yingying Wu and Shing-Tung Yau
We explain how the spectrum of a closed embedded surface $\Sigma \subset \mathbb{R}^3$ relates to the Dirichlet spectrum of the bounded domain $\Omega \subset \mathbb{R}^3$ with $\partial \Omega = \Sigma$. We prove that there exists a positive constant $K_g$, depending only on the genus $g$ of $\Sigma$, such that $\lambda_k^D(\Omega)^{3/2}/(\lambda_k(\Sigma)\sqrt{\lambda_1(\Sigma)}) \ge K_g$, where $\lambda_k(\Sigma)$ denotes the $k$-th nonzero
eigenvalue of the Laplace-Beltrami operator on $\Sigma$ and $\lambda_k^D(\Omega)$ denotes the $k$-th
eigenvalue of the
Laplacian on $\Omega$ with Dirichlet boundary conditions. Moreover, we explicitly obtain the dependence of $K_g$ on the genus, showing that $K_g \propto (g+1)^{-1}$, and we determine the optimal constant $K_0$ for $k=1$ in the genus-zero case. A generalized version of this result in arbitrary dimension is also provided for domains whose boundaries have nonnegative
Ricci curvature.
Read the full abstract ▾
Functional Analysis
Spectrality of product-form self-similar measures and tiles
Jing-Cheng Liu, Jia-Jie Wang and Jia Zheng
This paper studies the
Fourier properties of self-similar measures and tiles generated by digit sets of product-form. Let $0 <\rho <1$ be a real number and let $D$ be the direct sum of two consecutive integer sets: $$D=\{0,1,\cdots,N-1\}\oplus m\{0,1,\cdots, L-1\},$$ where $N, m, L \in \mathbb{N}^{*}$ with %$N, L \geq 2$ $N, L \geq 2$. The pair $(\rho,D)$ determines the self-similar iterated function system (IFS) $ \{\phi_d(\cdot)=\rho(\cdot+d)\}_{d \in D}$. Let $\mu_{\rho,D}$ and $T$ be the associated self-similar measure and self-similar set, respectively. We first prove that $L^2(\mu_{\rho,D})$ admits an exponential orthonormal basis if and only if $\rho^{-1}=p\in\mathbb{N}$ satisfies $N\mid p$, $L\mid p$ and $N\mid \frac{m}{\gcd(m,p^d)}$, where $$d=\max\left\{i:\gcd\left(\frac{mL}{\gcd(mL,p^i)},L\right)\neq 1,i\in\mathbb{N}\right\}.$$ This result extends a series of previous studies, including the cases where $N,L$ are
primes [An-Wang, J. Funct. Anal., 2021] and $N=L$ [Liu-Peng-Wu, J. Math. Anal. Appl., 2019]. Furthermore, in the context of the Fuglede
conjecture, we show that when $\rho^{-1} =\#D= NL$, the space $L^2(\chi_T dx)$ admits an exponential orthonormal basis if and only if $T$ is a translation tile of $\mathbb{R}$.
Read the full abstract ▾
Differential Geometry
Chen-Ricci and Hineva Inequalities For Riemannian Submersions and Riemannian Maps With Applications
Ravindra Singh
The Chen–
Ricci inequality provides a sharp upper estimate for the
Ricci curvature in terms of the ambient
curvature and the squared mean
curvature, whereas the Hineva inequality gives a complementary lower estimate. Although Chen–
Ricci inequalities have been investigated for Riemannian submersions and Riemannian maps, the corresponding Hineva inequalities have not yet been systematically studied in these settings. In this paper, we fill this gap by establishing sharp Hineva inequalities for Riemannian submersions and Riemannian maps. We also provide alternative and direct proofs of the Chen–
Ricci inequalities by working directly with the
Ricci curvature, rather than proceeding through scalar-
curvature identities and optimization arguments. For Riemannian submersions, we obtain sharp upper and lower estimates along the vertical and mixed distributions, while for Riemannian maps we obtain corresponding estimates along the range distribution. The equality cases are completely characterized, and the simultaneous equality of the Chen–
Ricci and Hineva inequalities is investigated. As applications, we obtain the corresponding two-sided
Ricci-
curvature estimates for Riemannian submersions from real and complex space forms and for Riemannian maps into real and complex space forms. Several examples are presented to demonstrate the sharpness of the obtained inequalities.
Read the full abstract ▾
Information Theory
Dual Representation of Minimum Divergence Under Integral Constraints
Shubhanshu Shekhar and Shubhada Agrawal
Minimum divergence problems under integral constraints appear throughout statistics and probability, including sequential inference, bandit theory, and distributionally robust optimization. In many such settings, dual representations are the key step that convert information-theoretic lower bounds into computationally tractable (and often near-optimal)
algorithms. In this paper, we present a general two-stage recipe for deriving dual representations of constrained minimum divergence (in the second argument) for distributions supported on $[0,1]^K$. The first stage derives a dual representation for finitely-supported distributions using classical finite-dimensional convex duality techniques, while the second establishes an abstract interchange argument that lifts this discretized dual to arbitrary distributions. We begin with the simplest case of mean-constrained minimum relative
entropy, commonly called $\mathrm{KL}_{\inf}$, and generalize an existing argument from multi-armed bandits literature for $K=1$ to arbitrary dimensions. Our main contribution is to significantly expand the scope of this approach to a broad class of $f$-divergences (beyond relative
entropy) and to general integral constraint functionals (beyond the mean constraint). Finally, we illustrate the statistical implications of our results by constructing optimal procedures for sequential testing, estimation, and change detection with observations in $[0,1]^K$.
Read the full abstract ▾