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 3 March

Probability · Cross-listed from cond-mat.stat-mech

Dynamically Emergent Correlations

In this perspective article, we discuss the scenario of dynamically emergent correlation (DEC) arising in classical and quantum noninteracting systems when they are subjected to a common fluctuating stochastic environment. The key property of such systems is that the strong correlations between different particles emerge from the dynamics and not from built-in interactions. In many cases, these strong correlations persist even at long times in the stationary state. Computing observables explicitly for such strongly correlated states in general is very hard. Remarkably, the stationary states in several models of DEC exhibit an interesting analytical structure that allows to compute physical observables, despite being strongly correlated. Recent experiments on trapped colloidal particles have established that these DEC in the stationary state can in fact be measured. DEC is a rapidly emerging domain of strongly correlated out-of-equilibrium statistical physics, with both theoretical and experimental, as well as classical and quantum, components.
Read the full abstract

Analysis of PDEs

Stable solutions to reaction-diffusion elliptic problems

We are concerned with stable solutions to reaction-diffusion elliptic PDEs. We begin with regularity questions, first addressing the classical Laplacian. In joint work with Figalli, Ros-Oton, and Serra, we proved that stable solutions are smooth up to the optimal dimension 9, thereby solving an open problem posed by Brezis in the mid-1990s. We describe this result and also discuss related progress and open problems for the fractional Laplacian – arising naturally in boundary reaction problems – , the $p$-Laplacian, and minimal surfaces. We then turn to existence questions, starting with the Casten-Holland and Matano theorem for interior reactions, which states that no nonconstant stable solution exists in convex domains under zero Neumann boundary conditions. We present a recent result with Consul and Kurzke (forthcoming) establishing that the analogous statement fails for boundary reactions. This requires the development of a new Ginzburg-Landau theory for real-valued functions and the analysis of the half-Laplacian on the real line, for which we present new results and open problems.
Read the full abstract

Number Theory

Twisted dynamical zeta functions and the Fried's conjecture

This is a survey article on the twisted dynamical zeta functions of Ruelle and Selberg and the Fried's conjecture. It is based on the mini-course: "Twisted Ruelle zeta function, complex-valued analytic torsion and the Fried's conjecture", given by the author during the thematic trimester programme: "Representation Theory and Noncommutative Geometry" at the Institut Henri Poincaré.
Read the full abstract

Analysis of PDEs

Rigidity of shear flows of the Euler equations in the plane

In this paper we show that steady states $u$ of the pressureless Euler equation which belong to $L^3_{loc}(\mathbb{R}^2,\mathbb{R}^2)$ are shear flows. This is achieved by combining results of degenerate Monge-Ampère-type equations with the theory of two dimensional transport equations. We also show that the problem of rigidity and flexibility for the associated differential inclusion is rigid for sequences equibounded in $L^{4+}$ and flexible for sequences equibounded in $L^{4-}$, thus displaying a gap in the rigidity exponent between the exact and the approximate problem.
Read the full abstract

Analysis of PDEs

Weak-Strong Uniqueness for a Rigid Body Immersed in an Inviscid Compressible Fluid

We consider the coupled motion of a free rigid body immersed in an inviscid compressible isentropic fluid. By means of a vanishing viscosity limit, we obtain the local-in-time existence of a dissipative measure-valued solution to the model. Moreover, we establish the weak-strong uniqueness property of the obtained measure-valued solution. To our knowledge, this is the first mathematical result on compressible inviscid fluid-structure interaction. The key novel technique is the construction of a suitable approximation of the test function in the weak formulation of the inviscid system, as the space of test functions depends on the viscosity parameter.
Read the full abstract

Optimization and Control

Hybridizing PDHG and Interior-Point Methods

The Primal-Dual Hybrid Gradient (PDHG) algorithm is a first-order method that can exploit GPUs to solve large-scale linear programming problems. The approach can often be faster than the alternatives, simplex and interior-point methods, typically at the cost of much lower accuracy. This paper looks at whether PDHG can be hybridized with an interior-point method to retain some of the speed advantages of the former while capturing the accuracy advantages of the latter.
Read the full abstract

Information Theory

Channel-Adaptive Edge AI: Maximizing Inference Throughput by Adapting Computational Complexity to Channel States

Integrated communication and computation (IC$^2$) has emerged as a new paradigm for enabling efficient edge inference in sixth-generation (6G) networks. However, the design of IC$^2$ technologies is hindered by the lack of a tractable theoretical framework for characterizing end-to-end (E2E) inference performance. The metric is highly complicated as it needs to account for both channel distortion and artificial intelligence (AI) model architecture and computational complexity. In this work, we address this challenge by developing a tractable analytical model for E2E inference accuracy and leveraging it to design a channel-adaptive AI algorithm that maximizes inference throughput, referred to as the edge processing rate (EPR), under latency and accuracy constraints. Specifically, we consider an edge inference system in which a server deploys a backbone model with early exit, which enables flexible computational complexity, to perform inference on data features transmitted by a mobile device. The proposed accuracy model characterizes high-dimensional feature distributions in the angular domain using a Mixture of von Mises (MvM) distribution. This leads to a desired closed-form expression for inference accuracy as a function of quantization bit-width and model traversal depth, which represents channel distortion and computational complexity, respectively. Building upon this accuracy model, we formulate and solve the EPR maximization problem under joint latency and accuracy constraints, leading to a channel-adaptive AI algorithm that achieves full IC$^2$ integration. The proposed algorithm jointly adapts transmit-side feature compression and receive-side model complexity according to channel conditions to maximize overall efficiency and inference throughput. Experimental results demonstrate its superior performance as compared with fixed-complexity counterparts.
Read the full abstract

Analysis of PDEs

Mean Effects on Critical Well-Posedness for Majda-Biello Systems on the Torus

This paper studies how the mean of the initial data $u_0$ affects the critical indices concerning local well-posedness for the following Majda-Biello systems: \[ \left\{\begin{aligned} & u_t + u_{xxx} + vv_x = 0 , \\ & v_t + \alpha v_{xxx} + (uv)_x = 0 , \\ & (u,v) \mid_{t=0} = (u_0, v_0) \in H^s(\mathbb{T}) \times H^s(\mathbb{T}), \end{aligned}\right. \qquad x \in \mathbb{T}, \, t\in \mathbb{R}, \] where $\mathbb{T}$ refers to the periodic torus and the dispersion coefficient $\alpha$ is restricted in $(0,4] \setminus \{1\}$ which corresponds to resonant cases. Previously, under the zero-mean assumption on $u_0$, Oh (Int. Math. Res. Not., (18):3516-3556, 2009) determined the critical indices $s^{*}(\alpha)$ of the Sobolev regularity of the initial data for $C^3$ local well-posedness. In particular, Oh showed that \[ s^{*}(\alpha) = \left\{ \begin{array}{lll} 1, & \text{for $\alpha$ such that $\sqrt{12/\alpha - 3} \in \mathbb{Q}$ }, \\ \frac12, & \text{for a.e. $\alpha$ such that $\sqrt{12/\alpha - 3} \notin \mathbb{Q}$ }. \end{array}\right. \] In this paper, by allowing the mean of $u_0$ to be non-zero, we find that the critical index $s^{*}(\alpha)$ can be lowered from $1$ to $\frac12$ when $\sqrt{12/\alpha - 3} \in \mathbb{Q}$. For other values of $\alpha$, except in a set of zero measure, we also justify the critical index $s^{*}(\alpha)$ to be $\frac12$ regardless of the mean of $u_0$. By subtracting the mean from $u_0$, the original Majda-Biello systems are slightly modified to contain first-order terms but with zero-mean initial data. The key ingredient in our proof is to introduce a refined Diophantine approximation theory to capture the essential resonance effect for the perturbed dispersive structure caused by these additional first-order terms.
Read the full abstract

Combinatorics

A very robust Ramsey theorem for matchings

Our main result is a robust generalisation of the Cockayne-Lorimer theorem on the multicolour Ramsey number of matchings. It is moreover a generalisation of the transference generalisation of Cockayne-Lorimer, which (informally) says that the random graph $G \sim G(n,p)$ with $np \to \infty$ has, with high probability, essentially the same Ramsey matching properties as the complete graph $K_n$. We show, somewhat surprisingly, that the same is true under the rather weak robustness assumption that $G$ is an $s$-connector (i.e. $\overline{G}$ is $K_{s,s}$-free) with $s=o(n)$. Moreover, we show that such $G$ has only an additive $O(s)$ loss with respect to $K_n$ for monochromatic matchings, which is essentially sharp. Our proof adapts a compression algorithm based on Gallai-Edmonds decompositions that we developed previously for generalised Ramsey-Turán problems.
Read the full abstract

Algebraic Geometry

Genus $2$ pencils on surfaces with $p_g=K^2=1$, envelopes, and conics tangent to plane cubic curves

We consider $(1,1)$-surfaces, namely, minimal compact complex surfaces $S$ with $p_g (S) =K_S^2=1$: for these the bicanonical map is a covering of degree $4$ of the plane $P^2$. And we answer a question posed by Meng Chen, whether they can contain a genus 2 pencil (this is the standard reason of failure of birationality of the bicanonical map). Our main theorem says that those which admit a genus 2 pencil form an irreducible subvariety of codimension $3$ in their moduli space $\frak M_{[1,1]}$; moreover, the general such surface admits exactly $24$ such pencils, corresponding to $12$ pencils of conics in $P^2$. The real fun is to relate this variety to the geometry of pencils of conics in the plane everywhere tangent to a cubic curve and a line. We investigate the corresponding variety $\cal{T}$ of triples and provide explicit equations using the classical theory of envelopes: among others, equations given in terms of the Weierstrass normal form of the cubic.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Deep Q-Learning-Based Gain Scheduling for Nonlinear Quadcopter Dynamics

This paper presents a deep Q-network (DQN)-based gain-scheduling framework for safety-critical quadcopter trajectory tracking. Instead of directly learning control inputs, the proposed approach selects from a finite set of pre-certified stabilizing gain vectors, enabling reinforcement learning to operate within a structured and stability-preserving control architecture. By exploiting the isotropic structure of the translational dynamics, feedback gains are shared across spatial axes to reduce dimensionality while preserving performance. The learned policy adapts feedback aggressiveness in real time, applying high authority during large transients and reducing gains near convergence to limit control effort. Simulation results using a high-fidelity nonlinear quadcopter model demonstrate accurate trajectory tracking, bounded attitude excursions, smooth transition to hover after the final time, and consistent reward improvement, validating the effectiveness and robustness of the proposed learning-based gain scheduling strategy.
Read the full abstract

Representation Theory

Complicial simple-minded collections

We consider the problem of characterizing derived endomorphism algebras of simple objects in length categories up to quasi-isomorphism. We give such a characterization for module categories, abelian categories, exact categories, as well as, for certain differential graded analogues of them. It turns out that the property of being $d$-complicial ($d\geq 1$), in the sense of Lurie, of the involved simple-minded collections plays a central role. We also explain how this characterization can be interpreted as a coherent generation property for any minimal $A_{\infty}$-model of the derived endomorphism algebra. Along the way, we propose a notion of length exact differential graded categories and explain how they relate to length abelian $d$-truncated differential graded categories, generalizing results of Enomoto.
Read the full abstract

Logic

Monochromatic sums and quotients in $\mathbb N$

We prove partition regularity of the configuration $x,y,x+y,y/x$ in a strong infinitary form that extends Hindman's Theorem. We study the related issue of partition regularity of configurations involving products of a degree one polynomial in $x$ with one in $y$, reducing the general problem to a handful of special cases.
Read the full abstract

All authors Mauro Di Nasso, Lorenzo Luperi Baglini, Rosario Mennuni, Mariaclara Ragosta, Alessandro Vegnuti

Spectral Theory

Absence of ballistic motion and presence of almost-ballistic motion for unitary operators with pure point spectrum

We adapt two results of Simon and collaborators to the setting of discrete-time unitary dynamics. We show that pure point spectrum precludes ballistic motion, and exhibit a family of examples showing that this is sharp within the class of extended Cantero–Moral-Velázquez (CMV) matrices: that is, there exist extended CMV matrices exhibiting pure point spectrum together with quantum dynamics as close to ballistic motion as one desires.
Read the full abstract

Number Theory

Joint distribution of leftmost digits in positional notation and Schanuels's conjecture

Assume that $n \geq 2$ and $B = (b_1,...,b_n)$ has distince integer entries $\geq 3.$ For $x > 0$ let $d_B(x) := (d_{b_1}(x),...,d_{b_n}(x))$ where $d_{b_i}(x) \in \{1,...,b_i-1\}$ is the leftmost digit in the base-$b_i$ positional notation representation of $x.$ We prove that if $d_B$ is surjective, then $\ln b_i$ and $\ln b_j$ are rationally independent whenever $i \neq j.$ We prove the converse for $n = 2,$ and for $n \geq 3$ if $\{\ln p : p \mbox{ prime} \}$ is algebraically independent, a condition implied by Schanuel's conjecture about transcendental numbers.
Read the full abstract

Optimization and Control

Robust principal component analysis with rank and cardinality regularization under matrix factorization

Robust principal component analysis is an important representative method in data analysis. It is usually viewed as an optimization problem involving the rank and $\ell_0$-norm of matrices. In this paper, we study the rank and $\ell_0$ regularized optimization problem and its matrix factorization problem. We establish their equivalences on global minimizers and stationary points, respectively. Furthermore, we construct a broadly applicable equivalent nonconvex relaxation framework for the constrained factorization model in the sense of global minimizers and stationary points with strong optimality conditions (called strong stationary points). For the general factorization problem with lower semicontinuous regularizers and a loss function whose gradient is locally Lipschitz, we propose a novel proximal gradient-based algorithm based on joint and alternating calculation with convergence to its limiting-critical points. The algorithm can attain the stationary points of the original problem and its adaptive counterpart can attain the strong stationary points of the factorization problem.
Read the full abstract

Number Theory

On the Frobenius number for three variables

For positive integers $a$, $b$, and $c$ which have no common divisor, the Frobenius number of $a$, $b$ and $c$ is defined to be the largest integer that cannot be expressed as a linear combination of $a$, $b$ and $c$ with non-negative integer coefficients. In 2017, Tripathi gave an algorithmic formula for the Frobenius number in three variables, however there were some minor inconsistencies in the formula. In this paper, we settle these inconsistencies.
Read the full abstract

Differential Geometry

Area minimising hypersurfaces mod $p$ do not admit immersed branch points

We show that area minimising hypersurfaces mod $p$ do not admit immersed branch points, namely branch points about which all classical singularities are immersed. Furthermore, we show that if an $n$-dimensional area minimising hypersurface mod $p$ is smoothly immersed outside a $\mathcal{H}^{n-1}$-null set, then it is in fact smoothly immersed outside a closed set of Hausdorff dimension at most $n-3$. These results are consequences of a more general analysis of immersed stable minimal hypersurfaces with a certain `alternating' orientation. Indeed, our proof does not rely on the minimising property other than through stationarity, stability, and the verification of simple structural properties of the hypersurface.
Read the full abstract

Complex Variables

Orthogonal polynomials in de Branges–Rovnyak spaces

Given a function $b$, holomorphic on the disc and bounded by 1, one can construct an associated reproducing kernel Hilbert space called the de Branges–Rovnyak space $H(b)$. We explore representations of such spaces via descriptions of the corresponding families of orthogonal polynomials. We find relevant structures in the linear systems involved in a diversity of cases when $b$ is rational. We also establish a form of invariance under some composition operators on $H(b)$ spaces.
Read the full abstract

Combinatorics

The Antisymmetric Line Graph

Let $G$ be a finite simple graph with oriented incidence matrix $D$. The signed graph on edge set $E(G)$ with adjacency matrix \[ A_{\mathcal A(G)}=D^{\mathsf T}D-2I \] is classical in the signed-line-graph literature. In this paper we study its canonical switching class as a source of invariants of the underlying unsigned graph. We prove that the switching class of $\mathcal A(G)$ determines $G$ up to isomorphism modulo isolated vertices, and we relate the frustration index $\ell(\mathcal A(G))$ to classical bipartization parameters. In particular, we show \[ \operatorname{def}(G)\le \ell(\mathcal A(G))\le (\Delta(G)-1)\operatorname{def}(G), \] and, for cubic graphs, \[ \ell(\mathcal A(G))=2\,\operatorname{oct}(G). \] We then prove the exact optimization identity \[ \ell(\mathcal A(G)) = \frac14\sum_{v\in V(G)} d(v)^2 -\frac14\max_{x\in\{\pm1\}^{E(G)}}\|Dx\|^2, \] so $\ell(\mathcal A(G))$ is exactly a Boolean edge-space Laplacian optimization problem. This yields a spectral lower bound in terms of the largest Laplacian eigenvalue, a cubic spectral lower bound on odd cycle transversal, and explicit family-level comparisons showing that the spectral and defect bounds govern different regimes: on odd cycles the spectral bound is asymptotically vacuous, while on complete multipartite graphs it already captures exactly $3/4$ of the true value of $\ell(\mathcal A(G))$. Thus the paper uses a classical signed line graph in a new way: as a source of combinatorial invariants of ordinary graphs, especially through frustration and odd-cycle-transversal phenomena.
Read the full abstract

Combinatorics

Resolving the Kohayakawa–Kreuter Conjecture for Families

A graph $G$ is $(a,b)$-sparse if every nonempty subgraph $H$ satisfies $e(H) \leq a v(H) - b$. We are interested in the conditions under which an $(a,b)$-sparse graph can be partitioned $E(G) = E(G_1) \cup E(G_2)$ such that for $i \in \{1,2\}$ we have that $G_i$ is $(a_i, b_i)$-sparse. Kuperwasser, Samotij, and Wigderson conjectured that a $(m,0)$-sparse graph can be partitioned into a $(1,1)$-sparse graph and a $(m,2m-1)$-sparse graph. We prove the conjecture in full. The Kohayakawa–Kreuter Conjecture for Families claims that $n^{-1/m_2}$ is the threshold function for the random graph being Ramsey a.a.s. for graph families $\mathcal{H}_1, \ldots \mathcal{H}_r$. Kuperwasser, Samotij, and Wigderson motivated their conjecture by proving that it is sufficient to establish the Kohayakawa–Kreuter Conjecture for Families.
Read the full abstract

Logic · Cross-listed from cs.LO

Bidirectional Interpolation for the Lambda-Calculus: Revisiting and Formalising Craig-Čubrić Interpolation

Craig's Interpolation theorem has a wide range of applications, from mathematical logic to computer science. Proof-theoretic techniques for establishing interpolation usually follow a method first introduced by Maehara for the Sequent Calculus and then adapted by Prawitz to Natural Deduction. The result can be strengthened to a proof-relevant version, taking proof terms into account: this was first established by Čubrić in the simply-typed lambda-calculus with sums and more recently in linear, classical and intuitionistic sequent calculi. We give a new proof of Čubrić's proof-relevant interpolation theorem by building on principles of bidirectional typing, and formalise it in Rocq.
Read the full abstract

Dynamical Systems · Cross-listed from eess.SY

Safe and Robust Domains of Attraction for Discrete-Time Systems: A Set-Based Characterization and Certifiable Neural Network Estimation

Analyzing nonlinear systems with attracting robust invariant sets (RISs) requires estimating their domains of attraction (DOAs). Despite extensive research, accurately characterizing DOAs for general nonlinear systems remains challenging due to both theoretical and computational limitations, particularly in the presence of uncertainties and state constraints. In this paper, we propose a novel framework for the accurate estimation of safe (state-constrained) and robust DOAs for discrete-time nonlinear uncertain systems with continuous dynamics, open safe sets, compact disturbance sets, and uniformly locally $\ell_p$-stable compact RISs. The notion of uniform $\ell_p$ stability is quite general and encompasses, as special cases, uniform exponential and polynomial stability. The DOAs are characterized via newly introduced value functions defined on metric spaces of compact sets. We establish their fundamental mathematical properties and derive the associated Bellman-type (Zubov-type) functional equations. Building on this characterization, we develop a physics-informed neural network (NN) framework to learn the corresponding value functions by embedding the derived Bellman-type equations directly into the training process. To obtain certifiable estimates of the safe robust DOAs from the learned neural approximations, we further introduce a verification procedure that leverages existing formal verification tools. The effectiveness and applicability of the proposed methodology are demonstrated through four numerical examples involving nonlinear uncertain systems subject to state constraints, and its performance is compared with existing methods from the literature.
Read the full abstract

Combinatorics

Concentration of the largest induced tree size of $G_{n,p}$ around the standard expectation threshold

Let $T(G)$ be the size of the largest induced tree of $G$, and let $G_{n,p}$ be the binomial random graph. Kamaldinov, Skorkin, and Zhukovskii proved that $T(G_{n,p})$ equals one of two consecutive values with high probability if $p$ is constant, and more recently, Oropeza extended this result to include all vanishing $p$ such that $p > n^{-\frac{e-2}{3e-2} + \epsilon}$, where $e$ is Euler's constant. We further extend this result to all vanishing $p$ such that $p \gg n^{-1/2} \ln^{3/2} n$, and furthermore, we show that, for $p$ such that $n^{-1} \ll p \ll n^{-1/2}, \ T(G_{n,p})$ cannot be concentrated at the standard expectation threshold.
Read the full abstract

Differential Geometry

On Simon's third gap conjecture for minimal surfaces in spheres

In this paper, continuing our previous work, we investigate the third gap problem in the Simon conjecture for closed minimal surfaces in the unit sphere. By developing refined third-order Simons-type integral identities and establishing new lower bounds for higher-order curvature terms, we obtain positive gap results throughout the entire interval $\left[\frac{5}{3},\frac{9}{5}\right]$ for the squared norm of the second fundamental form, including the endpoint cases. As an application, we establish a rigidity result for closed self-shrinkers.
Read the full abstract

Analysis of PDEs

Brunn-Minkowski Inequality for p-Harmonic Measures

We prove a Brunn–Minkowski inequality for a functional associated with p-harmonic measures for $1<p<n+1$, on a class of convex domains satisfying suitable conditions. Under an additional first-variation assumption, we also prove uniqueness up to dilation about the origin for the corresponding Minkowski problem. We also study geometric conditions involving level sets, support functions, and Gaussian curvature for the problem with a fixed inner body.
Read the full abstract

Probability

Universal approximation by signatures for infinite-dimensional rough paths

We establish universal approximation theorems for infinite-dimensional geometric rough paths, i.e., we show that continuous functions on the space of infinite-dimensional weakly geometric Hölder continuous rough paths can be approximated by functions that are linear in the signature of the path. The underlying topology determining continuity and compactness can be either the norm topology or the weak$^*$ topology. Whereas considerably more effort is required to obtain the universal approximation theorem with respect to the weak$^*$ topology, this setting ensures uniform approximation on norm-bounded sets. The motivation for establishing universal approximation theorems lies in the desire to approximate quantities derived from the solution of a stochastic partial differential equation. More specifically, our universal approximation theorems form the foundations of a novel approach to e.g. pricing of forward rates within the Heath–Jarrow–Morton–Musiela framework.
Read the full abstract

Algebraic Geometry

Hasse-Witt invariants of Calabi-Yau varieties

We define the Hasse-Witt invariant of Calabi-Yau varieties in two different ways. The first method is through Cartier operator and the second method is through the theory of Calabi-Yau modular forms developed by the third author. We conjecture that these two definitions are equivalent and provide many examples of Calabi-Yau varieties in support of this conjecture.
Read the full abstract

Probability

Distributional and Extremal Behaviour of Brownian Motion with Exponential Resetting

We study the distributional and asymptotic properties of the supremum of Brownian motion with drift and exponential resetting. We obtain an explicit renewal-type formula for the distribution of the supremum and then derive an approximation for its survival function. Moreover, we find the asymptotics of the tail distribution of the supremum and infimum. We also consider the stationary case and give a new explicit expression for the two-dimensional distributions of such processes.
Read the full abstract

Algebraic Geometry

On the coregularity of del Pezzo surfaces with du Val singularities

We compute the coregularity of del Pezzo surfaces with du Val singularities. To this aim, we study the relation between del Pezzo surfaces of degree $1$ and elliptic fibrations. It turns out that del Pezzo surfaces with positive coregularity correspond to isotrivial elliptic fibrations with some special properties. We also prove results about coregularity of del Pezzo surfaces over non-algebraically closed fields of characteristic $0$. Our results confirm the expectation that "most" del Pezzo surfaces have coregularity $0$, while del Pezzo surfaces with positive coregularity enjoy some special properties.
Read the full abstract