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)

Thursday 19 March

Optimization and Control

A new optimal control algorithm for the Keller-Segel problem

In this work we introduce a new optimal control algorithm for the Keller-Segel chemo-attraction system, where both boundary and distributed controls are considered and both are associated with introducing/removing the amount of chemical substances in the system. The key idea of our approach is to design the optimal control algorithm after discretizing the state problem system, which is done using an upwind finite volume scheme in space and a semi-implicit finite difference in time. Then, the discrete optimal control is approximated identifying the gradient of the reduced discrete cost via the discrete adjoint scheme. Finally, to minimize the reduced cost functional, we use a gradient descent type method (Adam scheme). Moreover, several numerical results are presented to illustrate the efficiency of the proposed approach.
Read the full abstract

All authors F. Guillen-Gonzalez, F. Palmero-Ramos, M.A. Rodriguez-Bellido, G. Tierra

Functional Analysis

Chain recurrent shifts on trees

We characterize when a weighted backward shift is chain recurrent on the $\ell^p$ ($1\leq p<\infty$) and $c_0$ spaces of a directed tree. The characterization is given in terms of two divergence conditions on the weights: a forward condition on the descendants of each vertex and, in the unrooted case, a backward condition on the descendants of each ancestor. The conditions reduce, in the case of symmetric weighted shifts on symmetric trees, to the classical characterizations of chain recurrence on the sequence spaces $\ell^p(\mathbb{N})$, $\ell^p(\mathbb{Z})$, $c_0(\mathbb{N})$, and $c_0(\mathbb{Z})$.
Read the full abstract

Numerical Analysis

A divided difference identity for a class of multiple integrals

We derive an identity that relates a class of multiple integrals involving Vandermonde polynomials to divided differences. Alternatively the identity can be viewed as an integral formula for divided differences. As part of the derivation we show that both sums of pure partial derivatives and mixed partial derivatives of Vandermonde polynomials are zero, which might be of independent interest.
Read the full abstract

Number Theory · Cross-listed from cs.FL

State Complexity of Shifts of the Fibonacci Word

The Fibonacci infinite word ${\bf f} = (f_i)_{i \geq 0} = 01001010\cdots$ is one of the most celebrated objects in combinatorics on words. There is a simple $5$-state automaton that, given $i$ in lsd-first Zeckendorf representation, computes its $i$'th term $f_i$, and a $2$-state automaton for msd-first. In this paper we consider the state complexity of the automaton generating the shifted sequence $(f_{i+c})_{i \geq 0}$, and show that it is $O(\log c)$ for both msd-first and lsd-first input. This is close to the information-theoretic minimum for an aperiodic sequence. The techniques involve a mixture of state complexity techniques and Diophantine approximation.
Read the full abstract

All authors Delaram Moradi, Pierre Popoli, Jeffrey Shallit, Ingrid Vukusic

Information Theory

BeamAgent: LLM-Aided MIMO Beamforming with Decoupled Intent Parsing and Alternating Optimization for Joint Site Selection and Precoding

Integrating large language models (LLMs) into wireless communication optimization is a promising yet challenging direction. Existing approaches either use LLMs as black-box solvers or code generators, tightly coupling them with numerical computation. However, LLMs lack the precision required for physical-layer optimization, and the scarcity of wireless training data makes domain-specific fine-tuning impractical. We propose BeamAgent, an LLM-aided MIMO beamforming framework that explicitly decouples semantic intent parsing from numerical optimization. The LLM serves solely as a semantic translator that converts natural language descriptions into structured spatial constraints. A dedicated gradient-based optimizer then jointly solves the discrete base station site selection and continuous precoding design through an alternating optimization algorithm. A scene-aware prompt enables grounded spatial reasoning without fine-tuning, and a multi-round interaction mechanism with dual-layer intent classification ensures robust constraint verification. A penalty-based loss function enforces dark-zone power constraints while releasing optimization degrees of freedom for bright-zone gain maximization. Experiments on a ray-tracing-based urban MIMO scenario show that BeamAgent achieves a bright-zone power of 84.0\,dB, outperforming exhaustive zero-forcing by 7.1 dB under the same dark-zone constraint. The end-to-end system reaches within 3.3 dB of the expert upper bound, with the full optimization completing in under 2 s on a laptop.
Read the full abstract

Combinatorics

Maximising homomorphism counts between digraphs

We prove a Sidorenko-type inequality for directed trees: for every oriented tree $T$ on $k$ vertices and every finite directed graph $G$, the homomorphism count hom$(T,G)$ is bounded above by the maximum of the two pure star counts hom$(S_{0,k-1},G)$ and hom$(S_{k-1,0},G)$. In other words, among all directed trees on $k$ vertices, the pure in- and out-stars maximise the homomorphism count into host digraphs. The proof is purely combinatorial, based on an iterative leaf-reallocation scheme combined with Hölder's inequality. We further investigate the corresponding homomorphism order on directed trees, discuss refinements via tail-truncation and pointwise bounds for rooted host graphs, and record several consequences, e.g. for random directed graph models and local weak limits, where the inequality reduces tree statistics to controlled pure in- and out-degree moments.
Read the full abstract

Optimization and Control

The multi-objective portfolio model for oil and gas exploration drilling projects selection and its operator-enhanced NSGA-II based solution

Drilling investment is pivotal to operational planning in oil and gas (O&G) exploration. Conventional deployment relies heavily on fragmented expert assessments of geological and economic factors, with limited integration ability of information. As the tool of portfolio show strong potential for mitigating uncertainty and selecting superior drilling plans, this study develops a multi-objective mean-variance portfolio model that accounts for geological-parameter uncertainty, enabling an effective risk-return trade-off and optimal selection. First, the probabilistic distribution of geological-parameters for prospect-list projects is obtained through expert-elicited priors. And considering the selection of the drilling projects as a portfolio, an optimization model is formulated jointly to describe the return and risk of short-term plan, under different constraints. Second, an improved OE-NSGA-II algorithm is proposed specifically for this model, in which (1) a directional crossover operator is designed to embed improving directions in objective space-derived from dominance and objective differences-into recombination, and (2) a structure-aware mutation operator is designed to prioritize high-utility bit flips via probabilistic sampling with feasibility repair, thus improving the search ability for superior Pareto solutions. Finally, using the case of 2023 exploration drilling deployment for verification, and then apply the validated method to the 2024 deployment to support decision-making. The results indicate that the proposed approach offers a reusable solution for drilling portfolio optimization in O&G exploration.
Read the full abstract

All authors Chao Min, Junyi Cui, Stanisław Migórski, Yonglan Xie, Qingxia Zhang, Jun Peng

Algebraic Geometry

Decorated Local Systems and Character Varieties

The focus of this paper is the study of the moduli space of representations of fundamental groupoids of surfaces $\Sigma$ with boundaries with values in $G:=GL_n(\mathbb C)$. In absence of marked points on the boundary, this moduli space is realized in many equivalent ways: as the moduli space of linear local systems on $\Sigma$, as the moduli space of representations of the fundamental groupoid $\Pi_1 (\Sigma)$, as the space of monodromy data and as character variety. By adding marked points to the boundary of $\Sigma$ in order to capture irregular singularities, the Betti moduli space has been generalized in several ways by many authors. Although it is clear that these different approaches describe essentially the same spaces of mathematical objects, exactly how they fit together has not yet been established. Motivated by the broader programme of establishing an explicit and conceptually coherent relationship between the existing approaches to the study of the decorated Betti moduli space, in this paper, we develop a categorical framework that allows for a systematic definition of the \dfn{decorated Betti moduli spaces} space, in the presence of higher order poles, designed to specialize to the different points of view encountered in the literature.
Read the full abstract

Information Theory

Robust Beamforming for Practical RIS-Aided RSMA Systems with Imperfect SIC under Transceiver Hardware Impairments

Reconfigurable intelligent surface (RIS)-aided rate-splitting multiple access (RSMA) systems have demonstrated remarkable potential in enhancing spectral efficiency. However, most existing works rely on ideal hardware, which is unrealistic.In practical deployments, RIS elements suffer from amplitude-phase coupling, where transceivers are subject to hardware impairments (HWI), and successive interference cancellation (SIC) in RSMA networks cannot achieve perfect interference elimination for decoded signals.To address these limitations, we investigate a robust beamforming design for RIS-aided RSMA systems under practical hardware imperfections. We first characterize the asymptotic signal-to-noise ratio (SNR) of practical RIS systems when the beamformer is designed based on ideal RIS model, thereby theoretically quantifying the resulting performance degradation. We then derive a closed-form expression for the distortion noise power induced by transceiver HWI, while also accounting for residual interference due to imperfect SIC. Building on these insights, we establish a comprehensive system model that jointly incorporates all hardware-induced impairments and formulate a multiuser sum rate maximization problem. To solve the resulting non-convex optimization problem, we develop an efficient block variable relaxation algorithm. Simulation results verify that the proposed scheme significantly outperforms conventional non-orthogonal multiple access (NOMA) approaches, and achieves superior robustness compared with benchmark schemes neglecting HWI, imperfect SIC, or amplitude-phase coupling.
Read the full abstract

All authors Xuejun Cheng, Qian Zhang, Yunnuo Xu, Zheng Dong, Ju Liu, Bruno Clerckx

Numerical Analysis

Model Order Reduction of Cerebrovascular Hemodynamics Using POD_Galerkin and Reservoir Computing_based Approach

We investigate model order reduction (MOR) strategies for simulating unsteady hemodynamics within cerebrovascular systems, contrasting a physics-based intrusive approach with a data-driven non-intrusive framework. High-fidelity 3D Computational Fluid Dynamics (CFD) snapshots of an idealised basilar artery bifurcation are first compressed into a low-dimensional latent space using Proper Orthogonal Decomposition (POD). We evaluate the performance of a POD-Galerkin (POD-G) model, which projects the Navier-Stokes equations onto the reduced basis, against a POD-Reservoir Computing (POD-RC) model that learns the temporal evolution of coefficients through a recurrent architecture. A multi-harmonic and multi-amplitude training signal is introduced to improve training efficiency. Both methodologies achieve computational speed-ups on the order of 10^2 to 10^3 compared to full-order simulations, demonstrating their potential as efficient and accurate surrogates for predicting flow quantities such as wall shear stress.
Read the full abstract

All authors Rahul Halder, Arash Hajisharifi, Kabir Bakhshaei, Gianluigi Rozza

Number Theory

Mahler's method and Carlitz logarithm

In 2007, Papanikolas established that if Carlitz logarithms of algebraic functions are linearly independent over the rational function field, then they are algebraically independent. The purpose of the present paper is to provide a new proof of this theorem using Mahler s method instead of the theory of t-motives. We revisit and extend the approach developed by Denis, which enabled him in 2006 to prove this result in the particular case of the logarithm of elements in Fq(theta) via a Mahler system.
Read the full abstract

Representation Theory

An automata-based test for bricks over string algebras

Motivated by the recent work of Deaconu, Mousavand and Paquette on the connection between infinite string bricks for certain gentle algebras and Sturmian words, we develop a decorated version of a deterministic automaton, called a multi-entry inverse automaton (MIA, for short) that accepts pointed words. We then associate an MIA $\mathsf M_{\Lambda\delta}$ over $\{0,1\}$ to a string algebra $\Lambda$, and show that strings over $\Lambda$ can be viewed as certain equivalence classes of the pointed words accepted by $\mathsf M_{\Lambda\delta}$. By defining (weak) brick words over this MIA, we show that a finite/infinite string module (resp. band module) is a brick if and only if every word in the associated equivalence class of pointed binary words is a brick word (resp. a weak brick word) over $\mathsf M_{\Lambda\delta}$. The result of Deaconu et al. follows as an immediate consequence.
Read the full abstract

Analysis of PDEs

Measure preserving maps with bounded total variation

Consider a piecewise affine Lipschitz map $\phi : \Omega \to \mathbb R$, where $\Omega \subset \mathbb R^d$ is an open set, and assume that $x \mapsto x + t \nabla \phi(x)$ is injective for almost every $t > 0$. In (J.-G. Liu, R.~L. Pego, Rigidly breaking potential flows and a countable Alexandrov theorem for polytopes, Pure Appl. Anal., 7(4), 2025) the authors conjecture that every such $\phi$ must be locally convex. We prove the result assuming additionally $\nabla \phi \in BV_{loc}(\Omega)$, for a more general class of measure preserving maps.
Read the full abstract

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

Extreme value statistics and some applications in statistical physics

These notes are based on lectures delivered by G. Schehr at the XVIth School on Fundamental Problems in Statistical Physics (FPSP), held in Oropa (Italy) from 30 June to 11 July 2025. After a brief introduction to extreme value statistics (EVS) for independent and identically distributed (IID) random variables, we discuss several paradigmatic examples of strongly correlated systems where classical extreme value theory no longer applies. In particular, we focus on time series generated by random walks and Brownian motion, as well as on eigenvalue statistics in random matrix theory. Emphasis is placed on applications of EVS to fundamental problems in statistical physics and disordered systems, including the Random Energy Model, stochastic search problems, as well as fluctuating interfaces, and directed polymers in random media within the Kardar-Parisi-Zhang universality class.
Read the full abstract

Dynamical Systems

Watanabe-Strogatz Invariants in the Liouvillian Dynamics of Coupled Phase Oscillators via the Koopman Framework

In dynamical systems, invariants, i.e., constants of motion conserved along the trajectory, play important roles in characterizing the system's dynamical behavior. Recent applications of the Koopman operator framework to nonlinear dynamical systems have provided new insights into the invariants. For a certain class of globally coupled phase oscillators, which serve as models for various synchronization phenomena, Watanabe and Strogatz proved the existence of N-3 invariants in N oscillator systems. In this study, we derive these invariants from an operator-theoretic perspective by exploiting the relation between Liouvillian (Perron-Frobenius) and Koopman descriptions of the dynamics. Exploiting a simple multiplicative property of functions under the action of the Liouvillian and Koopman operators, we explicitly construct a family of functions whose ratios yield the invariants of the underlying dynamics. Our analysis successfully reproduces the full set of N-3 invariants known in Watanabe-Strogatz theory, and offers an alternative spectral perspective. We demonstrate this approach for a well-studied class of phase models, including the Ermentrout-Kopell, pairwise Kuramoto, and higher-order Kuramoto models.
Read the full abstract

Geometric Topology

Fat distributions with Reeb directions need not be complex contact

It is well known that every complex contact $3$-manifold, when regarded as a real manifold, gives rise to a fat $(4,6)$-distribution that admits two Reeb directions. Nonetheless, it was an open question whether the converse was true. This was not known even at the level of germs. The present work completely answers this question in the negative. We construct the first example of a fat distribution with two Reeb directions that does not support a complex contact structure anywhere, not even locally nor up to diffeomorphism. This result answers an open question by Aritra Bhowmick.
Read the full abstract

Combinatorics

A Proof of a Conjecture of Móricz and Nagy on Rational-Value Sums

Móricz and Nagy introduced the problem of maximizing the number of $r$-element subsets with rational sums in an $n$-element set of irrational numbers, and showed that it is equivalent to an extremal zero-sum problem. They determined the exact maximum in several cases. For the remaining range, they presented an explicit construction of an $n$-element set of irrational numbers containing exactly $m\binom{n-m}{r-1}$ such subsets, where $m=\lfloor n/r\rfloor$. They conjectured that this construction is always optimal for any $1<r<n$. In this paper, we confirm that conjecture. Our proof combines an order-theoretic antichain argument for zero-sum subsets with a sharp maximization of the resulting binomial expressions. As a consequence, we determine exactly the maximum number of $r$-term zero-sum subsequences in sequences of $n$ nonzero integers.
Read the full abstract

Combinatorics

Minimum-excess coverings of complete graphs by 3-, 4-, and 5-cliques

We study two-level optimal coverings of the complete graph $K_v$ by cliques of orders $3$, $4$, and $5$. The first level minimizes the excess, namely the number of repeated edge occurrences, and the second level minimizes the number of cliques among coverings with minimum excess. We first isolate the two-size problem for triangles and 4-cliques, where the main congruence and local-degree methods already appear and where nonzero excess is unavoidable for one residue class of $v$. This motivates the passage to quintuples. For $\{K_3,K_4,K_5\}$ coverings we determine the minimum excess for every $v$, use an edge-count reduction for the secondary optimization, obtain exact values in ten residue classes modulo $20$, and give bounds for the remaining classes.
Read the full abstract

Number Theory

Simplest cubic fields with small class number

Let $m\in\mathbb{Z}$ be an integer and $L_m=\mathbb{Q}(\alpha)$ be the simplest cubic field with class number $h_m$ and conductor $\mathfrak{f}_m$ where $\alpha$ is a root of $f_m(X)=X^3-mX^2-(m+3)X-1$. Let $\mathcal{O}_{L_m}$ be the ring of integers of $L_m$. By using PARI/GP, we determine that if $[\mathcal{O}_{L_m}:\mathbb{Z}[\alpha]]=1$ $($resp. $3$, $27$$)$, i.e. $m^2+3m+9=\mathfrak{f}_m$ $($resp. $3\mathfrak{f}_m$, $27\mathfrak{f}_m$$)$, then there exist exactly $581$ (resp. $80$, $142$) integers $m\geq -1$ such that $h_m\leq 1000$. We also show that if $-1\leq m\leq 10^7$, then $h_m<16$ holds for $138=26+31+11+10+36+21+3$ integers $m$. More precisely, there exist $26$ $($resp. $31$, $11$, $10$, $36$, $21$, $3$$)$ integers $m$ with $-1\leq m\leq 10^7$ such that $h_m=1$ $($resp. $3$, $4$, $7$, $9$, $12$, $13$$)$ which are given explicitly. All computations of the class numbers and class groups of the listed fields are certified unconditionally. Under the GRH $($Generalized Riemann Hypothesis$)$, we confirm that these are the only such integers $m$ in the range $-1\leq m\leq 10^7$. We conjecture that the $26$ integers $m$ obtained above with $h_m=1$ are the only integers $m\geq -1$ with $h_m=1$.
Read the full abstract

Algebraic Geometry

The Legend of Masaki Kashiwara and Algebraic Analysis

This survey paper offers a concise introduction to Kashiwara's work on $\mathcal{D}$-modules, microlocal analysis and related subjects. In this way, we explain his role in the development of algebraic analysis.

Representation Theory

Silting theory and derived base change

We show that the silting theory of a locally finitely generated non-positive dg algebra over a complete local noetherian dg ring is determined by its derived closed fiber. More generally, we establish the invariance of silting theory under suitable derived base change. The key ingredient is a silting–simple-minded correspondence between the perfect derived category and the derived category with finite-length cohomology.
Read the full abstract

Differential Geometry

Index Estimates for CMC and Minimal Surfaces with Capillary Boundary

We prove that the index of a CMC surface with capillary boundary is bounded from above linearly by its genus, number of boundary components, and branching order, and also by some Willmore-type energy involving the area, mean curvature, contact angle, and ambient curvature. The main auxiliary theorem of more general interest is a comparison of the second variations of area and energy at a branched conformal map with boundary. In the appendix we derive the various second variation formulae for area, enclosed-volume, and wetting functionals away from critical points and for non-admissible variations, the purpose of which is to rather comprehensively fill a gap in the literature.
Read the full abstract

Numerical Analysis

Analysis of Convergence for the IPA-AC Method

The Improved Partial Area-Analytical Calculation (IPA-AC) method represents a leading meshfree discretization strategy for peridynamic models, distinguished by its rigorous geometric treatment of boundary intersections via dual corrections of integration weights and quadrature points. Despite its empirical success in suppressing boundary-induced geometric errors, a systematic theoretical characterization of its convergence behaviors under distinct scaling limits has remained elusive. This work establishes a unified convergence framework for the IPA-AC method applied to both scalar and tensor kernels. By leveraging the Lax Equivalence Theorem, we explicitly derive error estimates that reveal the method's performance across three critical limiting regimes. The theoretical analysis, substantiated by numerical validation, demonstrates that: (1) for a fixed horizon $\delta$, the method achieves robust second-order convergence $\mathcal{O}(h ^{2})$ with respect to the mesh size $h$; (2) for a fixed mesh, the discretization error scales as $\mathcal{O}(\delta^{-2})$, indicating a sensitivity to the nonlocal length scale; and (3) the method does not satisfy the Asymptotic Compatibility (AC) condition. These findings clarify that while the IPA-AC method offers superior accuracy for simulating fixed nonlocal models, it requires a sufficiently large horizon-to-mesh ratio to mitigate intrinsic discretization errors when approximating the local limit.
Read the full abstract

Analysis of PDEs

Physics-grounded Mechanism Design for Spectrum Sharing between Passive and Active Users

We propose a physics-grounded mechanism design for dynamic spectrum sharing that bridges the gap between radiometric retrieval constraints and economic incentives. We formulate the active and passive users coexistence problem as a Vickrey-Clarke-Groves (VCG) auctions mechanism, where the radiometer dynamically procures “quiet” time-frequency tiles from active users based on the marginal reduction in retrieval error variance. This approach ensures allocative efficiency and dominant-strategy incentive compatibility (DSIC). To overcome the computational intractability of exact VCG on large grids, we derive an approximation algorithm by using the monotone submodularity induced by the radiometer equation. AMSR-2-based simulations show that the approach avoids high-cost tiles by aggregating low-cost spectrum across time and frequency. In an interference-trap case study, the proposed framework reduces procurement costs by about 60% over a fixed-band baseline while satisfying accuracy targets.
Read the full abstract

All authors Jiguang Yu, Nicholas Brendle, Joel T. Johnson, David Starobinski

Analysis of PDEs

On single-frequency asymptotics for the Maxwell-Bloch equations: mixed states

We consider damped driven Maxwell-Bloch equations which are finite-dimensional approximation of the damped driven Maxwell-Schrödinger equations. The equations describe a single-mode Maxwell field coupled to a two-level molecule. Our main result is the construction of solutions with single-frequency asymptotics of the Maxwell field in the case of quasiperiodic pumping. The asymptotics hold for solutions with harmonic initial values which are stationary states of averaged equations in the interaction picture. We calculate all harmonic states and analyse their stability. The calculations rely on the Bloch-Feynman gyroscopic representation of von Neumann equation for the density matrix. The asymptotics follow by application of the averaging theory of the Bogolyubov type. The key role in the application of the averaging theory is played by a special a priori estimate.
Read the full abstract

Analysis of PDEs

Existence Theory for a Cross-Diffusion System with Independent Drifts: Mixing Dynamics

We consider a cross-diffusion system for which the diffusion of each species is governed solely by the aggregate density through a pressure law of logarithmic or fast diffusion type. The model is set over a one dimensional bounded interval, equipped with no-flux boundary conditions, and accommodates for the presence of potential drifts which are allowed to differ across each species. We establish the global existence of solutions without having to assume the total mixing of solutions. As a consequence, we give a full resolution of the PDE systems recently studied by the authors and by Elbar–Santambrogio, by allowing a general class of initial data with finite bounded variation, with no further structural assumptions on their supports.
Read the full abstract

Geometric Topology

Classification of (uncolored) bonded knots and links

We present a systematic classification of uncolored bonded knots with singularity number at most seven. Bonded knots provide a topological model for closed protein chains with intramolecular bridges, such as disulfide bonds. Following the tradition of knot tabulation, we describe a procedure based on the generation of planar graphs, their conversion into bonded knot diagrams, and the use of the Yamada polynomial together with brute-force Reidemeister moves to distinguish topological knotted types.
Read the full abstract

Number Theory

The triality of the twisted discrete trace formula for PGSO(8)

In this paper, we establish the triality twisted trace formula for PGSO(8), including its discrete part, and obtain a coarse classification of its automorphic representations by combining the properties of triality. By comparing the standard trace formula for G_2 with the triality twisted trace formula for PGSO(8), we derive a corresponding coarse classification for automorphic representations of G_2. Specifically, we construct the triality-twisted elliptic endoscopic data for PGSO(8), and the elliptic endoscopic data for G_2. Based on these constructions and the general framework of trace formulas, we establish the relevant trace formulas. Utilizing the triality property of PGSO(8), we obtain a coarse classification of its automorphic representations, which in turn yields a coarse classification for those of G_2.
Read the full abstract

Logic

Reverse mathematics and dimension of posets

Order dimension theory measures the complexity of partially ordered sets by quantifying how far they are from being linearly ordered. In this paper we study classical bounding results for order dimension within the framework of reverse mathematics. We focus on principles asserting that the dimension of a poset can be bounded in terms of the dimension of subposets obtained by removing chains or points, denoted by $\mathsf{DBi_n}$, $\mathsf{DBc_n}$, and $\mathsf{DB_p}$. We prove that, over $\mathsf{RCA}_0$, both $\mathsf{DBi_n}$ and $\mathsf{DBc_n}$ are equivalent to $\mathsf{WKL}_0$. To analyze $\mathsf{DB_p}$, we introduce a natural strengthening $\mathsf{DB^+_p}$ and show that both $\mathsf{DB_p}$ and $\mathsf{DB^+_p}$ are provable from $\mathsf{WKL}_0$ and from $\mathsf{I}\Sigma^0_2$, while $\mathsf{B}\Sigma^0_2$ does not suffice to prove $\mathsf{DB^+_p}$. The latter result is obtained by showing that the statement \lq\lq $\mathsf{DB^+_p}$ is computably true\rq\rq\ is equivalent to $\mathsf{I}\Sigma^0_2$.
Read the full abstract

Analysis of PDEs

Spreading of pathological proteins through brain networks: a case study for Alzheimers disease

Mathematical modeling offers a valuable approach to understanding Alzheimers disease (AD) given its complexity, unknown causes, and lack of effective treatments. Models, once validated, offer a powerful tool to test medical hypotheses that are otherwise difficult to verify directly. Our focus here is on elucidating the spread of misfolded tau protein, a critical hallmark of AD alongside Abeta protein, taking also into account the synergistic interaction between the two proteins. We consider distinct modelling choices, all employing network frameworks for protein evolution, differentiated by their network architecture and diffusion operators. By carefully comparing these models against clinical tau concentration data, gathered through advanced multimodal analysis techniques, we show that certain models replicate better the proteins dynamics. This investigation underscores a crucial insight: in modeling complex pathologies, the precision with which the mathematical framework is chosen is crucial, especially when validation against clinical data is considered decisive.
Read the full abstract

All authors G. Landi, A. Scaravelli, M.C. Tesi, C. Testa