Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 25 March

Information Theory · Cross-listed from quant-ph

Finite-Degree Quantum LDPC Codes Reaching the Gilbert-Varshamov Bound

We construct asymptotically good nested Calderbank-Shor-Steane (CSS) code pairs from Hsu-Anastasopoulos codes and MacKay-Neal codes. For fixed balanced triples with even component degrees and $j_Z\ge4$, we prove that the coding rate stays bounded away from zero and that the relative distances on both sides stay bounded away from zero with probability tending to one as the blocklength grows. Moreover, within an explicit low-degree search window, we prove that all 56 balanced triples in that window with even common row degree, column degree at least four, and positive design quantum rate attain the classical Gilbert-Varshamov (GV) bound on both constituent sides, and consequently the CSS GV bound at fixed finite degree.
Read the full abstract

2603.24588 · 25 Mar · 55 pages, 5 figures. Expanded proofs and exact-rational certificates; corrected theorem scope and enumerator estimates; added actual-rate analysis; revised the certified-degree figure. Data and code: https://github.com/kasaikenta/finite-degree-gv-certificates

Optimization and Control · Cross-listed from cs.DS

Coordinating Spot and Contract Supply in Freight Marketplaces

The freight industry is undergoing a digital revolution, with an ever-growing volume of transactions being facilitated by digital marketplaces. A core capability of these marketplaces is the fulfillment of demand for truckload movements (loads) by procuring the services of carriers who execute them. Notably, these services are procured both through long-term contracts, where carriers commit capacity to execute loads (e.g., contracted fleet of drivers or lane-level commitments), and through short-term spot marketplaces, where carriers can agree to move individual loads for the offered price. This naturally couples two canonical problems of the transportation industry: contract assignment and spot pricing. In this work, we model and analyze the problem of coordinating long-term contract supply and short-term spot supply to minimize total procurement costs. We develop a Dual Frank Wolfe algorithm to compute shadow prices which allow the spot pricing policy to account for the committed contract capacity. We show that our algorithm achieves small relative regret against the optimal – but intractable – dynamic programming benchmark when the size of the market is large. Importantly, our Dual Frank Wolfe algorithm is computationally efficient, modular, and only requires oracle access to spot-pricing protocols, making it ideal for large-scale markets. Finally, we evaluate our algorithm on semi-synthetic data from a major Digital Freight Marketplace, and find that it yields significant savings ($\approx 10\%$) compared to a popular status-quo method.
Read the full abstract

Algebraic Geometry

Stable homology of strata of abelian differentials

We show that the homology of strata of abelian differentials stabilizes in a range where the number of simple zeros is large relative to the homological degree. In this range, we show that the rational cohomology agrees with the restriction of the tautological classes to the stratum, and that the rational Picard group is trivial for unprojectivized strata. Our proof method is to develop an $h$-principle for these strata, valid in a range of homological degrees that increases with the number of simple zeros. The same approach also applies to higher order differentials.
Read the full abstract

Probability

Gaussian limits of lattice Higgs models with complete symmetry breaking

Given any compact connected matrix Lie group $G$ and any lattice dimension $d\ge 2$, we construct a massive Gaussian scaling limit for the $G$-valued lattice Yang-Mills-Higgs theory in the "complete breakdown of symmetry" regime. This limit arises as the lattice spacing tends to zero and the (inverse) gauge coupling constant tends to infinity sufficiently fast, causing the theory to "abelianize" and yield a Gaussian limit. This complements a recent work by Chatterjee (arXiv:2401.10507), which obtained a similar scaling limit in the special case $G= SU(2)$.
Read the full abstract

Number Theory

On Maximal Values of Gronwall Numbers for Integers with Given Greatest Prime Factor and Remainder in Modified Mertens Formula

The unconditional, i.e. without assuming validity of RH, sharp limit relationship (as p tends to infinity) is found between the remainder in the modified Mertens asymptotic formula for the sums of primes' reciprocals and maximal values of Gronwall numbers G(N) among all integers whose greatest prime factor is p and which are divided by any prime q<p. The proofs are based on the properties of G(N) studied in previous author's preprints.
Read the full abstract

Information Theory

Optimal Multidimensional Convolutional Codes

In this paper, we analyze $m$-dimensional ($m$D) convolutional codes with finite support, viewed as a natural generalization of one-dimensional (1D) convolutional codes to higher dimensions. An $m$D convolutional code with finite support consists of codewords with compact support indexed in $\mathbb{N}^m$ and taking values in $\mathbb{F}_{q}[z_1,\ldots,z_m]^n$, where $\mathbb{F}_{q}$ is a finite field with $q$ elements. We recall a natural upper bound on the free distance of an $m$D convolutional code with rate $k/n$ and degree~$\delta$, called $m$D generalized Singleton bound. Codes that attain this bound are called maximum distance separable (MDS) $m$D convolutional codes. As our main result, we develop new constructions of MDS $m$D convolutional codes based on superregularity of certain matrices. Our results include the construction of new families of MDS $mD$ convolutional codes of rate $1/n$, relying on generator matrices with specific row degree conditions. These constructions significantly expand the set of known constructions of MDS $m$D convolutional codes.
Read the full abstract

All authors Z. Abreu, J. Lieb, R. Pinto, R. Simoes

Statistics Theory

Detection of local geometry in random graphs: information-theoretic and computational limits

We study the problem of detecting local geometry in random graphs. We introduce a model $\mathcal{G}(n, p, d, k)$, where a hidden community of average size $k$ has edges drawn as a random geometric graph on $\mathbb{S}^{d-1}$, while all remaining edges follow the Erdős–Rényi model $\mathcal{G}(n, p)$. The random geometric graph is generated by thresholding inner products of latent vectors on $\mathbb{S}^{d-1}$, with each edge having marginal probability equal to $p$. This implies that $\mathcal{G}(n, p, d, k)$ and $\mathcal{G}(n, p)$ are indistinguishable at the level of the marginals, and the signal lies entirely in the edge dependencies induced by the local geometry. We investigate both the information-theoretic and computational limits of detection. On the information-theoretic side, our upper bounds follow from three tests based on signed triangle counts: a global test, a scan test, and a constrained scan test; our lower bounds follow from two complementary methods: truncated second moment via Wishart–GOE comparison, and tensorization of KL divergence. These results together settle the detection threshold at $d = \widetilde{\Theta}(k^2 \vee k^6/n^3)$ for fixed $p$, and extend the state-of-the-art bounds from the full model (i.e., $k = n$) for vanishing $p$. On the computational side, we identify a computational–statistical gap and provide evidence via the low-degree polynomial framework, as well as the suboptimality of signed cycle counts of length $\ell \geq 4$.
Read the full abstract

Numerical Analysis

Two-level nonlinear Schwarz methods - a parallel implementation with application to nonlinear elasticity and incompressible flow problems

Nonlinear Schwarz methods are a type of nonlinear domain decomposition method used as an alternative to Newton's method for solving discretized nonlinear partial differential equations. In this article, the first parallel implementation of a two-level nonlinear Schwarz method leveraging the GDSW-type coarse spaces from the Fast and Robust Overlapping Schwarz (FROSch) framework in Trilinos is presented. This framework supports both additive and hybrid two-level nonlinear Schwarz methods and makes use of modifications to the coarse spaces constructed by FROSch to further enhance the robustness and convergence speed of the methods. Efficiency and excellent parallel performance of the software framework are demonstrated by applying it to two challenging nonlinear problems: the two-dimensional lid-driven cavity problem at high Reynolds numbers, and a Neo-Hookean beam deformation problem. The results show that two-level nonlinear Schwarz methods scale exceptionally well up to 9\,000 subdomains and are more robust than standard Newton-Krylov-Schwarz solvers for the considered Navier-Stokes problems with high Reynolds numbers or, respectively, for the nonlinear elasticity problems and large deformations. The new parallel implementation provides a foundation for future research in scalable nonlinear domain decomposition methods and demonstrates the practical viability of nonlinear Schwarz techniques for large-scale simulations.
Read the full abstract

Numerical Analysis

Mitigating Barren Plateaus via Domain Decomposition in Variational Quantum Algorithms for Nonlinear PDEs

Barren plateaus present a major challenge in the training of variational quantum algorithms (VQAs), particularly for large-scale discretizations of nonlinear partial differential equations. In this work, we introduce a domain decomposition framework to mitigate barren plateaus by localizing the cost functional. Our strategy is based on partitioning the spatial domain into overlapping subdomains, each associated with a localized parameterized quantum circuit and measurement operator. Numerical results for the time-independent Gross-Pitaevskii equation show that the domain-decomposed formulation, allowing subdomain iterations to be interleaved with optimization iterations, exhibits improved solution accuracy and stable optimization compared to the global VQA formulation.
Read the full abstract

All authors Laila S. Busaleh, Jeonghyeuk Kwon, Orlane Zang, Muhammad Hassan, Yvon Maday

Representation Theory

The spectrum of Anosov representations

Given a $P$-Anosov representation into a noncompact semisimple real algebraic group $G$, where $P < G$ is a parabolic subgroup, we construct a natural resonance spectrum for the classical dynamics associated with the representation. This spectrum is a complex analytic hypersurface in $(\mathfrak{a}_P^*)_{\mathbb{C}}$, the complexified dual of the Lie algebra of the split component of the associated Levi group $L < P$. We reinterpret several objects from the theory of Anosov representations within this spectral framework and investigate, in higher rank, questions that are classically related to Pollicott-Ruelle theory in the rank-one setting. In particular, the “leading resonance”–which is now a hypersurface–is identified with the critical hypersurface of the representation and, as in the rank-one case, the resonant states lead to continuous families of invariant measures. We prove that the multivariate zeta functions and Poincaré series associated with Anosov representations admit a meromorphic extension to $(\mathfrak{a}_P^*)_{\mathbb{C}}$. We also establish an asymptotic expansion in inverse powers of time for the correlation function of the diagonal flow under a Diophantine condition on the representation. Most of our results concerning Anosov representations are obtained as a byproduct of a general theory of Axiom A actions of type $(k,1)$, where $k+1:=\dim \mathfrak{a}_P$, that we introduce in the article.
Read the full abstract

Information Theory

Pseudo-MDP Convolutional Codes for Burst Erasure Correction

Convolutional codes are a class of error-correcting codes that performs very well over erasure channels with low delay requirements. In particular, Maximum Distance Profile (MDP) convolutional codes, which are defined to have optimal column distances, are able to correct a maximal number of erasures in decoding windows of fixed sizes. However, the required field size in the known constructions for MDP convolutional codes increases rapidly with the code parameters. On the other hand, if the code parameters are small, larger bursts of erasures cannot be corrected. In this paper, we present a new class of convolutional codes, which we call Pseudo-MDP convolutional codes. By definition these codes can correct large bursts of erasures within a prescribed time-delay and still keep part of the advantageous properties of MDP convolutional codes, in the sense that we require some but not all column distances to be optimal. This release in the condition on the column distances allows us to construct Pseudo-MDP convolutional codes over fields of smaller size than those required for MDP convolutional codes with the same code parameters.
Read the full abstract

Combinatorics

Two counterexamples to a conjecture about even cycles

A conjecture of Verstraëte states that for any fixed $\ell < k$ there exists a positive constant $c$ such that any $C_{2k}$-free graph $G$ contains a $C_{2\ell}$-free subgraph with at least $c |E(G)|$ edges. For $\ell = 2$, this conjecture was verified by Kühn and Osthus in 2004. We identify two counterexamples to this conjecture for $\ell = 4$ and $k=5$: the first comes from a recent construction of a dense $C_{10}$-free subgraph of the hypercube and the second from Wenger's construction for extremal $C_{10}$-free graphs.
Read the full abstract

Optimization and Control

Optimal control of infinite-dimensional dissipative systems

We study the linear-quadratic optimal control problem for infinite-dimensional dissipative systems with possibly indefinite cost functional. Under the assumption that a storage function exists, we show that this indefinite optimal control problem is equivalent to a linear-quadratic optimal control problem with a nonnegative cost functional. We establish the relationship between the corresponding value functions and present the associated operator Lur'e equation. Finally, we illustrate our results with several examples.
Read the full abstract

Number Theory

Legendre compressions and an integrality conjecture for the Hörmander–Bernhardsson extremal function

We prove Conjecture~2 of Bondarenko, Ortega-Cerdà, Radchenko, and Seip for the three-term recurrence attached to the Hörmander–Bernhardsson extremal function $\varphi$. More precisely, define \[ \widetilde u_{-1}=0,\qquad \widetilde u_0=1, \] and \[ \widetilde u_{n+1} = \frac{4n+2}{n+1}\bigl(n(n+1)-\lambda\bigr)\widetilde u_n + \frac{4n}{n+1}x\,\widetilde u_{n-1}. \] Then \[ \widetilde u_n(x,\lambda)\in\mathbb Z[x,\lambda] \qquad(n\ge0). \] The proof is a determinant comparison in the scaled Legendre basis. After sign reversal and central-binomial normalization, the recurrence becomes exactly the continuant recurrence of a finite tridiagonal compression. In particular, if $T_n(a,\lambda)$ denotes the $n$th BOCRS tridiagonal truncation, then \[ \widetilde u_{n+1}(a^2,\lambda)=\binom{2n+2}{n+1}\det T_n(a,\lambda). \] As consequences, we derive that \[ \left(\frac{\pi}{4C}\right)^2 \quad\text{and}\quad -\frac{L_\tau(1)}{2C} \] are not simultaneously rational, where \(C\) is the sharp point-evaluation constant for $PW^1$, $\pm\tau_n$ are the nonzero zeros of $\varphi$, and $ L_\tau(1)=\sum_{n\ge1}\frac{(-1)^n}{\tau_n}.$ Finally, if we write $\varphi(z)=\sum_{n\ge0}c_n z^{2n},$ then \[ c_n\in C^n\,\mathbb Z[\pi^2,C,L_\tau(1)] \qquad(n\ge0). \]
Read the full abstract

Group Theory

A new source of purely finite matricial fields

A countable group $G$ is said to be matricial field (MF) if it admits a strongly converging sequence of approximate homomorphisms into matrices; i.e, the norms of polynomials converge to those in the left regular representation. $G$ is purely MF (PMF) if these maps are actual homomorphisms, and $G$ is further purely finite field (PFF) if the image of each homomorphism is finite. By developing a new operator algebraic approach to these problems, we are able to prove the following result bringing several new examples into the fold. Suppose $G$ is a MF (resp., PMF, PFF) group and $H<G$ is separable (i.e., $H=\cap_{i\in \mathbb{N}}H_i$ where $H_i<G$ are finite index subgroups) and $K$ is a residually finite MF (resp., PMF, PFF) group. If either $G$ or $K$ is exact, then the amalgamated free product $G*_{H}(H\times K)$ is MF (resp., PMF, PFF). Our work has several applications, we list some below: 1. The Brown–Douglas–Fillmore semigroups of many new examples of reduced group $C^*$-algebras are shown to be not groups. 2. Arbitrary group doubles $G*_HG$ of MF (resp., PMF, PFF) over separable subgroups $H$ are MF (resp., PMF, PFF). Moreover, $G*H$ is PFF whenever $G,H$ are PFF, and either $G$ or $H$ is exact. 3. Arbitrary graph products of residually finite exact MF (resp., PMF, PFF) groups are MF (resp., PMF, PFF), yielding a significant generalization of the breakthrough work of M. Magee and J. Thomas. 4. The open problem of proving PFF for fundamental groups of closed hyperbolic 3-manifolds is resolved. This has geometric significance in the theory of minimal surfaces via A. Song's approach.
Read the full abstract

All authors David Gao, Srivatsav Kunnawalkam Elayavalli, Aareyan Manzoor, Gregory Patchell

2603.24502 · 25 Mar · 15 pages. For Vidhya Ranganathan. v2: Fixed typo in Corollary 1.4. v3: improved readability; added section 1.3: optimality of results, explicitness/concreteness of matrix models, further bootstrapping, insights into proof; added more details and explanation in Lemma 2.3. v4. minor changes and expanded on geometric significance, thanks to A. Song. v5. minor changes around references

Probability

A central limit theorem for connected components of random coverings of manifolds with nilpotent fundamental groups

There is a well understood way of generating random coverings of a fixed manifold by sampling homomorphisms from the fundamental group of this manifold into the symmetric group. We prove a central limit theorem for the number of connected components of these random coverings when the fundamental group is nilpotent. This provides a nonabelian generalization of an earlier result by the author and Shannon Starr in the case of the torus where the fundamental group is a free abelian group of rank at least two. Our result relies on the work of du Sautoy and Grunewald on the subgroup growth zeta functions of nilpotent groups, and on Delange's generalization of the Wiener-Ikehara Tauberian theorem.
Read the full abstract

Analysis of PDEs

Propagation of singularities and inverse problems for the viscoacoustic wave equation

We study an inverse problem for the viscoacoustic wave equation, an integro-differential model describing wave propagation in viscoacoustic media with memory in the leading order term. The medium is characterized by a spatially varying sound speed and a space-time dependent memory kernel. Assuming that waves are generated by sources supported outside the region of interest, we consider exterior measurements encoded by the source-to-solution map. To study this inverse problem, we construct solutions concentrating near fixed geodesics and establish a corresponding propagation of singularities result for the semiclassical wave front set. These results are valid without any restriction on the underlying sound speed. Then, under certain geometric conditions, we prove that the exterior data uniquely determine not just the sound speed inside the domain but also all time derivatives at zero of the memory kernel. This involves a reduction to the lens rigidity and geodesic ray transform inverse problems. As an application, we establish uniqueness for the recovery of variable parameters in the extended Maxwell model.
Read the full abstract

Statistics Theory

Reflected diffusion models adapt to low-dimensional data

While the mathematical foundations of score-based generative models are increasingly well understood for unconstrained Euclidean spaces, many practical applications involve data restricted to bounded domains. This paper provides a statistical analysis of reflected diffusion models on the hypercube $[0,1]^D$ for target distributions supported on $d$-dimensional linear subspaces. A primary challenge in this setting is the absence of Gaussian transition kernels, which play a central role in standard theory in $\mathbb{R}^D$. By employing an easily implementable infinite series expansion of the transition densities, we develop analytic tools to bound the score function and its approximation by sparse ReLU networks. For target densities with Sobolev smoothness $\alpha$, we establish a convergence rate in the $1$-Wasserstein distance of order $n^{-\frac{\alpha+1-\delta}{2\alpha+d}}$ for arbitrarily small $\delta > 0$, demonstrating that the generative algorithm fully adapts to the intrinsic dimension $d$. These results confirm that the presence of reflecting boundaries does not degrade the fundamental statistical efficiency of the diffusion paradigm, matching the almost optimal rates known for unconstrained settings.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Uniform Laws of Large Numbers in Product Spaces

Uniform laws of large numbers form a cornerstone of Vapnik–Chervonenkis theory, where they are characterized by the finiteness of the VC dimension. In this work, we study uniform convergence phenomena in cartesian product spaces, under assumptions on the underlying distribution that are compatible with the product structure. Specifically, we assume that the distribution is absolutely continuous with respect to the product of its marginals, a condition that captures many natural settings, including product distributions, sparse mixtures of product distributions, distributions with low mutual information, and more. We show that, under this assumption, a uniform law of large numbers holds for a family of events if and only if the linear VC dimension of the family is finite. The linear VC dimension is defined as the maximum size of a shattered set that lies on an axis-parallel line, namely, a set of vectors that agree on all but at most one coordinate. This dimension is always at most the classical VC dimension, yet it can be arbitrarily smaller. For instance, the family of convex sets in $\mathbb{R}^d$ has linear VC dimension $2$, while its VC dimension is infinite already for $d\ge 2$. Our proofs rely on estimator that departs substantially from the standard empirical mean estimator and exhibits more intricate structure. We show that such deviations from the standard empirical mean estimator are unavoidable in this setting. Throughout the paper, we propose several open questions, with a particular focus on quantitative sample complexity bounds.
Read the full abstract

Quantum Algebra

Cyclic adjoint modules and their embeddings in quantized enveloping algebras

We study cyclic adjoint modules arising from the relative locally finite part of the adjoint action of a quantum Levi subalgebra on a quantized enveloping algebra. We classify embeddings of finite-dimensional irreducible modules inside of quantized enveloping algebra via cyclic generators and show that such realizations are in general non-unique, exhibiting infinite families in the cominuscule case. We also introduce a partial order on cyclic adjoint modules, characterize its minimal elements, and prove finite generation by irreducible submodules.
Read the full abstract

Optimization and Control

Model Predictive Path Integral Control as Preconditioned Gradient Descent

Model Predictive Path Integral (MPPI) control is a widely used sampling-based method for trajectory optimization, yet its convergence properties remain only partially understood. This paper provides a direct convergence analysis using variational optimization. By lifting constrained trajectory optimization to a Kullback-Leibler (KL) regularized problem over decision distributions, we derive a reduced free-energy objective defined over a parametric sampling family. For general parametric families, we derive gradient and Hessian representations of this reduced objective and analyze preconditioned gradient descent on the sampling-distribution parameters. In the fixed-covariance Gaussian case, the classical MPPI update is recovered exactly as a unit-step preconditioned gradient update. We prove descent and stationarity guarantees for the exact expectation-based iteration when the Hessian of the reduced objective is bounded in the metric induced by the preconditioner. For the Gaussian family, we further show that the preconditioned Hessian is governed by the covariance of the Gibbs-tilted distribution relative to the covariance of the sampling distribution, yielding a covariance-dependent sufficient condition for the descent of exact unit-step MPPI. Numerical experiments illustrate the theory and the effect of key hyperparameters.
Read the full abstract

Analysis of PDEs

Young's law for a nonlocal isoperimetric model of charged capillarity droplets

We study a variational problem modeling equilibrium configurations of charged liquid droplets resting on a surface under a convexity constraint. In the two-dimensional case with Coulomb interactions, we establish the validity of Young's law for the contact angle for small enough charges.
Read the full abstract

Analysis of PDEs

Liouville theorem and sharp solvability for solutions of the parabolic Monge-Ampère equation with periodic data

We prove a Liouville Theorem for ancient solutions of the parabolic Monge-Ampère equation with smooth periodic data, generalizing Caffarelli-Li's result \cite{cl04} in 2004 to the parabolic background. To achieve this, we obtain a necessary and sufficient condition for the existence of the smooth periodic solution of the equation $\left(1-u_t\right)\det \left(D_x^2u+I\right)=f$ in $\mathbb{R}^{n+1}$, where $f$ is smooth and periodic in both spatial and temporal variables. This parabolic existence theorem parallels the elliptic counterpart established by Li \cite{l90} in 1990.
Read the full abstract

Probability

The conformal dimension of the Brownian sphere is two

The conformal dimension of a metric space $(X, d)$ is equal to the infimum of the Hausdorff dimensions among all metric spaces quasisymmetric to $(X, d)$. It is an important quasisymmetric invariant which lies non-strictly between the topological and Hausdorff dimensions of $(X, d)$. We consider the conformal dimension of the Brownian sphere (a.k.a. the Brownian map), whose law can be thought of as the uniform measure on metric measure spaces homeomorphic to the standard sphere $\mathbf S^2$ with unit area. Since the Hausdorff dimension of the Brownian sphere is $4$, its conformal dimension lies in $[2, 4]$. Our main result is that its conformal dimension is equal to $2$, its topological dimension.
Read the full abstract

Algebraic Geometry

Weighted Cohomology, Hodge Theory and Intersection Cohomology of Shimura varieties

We prove that the intersection cohomology of the Baily-Borel compactification of a complex Shimura variety is identified with the top weight quotient of the mixed Hodge structure on the reductive Borel-Serre compactification. This yields canonical cup products and functorial pullbacks on the intersection cohomology. As an application, we introduce canonical cycle classes associated to special cycles, relating analytic geometric volumes of non-compact Shimura varieties to topological terms.
Read the full abstract

Spectral Theory

Continuum Fibonacci Schrödinger Operators in the Strongly Coupled Regime

We study Schrödinger operators on the real line whose potentials are generated by the Fibonacci substitution sequence and a rule that replaces symbols by compactly supported potential pieces. We consider the case in which one of those pieces is identically zero, and study the dimension of the spectrum in the large-coupling regime. Our results include a generalization of theorems regarding explicit examples that were studied previously and a counterexample that shows that the naïve generalization of previously established statements is false. In particular, in the aperiodic case, the local Hausdorff dimension of the spectrum does not necessarily converge to zero uniformly on compact subsets as the coupling constant is sent to infinity.
Read the full abstract

All authors David Damanik, Mark Embree, Jake Fillman, Anton Gorodetski, May Mei

Numerical Analysis

Analysis and numerical simulation of a spatio-temporal Ricker-type model for the control of Aedes aegypti mosquitoes with Sterile Insect Techniques

Sterile Insect Technique (SIT) is widely regarded as a promising, environmentally friendly and chemical-free strategy for the prevention and control of dengue and other vector-borne diseases. In this paper, we develop and analyze a spatio-temporal reaction-diffusion model describing the dynamics of three mosquito subpopulations involved in SIT-based biological control of Aedes aegypti mosquitoes. Our sex-structured model explicitly incorporates fertile females together with fertile and sterile males that compete for mating. Its key features include spatial mosquito dispersal and the incorporation of spatially heterogeneous external releases of sterile individuals. We establish the existence and uniqueness of global, non negative, and bounded solutions, guaranteeing the mathematical well-posedness and biological consistency of the system. A fully discrete numerical scheme based on the finite element method and an implicit-explicit time-stepping scheme is proposed and analyzed. Numerical simulations confirm the presence of a critical release-size threshold governing eradication versus persistence at a stable equilibrium with reduced total population size, in agreement with the underlying ODE dynamics. Moreover, the spatial structure of the model allows us to analyze the impact of spatial distributions, heterogeneous releases, and periodic impulsive control strategies, providing insight into the optimal spatial and temporal deployment of SIT-based interventions.
Read the full abstract

All authors Oscar Eduardo Escobar-Lasso, Stefan Frei, Reinhard Racke, Olga Vasilieva

Optimization and Control

Optimal local interventions in the two-dimensional Abelian sandpile model

The Abelian sandpile model serves as a canonical example of self-organized criticality. This critical behavior manifests itself through large cascading events triggered by small perturbations. Such large-scale events, known as avalanches, are often regarded as stylized representations of catastrophic phenomena, such as earthquakes or forest fires. Motivated by this perspective, we study strategies to reduce avalanche sizes. We provide a first rigorous analysis of the impact of interventions in the Abelian sandpile model, considering a setting in which an external controller can perturb a configuration by removing sand grains at selected locations. We first develop and formalize an extended method to compute the expected size of an avalanche originating from a connected component of critical vertices, i.e., vertices at maximum height. Using this method, we characterize the structure of avalanches starting from square components and explicitly analyze the effect of interventions in such components. Our results show that the optimal intervention locations strike an interesting balance between reduction of largest avalanche sizes and increasing the number of mitigated avalanches.
Read the full abstract

Analysis of PDEs

Optimal Asymptotic Behavior at Infinity of Ancient Solution to the Parabolic Monge-Ampère Equation with Slow Perturbation Term

In this paper, we obtain optimal asymptotic behavior of parabolically convex $C^{2,1}$ solution to the parabolic Monge-Ampère equation $-u_t\det D_x^2u=f$, where $f$ converges to $1$ at infinity with a slow rate. This result extends the elliptic estimate in \cite{lb5} to the parabolic setting.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.str-el

Intertwined spin and charge dynamics in one-dimensional supersymmetric t-J model

Following the Bethe ansatz we determine the dynamical spectra of the one-dimensional supersymmetric t-J model. A series of fractionalized excitations are identified through two sets of Bethe numbers. Typical patterns in each set are found to yield wavefunctions containing elementary spin and charge carriers, manifested as distinct boundaries of the collective excitations in the spectra of single electron Green functions. In spin channels, gapless excitations fractionalized into two spin and a pair of postive and negative charge carriers, extending to finite energy as multiple continua. These patterns connect to the half-filling limit where only fractionalized spinons survive. In particle density channel, apart from spin-charge fractionalization, excitations involving only charge fluctuations are observed. Furthermore, nontrivial Bethe strings encoding bound state structure appear in channels of reducing or conserving magnetization, where spin and charge constituents can also be identified. These string states contribute significantly even to the low-energy sector in the limit of vanishing magnetization.
Read the full abstract