Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 17 February

Analysis of PDEs

Quantitative Landis-type result for Dirac operators

We study quantitative unique continuation at infinity for Dirac equations with bounded matrix-valued potentials. For the massless Dirac operator $\mathcal{D}_n$ in $\mathbb{R}^n$, we establish a Landis-type estimate showing that the vanishing order of any nontrivial bounded solution of $( \mathcal{D}_n + \mathbb{V} ) \varphi = 0$ satisfies a lower bound of order $\exp(-\kappa R^{2} (\log R)^{2})$ as $|x|=R\to \infty$; the quadratic growth in the exponent is sharp, in view of previous known results. Our proof follows a Bourgain–Kenig type approach based on a Carleman inequality for Dirac operators which relies on a local Hölder regularity result, which we also prove. In two dimension, we obtain improved quantitative estimates under symmetry assumptions on the potential $\mathbb{V}$ and for real-valued solutions. Finally, we also derive qualitative Landis-type results for Dirac equations with decaying potentials, including critical decay rates.
Read the full abstract

Differential Geometry

On the Calabi-Yau Conjectures for Minimal Hypersurfaces in Higher Dimensions

In this paper, we study the Calabi-Yau conjectures for complete minimal hypersurfaces $\Sigma^{n}\subset \mathbb{R}^{n+1}$ in dimensions $n\ge 3$. These conjectures ask whether a complete minimal hypersurface must be unbounded, and more strongly, whether it must be proper. For the unboundedness question, we prove a chord-arc estimate for an embedded minimal disk with bounded curvature, showing that intrinsic distance is controlled by a polynomial of the extrinsic distance. On the other hand, using gluing techniques, we construct a complete, improperly embedded minimal hypersurface in $\mathbb{R}^{n+1}$ for every $n\ge 3$. This example shows that the properness conjecture suggested by the deep work of Colding-Minicozzi [CM08] in the case $n=2$ fails in higher dimensions.
Read the full abstract

General Topology

Productively Scheepers spaces and their relatives

We prove that assuming $\mathfrak{b}=\mathfrak{d}$, in the class of hereditarily Lindelöf spaces, each productively Scheepers space is productively Hurewicz. The above statement remains true in the class of all general topological spaces assuming that $\mathfrak{d}=\aleph_1$. To this end we use combinatorial methods and the Menger covering property parametrized by ultrafilters. We also show that if near coherence of filters holds, then the Scheepers property is equivalent to a Menger property parametrized by any ultrafilter.
Read the full abstract

Probability · Cross-listed from cs.DS

Markov Chains with Rewinding

Motivated by techniques developed in recent progress on lower bounds for sublinear time algorithms (Behnezhad, Roghani and Rubinstein, STOC 2023, FOCS 2023, and STOC 2024) we introduce and study a new class of randomized algorithmic processes that we call Markov Chains with Rewinding. In this setting, an algorithm interacts with a (partially observable) Markovian random evolution by strategically rewinding the Markov chain to previous states. Depending on the application, this may lead the evolution to desired states faster, or allow the agent to efficiently learn or test properties of the underlying Markov chain that may be infeasible or inefficient with passive observation. We study the task of identifying the initial state in a given partially observable Markov chain. Analysis of this question in specific Markov chains is the central ingredient in the above cited works and we aim to systematize the analysis in our work. Our first result is that any pair of states distinguishable with any rewinding strategy can also be distinguished with a non-adaptive rewinding strategy (one whose rewinding choices are determined before observing any outcomes of the chain). Therefore, while rewinding strategies can be shown to be strictly more powerful than passive strategies (those that do not rewind back to previous states), adaptivity does not give additional power to a rewinding strategy in the absence of efficiency considerations. The difference becomes apparent however when we introduce a natural efficiency measure, namely the query complexity (i.e., the number of observations they need to identify distinguishable states). Our second main contribution is to quantify this efficiency gap. We present a non-adaptive rewinding strategy whose query complexity is within a polynomial of that of the optimal (adaptive) strategy, and show that such a polynomial loss is necessary in general.
Read the full abstract

All authors Amir Azarmehr, Soheil Behnezhad, Alma Ghafari, Madhu Sudan

Number Theory

On the Mean Value of a Weighted Composite Arithmetic Function

The primary objective of this paper is to employ methods from analytic number theory to investigate the mean value properties of a composite function involving the Dirichlet divisor function and a generalized minimal power function. Specifically, we study the weighted summatory function where the divisor function is normalized by the number of distinct prime factors. We establish a rigorous asymptotic formula for this sum, detailing the analytic properties of the associated Dirichlet series and the contour integration process.
Read the full abstract

History and Overview of Mathematics

Bad Foundations and Manipulable Objects

Imagine a student – let's call him `E', and make him a "he" – that is enrolled in Calculus 2, and who believes that to pass in maths courses he only needs to memorize methods and apply them quickly and without errors. Let's imagine that `E' is an `E'xtreme case of "bad foundations" and that he knows how to solve $x+2=5$ by doing $x=5-2=3$, but he doesn't know how to substitute the $x$ in $x+2=5$ by 3, and the only way that he knows of "testing the solution" is to apply the same method again and check that he got the same result. When we are teaching Calculus to classes that have many students that are extreme cases of bad foundations we need new strategies and tools; for example, we can't pretend that "taking a particular case" is an obvious operation anymore – instead we need ways to make these operations easy to visualize. This article shows a way to do that using Maxima.
Read the full abstract

Analysis of PDEs

The lingering phenomenon and pattern formation in a nonlocal population model with cognitive map

The rates at which individuals memorize and forget environmental information strongly influence their movement paths and long-term space use. To understand how these cognitive time scales shape population-level patterns, we propose and analyze a nonlocal population model with a cognitive map. The population density moves by a Fokker–Planck type diffusion driven by a cognitive map that stores a habitat quality information nonlocally. The map is updated through local presence with learning and forgetting rates, and we consider both truncated and normalized perception kernels. We first study the movement-only system without growth. We show that finite perceptual range generates spatial heterogeneity in the cognitive map even in nearly homogeneous habitats, and we prove a lingering phenomenon on unimodal landscapes: for the fixed high learning rate, the peak density near the best location is maximized at an intermediate forgetting rate. We then couple cognitive diffusion to logistic growth. We establish local well-posedness and persistence by proving instability of the extinction equilibrium and the existence of a positive steady state, with uniqueness under an explicit condition on the motility function. Numerical simulations show that lingering persists under logistic growth and reveal a trade-off between the lingering and total population size, since near the strongest-lingering regime the total mass can fall below the total resource, in contrast to classical random diffusive–logistic models.
Read the full abstract

Optimization and Control

Exponential Conic Optimization for Multi-Regime Service System Design under Congestion and Tail-Risk Control

We study the design of single-facility service systems operating under multiple recurring regimes with service-level constraints on response times. Regime-dependent arrival and service rates induce hyperexponential response-time distributions, and the design problem selects regime-specific capacities to balance cost, congestion, fairness, and reliability. We propose a mixed-integer exponential conic optimization framework integrating SLA chance constraints, conflict-graph design restrictions, and CVaR-based tail-risk control. Although NP-hard, the problem admits an efficient decomposition scheme and tractable special cases. Computational experiments and a large-scale urban case study show substantial improvements over the current system, quantifying explicit trade-offs between efficiency, congestion control, fairness, and robustness. The framework provides a practical tool for congestion-aware and tail-control service system design.
Read the full abstract

Quantum Algebra

Homotopy Lie algebras and coherent infinitesimal 2-braidings

Given a homotopy Lie algebra (i.e. an $L_\infty$-algebra) $\mathfrak{g}$, we show concretely how the Lada-Markl $\mathfrak{g}$-modules (i.e. representations) assemble into a symmetric monoidal dg-category. Considering the homotopy 2-category of that dg-category, we construct infinitesimal 2-braidings from 2-shifted Poisson structures then show that such infinitesimal 2-braidings are coherent in Cirio and Faria Martins' sense. We then explicitly determine the differential of the Chevalley-Eilenberg algebra associated with a finite-dimensional homotopy Lie algebra and construct the symmetric monoidal dg-equivalence between the category of representations and the category of semi-free dg-modules over the Chevalley-Eilenberg algebra.
Read the full abstract

Optimization and Control · Cross-listed from cs.AI

Towards Efficient Constraint Handling in Neural Solvers for Routing Problems

Neural solvers have achieved impressive progress in addressing simple routing problems, particularly excelling in computational efficiency. However, their advantages under complex constraints remain nascent, for which current constraint-handling schemes via feasibility masking or implicit feasibility awareness can be inefficient or inapplicable for hard constraints. In this paper, we present Construct-and-Refine (CaR), the first general and efficient constraint-handling framework for neural routing solvers based on explicit learning-based feasibility refinement. Unlike prior construction-search hybrids that target reducing optimality gaps through heavy improvements yet still struggle with hard constraints, CaR achieves efficient constraint handling by designing a joint training framework that guides the construction module to generate diverse and high-quality solutions well-suited for a lightweight improvement process, e.g., 10 steps versus 5k steps in prior work. Moreover, CaR presents the first use of construction-improvement-shared representation, enabling potential knowledge sharing across paradigms by unifying the encoder, especially in more complex constrained scenarios. We evaluate CaR on typical hard routing constraints to showcase its broader applicability. Results demonstrate that CaR achieves superior feasibility, solution quality, and efficiency compared to both classical and neural state-of-the-art solvers.
Read the full abstract

All authors Jieyi Bi, Zhiguang Cao, Jianan Zhou, Wen Song, Yaoxin Wu, Jie Zhang, Yining Ma, Cathy Wu

Logic

Necessary and Sufficient Conditions for Proving Choice in Zermelo-Fraenkel Set Theory

This paper introduces an alternative approach to proving the existence of choice functions for specific families of sets within Zermelo-Fraenkel set theory (ZF) without assuming any form on the Axiom of Choice (AC). Traditional methods of proving choice, when it is possible without AC, are based on explicit constructing a choice function, which relies on being able to identify canonical elements within the sets. Our approach, instead, employs the axiom schema of separation. We begin by considering families of well-ordered sets, then apply the schema of separation twice to build a set of possible candidates for the choice functions, and, finally, prove that this set is non-empty. This strategy enables proving the existence of choice function in situations where canonical elements cannot be identified explicitly. We then extend our method beyond families of well-ordered sets to families of sets, over which partial orders with a least element exist. After exploring possibilities for further generalization, we establish a necessary and sufficient condition: in ZF, without assuming AC, a choice function exists for a non-empty family if and only if each set admits a partial order with a least element. Finally, we demonstrate how this approach can be used to prove the existence of choice functions for families of contractible and path-connected topological spaces, including hyper-intervals in $\mathbb{R}^n$, hyper-balls, and hyper-spheres.
Read the full abstract

Optimization and Control

Exploring New Frontiers in Vertical Federated Learning: the Role of Saddle Point Reformulation

The objective of Vertical Federated Learning (VFL) is to collectively train a model using features available on different devices while sharing the same users. This paper focuses on the saddle point reformulation of the VFL problem via the classical Lagrangian function. We first demonstrate how this formulation can be solved using deterministic methods. More importantly, we explore various stochastic modifications to adapt to practical scenarios, such as employing compression techniques for efficient information transmission, enabling partial participation for asynchronous communication, and utilizing coordinate selection for faster local computation. We show that the saddle point reformulation plays a key role and opens up possibilities to use mentioned extension that seem to be impossible in the standard minimization formulation. Convergence estimates are provided for each algorithm, demonstrating their effectiveness in addressing the VFL problem. Additionally, alternative reformulations are investigated, and numerical experiments are conducted to validate performance and effectiveness of the proposed approach.
Read the full abstract

All authors Aleksandr Beznosikov, Georgiy Kormakov, Alexander Grigorievskiy, Mikhail Rudakov, Ruslan Nazykov, Alexander Rogozin, Anton Vakhrushev, Andrey Savchenko, Martin Takáč, Alexander Gasnikov

Probability

Generalized noise sensitivity of eigenvectors: All eigenvectors, inhomogeneous variance profiles, and dependent resampling

Chatterjee (2016) proved, as an application of his general framework relating superconcentration and chaos, that after the entries of an $n \times n$ matrix drawn from the Gaussian unitary ensemble undergo an entrywise Ornstein-Uhlenbeck (OU) process for time greater than $n^{-1/3}$, the top eigenvector of the matrix becomes almost completely decorrelated from its initial position. More recently, Bordenave, Lugosi, and Zhivotovskiy (2020) showed that the same happens under a discrete resampling model, once more than $n^{5/3}$ randomly chosen entries of a Wigner random matrix are resampled. We generalize these results in several directions: (1) we analyze the decorrelation of any eigenvector under continuous and discrete resampling dynamics, (2) we analyze the discrete resampling process for generalized Wigner matrices with inhomogeneous variance profiles, (3) we analyze a combination of continuous and discrete resampling where an OU process is repeatedly run for a certain time on randomly chosen entries, and (4) we analyze a dependent version of resampling where entries grouped into "blocks" of arbitrary shapes are resampled together. In each case, we show that a given eigenvector decorrelates provided that enough entries have been resampled or that the associated dynamics have been run for a long enough time. Our proofs take a different approach from prior work, relying more directly on the characterization of eigenvectors as derivatives of eigenvalues and reducing the problem of establishing eigenvector noise sensitivity to variants of standard and robust properties of random matrices such as bounds on eigenvalue spacings and eigenvector delocalization.
Read the full abstract

Optimization and Control · Cross-listed from cs.SE

ReLoop: Structured Modeling and Behavioral Verification for Reliable LLM-Based Optimization

Large language models (LLMs) can translate natural-language problem descriptions into optimization code, but the code is prone to silent failures: it executes and returns a solver-feasible solution while encoding a semantically incorrect formulation. On compositional problems, the resulting feasibility-correctness gap reaches 90 percentage points. We introduce ReLoop, which combines two mechanisms. Structured generation decomposes code production into a four-stage reasoning chain (understand, formalize, synthesize, verify) to reduce formulation errors during generation. Behavioral verification detects the errors that remain by testing whether the formulation responds correctly to solver-based parameter perturbation, a signal that comes from the solver rather than from LLM self-review and requires no ground truth. The two mechanisms address different error structures: structured generation gives the largest gain on compositional problems (+8.5pp accuracy on RetailOpt-190 with Claude Opus 4.6), and behavioral verification gives its largest gain on localized defects (+4.4pp on MAMO-ComplexLP). With diagnostic execution recovery, ReLoop reaches 100% executable code on Claude Opus 4.6, and relative to direct generation it raises or preserves every reported metric of the three chat-tuned foundation models on all three benchmarks. For the narrowly fine-tuned SFT model we test, the chain-of-thought prompt conflicts with its learned output format and lowers its accuracy on MAMO-ComplexLP; we document and analyze this interaction. We release RetailOpt-190, 190 compositional retail optimization scenarios in which several constraints interact.
Read the full abstract

All authors Junbo Jacob Lian, Yujun Sun, Huiling Chen, Chaoyu Zhang, Hanzhang Qin, Chung-Piaw Teo

Representation Theory

$G_2$ representations and semistandard tableaux

Continuing earlier work, we show how to realize irreducible finite-dimensional representations of the complex group of type $G_2$ via tableaux, along the way exhibiting explicit generators of the defining ideal of the flag variety

Analysis of PDEs

Weak-strong uniqueness for bi-fluid compressible system with algebraic closure

We consider a real two-fluid system of compressible viscous fluids with a common velocity field and algebraic closure for the pressure law. The constitutive relation involves densities of both fluids through an implicit function. The existence of global-in-time finite energy weak solutions to this system is known since the work of Novotný and Pokorný [Arch. Rational Mech. Anal., 2020]. On the other hand, existence of local-in-time strong solutions is due to Piasecki and Zatorska [J. Math Fluid Mech., 2022]. In this paper, we establish the weak-strong uniqueness principle using the relative entropy method. In sharp contrast to the two-phase model of Baer-Nunziato type, the volume fraction of phase $+$ obeys a transport equation with an additional nonlinear term. This gives rise to troublesome terms in the relative entropy inequality. We are able to close the estimate by making an elaborate use of the structure of the system.
Read the full abstract

All authors Yang Li, Mária Lukáčová-Medvid'ová, Milan Pokorný, Ewelina Zatorska

Differential Geometry

Einstein connection of nonsymmetric pseudo-Riemannian manifold

A.Einstein considered a linear connection $\nabla$ with torsion $T$ on a smooth manifold equipped with a nonsymmetric (0,2)-tensor $G=g+F$, where $g$ is a pseudo-Riemannian metric associated with gravity, and $F\ne0$ is a skew-symmetric tensor associated with electromagnetism, such that $(\nabla_X\,G)(Y,Z)=-G(T(X,Y),Z)$. In this paper, we explicitly present the Einstein connection of a nonsymmetric pseudo-Riemannian manifold with non-degenerate $F$, satisfying the $f^2$-torsion condition $T(f^2X,Y)=T(X,f^2Y)=f^2 T(X,Y)$, where $g(X,fY)=F(X,Y)$, and show that in the almost Hermitian case, it reduces to the M.Prvanović's (1995) solution. We also explicitly present the Einstein connection of almost contact metric manifolds satisfying the $f^2$-torsion condition, discuss special Einstein connections, and give example in terms of weighted product of almost Hermitian manifolds.
Read the full abstract

Quantum Algebra · Cross-listed from hep-th

Towards a classification of graded unitary ${\mathcal W}_3$ algebras

We study constraints imposed by four-dimensional unitarity (formalised as graded unitarity in recent work by the first author) on possible ${\mathcal W}_3$ vertex algebras arising from four-dimensions via the SCFT/VOA correspondence. Under the assumption that the $\mathfrak{R}$-filtration is a weight-based filtration with respect to the usual strong generators of the vertex algebra, we demonstrate that all values of the central charge other than those of the $(3,q+4)$ minimal models are incompatible with four-dimensional unitarity. These algebras are precisely the ones that are realised by performing principal Drinfel'd–Sokolov reduction to boundary-admissible $\mathfrak{sl}_3$ affine current algebras; those affine algebras were singled out by a similar graded unitarity analysis in \cite{ArabiArdehali:2025fad}. Furthermore, these particular vertex algebras are known to be associated with the $(A_2,A_q)$ Argyres–Douglas theories.
Read the full abstract

Mathematical Physics

New formula for Asymptotic behavior of the Synchrotron function

Synchrotron radiation plays a central role in astrophysical and high-energy processes. Its spectral description involves the synchrotron function, defined by a non-trivial integral of modified Bessel functions and commonly evaluated through numerical methods or dedicated approximations. In this work, we obtain a compact analytical representation of the synchrotron function using the Method of Brackets, which yields systematically controllable asymptotic expansions in both the small- and large-argument regimes. The resulting expressions accurately reproduce numerical integration and make the analytic structure of the function explicit. Our results provide an efficient alternative to repeated numerical evaluations and facilitate applications requiring fast and controlled approximations.
Read the full abstract

Number Theory

On the Jacobian of $\overline{{{\rm Spec}\,\mathbb Z}}$

We interpret the structure of the adele class space of the rationals–and specifically its Riemann sector–as the natural monoidal extension of the Picard group of the arithmetic curve $\overline{\operatorname{Spec} \mathbb Z}$. We identify the elements of this space with torsion-free rank-1 abelian groups $L$ endowed with rigidifying data. In the Riemann sector, this data corresponds to a norm, extending the classical notion of metrized line bundles in Arakelov geometry. For the full adele class space, we replace the norm with a group morphism to $\mathbb R$ and a combinatorial datum: a parametrization of the roots of unity associated with the character dual of $L$. We show that the product of adeles is represented geometrically by the tensor product of these rank-1 groups and their rigidifying structures. The resulting monoid space generalizes the Picard group to the full adelic context by incorporating the singular strata required for the spectral realization of $L$-functions.
Read the full abstract

Information Theory · Cross-listed from eess.IV

ROIX-Comp: Optimizing X-ray Computed Tomography Imaging Strategy for Data Reduction and Reconstruction

In high-performance computing (HPC) environments, particularly in synchrotron radiation facilities, vast amounts of X-ray images are generated. Processing large-scale X-ray Computed Tomography (X-CT) datasets presents significant computational and storage challenges due to their high dimensionality and data volume. Traditional approaches often require extensive storage capacity and high transmission bandwidth, limiting real-time processing capabilities and workflow efficiency. To address these constraints, we introduce a region-of-interest (ROI)-driven extraction framework (ROIX-Comp) that intelligently compresses X-CT data by identifying and retaining only essential features. Our work reduces data volume while preserving critical information for downstream processing tasks. At pre-processing stage, we utilize error-bounded quantization to reduce the amount of data to be processed and therefore improve computational efficiencies. At the compression stage, our methodology combines object extraction with multiple state-of-the-art lossless and lossy compressors, resulting in significantly improved compression ratios. We evaluated this framework against seven X-CT datasets and observed a relative compression ratio improvement of 12.34x compared to the standard compression.
Read the full abstract

All authors Amarjit Singh, Kento Sato, Kohei Yoshida, Kentaro Uesugi, Yasumasa Joti, Takaki Hatsui, Andrès Rubio Proaño

Classical Analysis and ODEs

Connection formulas for Askey–Wilson polynomials and related expansions

We derive and study expansions of and over the Askey–Wilson polynomials. We study these expansions and examine some limits to the continuous dual $q$-Hahn, Al-Salam–Chihara, continuous big $q$-Hermite and continuous $q$-Hermite polynomials and their $q^{-1}$-analogues. The Poisson kernel for the infinite discrete orthogonality relation for the $q^{-1}$-Al-Salam–Chihara polynomials is derived which in a special case reduces to the Gupta–Masson biorthogonal rational ${}_4\phi_3$-functions. This Poisson kernel implies new infinite series connection relations for the Askey–Wilson polynomials involving these rational ${}_4\phi_3$-functions. We also consider various interesting limits.
Read the full abstract

Probability

Finite Free Information Inequalities

We develop finite free information theory for real-rooted polynomials, establishing finite free analogues of entropy and Fisher information monotonicity, as well as the Stam and entropy power inequalities. These results resolve conjectures by Shlyakhtenko and Gribinski and recover inequalities in free probability in the large-degree limit. Equivalently, our results may be interpreted as potential-theoretic inequalities for the zeros of real-rooted polynomials under differential operators which preserve real-rootedness. Our proofs leverage a new connection between score vectors and Jacobians of root maps, combined with convexity results for hyperbolic polynomials. We further characterize the equality cases in our inequalities, which arise from Hermite polynomials.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Solving Parameter-Robust Avoid Problems with Unknown Feasibility using Reinforcement Learning

Recent advances in deep reinforcement learning (RL) have achieved strong results on high-dimensional control tasks, but applying RL to reachability problems raises a fundamental mismatch: reachability seeks to maximize the set of states from which a system remains safe indefinitely, while RL optimizes expected returns over a user-specified distribution. This mismatch can result in policies that perform poorly on low-probability states that are still within the safe set. A natural alternative is to frame the problem as a robust optimization over a set of initial conditions that specify the initial state, dynamics and safe set, but whether this problem has a solution depends on the feasibility of the specified set, which is unknown a priori. We propose Feasibility-Guided Exploration (FGE), a method that simultaneously identifies a subset of feasible initial conditions under which a safe policy exists, and learns a policy to solve the reachability problem over this set of initial conditions. Empirical results demonstrate that FGE learns policies with over 50% more coverage than the best existing method for challenging initial conditions across tasks in the MuJoCo simulator and the Kinetix simulator with pixel observations.
Read the full abstract

All authors Oswin So, Eric Yang Yu, Songyuan Zhang, Matthew Cleaveland, Mitchell Black, Chuchu Fan

Operator Algebras

Set-theoretic absoluteness for analysts and separable \cstar-algebras without Choice

Basic theory of separable C*-algebras can be developed without the Axiom of Choice, and it does not depend on the Continuum Hypothesis, Martin's Axiom, and other standard set-theoretic assumptions. This can be proved in two ways. First, by showing that the standard proofs do not require Choice. Second, by utilizing set-theoretic absoluteness theorems. We provide an introduction to projective complexity and absoluteness for analysts. We also give some limiting examples consistent with ZF, such as a commutative \cstar-algebra concretely represented on a Hilbert space but not isomorphic to $C(X)$ for any compact Hausdorff space $X$ and whose state space is not compact and has no extreme points.
Read the full abstract

Probability

An effective energy-enstrophy diffusion process with a condensation bound

We use Gaussian measure on $\mathbb{R}^N$ to define the coefficients of an elliptic diffusion and show that it lives in an open cone of $\mathbb{R}^2$. One component represents enstrophy and the other energy. We establish the existence and uniqueness of a stationary distribution for this diffusion. Owing to the special properties of the coefficients of this diffusion, we derive a condensation bound, which controls the distance to $1$ of the ratio of the expected energy to the expected enstrophy (this ratio is at most $1$ with our normalization). In a companion article, as a “proof of concept”, we show that the diffusion constructed in this work is the inviscid limit of the laws of the “enstrophy-energy” process of a stationary $N$-dimensional Galerkin-Navier-Stokes type evolution with Brownian forcing and random stirring (the strength of which can be made to go to zero in the inviscid limit, and which plays the role of a regularization).
Read the full abstract

Category Theory

The dimension of the tangent bundle and the universality of the vertical lift

This paper explores a new perspective on the universality of the vertical lift in tangent categories by presenting a categorification of the dimension of smooth manifolds. The universality of the vertical lift is a key part of the axioms of a tangent category as presented in [4]. The categorical dimension presented in this paper provides insight into the nature of this property. The main result is Theorem 3.7, showing that if it exists, the dimension of the tangent bundle must fulfill an equation relating the dimension of the tangent bundle to the dimension of the base. In particular, when the dimension function is a strong tangent dimension, Theorem 3.8 shows that the dimension of the tangent bundles is either twice the dimension of the base, or equal to the dimension of the base. Many examples of dimension functions are provided to demonstrate the utility of the definition. In particular, a consequence of Theorem 3.7 is that there are limitations on which functors may be tangent bundle endofunctors for a category. We show that this means that there are no non-trivial tangent structures on sets, as an example.
Read the full abstract

Probability

An inviscid limit to an effective energy-enstrophy diffusion process

In this article we consider a stationary $N$-dimensional Galerkin-Navier-Stokes type evolution with Brownian forcing and random stirring (of arbitrarily small strength that plays the role of a regularization). We show, as a “proof of concept”, that the stationary diffusion in an open two-dimensional cone constructed in a companion article, stands as the inviscid limit of the laws of the “enstrophy-energy” process of the $N$-dimensional diffusion process considered here, this regardless of the strength of the stirring. With the help of the quantitative condensation bounds of the companion article, we infer quantitative inviscid condensation bounds, which for suitable forcings show an attrition of all but the lowest modes in the inviscid limit.
Read the full abstract

Differential Geometry

Casorati inequalities for Riemannian submersion along mixed distributions and their applications

This paper introduces Casorati inequalities for the normalised scalar curvature and normalised Casorati curvature of vertical and horizontal distributions for Riemannian submersions between Riemannian manifolds. We completely characterise the equality cases from both algebraic and geometric perspectives. As applications, we derive the corresponding inequalities for Riemannian submersions from real, complex, and generalised Sasakian space forms, including Sasakian, cosymplectic, Kenmotsu, and almost $C(\alpha)$ space forms. We provide several examples to demonstrate the effectiveness and applicability of the results obtained.
Read the full abstract

Mathematical Physics

Deformed Heisenberg algebra and its Hilbert space representations

A deformation of Heisenberg algebra induces among other consequences a loss of Hermiticity of some operators that generate this algebra. Therefore, these operators are not Hermitian, nor is the Hamiltonian operator built from them. In the present paper, we propose a position deformation of Heisenberg algebra with both maximal length and minimal momentum uncertainties. By using a pseudo-similarity transformation to the non-Hermitian operators, we prove their Hermiticity with a suitable positive-definite pseudo-metric operator. We then construct Hilbert space representations associated with these pseudo-Hermitian operators. Finally, we study the eigenvalue problem of a free particle in this deformed space and we show that this deformation curved the quantum levels allowing particles to jump from one state to another with low energy transitions.
Read the full abstract