Peer Revenue Publish or profit

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Monday 30 March

Quantum Algebra

Shifted affine iquantum groups of quasi-split ADE types

We formulate shifted affine iquantum groups of arbitrary quasi-split ADE types via Drinfeld presentations. We construct GKLO-type representations of shifted affine iquantum groups via algebras of difference operators, which allow us to construct truncated shifted affine iquantum groups. This provides a q-deformation of truncated shifted iYangians in our prior work arising as a quantization of affine Grassmannian islices.
Read the full abstract

Analysis of PDEs

The Return Map in the Class $\mathcal{O}_C$: Geometry, Dynamics, and Thickness Regularity

We study a discrete dynamical system $F = \pi \circ \Phi$ on the boundary of a convex core $\partial C \subset \mathbb{R}^N$, generated by linking $C$ to an outer boundary $\partial\Omega$ via normal rays and a thickness function $d$. We derive the local expansion $F(c) - c = d(c)\bigl(I - d(c)S_c\bigr)^{-1}\nabla_{\partial C}d(c) + O\bigl(\vert{}\nabla_{\partial C}d(c)\vert{}^2\bigr)$, showing how curvature precalculates thickness gradients. Fixed points correspond to critical points of $d$, with linearization $DF(c_*) = I + d_*\bigl(I - d_*S_*\bigr)^{-1}H_*$ yielding a stability classification driven by curvature and thickness variation. Results are validated on the unit circle, alongside regularity transfer and global bilipschitz bounds.
Read the full abstract

Numerical Analysis

Structure-Preserving Dynamic Mode Decomposition for Highly Oscillatory Dynamics of Semiclassical Schrödinger Equations

We propose two novel data-driven dynamic mode decomposition (DMD)-type methods, the Crank–Nicolson DMD and the semi-implicit DMD, to predict the highly oscillatory dynamics of the semiclassical Schrödinger equations efficiently and accurately. Unlike many existing DMD-type methods which directly models the dynamics of the wave function, our approach is based on learning the Schrödinger operator while explicitly incorporating mass and energy conservation laws. This approach ensures physical fidelity and endows the resulting methods with built-in model order reduction capabilities, without the necessity for additional dimensionality-reduction preprocessing. An analysis of training and prediction errors are given for theoretical guarantees. Extensive numerical experiments demonstrate the noise robustness, computational efficiency, and transferability to other equations of the proposed methods.
Read the full abstract

Optimization and Control

Optimal control for a class of linear evolution equations with transformed proper orthogonal decomposition

Solving optimal control problems for high-dimensional partial differential equations (PDEs) is computationally expensive. As a workaround, reduced-order models (ROMs) are often employed, which replace the full PDE system and alleviate the computational burden while solving optimal control problems. However, when the underlying PDE exhibits transport-dominated behavior, standard reduced-order modeling techniques like proper orthogonal decomposition (POD) that rely on linear approximation spaces may require a large number of modes due to the slowly decaying Kolmogorov $n$-width. To overcome this challenge, we focus on the use of transformed POD as a reduced-order model, which is particularly effective in capturing low-dimensional representations of high-fidelity transport-dominated phenomena. In this work, a reduced-order model is constructed first, followed by the optimization of the reduced system. For linear systems generated by strongly continuous groups, we prove existence and uniqueness of solutions for the ROM under an explicit smallness condition on the control, as well as the existence of an optimal control for sufficiently large regularization. The numerical experiments concern the 1D linear advection equation with a subset of the general transformation groups called the shift transformations. Additionally, we compare the computational performance of the shifted POD (sPOD) method against the standard POD.
Read the full abstract

Analysis of PDEs

Asymptotic behavior of small solutions to the Vlasov–Klein–Gordon system in high dimensions

We study the asymptotic behavior of small solutions to the Vlasov–Klein–Gordon system in high dimensions. The standard argument of Glassey and Strauss \cite{GS87} for studying small solutions to the Vlasov–Maxwell system does not apply to the Vlasov–Klein–Gordon system due to the massiveness of the Klein–Gordon field. In this paper we use the vector field method and consider solutions in dimensions $ n \geq 4 $ with the hyperboloidal foliation of the Minkowski spacetime to obtain the asymptotic properties for the Vlasov–Klein–Gordon system.
Read the full abstract

Rings and Algebras

The free tracial post-Lie-Rinehart algebra of planar aromatic trees for the design of divergence-free Lie-group methods

Aromatic Butcher series were successfully introduced for the study and design of numerical integrators that preserve volume while solving differential equations in Euclidean spaces. They are naturally associated to pre-Lie-Rinehart algebras and pre-Hopf algebroids structures, and aromatic trees were shown to form the free tracial pre-Lie-Rinehart algebra. In this paper, we present the generalisation of aromatic trees for the study of divergence-free integrators on manifolds. We introduce planar aromatic trees, prove that they span the free tracial post-Lie-Rinehart algebra, and apply them for deriving new Lie-group methods that preserve geometric divergence-free features up to a high order of accuracy.
Read the full abstract

Logic

Minimal and intrinsic topologies on monoids of elementary embeddings

To every $\omega$-categorical structure $\mathrm{Aut}M$ one can associate two spaces of symmetries which determine the structure up to first-order bi-interpretability: the topological group $\mathrm{Aut}(M)$ of its automorphisms and the topological monoid $\mathrm{EEmb}(M)$ of its elementary embeddings, both equipped with the topology of pointwise convergence $\tau_{\mathrm{pw}}$. We investigate the relation of $\tau_{\mathrm{pw}}$ to other topologies on these spaces: in particular, when $\tau_{\mathrm{pw}}$ is minimal, i.e. does not admit any strictly coarser Hausdorff semigroup topology. A common method to prove minimality of $\tau_{\mathrm{pw}}$ on $\mathrm{EEmb}(M)$ is to show that it coincides with the algebraically defined semigroup Zariski topology $\tau_{\mathrm{Z}}$. We show that $\tau_{\mathrm{pw}}$ differs from $\tau_{\mathrm{Z}}$ on $\mathrm{EEmb}(M)$ whenever $\mathrm{Aut}(M)$ has a non-trivial centre. In spite of this, we then prove that whenever algebraic closure on $M$ is modular, $\tau_{\mathrm{pw}}$ is minimal on $\mathrm{EEmb}(M)$. This covers, for example, countable vector spaces and projective spaces over finite fields. Turning to $\mathrm{Aut}(M)$, we describe the semigroup topologies coarser than $\tau_{\mathrm{pw}}$ on the automorphism groups of structures for which algebraic independence satisfies independent 3-amalgamation. We conclude by proving that for the real and the rational Urysohn space and sphere, the metric pointwise topology $\tau_{\mathrm{mp}}$ is minimal on $\mathrm{EEmb}(M)$, equals $\tau_{\mathrm{Z}}$, and is strictly coarser than $\tau_{\mathrm{pw}}$.
Read the full abstract

All authors J. de la Nuez González, Zaniar Ghadernezhad, Paolo Marimon, Michael Pinsker

Information Theory

Joint Detection and Identification for Scalable Control of Nanorobot Swarms under Harsh Communication Constraints

The coordination of large populations of highly constrained devices, such as micro- and nanoscale agents in biomedical applications, poses fundamental challenges to classical communication paradigms. In scenarios such as targeted drug delivery, devices operate under severe limitations in energy, size, and communication capabilities, while requiring precise and selective activation within spatially localized regions. In this work, we propose the framework of Joint Detection and Identification (JDAI) as a system-level approach for scalable control under such constraints. The key idea is to shift from reliable message transmission to a control-oriented paradigm, in which devices locally decide whether a broadcast signal is relevant. This enables implicit addressing and subset activation without the need for explicit per-device communication. We demonstrate how message identification can be combined with sensing. This enables the realization of a closed-loop system that integrates detection, communication, and actuation. Using the example of targeted nanorobot therapy, we analyze the interplay between sensing resolution, communication constraints, and system dynamics. In particular, we show that while identification exhibits favorable asymptotic scaling, practical implementations are governed by finite blocklength effects, noise, and latency. The proposed framework complements existing physical-layer communication approaches, including molecular, electromagnetic, and acoustic techniques, by providing a control-layer abstraction for scalable subset selection. Overall, JDAI connects identification-theoretic principles with system-level design to control large, resource-limited environments.
Read the full abstract

All authors Wafa Labidi, Holger Boche, Christian Deppe, Marc Geitz

Functional Analysis

Perturbation Method in Musielak-Orlicz Sequence Spaces

We generalize an abstract variational principle in Banach spaces, introduced by Topalova & Zlateva, by showing that the set $\mathbb{P}_0$ of perturbations for which a perturbed lower semi-continuous function $f$ is WPMC (Well Posed Modulus Compact) not only contains a dense $G_\delta$ subset, but is also a complement to a $\sigma$-porous subset in a specifically defined positive cone. Moreover, if the space is a Musielak-Orlicz sequence space satisfying $\ell_\Phi\cong h_{\Phi}$, then the notion WPMC is replaced by the stronger notion of Tikhonov well posedness, which is proved to be equivalent to the single-valuedness and upper semi-continuity of the multivalued mapping assigning a parameter to the solution set. We give several applications. The first one is that the Musielak-Orlicz sequence spaces have the Radon-Nikodym property and, therefore, are dentable by proving the validity of Stegall's variational principle. As a consequence we obtain that the duals of Musielak-Orlicz sequence spaces are $w^*$-Asplund. We establish also a sufficient condition for Musielak-Orlicz and Nakano sequence spaces to be Asplund spaces. The next applications are for determining the type of the smoothness of certain Musielak-Orlicz, Nakano, and weighted Orlicz sequence spaces. We illustrate by an example that it is possible to consider an Orlicz function without the $\Delta_2$ condition, by a particular choice of the weighted sequence $\{w_n\}_{n=1}^\infty$ to get $\ell_M(w)\cong h_M(w)$ and to be able to apply the main result.
Read the full abstract

Functional Analysis

On non-negative operators in Krein spaces and their perturbations

One of the most important contributions of Heinz Langer in the area of operator theory in Krein spaces is the introduction of the notion of definitizable operators and the construction of the corresponding spectral function. In this note we obtain a new characterization for the subclass of non-negative operators in Krein spaces which is based on local sign type properties of the spectrum and growth conditions on the resolvent. Based on these local properties, a notion of local non-negativity for self-adjoint operators in Krein spaces is defined and it is shown that such classes of operators appear naturally as perturbations of non-negative operators.
Read the full abstract

Logic

Relational Semantics for Flat Heyting-Lewis Logic

We introduce relational semantics for "flat Heyting-Lewis logic" HLC-flat. This logic arises as the extension of intuitionistic logic with a Lewis-style strict implication modality that, contrary to its "sharp" counterpart HLC-sharp, does not turn meets into joins in its first argument. We prove completeness and the finite model property for HLC-flat and for several extensions with additional axioms.
Read the full abstract

Dynamical Systems

Dynamical metric order

We introduce the notion of dynamical metric order of a continuous map on a compact metric space, study its basic properties, and compute it for several classes of maps. This concept which is a counterpart of the metric mean dimension with the role of the box-counting dimension being played by the metric order. It is devised for maps acting on spaces with infinite box-counting dimension but finite metric order. For example, it brings forward new information about full shifts whose alphabets have infinite box-counting dimension; and provides a sharper estimate of complexity for the induced map determined by a continuous transformation on a compact metric space, whose upper metric mean dimension is known to admit only two values (zero or infinity). We also show that it satisfies a variational principle where maximization is taken over the space of invariant probability measures and whose equilibrium states always exist.
Read the full abstract

Dynamical Systems

Denseness of zero entropy aperiodic ergodic measures

We study partially hyperbolic homoclinic classes of $C^1$-generic diffeomorphisms with a one-dimensional central bundle, so that the central Lyapunov exponent $\chi^c(\mu)$ is well defined for any ergodic measure $\mu$ supported on the class. We focus on nonhyperbolic homoclinic classes supporting ergodic measures with positive, zero, and negative central exponents. For each $\alpha$ and a nontrivial homoclinic class $H$ of a $C^1$-generic diffeomorphism $f$, we consider the level set of measures \[ \mathcal{M}^\alpha_{\mathrm{erg}}(f,H)= \left\{\text{$\mu$ ergodic, supported on $H$, with } \chi^c(\mu)=\alpha \right\}. \] In this generic setting, the range of $\alpha$ for which $\mathcal{M}^\alpha_{\mathrm{erg}}(f,H)$ is nonempty forms a nontrivial closed interval $I$. Since the set of periodic measures is countable, most of these sets contain no periodic measures. We show that for every $\alpha$ in the interior of $I$, the so-called Axiomatized GIKN measures, a class of low-complexity, zero-entropy measures, are dense in $\mathcal{M}^\alpha_{\mathrm{erg}}(f,H)$. This result can be viewed as an analogue of Sigmund's classical density of periodic measures for systems with the specification property, obtained here in a setting where the specification property does not hold and periodic measures are typically absent (in the considered level sets). We also present a similar result for the open class of blender-minimal diffeomorphisms, contained in the class of $C^1$-robustly transitive ones.
Read the full abstract

Algebraic Geometry

Irreducible Characteristic Cycles for Orbit Closures of a Symmetric Subgroup

Let $G = GL(n)$ and $K = GL(p) \times GL(q)$ with $p+q=n$, where the groups are taken over $\C$. In this paper we study a certain family of $K$-orbit closures on the flag variety $X$ of $G$. The geometry of these orbit closures plays a central role in the infinite-dimensional representation theory of the real Lie group $U(p,q)$, and has applications to degeneracy loci and combinatorics. In this paper we use small resolutions to study orbit closures in this family. We prove that the fibers of these resolutions are smooth and strongly reduced, as well as a general result that if a variety has a resolution of singularities with these properties, then its characteristic cycle is irreducible. Hence these orbit closures have irreducible characteristic cycles. A result of Jones then allows us to calculate the torus-equivariant Chern-Mather classes of these orbit closures. We describe torus fixed points and tangent spaces of the resolutions, and use localization to obtain a formula for these classes. We conjecture that the Chern-Mather classes of a $K$-orbit closure are equivariantly positive when expressed in a Schubert basis of equivariant Borel-Moore homology, and use our results to verify the conjecture in an example.
Read the full abstract

K-Theory and Homology

Anick Resolution for Lawvere Theories from Algebraic Discrete Morse Theory

Inspired by Brown's collapsing method (or discrete Morse theory) to obtain a free resolution of $\bbZ$ over the monoid ring $\bbZ M$, we apply algebraic discrete Morse theory to compute the homology groups of Lawvere theories, which is defined as Tor of a certain module. We reinterpret known partial free resolutions arising from complete term rewriting systems in terms of collapsing of the normalized bar resolution. This perspective yields homological inequalities that bound the number of equational axioms in presentations and recovers classical results, such as lower bounds for group axiomatizations. Our main contribution is to extend these resolutions to higher dimensions.
Read the full abstract

Dynamical Systems

Time Series Correlations and Kolmogorov Complexity: A Hausdorff Dimension Perspective

Spurious correlations are common in time-series analysis because simple, low-complexity patterns can produce high Pearson correlations even between unrelated series. We argue that Kolmogorov complexity, interpreted as resistance to compression, provides a principled safeguard against such false positives. Using effective Hausdorff dimension, we show that the probability of accidental correlation between two independent series decays exponentially with their complexity, while noise can inflate observed complexity and must therefore be accounted for in practice. We illustrate these ideas with coupled logistic maps and multivariate fractional Brownian motion (mfBm), where the Hurst parameter \(H\) controls both complexity and Hausdorff dimension \((\dim_H = 2 - H)\). Both models show that false positives are much more common among low-complexity series than among high-complexity ones. We introduce the joint complexity indicator \[ J_{\rm LZ} = \sqrt{\widetilde{C}_{\rm LZ}(x)\widetilde{C}_{\rm LZ}(y)}, \] which captures joint high complexity rather than simple similarity between individual complexities. Its threshold can be calibrated from the mfBm false-positive curve. In logistic maps, \(J_{\rm LZ}\) also anticipates the collapse of individual complexity just before synchronization. We recommend establishing stationarity first, then reporting \(J_{\rm LZ}\) alongside \(\rho\), and treating high correlation among low-complexity series with skepticism.
Read the full abstract

All authors Boumediene Hamzi, Marianne Clausel, Kamal Dingle, Marcus Hutter, Mohammed Terry-Jack

Information Theory

Fairness Scheduling for Coded Caching in Multi-AP Wireless Local Area Networks

Coded caching (CC) exploits cumulative cache memory at user devices and coding to transform unicast traffic into multicast transmissions. While information theoretic results show significant gains over uncoded caching for various network topologies, its practical benefits remain unclear. In this work, we investigate CC for on-demand video streaming over large wireless local area networks, where multiple users are served simultaneously by spatially distributed access points. Users asynchronously request video chunks from a content library. We propose a decentralized, asynchronous, and location-independent cache placement scheme combined with an "over IP" delivery mechanism operating at higher network layers, leaving the physical and MAC layers unchanged. For this scheme, we characterize the achievable goodput region, where goodput is defined as the number of video chunks per unit time delivered to users' playback buffers, and formulate the corresponding fairness problem as a convex maximization. We develop a dynamic scheduling algorithm that provably achieves the optimal fairness point under stationary conditions with reduced complexity, and introduce a heuristic to further lower complexity. Numerical results demonstrate significant gains over baseline schemes, including conventional prefix caching, orthogonal sub-channel allocation with spatial reuse, and a CSMA-inspired distributed coordination approach, showing that CC can be implemented as a scalable and compatible over IP solution for existing WLANs.
Read the full abstract

Information Theory

Minimizing the Age of Incorrect Information of Discrete-Time Markov Sources With Hybrid ARQ

This work introduces a framework for analyzing the Age of Incorrect Information (AoII) in a real-time monitoring system with a generic discrete-time Markov source. We study a noisy communication system employing a hybrid automatic repeat request (HARQ) protocol, subject to a transmission rate constraint. The optimization problem is formulated as a constrained Markov decision process (CMDP), and it is shown that there exists an optimal policy that is a randomized mixture of two stationary policies. To overcome the intractability of computing the optimal stationary policies, we develop a multiple-threshold policy class where thresholds depend on the source, the receiver, and the packet count. By establishing a Markov renewal structure induced by threshold policies, we derive closed-form expressions for the long-term average AoII and transmission rate. The proposed policy is constructed via a relative value iteration algorithm that leverages the threshold structure to skip computations, combined with a bisection search to satisfy the rate constraint. To accommodate scenarios requiring lower computational complexity, we adapt the same technique to produce a simpler single-threshold policy that trades optimality for efficiency. Numerical experiments exhibit that both thresholdbased policies outperform periodic scheduling, with the multiplethreshold approach matching the performance of the globally optimal policy.
Read the full abstract

All authors Konstantinos Bountrogiannis, Anthony Ephremides, Panagiotis Tsakalides, George Tzagkarakis

Statistics Theory

The Conjugate Domain Dichotomy: Exact Risk of M-Estimators under Infinite-Variance Noise in High Dimensions

This paper studies high-dimensional M-estimation in the proportional asymptotic regime (p/n -> gamma > 0) when the noise distribution has infinite variance. For noise with regularly-varying tails of index alpha in (1,2), we establish that the asymptotic behavior of a regularized M-estimator is governed by a single geometric property of the loss function: the boundedness of the domain of its Fenchel conjugate. When this conjugate domain is bounded – as is the case for the Huber, absolute-value, and quantile loss functions – the dual variable in the min-max formulation of the estimator is confined, the effective noise reduces to the finite first absolute moment of the noise distribution, and the estimator achieves bounded risk without recourse to external information. When the conjugate domain is unbounded – as for the squared loss – the dual variable scales with the noise, the effective noise involves the diverging second moment, and bounded risk can be achieved only through transfer regularization toward an external prior. For the squared-loss class specifically, we derive the exact asymptotic risk via the Convex Gaussian Minimax Theorem under a noise-adapted regularization scaling. The resulting risk converges to a universal floor that is independent of the regularizer, yielding a loss-risk trichotomy: squared-loss estimators without transfer diverge; Huber-loss estimators achieve bounded but non-vanishing risk; transfer-regularized estimators attain the floor.
Read the full abstract

Analysis of PDEs

A Wiener criterion at infinity for $p$-massiveness on weighted graphs

We study boundary value problems at infinity for the graph $p$-Laplacian on infinite, connected, locally finite weighted graphs. Our main result is a Wiener criterion for $p$-massiveness. Assuming volume doubling and a weak $(1,p)$-Poincaré inequality, we show that every infinite connected $p$-massive set satisfies a dyadic capacitary condition expressed through relative $p$-capacities in nested balls; under the additional $(p_0)$ condition, the converse also holds. This yields a nonlinear criterion at the point at infinity in a rough weighted-graph setting and extends the Wiener viewpoint to a nonlinear discrete framework. We also prove, without these geometric assumptions, that $p$-massiveness is equivalent to a strengthened nonuniqueness property for exterior Dirichlet problems. As a further consequence, bounded nonconstant $p$-harmonic functions are characterized by the existence of two disjoint massive sets. In this way, the Wiener criterion is placed in a broader and more flexible picture of exterior boundary behavior and Liouville-type phenomena on weighted graphs.
Read the full abstract

Numerical Analysis

A Simple Trigonometric Classification of Quintic Roots

This article provides a simple trigonometric method for determining how many roots of a quintic equation are real and how many are complex, without solving the equation. The approach transforms a depressed quintic $t^5 + mt^3 + nt^2 + pt + q = 0$ with $m < 0$ into the trigonometric equation $f(\theta) = \alpha\cos^2\!\theta + \beta\cos\theta + \cos 5\theta + \gamma = 0$ via the Chebyshev identity $16\cos^5\!\theta - 20\cos^3\!\theta + 5\cos\theta = \cos 5\theta$. The derivation is computationally light and conceptually natural, extending the quartic case to fifth-degree equations. As the Abel–Ruffini theorem forbids a general algebraic solution for the quintic, having a simple trigonometric criterion for the nature of its roots is especially appealing.
Read the full abstract

Analysis of PDEs

Inverse source problems with reduced interior data for a coupled reaction-diffusion system

We consider a two-component semilinear reaction-diffusion system in a bounded spatial domain $\Omega$ over a time interval $(0,T)$, which governs the water density $u(x,t)$ and the vegetation biomass density $v(x,t)$ for $x\in\Omega$ and $0<t<T$. In this system, called the Klausmeier-Gray-Scott model, we assume that an unknown source depends only on the spatial variable and appears in the reaction-diffusion equation for $u$. The main subject is the inverse source problem of determining a source term from limited data on $(u,v)$. We establish two kinds of stability estimates by means of Carleman estimates. First, a Carleman estimate with a singular weight yields a Lipschitz stability estimate for the inverse source problem from data consisting of a snapshot $u(\cdot,t_0)$ in $\Omega$ and $(u,v)$ in a subdomain $\omega$ over a time interval. Second, without assuming boundary data, we prove a Hölder stability estimate in any interior subdomain $\Omega_0$ satisfying $\overline{\Omega_0}\subset\Omega$. We further study how much the observation data can be reduced while preserving uniqueness and stability in the inverse problem under suitable additional conditions.
Read the full abstract

Dynamical Systems

Integrability of Billiards Inside Cones as a Discrete-Time Hamiltonian System

In this paper, we continue to study billiards inside cones $K\subset \mathbb{R}^n$ over strictly convex closed $C^3$ manifolds with non-degenerate second fundamental form. Recently we proved that the billiard is superintegrable, i.e., the billiard admits first integrals whose values uniquely determine all billiard trajectories. In this paper we prove that this billiard system admits $n-1$ independent first integrals in involution. Consequently, the system is completely integrable as a discrete-time Hamiltonian system. This provides an example of an integrable billiard where the billiard table is neither a quadric nor consists of pieces of quadrics.
Read the full abstract

Group Theory

Abelian maximal subgroups of valued division algebras

Let $D$ be a division ring. We study when the multiplicative group $D^*$ can contain an abelian maximal subgroup. We prove that this cannot occur for any noncommutative tame finite-dimensional central division algebra over a Henselian valued field with nontrivial valuation. We also apply the same idea to standard valued division rings, including twisted Laurent series, iterated Laurent series, and Mal'cev–Neumann series. Finally, we introduce a complementary malnormality obstruction and use it to rule out abelian maximal subgroups in quaternion division algebras over real-closed fields.
Read the full abstract

Numerical Analysis

Energy dissipation rates of ensemble eddy viscosity models of turbulence: the periodic box

Classical eddy viscosity models of turbulence add an eddy viscosity term based on the Kolmogorov-Prandtl parameterization by a turbulent length scale $l$ and a turbulent kinetic energy $k^{\prime }$. Approximations of the unknowns $l,k^{\prime }$ are typically constructed by solving multi-parameter systems of nonlinear convection-diffusion-reaction equations. Often these over-diffuse so additional fixes are added. Alternately, one can solve an ensemble of NSE's with perturbed data and simply compute directly $k^{\prime }$(without modeling). The question then arises: Does this ensemble eddy viscosity approach over-diffuse solutions? We prove herein that for turbulence in a periodic box it does not.
Read the full abstract

Number Theory

Plectic Heegner classes

We introduce a new collection of partially global Galois cohomology classes subsuming both plectic Heegner points and mock plectic invariants. The former are recovered as localizations of plectic Heegner classes, while the latter arise as eigenspace projections with respect to a "partial Frobenius"-action. By overcoming some limitations of previous constructions, plectic Heegner classes are expected to provide finer control over the arithmetic of higher rank elliptic curves. We are able to perform our construction via a systematic use of certain automorphic functions whose coefficients are p-adic measures valued in Galois cohomology. As we produce these functions through the uniformization of Shimura curves – rather than higher dimensional quaternionic Shimura varieties – our results are compatible with a plectic refinement of Tate's conjectures.
Read the full abstract

Numerical Analysis · Cross-listed from stat.ML

LDDMM stochastic interpolants: an application to domain uncertainty quantification in hemodynamics

We introduce a novel conditional stochastic interpolant framework for generative modeling of three-dimensional shapes. The method builds on a recent LDDMM-based registration approach to learn the conditional drift between geometries. By leveraging the resulting pull-back and push-forward operators, we extend this formulation beyond standard Cartesian grids to complex shapes and random variables defined on distinct domains. We present an application in the context of cardiovascular simulations, where aortic shapes are generated from an initial cohort of patients. The conditioning variable is a latent geometric representation defined by a set of centerline points and the radii of the corresponding inscribed spheres. This methodology facilitates both data augmentation for three-dimensional biomedical shapes, and the generation of random perturbations of controlled magnitude for a given shape. These capabilities are essential for quantifying the impact of domain uncertainties arising from medical image segmentation on the estimation of relevant biomarkers.
Read the full abstract

All authors Sarah Katz, Francesco Romor, Jia-Jie Zhu, Alfonso Caiazzo

Representation Theory

Coxeter Graphs for Super Weyl Groups of Exceptional Classical Lie Superalgebras

Super Weyl group plays an important role in the study of representations of basic classical Lie superalgebras. The Coxeter graphs for super Weyl groups of basis classical Lie superalgebras have been given in \cite{CLS}, where the authors also made a proposal on the Coxeter graphs for the super Weyl groups of exceptional classical Lie superalgebras $D(2,1,\alpha)$, $F(4)$ and $G(3)$. In this paper, we present all fundamental systems of the exceptional Lie superalgebras and get the Coxeter graphs for the corresponding super Weyl groups, verifying a proposal in \cite{CLS}.
Read the full abstract

Analysis of PDEs

An inverse source problem for a quasilinear elliptic equation

We initiate the study of inverse source problems for quasilinear elliptic equations of the form \[ \left\{ \begin{array}{ll} \nabla \cdot (\gamma(x,u,\nabla u) \nabla u) = F & \text{in } \Omega, \\ u = f & \text{on } \partial\Omega, \end{array} \right. \] where $\Omega \subset \mathbb{R}^n$, $n \geq 2$, is a simply connected bounded domain. We consider the specific nonlinearity $\gamma(x,u,\nabla u) = \sigma(x) + q(x) u$, with $q$ assumed to be known. By exploiting the nonlinearity to break the gauge invariance of the problem, we establish unique recovery of both $\sigma$ and $F$ from the associated Dirichlet-to-Neumann (DN) map under the structural conditions $q$ and $\nabla(\sigma/q)$ are nowhere vanishing in $\overline\Omega$. In the absence of these conditions, in particular in the linear case, we demonstrate that the inverse problem admits a gauge obstructing the uniqueness. We use higher order linearizations to obtain a complicated coupled system for the unknowns. The complexity of this system arises in part from the gauge freedom of the linearized equation, which is new in this context. We solve the system by constructing suitable complex geometric optics solutions and applying the unique continuation principle for nonlinear elliptic systems. We anticipate that the solution method developed here will prove useful in other inverse problems as well.
Read the full abstract

Analysis of PDEs

Finite-Time Weak Singularities and the Statistical Structure of Turbulence in 3D Incompressible Navier-Stokes Equations

This paper provides a rigorous mathematical analysis of the global regularity problem for the 3D incompressible Navier-Stokes (NS) equations, specifically addressing the conditions under which smooth initial data may lead to a loss of regularity. By departing from traditional phenomenological turbulence models and focusing strictly on the mechanical energy transport equation, we derive a fundamental critical condition, $\boldsymbol{u}\cdot\nabla E = 0,$ where $E = \frac12|\boldsymbol{u}|^2 + p$ is the specific mechanical energy, which characterizes the transition from laminar to turbulent flow.
Read the full abstract