Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 16 March

Rings and Algebras

Post-Lie conformal algebra structures on Lie conformal algebras

In this paper, we introduce and study post-Lie conformal algebras (PLCAs), a generalization of post-Lie algebras to conformal algebras. We establish an equivalence between PLCA structures and Rota-Baxter operators of weight 1 on Lie conformal algebras. We also show that every PLCA induces a new Lie conformal algebra and study PLCA structures on pairs of Lie conformal algebras. Finally, we classify all PLCA structures on two important classes of Lie conformal algebras: B(q) and W(b), achieved through Rota-Baxter operators of weight 1.
Read the full abstract

Numerical Analysis

Edge element DtN method for electromagnetic scattering poles of perfectly conducting obstacles

Meromorphic continuation of the scattering operator leads to scattering poles (resonances) in the complex plane. Despite their significance, numerical investigation of scattering poles remains limited. In this paper, we propose and analyze a numerical method to compute electromagnetic poles of perfectly conducting obstacles. The unbounded domain for the scattering problem is truncated using the DtN mapping and the poles are shown to be the eigenvalues of a holomorphic Fredholm operator function related to Maxwell's equations. Edge elements are used for discretization. The convergence is proved using the abstract approximation theory for eigenvalue problems of holomorphic Fredholm operator functions. The proposed finite element DtN approach is free of non-physical poles. A spectral indicator method is then employed to compute the resulting nonlinear matrix eigenvalue problem. Numerical examples are presented to demonstrate the effectiveness of the method.
Read the full abstract

All authors Bo Gong, Takumi Sato, Jiguang Sun, Xinming Wu

Analysis of PDEs

Multi-Dimensional Structural Stability of Mixed Riemann Configurations Containing Centered Rarefaction Waves and Surfaces of Discontinuities of Gas Dynamics

For 2D compressible Euler equations of isentropic gas, we prove the structural stability of mixed Riemann configurations containing centered rarefaction waves and surfaces of discontinuities (such as shock waves or vortex sheets), by deriving simultaneous energy estimates for acoustic and vorticity waves within the rarefaction wave region without loss of derivatives and examinations of the nonlinear superpositions of rarefaction waves with other waves such as shock waves or vortex sheets. The nonlinear superpositions of shock wave-rarefaction wave and rarefaction wave-vortex sheet-rarefaction wave are achieved by reducing the problems in corner regions to the Cauchy problems with the data prescribed on the plane $\Sigma_0=\{(t, x_1, x_2): t=0, (x_1, x_2)\in \mathbb{R}\times\mathbb{R}/2\pi\mathbb{Z}\}$ with discontinuities at $\mathbf{S}_*:=\{(t,x_{1},x_{2})\mid t=0,\ x_{1}=0, x_2\in\mathbb{R}/2\pi\mathbb{Z} \}$.
Read the full abstract

Complex Variables

Complete interpolating sequences for Fock type spaces

We obtain a characterization of complete interpolating sequences in a class of Fock-type spaces with radial weights for which such sequences exist. Our criterion is formulated in terms of logarithmic separation and controlled perturbations of a reference sequence satisfying an Avdonin-type condition. This provides a geometric description of complete interpolating sequences and extends previous results of Borichev–Lyubarskii and Baranov–Belov–Borichev on Riesz bases of reproducing kernels in Fock-type spaces. It also yields explicit density criteria for sampling and interpolating sequences.
Read the full abstract

Sunday 15 March

Differential Geometry

A generalisation of g-rectifying and g-normal curves in Lorentzian n-space

In this paper, we introduce and analyze $g-$rectifying curves (spacelike and null curves) and $\ g-$normal curves in Lorentzian $n$-space, building upon the established notion of rectifying curves and normal curve, respectively. Our generalization extends this definition by considering an $% g-$position vector field, $\xi _{g}(s)=\int g(s)d\xi $, where $g$ is an integrable function in the arc-length parameter $s$. An $g$-rectifying curves(or $g-$normal curves) are then defined as an arc-length parametrized curve $\xi $ in Lorentzian $n-$space such that its $g$-position vector consistently lies within its rectifying space(or normal space). The primary objective of this work is to provide a comprehensive characterization and classification of these $g$-rectifying curves and $g-$normal curves, thereby expanding the geometric understanding of curves in Lorentzian $n$-spaces.
Read the full abstract

Analysis of PDEs

Global stability of Minkowski spacetime for a causal nonlocal gravity model

We establish small-data global existence and decay for the causal-informational nonlocal gravity model CETOmega in 3+1 dimensions. Under harmonic gauge the field equations reduce to a quasilinear hyperbolic system with causal memory generated by a retarded Stieltjes operator K^{-1}. We establish three results: (i) commutator estimates for the Klainerman vector fields acting on K^{-1}, showing that the nonlocal operator costs at most two additional derivatives relative to Einstein vacuum; (ii) a sharp Sobolev-level bound on the memory convolution under explicit integrability conditions on the spectral density rho; (iii) global existence, uniform energy bounds, and pointwise (1+t)^{-1} decay for small initial data in H^N with N>=10. The proof combines the Lindblad-Rodnianski ghost weight method with commutator estimates and resolvent identities adapted to the Stieltjes kernel. A key structural observation is that retarded causality of the kernel is mathematically necessary for the stability argument: acausal modifications destroy the hyperbolic energy identity on which the bootstrap relies. We verify that the spectral conditions are satisfied by explicit, physically motivated kernel families. Because the memory operator generates a persistent tail that does not vanish at late times, classical scattering to free waves does not hold; we establish instead modified scattering, proving convergence to a solution of a linear wave equation with an explicit, computable memory profile in the energy topology. We discuss quantitative observational signatures including gravitational wave memory excess, frequency-dependent phase shift, and anomalous late-time ringdown tail controlled by the same spectral constants governing the stability conditions.
Read the full abstract

Information Theory

DeepOFW: Deep Learning-Driven OFDM-Flexible Waveform Modulation for Peak-to-Average Power Ratio Reduction

Peak-to-average power ratio (PAPR) remains a major limitation of multicarrier modulation schemes such as orthogonal frequency-division multiplexing (OFDM), reducing power amplifier efficiency and limiting practical transmit power. In this work, we propose DeepOFW, a deep learning-driven OFDM-flexible waveform modulation framework that enables data-driven waveform design while preserving the low-complexity hardware structure of conventional transceivers. The proposed architecture is fully differentiable, allowing end-to-end optimization of waveform generation and receiver processing under practical physical constraints. Unlike neural transceiver approaches that require deep learning inference at both ends of the link, DeepOFW confines the learning stage to an offline or centralized unit, enabling deployment on standard transmitter and receiver hardware without additional computational overhead. The framework jointly optimizes waveform representations and detection parameters while explicitly incorporating PAPR constraints during training. Extensive simulations over 3GPP multipath channels demonstrate that the learned waveforms significantly reduce PAPR compared with classical OFDM while simultaneously improving bit error rate (BER) performance relative to state-of-the-art transmission schemes. These results highlight the potential of data-driven waveform design to enhance multicarrier communication systems while maintaining hardware-efficient implementations. An open-source implementation of the proposed framework is released to facilitate reproducible research and practical adoption.
Read the full abstract

Algebraic Geometry

On the distribution of mixed Hodge loci

Let $\mathbb{V}$ be an admissible and graded-polarized integral variation of mixed Hodge structures over a smooth and irreducible complex algebraic variety $S$. We show that if the typical Hodge locus $\mathrm{HL}(S,\mathbb{V}^\otimes)_\mathrm{typ}$ of $\mathbb{V}$ is non-empty, the full Hodge locus $\mathrm{HL}(S,\mathbb{V}^\otimes)$ is dense in $S$ for the Zariski topology. In an other direction, we show that if the associated graded variation $\mathrm{Gr}(\mathbb{V})$ for the weight filtration has large monodromy and level at least 3 in the sense of Baldi- Klingler-Ullmo, the typical Hodge locus of $\mathbb{V}$ is empty, and the full Hodge locus of $\mathbb{V}$ is a strict Zariski-closed subset of $S$, at least if one restricts to its factorwise positive dimensional part, improving a classical result of Brosnan-Pearlstein-Schnell in this situation. These results follow from a detailed study of the transverse part $\mathrm{HL}(S,\mathbb{V}^\otimes)_\mathrm{trans}$ of the Hodge locus of $S$ for $\mathbb{V}$, a subset which contains $\mathrm{HL}(S,\mathbb{V}^\otimes)_\mathrm{typ}$ and whose Zariski-density in $S$ is equivalent, under the Zilber-Pink conjecture for $\mathbb{V}$, to the Zariski-density of $\mathrm{HL}(S,\mathbb{V}^\otimes)_\mathrm{typ}$. We show that non-emptiness of $\mathrm{HL}(S,\mathbb{V}^\otimes)_\mathrm{trans}$ is equivalent to its Zariski-density in $S$, we completely classify variations whose transverse Hodge locus $\mathrm{HL}(S,\mathbb{V}^\otimes)_\mathrm{trans}$ is Zariski-dense, and we prove an independent criterion ensuring that $\mathrm{HL}(S,\mathbb{V}^\otimes)_\mathrm{trans}$ is empty.
Read the full abstract

Analysis of PDEs

Quantitative Closure Analysis toward Ideal Fluids

We establish the incompressible low–Mach/high–Reynolds limit for the Boltzmann equation for a broad class of initial data, without recourse to any asymptotic expansion. Exploiting the local Maxwellian manifold and the macro–micro decomposition in a new quasi-linear analysis, we derive quantitative estimates for the purely microscopic fluctuation, as well as bounds for the kinetic vorticity and the entropic fluctuation in terms of the initial data. As a consequence, in two space dimensions, the rescaled velocity and temperature converge to a global solution of the incompressible Euler equations coupled to a transported temperature, within the frameworks of DiPerna–Lions–Majda and Delort.
Read the full abstract

2603.14671 · 15 Mar · 144 pages; minor changes in presentation. This arXiv preprint is the detailed companion to the compact journal-submission version of the same title and is posted on arXiv.org for readers' convenience. This version is not intended for separate journal publication

Combinatorics

A Characterization of $P_6$-Free Irredundance Perfect Graphs

Let $ir(G)$ and $\gamma(G)$ be the irredundance number and the domination number of a graph $G$, respectively. A graph $G$ is called irredundance perfect if $ir(H)=\gamma(H)$ for every induced subgraph $H$ of $G$. The subclass of $P_6$-free irredundance perfect graphs has been studied extensively. In this paper, we present a characterization of this graph class in terms of eleven forbidden induced subgraphs.
Read the full abstract

Metric Geometry

Formalizing the Classical Isoperimetric Inequality in the Two-Dimensional Case

We present a formal verification of the classical isoperimetric inequality in the plane using the Lean 4 proof assistant and its mathematical library Mathlib. We follow Adolf Hurwitz's analytic approach to establish the inequality $L^2 \ge 4\pi A$, which states that among all simple closed curves of a given perimeter $L$, the circle uniquely maximizes the enclosed area $A$. The formalization proceeds in two phases. In the first phase, we establish the Fourier-analytic foundations required by Hurwitz's approach: we formalize orthogonality relations for trigonometric functions over $[-\pi,\pi]$, Parseval's theorem for classical Fourier series, uniform convergence of Fourier partial sums via the Weierstrass M-test, term-by-term differentiability, and Wirtinger's inequality. In the second phase, we carry out Hurwitz's proof itself: working with simple closed $C^1$ curves given in arc-length parametrization, we reparametrize over $[0,2\pi]$, establish the shoelace area formula, apply integration by parts, invoke the AM–GM inequality, apply Wirtinger's inequality, and use the arc-length constraint to derive the bound $A \le L^2/(4\pi)$. We discuss the key formalization challenges encountered, including the interchange of infinite sums and integrals, term-by-term differentiation, and the coordination of different indexing conventions within Mathlib. The complete formalization is available at https://github.com/mirajcs/IsoperimetricInequality
Read the full abstract

Analysis of PDEs

Localized Enhanced Dissipation: A Hypocoercivity Approach

In this paper, we consider the passive scalar solutions in shear flows with critical points. With a detailed hypocoercivity functional, we develop streamline-wise enhanced dissipation estimates.

Number Theory

Hilbert cubes in sets with arithmetic properties

In this paper, we introduce new general frameworks for estimating the maximal dimension of Hilbert cubes contained in finite truncations of arbitrary sets. As applications, we investigate Hilbert cubes in a range of arithmetic sets, including perfect powers, powerful numbers, primes, smooth numbers, and squarefree numbers. Along the way, we substantially sharpen several earlier results of Dietmann-Elshotlz, Erdős-Sárközy-Stewart, Hajdu, and Sárközy, and we obtain bounds that are sharp up to the implied constant in several cases. Additionally, we prove conditional results of independent interest, including an almost sharp uniform upper bound on the number of $k$-th powers in an arithmetic progression for each $k\geq 4$, assuming the ABC conjecture.
Read the full abstract

Dynamical Systems

The Dimension of Integral Self-Affine Sets via Fractal Perturbations: The Box and the Hausdorff Dimensions, Ergodic Measures

Note by the author: Section 9.3 is added from the more general unpublished manuscript “A Perturbation Method Leading to Full-Dimension Ergodic Measures on Integral Self-Affine Sets”, (2021) by I. Kirat. Original abstract: An integral self-affine set $F=F(T,A)\subseteq \mathbb{R}^n$ is a self-affine set which is generated by an $n\times n$ integer expanding matrix $T$ (not necessarily a similitude) and a finite set $A\subset \mathbb{Z}^n$ of integer vectors so that $F=T^{-1}(F+A)$. The dimension problem of $F$ has not yet been settled fully. For that, we introduce a fractal perturbation method with respect to $T,A$ and get the dimension as the limit of the dimensions of a sequence of better-behaved perturbed fractals, for which a dimension formula already exists. An unexpected feature of this technique is that the overlap structures of $F$ and its perturbations are eventually the same (i.e. the neighbor graphs are isomorphic), which is unlike some known perturbations. Our method has been developed especially for the problematic case of irreducible characteristic polynomial of $T$. Also, we do not impose any separation condition on $F$ (like the open set condition) or any further restriction (such as size, etc.) on $T$ or $A$. As a by-product of the perturbation method, we prove the existence of the box dimension of $F$ too. Further, we consider $F$ as a $T$-invariant subset of the n-torus (i.e, we consider $F \ \rm{mod \ 1}$), and we rather use the perturbation method to show that there is an ergodic $T$-invariant Borel probability measure on $F \ \rm{mod \ 1}$ of full dimension. In contrast to some known results, this is not an almost-sure result.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Exact characterizations for quantum conditional mutual information and some other entropies

Lieb and Ruskai's strong subadditivity theorem, which shows that the conditional mutual information must be nonnegative, is fundamental in quantum theory. It has numerous applications, such as in quantum error correction. When the mutual information is zero, the Petz recovery map can be used to reconstruct the quantum channel. When the mutual information is small, one seeks to define an optimal recovery channel. To this end, a mathematical characterization of the mutual information is desirable. We address this problem by providing an exact characterization of the mutual information, along with characterizations for other entropies. Our controls are sharp, leaving no room for improvement, in the sense that we provide equalities, regardless of whether the mutual information (or remainder) is small or large. We transform the definitions of these entropies into a summation of explicitly constructed terms, and the definition of each term obviously demonstrates the desired positivity/convexity/concavity. The summation converges rapidly and absolutely in a chosen elementary norm.
Read the full abstract

Information Theory · Cross-listed from cs.DS

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs

We combine two methods for the lossless compression of unlabeled graphs - entropy compressing adjacency lists and computing canonical names for vertices - and solve an ensuing novel optimisation problem: Minimum-Entropy Tree-Extraction (MINETREX). MINETREX asks to determine a spanning forest $F$ to remove from a graph $G$ so that the remaining graph $G-F$ has minimal indegree entropy $H(d_1,\ldots,d_n) = \sum_{v\in V} d_v \log_2(m/d_v)$ among all choices for $F$. (Here $d_v$ is the indegree of vertex $v$ in $G-F$; $m$ is the number of edges.) We show that MINETREX is NP-hard to approximate with additive error better than $\delta n$ (for some constant $\delta>0$), and provide a simple greedy algorithm that achieves additive error at most $n / \ln 2$. By storing the extracted spanning forest and the remaining edges separately, we obtain a degree-entropy compressed ("ultrasuccinct") data structure for representing an arbitrary (static) unlabeled graph that supports navigational graph queries in logarithmic time. It serves as a drop-in replacement for adjacency-list representations using substantially less space for most graphs; we precisely quantify these savings in terms of the maximal subgraph density. Our inapproximability result uses an approximate variant of the hitting set problem on biregular instances whose hardness proof is contained implicitly in a reduction by Guruswami and Trevisan (APPROX/RANDOM 2005); we consider the unearthing of this reduction partner of independent interest with further likely uses in hardness of approximation.
Read the full abstract

All authors Ziad Ismaili Alaoui, Tamio-Vesa Nakajima, Namrata, Sebastian Wild

Analysis of PDEs

Nonlinear Wave Dynamics in Black Hole Spacetimes

This manuscript is a lightly reformatted version of my 2017 PhD thesis. I am posting it on arXiv at the request of my advisor, Sergiu Klainerman, who noted that it has been useful to some students. The content largely reflects the thesis in its original form. This thesis details a method for proving global boundedness and decay results for nonlinear wave equations on black hole spacetimes. The method is applied to five example problems of increasing difficulty. The first problem, which addresses the semilinear wave equation on Minkowski space, is quite simple and should be accessible to a reader who is still new to the field of partial differential equations. The final problem, which was posed by Ionescu and Klainerman in [IK14], constitutes a step toward proving stability for slowly rotating Kerr black holes. The remaining intermediate problems are: a semilinear wave equation on the Schwarzschild spacetime, a semilinear wave equation on any subextremal Kerr spacetime with the additional assumption of axisymmetry, and a restriction of the final problem to the Schwarzschild case. The method used in this thesis is based on a few particular developments that may be useful for other related problems. These include: a new method for constructing Morawetz-type estimates that is fairly robust (insofar as it may be successfully applied to all five problems), a strategy based on a decay hierarchy for energy estimates on uniformly spacelike hypersurfaces using, in particular, a notion of weak decay, and a technique for handling certain terms with factors that are singular on an axis of symmetry.
Read the full abstract

Information Theory · Cross-listed from cs.CV

Continual Few-shot Adaptation for Synthetic Fingerprint Detection

The quality and realism of synthetically generated fingerprint images have increased significantly over the past decade fueled by advancements in generative artificial intelligence (GenAI). This has exacerbated the vulnerability of fingerprint recognition systems to data injection attacks, where synthetic fingerprints are maliciously inserted during enrollment or authentication. Hence, there is an urgent need for methods to detect if a fingerprint image is real or synthetic. While it is straightforward to train deep neural network (DNN) models to classify images as real or synthetic, often such DNN models overfit the training data and fail to generalize well when applied to synthetic fingerprints generated using unseen GenAI models. In this work, we formulate synthetic fingerprint detection as a continual few-shot adaptation problem, where the objective is to rapidly evolve a base detector to identify new types of synthetic data. To enable continual few-shot adaptation, we employ a combination of binary cross-entropy and supervised contrastive (applied to the feature representation) losses and replay a few samples from previously known styles during fine-tuning to mitigate catastrophic forgetting. Experiments based on several DNN backbones (as feature extractors) and a variety of real and synthetic fingerprint datasets indicate that the proposed approach achieves a good trade-off between fast adaptation for detecting unseen synthetic styles and forgetting of known styles.
Read the full abstract

Analysis of PDEs

Monotonicity for the fractional semi-linear problem in a half space

In this paper, we study semilinear fractional equations $$(-\Delta)^s u(x) = f(u(x))$$ in a half-space and prove that all positive solutions are strictly increasing in the $x_n$-direction. Previous results typically require the solution $u$ to be globally bounded in $\mathbb{R}^n$. We substantially weaken this condition by assuming only that $u$ be bounded in each slab. Moreover, our analysis relies solely on the local Lipschitz continuity of the nonlinearity $f$, which is weaker than the conditions imposed in earlier works. As a crucial ingredient, we obtained a boundary Hölder} regularity estimate that requires only the boundedness of $u$ near the boundary. This represents a significant improvement over existing results, which often assumed global boundedness of $u$ throughout $\mathbb{R}^n$. The proof introduces a new idea that may be of independent interest. To derive the monotonicity, we employ the method of moving planes. We first obtain a narrow region principle in unbounded domains, which ensures that the moving plane procedure can be initiated from $x_n = 0$. We then establish two averaging effects for the solutions to fractional equations. These key ingredients guarantee that the planes can be moved continuously all the way to $x_n = \infty$. Previously, narrow region principle can only be applied to a single narrow region. It is for the first time that we establish a multiple narrow region principle that can be applied simultaneously to finitely many narrow regions. Compared with the traditional approaches, methods based on the averaging effect require substantially weaker regularity assumptions and can even accommodate unbounded solutions. We believe that these new ideas and techniques develop here will serve as powerful tools in studying qualitative properties of solutions to fractional equations.
Read the full abstract

Analysis of PDEs

Energy cascade for cross-shear length scales in free-shear three-dimensional incompressible viscous flows

The phenomenon of energy cascade is addressed in the case of free-shear flows, modeled with the equations for incompressible Newtonian fluids with mixed periodic and free-slip boundary conditions driven by an imposed mean shear profile. The rigorous results are proved for ensemble averages with respect to stationary statistical solutions in the sense of Foias and Prodi. The flow is decomposed into high and low horizontal wavenumber components, corresponding to scales perpendicular to the mean shear gradient, and the corresponding energy budget balances viscous dissipation, production by the mean shear, and transfer between scales. Exploiting the orthogonality of horizontal Fourier modes to control the shear-production term, we look for a cascade in which energy flows from the large scales, where it is fed by the mean shear, down to the small scales, where viscosity dissipates it. For any given wavenumber, we define an associated horizontal Taylor wavenumber of the high-wavenumber band above the given wavenumber. We prove two energy cascade results, for the energy flux and for a restricted energy flux that discounts possible energy loss to flow singularities, both valid for wavenumbers whose associated horizontal Taylor wavenumber lies above the viscous shear wavenumber and whose low-wavenumber energy dissipation rate is negligible compared to the total energy dissipation rate. On heuristic grounds, these rigorous conditions correspond precisely to an energy cascade in the range from the classical Corrsin scale down to the Kolmogorov dissipation scale, as expected in the conventional theory of turbulent shear flows.
Read the full abstract

Analysis of PDEs

Mixing and enhanced dissipation in a time-translating shear flow

Motivated in part by the work of Vanneste and Byatt-Smith, we study mixing and enhanced dissipation for the advection-diffusion equation with velocity field $\mathbf{u}(x,y,t)=(\sin(y-ct),0)$, a shear flow whose profile translates rigidly with speed $c$. This is a prototypical example of a flow whose critical points move in time. We quantify how the decay properties depend on the relation between translation speed $c$ and diffusivity $\nu$. We first analyse the inviscid transport problem and establish time-averaged $H^{-1}$ mixing estimates for $t\lesssim c^{-1}$, yielding decay rates faster than stationary estimates. Building on these estimates, we prove enhanced dissipation for moderate translation speeds $c=c_0\nu^\ell$ with $\ell\in(1/3,3/4)$. In this regime we obtain decay at rate $\nu^{(1+2\ell)/5}$, which interpolates continuously between the sharp rates $\nu^{1/2}$ for stationary shear flows with simple critical points and $\nu^{1/3}$ for monotone flows. This quantifies how increasing translation speed progressively weakens the influence of the critical points. Comparing the inviscid mixing and enhanced dissipation timescales heuristically explains the lower endpoint $\ell=1/3$. For $c\gg 1$, we show that solutions remain close to those of the heat equation on fixed time intervals, such that the rapid translation averages out advection and weakens mixing. The mixing estimate relies on a refined stationary phase analysis exploiting cancellations generated by the motion of the critical points. The enhanced dissipation result requires an adaptation of the hypocoercivity framework for stationary shear flows to the non-autonomous setting. The translating flow prevents the commutator hierarchy from closing in the standard way, which we overcome by constructing an extended energy functional. The large-$c$ analysis exploits the averaging effect of rapid translations in this regime.
Read the full abstract

Numerical Analysis

Model Order Reduction for Parametric Hermitian Eigenvalue Problems: Local High-Order Approximation with Taylor-Reduced Basis Method

This paper is concerned with the Taylor-reduced basis method (Taylor-RBM) for the efficient approximation of eigenspaces of large-scale parametric Hermitian matrices. The Taylor-RBM is a local model order reduction method, which constructs an approximation space by using the ranges of scaled derivatives of the spectral projector at a reference point in the parameter domain. For a prescribed order $n$, under local $\mathrm{C}^{n+1}$-regularity, we prove local convergence of orders $n+1$ and $2n+2$ for the eigenspace and the Ritz-value sum, respectively, and present a computationally efficient procedure for assembling the Taylor reduced basis space. Since this method is tightly connected to multivariate perturbation theory, we also analyze a projector approximation obtained from the finite Taylor polynomial of the eigenprojector and compare it with the Taylor-RBM.
Read the full abstract

Number Theory

Counting Polynomials via Galois Actions on Root Subsets

This paper studies the number of monic integer polynomials $f$ of height at most $H$ whose Galois group, endowed with the action on the roots, is isomorphic to a prescribed permutation group $(G,\Omega)$. New upper bounds are obtained for several families of groups: transitive subgroups of the wreath product $S_m\wr S_r$ in the primitive action; $k$-homogeneous subgroups of $S_m$ in the action on $k$-subsets of $\{1,\ldots,m\}$; $k$-transitive subgroups of $S_m$ in the action on $k$-tuples of distinct elements of $\{1,\ldots,m\}$. Almost all finite groups in their regular permutation representation are also treated.
Read the full abstract

Combinatorics

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs

Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number of classes of closure systems. In particular, several classes of convex geometries are known to have tractable optimization, while the problem was recently claimed to remain hard in general convex geometries. Continuing this line of research, we give a characterization of the optimum bases of a convex geometry in terms of what we call quasi-closed hypergraphs. We then use this characterization to show that when each quasi-closed hypergraph has disjoint edges, any implicational base of the convex geometry can be optimized in polynomial time with existing minimization and reduction algorithms. Finally, we prove that this property applies to double-shelling convex geometries, $D$-geometries, convex geometries with the $n$-Carousel property and $q$-acceptant convex geometries, thus unifying and extending the existing results regarding the tractability of optimization.
Read the full abstract

Numerical Analysis

A Numerical Solution to KPD

A stationary value based algorithm (SVA) is provided to solve the nearest Kronecker product decomposition (KPD) problem of vector form hypermatrices. Using the algorithm successively, the finite sum KPD is also solved. Then the permutation matrix is introduced. Using it, the KPD of matrix form hypermatrices is converted to its equivalent KPD of vector forms, and then the SVA is also applicable to solve the same problems for vector form hypermatrix. Some numerical examples are presented to demonstrate the new algorithm and to compare it with existing methods.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Delightful Policy Gradient

Standard policy gradients weight each sampled action by advantage alone, regardless of how likely that action was under the current policy. This creates two pathologies: within a single decision context (e.g. one image or prompt), a rare negative-advantage action can disproportionately distort the update direction; across many such contexts in a batch, the expected gradient over-allocates budget to contexts the policy already handles well. We introduce the Delightful Policy Gradient (DG), which gates each term with a sigmoid of delight, the product of advantage and action surprisal (negative log-probability). For $K$-armed bandits, DG provably improves directional accuracy in a single context and, across multiple contexts, shifts the expected gradient strictly closer to the supervised cross-entropy oracle. This second effect is not variance reduction: it persists even with infinite samples. Empirically, DG outperforms REINFORCE, PPO, and advantage-weighted baselines across MNIST, transformer sequence modeling, and continuous control, with larger gains on harder tasks.
Read the full abstract

Statistics Theory

$K-$means with learned metrics

We study the Fréchet $k-$means of a metric measure space when both the measure and the distance are unknown and have to be estimated. We prove a general result that states that the $k-$means are continuous with respect to the measured Gromov-Hausdorff topology. In this situation, we also prove a stability result for the Voronoi clusters they determine. We do not assume uniqueness of the set of $k-$means, but when it is unique, the results are stronger. This framework provides a unified approach to proving consistency for a wide range of metric learning procedures. As concrete applications, we obtain new consistency results for several important estimators that were previously unestablished, even when $k=1$. These include $k-$means based on: (i) Isomap and Fermat geodesic distances on manifolds, (ii) difussion distances, (iii) Wasserstein distances computed with respect to learned ground metrics. Finally, we consider applications beyond the statistical inference paradigm like (iv) first passage percolation and (v) discrete approximations of length spaces.
Read the full abstract

All authors Pablo Groisman, Matthieu Jonckheere, Jordan Serres, Mariela Sued

Mathematical Physics · Cross-listed from cond-mat.mtrl-sci

Cut-and-Project Density Functional Theory for Quasicrystals

Cut-and-project from a symmetric structure in a higher-dimensional space is a standard method for describing the structure of a large class of quasicrystals. By means of a novel localization procedure, we now show how local physical interactions within these quasicrystals are also accurately described by cut-and-project, from corresponding physical interactions in the higher-dimensional space. A density functional theory (DFT++) formulation allows the cut-and-project method to handle the Schroedinger equation for interactions in quasicrystals. The theory is both rigorous and computationally tractable. The resulting ab initio approach specifies quasicrystalline quantum states, in contrast to previous approaches which only worked with crystalline approximants of the quasi-periodic structures.
Read the full abstract

All authors Gavin N. Nop, Jonathan D. H. Smith, Thomas Koschny, Durga Paudyal

Geometric Topology

Unity of Jones polynomials in the unit circle and the plane

In this note, we study solutions of the equation $J_K(t)=1$ for the Jones polynomial of knots and links. For the family $K_n$ of double-twist knots, we show that every root of unity (except $-1$) satisfies $J_{K_n}(\zeta)=1$ for some $n$. Consequently, the set of solutions to $J_{K_n}(t)=1$ arising from this family is dense in the unit circle. We further show that there exists a family of links for which the zeros of $J_L(t)-1$ are dense in the complex plane, adapting the density mechanism of Jin–Zhang–Dong–Tay for Jones polynomial zeros.
Read the full abstract