Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 16 April

Combinatorics

On the independence number of de Bruijn graphs

We derive the asymptotic formula $\alpha(k,q)=\lambda_{k-1}q^k+o(q^k)$, where $\alpha(k,q)$ is the independence number of the de Bruijn graph $B(k,q)$, and $\lambda_{k-1}$ is a constant arising from a variational problem on the unit $(k-1)$-dimensional cube. When $k=4$, we show the bounds $91/240\le \lambda_3\le 11/28$. For odd prime $k$, we analyse the binary case $q=2$ via a phase reduction on rotation orbits. For $k=11,13,17$ this yields compact orbit-marker certificates for optimal constructions. Combined with a lifting theorem by Lichiardopol, these certificates give exact formulas for $\alpha(11,q)$, $\alpha(13,q)$, and $\alpha(17,q)$ for all $q\ge2$, extending the known cases $k=3,5,7$.
Read the full abstract

Combinatorics

New results on proper orientation number of graphs

The proper orientation number $\vec{\chi}(G)$ of an undirected graph $G$ is the minimum $k$ such that there exists an orientation of $G$ with all out-degrees at most $k$ and with different out-degrees for any two adjacent vertices. Chen, Mohar and Wu (JCTB, 2023) proved that if $G$ is a $r$-partite graph, then $\vec{\chi}(G) \leq \frac{1}{2} \text{Mad}(G)+r^{1+o(1)}$, where $\text{Mad}(G)$ is the maximum average degree of $G$. Moreover, if $G$ is a bipartite graph, then $ \vec{\chi}(G) \leq \lceil \frac{1}{2} \text{Mad}(G)\rceil +3$ and this bound is tight. They also asked whether $\vec{\chi}(G)-\lceil \frac{1}{2} \text{Mad}(G)\rceil$ can be bounded by a linear function of $r$. In this paper, we first construct somewhat involved $r$-partite graphs with $\vec{\chi}(G)\geq\lceil \frac{1}{2} \text{Mad}(G)\rceil +\lfloor\frac{5}{2}r\rfloor-2$, showing that a linear dependence on \(r\) is unavoidable. We also prove that $ \vec{\chi}(G) \leq\lceil \frac{1}{2} \text{Mad}(G)\rceil +7$ for every 3-partite graph $G$. This implies \(\vec{\chi}(G)\le 10\) for \(3\)-colorable planar graphs and \(\vec{\chi}(G)\le 9\) for outerplanar graphs, improving the corresponding bounds of Chen, Mohar, and Wu.
Read the full abstract

Dynamical Systems · Cross-listed from cs.LG

Zeroth-Order Optimization at the Edge of Stability

Zeroth-order (ZO) methods are widely used when gradients are unavailable or prohibitively expensive, including black-box learning and memory-efficient fine-tuning of large models, yet their optimization dynamics in deep learning remain underexplored. In this work, we provide an explicit step size condition that exactly captures the (mean-square) linear stability of a family of ZO methods based on the standard two-point estimator. Our characterization reveals a sharp contrast with first-order (FO) methods: whereas FO stability is governed solely by the largest Hessian eigenvalue, mean-square stability of ZO methods depends on the entire Hessian spectrum. Since computing the full Hessian spectrum is infeasible in practical neural network training, we further derive tractable stability bounds that depend only on the largest eigenvalue and the Hessian trace. Empirically, we find that full-batch ZO methods operate at the edge of stability: ZO-GD, ZO-GDM, and ZO-Adam consistently stabilize near the predicted stability boundary across a range of deep learning training problems. Our results highlight an implicit regularization effect specific to ZO methods, where large step sizes primarily regularize the Hessian trace, whereas in FO methods they regularize the top eigenvalue.
Read the full abstract

All authors Minhak Song, Liang Zhang, Bingcong Li, Niao He, Michael Muehlebach, Sewoong Oh

Information Theory

Constructions of $q$-ary Golay Complementary Pairs Over Flexible Non-Power-of-Two Lengths

Golay complementary pair (GCP), first introduced by Golay in 1951, has been extensively studied and widely applied in communication systems. A $q$-ary GCP $\{\mathbf{A},\mathbf{B}\}$ consists of two $q$-ary complex sequences $\mathbf{A}=(A_0,\cdots,A_{M-1})$ and $\mathbf{B}=({B}_0,\cdots,{B}_{M-1})$ of equal length $M$, where $\textit{A}_i,\textit{B}_i\in\{\xi^a:0\leq a\leq q-1\}$ with $\xi=e^{\frac{2\pi\sqrt{-1}}{q}}$.In this paper,we prove that the existence of a quaternary ($q=4$) GCP of length $M$ is equivalent to the explicit constructibility of ($4h$)-ary GCPs of length $2^mM$ for all integers $h,m\geq1$. All proposed sequences are constructed via extended Boolean functions (EBFs), and the direct construction yields GCPs with more flexible length ranges than all previous relevant results.
Read the full abstract

Classical Analysis and ODEs

Restricted Projections to Hyperplanes in $\mathbb{R}^n$

We study dimensions of sets projected to an $(n-2)$-dimensional family of hyperplanes in $\mathbb{R}^n$ under curvature conditions. Let $n\ge 4$, $\Sigma \subset S^{n-1}$ be an $(n-2)$-dimensional $C^2$ manifold such that $\Sigma$ has sectional curvature $>1$ and $Z \subset \mathbb{R}^{n}$ be analytic. If $\dim\pi_{T_yS^{n-1}}(Z) \le n-2$ for some $y \in S^{n-1}$, then $\dim \pi_{T_xS^{n-1}}(Z) = \dim Z$ for $\mathcal{H}^{n-2}$-a.e. $x \in \Sigma$.
Read the full abstract

Classical Analysis and ODEs

On the Weighted Hardy Type Inequality for Functions from $W^1_p$ Vanishing on Small Parts of the Boundary

A new weighted Hardy-type inequality for functions from the Sobolev space $W_{p}^{1}$ is proved. It is assumed that functions vanish on small alternating pieces of the boundary. The proved inequality generalizes the classical known weighted Hardy-type inequalities.

Statistics Theory · Cross-listed from stat.ME

Model Checking for Regressions Based on Weighted Residual Processes with Diverging Number of Predictors

The integrated conditional moment (ICM) test is a classical and widely used method for assessing the adequacy of regression models. Although it performs well in fixed-dimension settings, its behavior changes dramatically when the predictor dimension diverges: in such regimes, the limiting null and alternative distributions of the ICM statistic degenerate to fixed constants. Moreover, when the number of predictors diverges, the commonly used wild bootstrap no longer approximates the null distribution of the ICM statistic well, leading to size distortion and substantial power loss. To address these challenges, we propose a new specification test based on weighted residual processes for evaluating the parametric form of the regression mean function in high-dimensional settings where the number of predictors increases with the sample size. We establish the asymptotic properties of the test statistic under the null hypothesis and under global and local alternatives. The proposed test maintains the nominal significance level and can detect local alternatives that deviate from the null hypothesis at the parametric rate $1/\sqrt{n}$. Furthermore, we propose a smooth residual bootstrap to approximate the limiting null distribution and establish its validity in high-dimensional settings. Two simulation studies and a real-data example are conducted to evaluate the finite-sample performance of the proposed test.
Read the full abstract

Information Theory

Sidorenko-Inspired Pessimistic Estimation

Recently, Abo Khamis et al. showed how to upper bound the size of a join of multiple tables, a problem essential to query optimization in database theory. They unified earlier works by the following information-theoretical framework. 1. Let $(X_1,..., X_n)$ be a row selected from the join uniformly at random. 2. The size of the join is now $\exp(H(X_1,..., X_n))$. 3. To upper bound $H(X_1,..., X_n)$, break it into several $\textit{local entropies}$, such as $H(X_1)$, $H(X_2, X_3)$, and $H(X_4|X_5)$, using Shannon-type inequalities. 4. Upper bound local entropies using statistics of the tables being joined. The statistics Abo Khamis et al. considered are the counts of graph homomorphisms from stars to the tables. In a follow-up work, we generalized stars to bi-stars. In this paper, we generalize bi-stars to caterpillars, an even larger class of graphs inspired by Sidorenko's conjecture. Simulations show that, while Abo Khamis et al.'s star bound overestimates the join size by $m$, our bi-star bound overestimates by about $m^{3/4}$, and this paper's new caterpillar bound overestimates by about $m^{3/5}$. These exponents are obtained by log-log regressions with R-square $> 0.98$. All homomorphisms are counted in time linear in the size of the tables being joined.
Read the full abstract

Combinatorics

Unimodality and log-concavity of generalized Glasby-Paseman sequences

In this paper, we consider a two-parameter ($l$ and $a$) generalization of a sequence that Glasby and Paseman considered. Based on computer experiments, we conjecture its unimodality, log-concavity, peak positions, and the asymptotic behavior of the maximum values. Then we prove this conjecture for the case where $l=2$ and $a=1$. We finish the paper by making some comments about the conjecture on the generalized sequence.
Read the full abstract

Analysis of PDEs

An inverse problem for compressible Euler's equations

We consider an inverse problem for the compressible Euler's equations in polytropic fluid. We show that by taking active measurements near a particle trajectory one can determine the background flow in a set where pressure waves can propagate from and return to the particle trajectory, under the additional assumption that the flow has nonzero vorticity.
Read the full abstract

Combinatorics

Orbits and incidence matrices for points, planes and lines regarding the twisted cubic in PG(3,q), q = 2, 3, 4

In the three-dimensional projective space PG(3,q) over the finite field F_q with q elements, we consider the normal rational curve known as a twisted cubic and the projectivity group G_q that fixes it. For q = 2, 3, 4, we solve the open problems of classifying the orbits of points, planes, and lines under G_q and of determining the corresponding incidence matrices between points, planes, and lines partitioned into these orbits.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Optimal Trace Inequalities for Single-Shot Quantum Information

Single-shot quantum information theory is governed not only by entropy exponents, but also by the finite-resource constants that multiply them. These constants directly affect the quantitative performance of decoupling, covering, convex-splitting, position-based decoding, and one-shot communication protocols, yet they are often inherited from nonoptimal scalar estimates or from classical-to-quantum lifting arguments that introduce additional losses. In this work we show that the operator layer-cake representation provides a mechanism for lifting sharp scalar inequalities to the noncommutative setting without loss. Using an iterative Riemann–Stieltjes integration-by-parts method, we derive sharp quantum trace inequalities that tighten several standard single-shot bounds. For a logarithmic trace inequality recently introduced by Cheng et al.\ and subsequently used in quantum covering and decoupling problems, we determine the exact optimal prefactor, replacing the previously known constant by a smaller Lambert-$W$ constant and proving universal optimality for positive operators. We also completely characterize the threshold behavior that appears under normalization to quantum states. In addition, we establish optimal two-sided collision-divergence inequalities, which lead to improved position-based decoding and single-shot classical communication bounds. These results show that several finite-resource bounds in single-shot quantum information can be tightened, and that within the layer-cake Rényi-divergence framework the resulting constants are genuine optimality barriers rather than artifacts of the proof.
Read the full abstract

Information Theory

A Synonymous Variational Perspective on the Rate-Distortion-Perception Tradeoff

The fundamental limit of natural signal compression has traditionally been characterized by classical rate-distortion (RD) theory through the tradeoff between coding rate and reconstruction distortion, while the rate-distortion-perception (RDP) framework introduces a divergence-based measure of perceptual quality as a modeling principle, leaving its theoretical origin unclear. In this paper, motivated by a synonymity-based semantic information perspective, we reformulate perceptual reconstruction as recovering any admissible sample within an ideal synonymous set (synset) associated with the source, rather than the source sample itself, and establish a synonymous source coding architecture. On this basis, we develop a synonymous variational inference (SVI) analysis framework with a synonymous variational lower bound (SVLBO) for tractable analysis of synset-oriented compression. Within this framework, we establish a synonymity-perception consistency principle, showing that optimal identification of semantic information is theoretically consistent with perceptual optimization. Based on this result, we further derive a tight-bound synonymous source coding rate characterization and show that its Jensen-limit relaxation leads to a synonymous rate-distortion-perception form for practical optimization. These analytical results show that the distributional divergence term arises naturally from the synset-based reconstruction objective, clarify its compatibility with existing RDP formulations and classical RD theory, and suggest the potential advantages of synonymous source coding.
Read the full abstract

All authors Zijian Liang, Kai Niu, Changshuo Wang, Jin Xu, Ping Zhang

2604.14603 · 16 Apr · 27 pages, 6 figures. This paper is submitted to the special issue on "Data Compression: Classical Theories Meet Modern Advances" of the IEEE Journal of Selected Areas in Information Theory (IEEE JSAIT), R1 revision version

Differential Geometry

Large $p$-Capacitary Invariants, Entropy, and Geometric Rank

We introduce large-$p$ asymptotic invariants associated with the $p$-capacity, the first $p$-eigenvalue, and the Maz'ya constant on connected complete noncompact Riemannian manifolds. For the two standard normalizations \[ p\,\operatorname{Cap}_p(\Omega)^{1/p} \quad\text{and}\quad (p-1)\operatorname{Cap}_p(\Omega)^{1/(p-1)}, \] we prove that their upper and lower limits are independent of the bounded smooth conductor $\Omega$. We denote the conductor-independent upper limit of the first normalization by $\mathcal C(M)$. When the second normalization converges to a positive limit, its logarithmic second-order coefficient is also conductor-independent. These invariants satisfy \[ \mathcal V(M)\geq \mathcal C(M)\geq \Lambda(M)=\mathcal M(M)\geq0. \] Under centered-ball isoperimetry or rotational symmetry, together with an eventual monotonicity assumption on the sphere-area-to-ball-volume ratio, all four invariants coincide with the volume entropy. This yields hyperbolic rigidity from either maximal $p$-spectral data or maximal $\mathcal C(M)$, as well as an almost-rigidity theorem under Ricci curvature and diameter bounds. For the universal cover of a closed negatively curved manifold, both capacitary normalizations converge to the volume entropy, which equals the topological entropy of the geodesic flow, without any centered-ball isoperimetric or rotational-symmetry assumption. For nonflat Hadamard manifolds with compact quotient satisfying either of the above geometric conditions, we obtain a second-order large-$p$ expansion whose logarithmic coefficient detects the geometric rank. Finally, sharp examples show that the general inequalities may be strict and that the first-order capacitary limit need not exist.
Read the full abstract

General Mathematics

Prime–Zero Duality: Fractal Geometry, Renormalization-Group Flow, and an Information-Ontological Framework for Number Theory

The prime numbers and the non-trivial zeros of the Riemann zeta function are globally linked by the explicit formula of analytic number theory. Whether they share a hidden, scale-by-scale geometric symmetry has remained unexplored. We address this by measuring the joint fractal structure of a prime residue class (p=1,5,9,13 mod 16) and the zero distribution of zeta(s). Our central finding is that the duality measure K = 1/d_P + 1/zeta_R is remarkably stable, varying by only 17% across scales L=100–2000, captured by a finite-size scaling law K(L) = K_IR + a*L^{-b}. After geometric normalization, the data converge to a universal infrared fixed point K_IR = 4 with critical exponent b ~ 0.51, robust across two random-matrix symmetry classes (beta=2,4), echoing Montgomery–Odlyzko universality. We interpret K as a conserved information current between the arithmetic and spectral domains, with the scaling law reflecting a renormalization-group flow from an ultraviolet fixed point K_UV = 11 (Hurwitz's theorem on normed division algebras) to K_IR = 4. The exponent b ~ 1/2 is derived from a variational information action S[I_P, I_Z]. A structural argument for the Riemann Hypothesis emerges: the generator kappa with kappa^2 = ijk = -1 enforces, via exchange symmetry I_P <-> I_Z, the fixed point I_P* = I_Z* = 2, encoding the critical line Re(s) = 1/2. Upgrading this to a rigorous proof is the central open problem. We also explore, in a speculative spirit, whether (K_IR, b, kappa) resonate with quantities in quantum gravity and learning theory, including the Bekenstein–Hawking entropy formula. These analogies define open problems at the interface of number theory, physics, and information science.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

CLion: Efficient Cautious Lion Optimizer with Enhanced Generalization

Lion optimizer is a popular learning-based optimization algorithm in machine learning, which shows impressive performance in training many deep learning models. Although convergence property of the Lion optimizer has been studied, its generalization analysis is still missing. To fill this gap, we study generalization property of the Lion via algorithmic stability based on the mathematical induction. Specifically, we prove that the Lion has a generalization error of $O(\frac{1}{N\tau^T})$, where $N$ is training sample size, and $\tau>0$ denotes the smallest absolute value of non-zero element in gradient estimator, and $T$ is the total iteration number. In addition, we obtain an interesting byproduct that the SignSGD algorithm has the same generalization error as the Lion. To enhance generalization of the Lion, we design a novel efficient Cautious Lion (i.e., CLion) optimizer by cautiously using sign function. Moreover, we prove that our CLion has a lower generalization error of $O(\frac{1}{N})$ than $O(\frac{1}{N\tau^T})$ of the Lion, since the parameter $\tau$ generally is very small. Meanwhile, we study convergence property of our CLion optimizer, and prove that our CLion has a fast convergence rate of $O(\frac{\sqrt{d}}{T^{1/4}})$ under $\ell_1$-norm of gradient for nonconvex stochastic optimization, where $d$ denotes the model dimension. Extensive numerical experiments demonstrate effectiveness of our CLion optimizer.
Read the full abstract

Algebraic Geometry

Bernstein–Sato Theory for D-modules in Positive Characteristic

In this article, we develop a positive characteristic analogue of the Bernstein–Sato theory for holonomic D-modules in the complex setting. We work with D-modules on a Noetherian regular $F$-finite $\mathbb{F}_p$-scheme $X$, and define their Bernstein–Sato roots as $p$-adic integers. When the D-module is the structure sheaf $O_X$, this recovers Bitoun's definition. When the D-module arises from a locally finitely generated unit $F^e$-module and $X$ is of finite type over an $F$-finite field, we show that the roots are finite and rational, generalizing Bitoun's result. In the course of the proof, we also develop a related theory for Cartier modules.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

HASOD: A Hybrid Adaptive Screening-Optimization Design for High-Dimensional Industrial Experiments

Industrial experimentation requires both factor screening to identify critical variables and response optimization to find optimal operating conditions. Traditional approaches treat these as separate phases, necessitating costly sequential experimentation and full experimental redesign between phases. This paper introduces HASOD (Hybrid Adaptive Screening-Optimization Design), a novel three-phase sequential framework that simultaneously addresses factor identification and response surface optimization within a unified adaptive structure. Phase 1 employs a modified Definitive Screening Design with an enhanced Cumulative Weighted Effect Screening Statistic (CWESS) incorporating interaction detection via ElasticNet regression. Phase 2 adaptively selects augmentation strategies – from full factorial to Response Surface Methodology designs – based on critical factors identified in Phase 1. Phase 3 applies Gaussian process-based global optimization with uncertainty-guided refinement near the predicted optimum. We prove that CWESS asymptotically separates active from inactive factors, providing classification consistency guarantees absent from most screening methodologies. Across six test scenarios, HASOD achieves 97.08% factor detection accuracy – 13.75 percentage points above traditional sequential methods (83.33%) – and significantly outperforms all eight competitor methods (p < 0.001). HASOD yields improved prediction performance (mean error: 3.61) while maintaining >=90% detection across all scenarios including interaction-heavy systems. The framework requires an average of 41.5 experimental runs – a 43% increase over traditional approaches – yet delivers superior detection accuracy with dramatically reduced prediction error. HASOD offers a theoretically grounded, unified framework that eliminates sequential redesign without sacrificing predictive capability.
Read the full abstract

Analysis of PDEs

Propagation dynamics for nonlocal dispersal predator-prey systems in shifting habitats: A Hamilton-Jacobi approach

This paper is concerned with the spreading speeds of nonlocal dispersal predator-prey systems in shifting habitats under general initial conditions. By employing geometric optics techniques and theory of viscosity solutions, we reformulate the problem into the study of Hamilton-Jacobi equations. Through a detailed analysis of the structure of viscosity solutions, we provide a complete classification of explicit formulas for the spreading speed of the prey population, especially in cases where it invades the habitat more rapidly than predators, yielding two fundamentally distinct “nonlocal determinacy” results derived by different mechanisms. We also obtain an upper bound for spreading speed of the predators, incorporating the decay rate of the initial data and the speed of shifting habitats. These findings demonstrate that there are complex connections among spreading speeds, habitat shifting speed and initial conditions, and emphasize the significance of nonlocal dispersal in determining the propagation dynamics of predator-prey systems.
Read the full abstract

All authors Wen Tao, Wan-Tong Li, Shigui Ruan, Wen-Bing Xu

Information Theory · Cross-listed from eess.SP

Beam Squinting Effects in Super Wideband Communication Systems

Beam squint, the frequency-dependent shift of the main beam, poses a major challenge for wideband antenna arrays. This paper focuses on the beam squint effects in super wideband (SW) systems, where high mutual coupling (MC) effects are present. These high MC effects complicate beamforming (BF) by creating frequency-dependent phase relationships that invalidate conventional approaches. To accurately model MC effects, this paper uses a circuit-theoretic framework for tightly coupled SW uniform linear arrays (ULAs). We derive closed-form expressions for the average received signal-to-noise ratio (SNR) with BF in conventional half-wavelength spaced, weakly coupled arrays and validate them. Extending our analysis to tightly coupled SW arrays, we demonstrate that, in contrast to conventional weakly coupled arrays, the effective true time delays exhibit a nonlinear dependence on frequency due to coupling-induced phase shifts. A comparative analysis reveals that strong MC in SW arrays significantly reduces squint in phase-controlled BF, extending the usable bandwidth considerably.
Read the full abstract

All authors Sachitha C. Bandara, Peter J. Smith, Erfan Khordad, Pawel Dmochowski, Robin Evans, Rajitha Senanayake

Analysis of PDEs

Local boundedness for solutions to parabolic double phase problems

In this paper, we investigate the local boundedness of weak solutions to parabolic double phase equations of type $$u_t-\mathrm{div}(|Du|^{p-2}Du+a(x,t)|Du|^{q-2}Du)=0\quad\text{in }\Omega_T:=\Omega\times(0,T),$$ where $0\leq a(\cdot)\in L^\infty(\Omega_T)$ and $\frac{2n}{n+2}<p<q<p\left(\frac{n+2}{n}\right)$, so that both the degenerate range $p\geq 2$ and the singular range $p<2$ are covered. To this end, we derive the Caccioppoli inequality and recall a parabolic embedding theorem, which are then utilized in an iteration method.
Read the full abstract

Probability

The Euler-Maruyama method for invariant measures of McKean-Vlasov stochastic differential equations

This paper investigates the approximation of invariant measures for McKean-Vlasov stochastic differential equations (SDEs) using the Euler-Maruyama (EM) scheme under a monotonicity condition. Firstly, the convergence of the numerical solution from the EM scheme to its continuous-time counterpart is established. Secondly, we show that the numerical solution admits a unique invariant measure and derive its convergence rate under the Wasserstein metric. In parallel, it is demonstrated that the associated particle system also possesses these properties.
Read the full abstract

Mathematical Physics

The $n$-Point Function of $t$-Core Partitions and Topological Vertex

In this paper, we study the $n$-point function of $t$-core partitions. The main tool is the topological vertex, originally developed to study the topological string theory for toric Calabi–Yau 3-folds. By virtue of the topological vertex, we introduce the $q$-deformed $n$-point function that generalizes both the ordinary $n$-point function of all integer partitions studied by Bloch–Okounkov and $t$-core partition case treated here. As a consequence, we provide a closed formula for the $n$-point function of $t$-core partitions in terms of theta functions, and prove that the corresponding correlation functions are quasimodular forms.
Read the full abstract

Numerical Analysis

Spurious-mode-free finite element method for scattering resonances in transmission problems

Scattering resonances arise in wave phenomena and play an important role in many applications. While extensive theoretical studies have been conducted, effective numerical computation remains limited, and most existing methods suffer from spurious modes. In this paper, we propose a spurious-mode-free method for computing scattering resonances in transmission problems. The unbounded domain is truncated using a Dirichlet-to-Neumann (DtN) map. The resonances are formulated as eigenvalues of a holomorphic Fredholm operator function, which is discretized by the finite element method. The spectrum indicator method is then used to compute the eigenvalues of the nonlinear matrix eigenvalue problems. We establish optimal order convergence and present extensive examples that demonstrate the effectiveness of the proposed method. The results are consistent with existing theoretical findings in the literature and offer new insights that may inform further theoretical developments.
Read the full abstract

Differential Geometry

Complete manifolds with nonnegative Ricci curvature and slow relative volume growth

For any complete and noncompact manifold $M$ with $\mathrm{Ric}\ge 0$, we define a function $\mathrm{RV}(s)$ that describes the growth of relative volume asymptotically $$\mathrm{RV}(s)=\limsup_{r\to\infty} \dfrac{\mathrm{vol} B_{rs}(p)}{\mathrm{vol} B_r(p)},\quad s\ge 1.$$ Then we study the fundamental groups of such manifolds with slow relative volume growth and sublinear diameter growth. We show that if $\mathrm{RV}(s)\ll s^2$ as $s\to\infty$, then $\pi_1(M)$ is almost abelian; if $\mathrm{RV}(s)\ll s^{1+\delta}$ for some $\delta\in (0,1)$ and the Ricci curvature is positive at a point, then $\pi_1(M)$ is finite. These results generalize our previous work on complete manifolds with $\mathrm{Ric}\ge 0$ and linear (minimal) volume growth.
Read the full abstract

Algebraic Geometry

Oriented Cohomology Rings of Some Moduli Spaces via Blowups

Oriented cohomology theories provide a general framework to perform intersection-theory-type calculus. The Chow ring, algebraic $K$-theory, and Levine–Morel's algebraic cobordism are all instances of such theories satisfying $\mathbb A^1$-invariance. Topological Hochschild homology, topological cyclic homology, and Hodge cohomology are important examples of theories without $\mathbb A^1$-invariance. In this paper, we prove an additive blowup formula for oriented cohomology theories in the non-$\mathbb A^1$-invariant category of motivic spectra, developed by Annala, Hoyois, and Iwasa. Then, we specialize to $\mathbb A^1$-invariant theories and give presentations of oriented cohomology rings of the blowup of a smooth scheme along a smooth center. We compute explicit examples of such presentations for the cases of del Pezzo surfaces, the blowup of $\mathbb P^3$ along the twisted cubic, and the blowup of $\mathbb P^5$ along the Veronese surface, which can be identified with the moduli space of complete conics. We demonstrate that one can recover solutions to classical enumerative geometry problems, such as Steiner's $3264$ conics, using arbitrary oriented cohomology theories. Finally, we give a presentation of oriented cohomology rings of $\overline M_{0,n}$, which generalizes Keel's presentation of the Chow ring.
Read the full abstract

Optimization and Control

PANOC-lite: A simpler and more efficient algorithm for composite minimization

This work introduces a simple and efficient linesearch method for composite minimization that accelerates proximal-gradient iterations with fast Newton-type directions. Our algorithm is based on simple operations and only requires the standard proximal-gradient oracle, similar to PANOC and ZeroFPR, provided that the nonsmooth term is convex. Noteworthy improvements include a cheaper backtracking procedure, in the sense that no additional gradients need to be evaluated, and an enlarged range of permitted stepsizes. Global subsequential convergence and local superlinear convergence are established under conventional assumptions by considering a novel merit function which is less expensive to evaluate than alternatives like the forward-backward envelope. Finally, the proposed approach is validated on model predictive control problems with collision avoidance constraints, as well as on the LIBSVM and CUTEst benchmarks.
Read the full abstract

All authors Alexander Bodard, Pieter Pas, Andreas Themelis, Panagiotis Patrinos

Complex Variables

Some global operators and the material derivative

The theory of the operator $$G(x) = |\underline{x}|^2 \frac{\partial }{\partial x_0} + \underline{x} \sum_{j=1}^n x_j \frac{\partial }{\partial x_j} $$ is deeply associated with the slice monogenic function theory and has grown in recent years. In particular, for $n=3$ the quaternionic version of $G$ has been recently used to study the quaternionic slice regular function theory. This work extends the study of the $G$ operator in two senses: a) Clifford's analysis structure. The function theory induced by the operator \begin{align*}\mathcal H_a (x) = {\underline a} ( {x}) \frac{\partial }{\partial x_0} - \sum_{i=1}^n \left( \sum_{j=1}^n a_j ( {x}) \frac{\partial (a^{-1})_i}{\partial y_j}\circ a ( {x}) \right) \frac{\partial}{\partial x_i}, \end{align*} where $a$ is a function with certain properties with domain in $\mathbb R^{n+1}$ is presented extending the already known results of the $G$. Also some properties of the material derivative are presented as consequences of function theory induced by $\mathcal H_a$. b) Structure of quaternionic analysis. In particular, the case $n=3$ is approached from the point of view of quaternionic analysis.
Read the full abstract

Wednesday 15 April

Numerical Analysis · Cross-listed from cs.CE

Applying Two-Grid Preconditioner for Subsurface Flow Simulation using Attention-enhanced Hybrid Network to Accelerate Multiscale Discretization in High-contrast Media

In this paper, we study the efficient numerical solution of Darcy equations in strongly heterogeneous media with high-contrast permeability and propose a hybrid framework that combines learning with multiscale numerical methods. The learning component is used for the prediction of multiscale basis functions in the mixed generalized multiscale finite element method (mixed GMsFEM), with the goal of reducing the repeated local computations required in the offline stage. Once these basis functions are predicted, the global system is assembled and the pressure field is computed by a two-grid preconditioned solver. The resulting method accelerates the costly local basis-construction stage while retaining the multiscale discretization and preconditioned iterative structure of the underlying solver. Numerical experiments on two-dimensional heterogeneous Darcy problems show that the proposed framework yields more accurate final pressure reconstruction than several representative learning-based methods and remains stable under strong heterogeneity and high-contrast coefficients. In comparison with the traditional mixed GMsFEM, its main advantage lies in the efficiency of the basis-generation stage, while the quality of the global solve is still ensured by the two-grid preconditioner. These results indicate that accelerating multiscale basis construction through learning, while preserving a mature numerical solver for the global problem, provides a viable approach for high-resolution Darcy-type simulations.
Read the full abstract

Probability · Cross-listed from physics.soc-ph

Stochastic compliance/evasion dynamics in tax models: a piecewise deterministic Markov process approach

This paper introduces a novel stochastic framework for modelling tax evasion dynamics by extending the deterministic model of Bertotti and Modanese (2018) through the use of Piecewise Deterministic Markov Processes (PDMPs). A key limitation of the original model is the static treatment of taxpayer compliance and evasion behaviour. We address this limitation by incorporating two stochastic mechanisms:(i) audits, where random enforcement events shift non-compliant individuals toward compliance, and (ii) imitation, where social influence drives compliant individuals toward evasion. We develop each mechanism as a separate PDMP, proving that both preserve the fundamental conservation laws of population and global income. Numerical simulations show that these mechanisms produce opposing long-term outcomes: pure audits lead to full compliance, while pure imitation leads to full evasion. The central contribution is a combined PDMP model in which both dynamics interact. This model no longer converges to an extreme equilibrium state. Instead, it can exhibit persistent fluctuations around the deterministic trajectory and suggests convergence to a stationary distribution, providing a more realistic representation of compliance-evasion dynamics observed in real economies. The proposed framework offers a versatile approach for integrating behavioural stochasticity into socio-economic models.
Read the full abstract