Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 22 April
Recently S. Goswami proved that whenever the set $\mathbb N$ of natural numbers is finitely colored, the set $\{a, b, ab, b(a+1)\}$ is monochromatic which also established a variant of the long-standing Hindman's conjecture, which asks for a monochromatic set of the form $\{a, b, ab, a+b\}$. Actually he disproved a conjecture proposed by J. Sahasrabudhe that $\{a, b, a(b + 1)\}$ is not partition regular. In this paper we prove that $\{a, b, ab, b(a+1)\}$ is monochromatic near zero which means for every finite coloring of a dense subsemigroups of $((0, \infty), +)$, the set $\{a, b, ab, b(a+1)\}$ is monochromatic near zero or in other words, we will get $a, b$ in a dense subsemigroups of $((0, \infty), +)$ as small as we want such that the set $\{a, b, ab, b(a+1)\}$ is monochromatic for every finite coloring of that dense subsemigroups of $((0, \infty), +)$, also we show that the pattern $x, y, x+y, \frac{y}{x}$ is partition regular near zero.
Combinatorics
Carathéodory Number in Cycle Convexity
Let $G$ be a graph and $S \subseteq V(G)$. In the cycle convexity, we say that $S$ is cycle convex if for any $u\in V(G)\setminus S$, the induced subgraph of $S\cup\{u\}$ contains no cycle that includes $u$. The cycle convex hull of $S$, denoted by $\hullc (S)$, is the smallest cycle convex set containing $S$. A set $S \subseteq V(G)$ is said to be Carathéodory independent if there exists a vertex $u \in \hullc(S) $ such that $u \notin\displaystyle \bigcup_{a \in S} \hullc (S \setminus \{a\}) $, and the Carathéodory number $\car(G)$ is the maximum size of such a set. In this paper, we prove that given a graph $G$ and $k \in \mathbb{N}$, deciding whether $\car(G) \geq k$ is \NP-complete, even when $G$ is bipartite. On the other hand, we derive exact values and constant upper bounds for several graph classes, leading to polynomial-time algorithms. Some of them include forests, cycles, complete graphs, complete multipartite, split, and $P_4$-sparse graphs. In addition, we present a characterization of $n$-vertex graphs $G$ with extremal values near to $n$, including $\car(G) = n-1$ and $\car(G) = n-2$. Furthermore, we investigate the behavior of the Carathéodory number under graph products such as the strong, lexicographic, and Cartesian products.
Read the full abstract
Dynamical Systems
Rational maps with Cantor bubble Julia sets
It has been shown that Cantor bubble Julia sets can appear in the dynamics of polynomials and their singular perturbations. In this paper, we present a criterion that guarantees the existence of Cantor bubble Julia sets for certain rational maps with attracting or parabolic fixed points. Moreover, we construct other Cantor bubble Julia sets, including those with high-periodic attracting cycles and those with Hausdorff dimension two. Finally, we give a sufficient condition for Cantor bubble Julia sets to be quasisymmetrically equivalent to Cantor round bubbles.
Read the full abstract
Probability
Persistence and local extinction for superprocesses in random environments
We consider a super-Brownian motion $\{X_t, t\geq 0\}$ in a random environment described by a centered Gaussian field $\{W(t,x),t\geq 0, x\in\mathbb{R}^d\}$ whose correlation function is given by $\mathcal{C} (x,y)(t \wedge s)$. The process takes values in $\mathcal{M}(\mathbb{R}^d)$, the space of Radon measures on $\mathbb{R}^d$. It can be characterized through a conditional Laplace transform by a parabolic stochastic partial differential equation driven by $W(t, x)$. Suppose that $\mathcal{C} (x, y)\leq g(x-y)$ for some bounded positive function $g$ on $\mathbb{R}^d$ and the initial distribution of process $X$ is the Lebesgue measure $m$ on $\mathbb{R}^d$. We prove that for dimension $d\geq 3$, whenever $$ \sup_{x\in \mathbb{R}^d} \int_{\mathbb{R}^d} |x-y|^{2-d} g(y)dy< \frac{8 (d-2) \pi^{d/2}}{d 2^d \Gamma \left(d/2-1\right)}, $$ the distribution of $X_t$ converges weakly as $t \to \infty$ to a non-trivial invariant probability distribution $\pi^m$ on $\mathcal{M}(\mathbb{R}^d)$ with mean measure $m$. This result in particular gives an affirmative answer to Conjecture 1.4 of Mytnik and Xiong (Electron. J. Probab. 12: 1349-1378 (2007)). We further show that given $ \Theta \in C^\beta(\mathbb{R}^d)$ $(\beta>1)$, when $\mathcal{C}(x,y)= a \Theta (x-y)$ with $a$ being large enough, the superprocess $X$ suffers local extinction.
Read the full abstract
Number Theory
Minimal $a$-numbers of Artin–Schreier covers of ordinary curves
Let $k$ be a perfect field of characteristic $p>0$, and let $d$ be a positive integer not divisible by $p$. We define a non-empty Zariski open subset $U$ of the space of polynomials of degree $d$, and for $f(x)\in U(k)$, we compute the $a$-number of the curve defined by $y^p-y=f(x)$. This $a$-number realizes a lower bound given by Booher and Cais, so the latter is tight. Our result also implies that the bound of Booher and Cais for minimal $a$-numbers of Artin-Schreier covers of ordinary curves is tight.
Read the full abstract
Information Theory
Uniform Recovery of Structured Signals from Nonlinear Observations: Improved Error Rates
Consider the recovery of structured signals from nonlinear observations. Under Gaussian matrix and a large class of unknown nonlinear link functions, Plan and Vershynin (2016) showed that generalized Lasso achieves accurate nonuniform recovery of a fixed signal. More recently, Genzel and Stollenwerk (2023) showed that generalized Lasso is indeed capable of accurately recovering all structured signals. However, in some canonical settings with discontinuous link functions, their uniform recovery error rate is essentially slower than the nonuniform one. Specifically, in the recovery of $n$-dimensional $k$-sparse vectors from $m$ measurements, generalized Lasso with a perfectly tuned $\ell_1$ constraint achieves nonuniform error rate $ O(\sqrt{k\log(en/k)/m})$, while the uniform error rate of Genzel and Stollenwerk is no faster than $O((k\log(en/k)/m)^{1/4})$. In this paper, we narrow this gap by establishing improved uniform recovery guarantees under piecewise Lipschitz link functions with well-separated jump discontinuities. We analyze a projected gradient descent (PGD) algorithm whose projection can be onto a convex set or a cone, and our results for the PGD with a convex set are also valid for the generalized Lasso. In sparse recovery, the improved uniform error rates match the nonuniform rate $O(\sqrt{k\log(en/k)/m})$ up to logarithmic factors. Under the sign link function, we further show that iterative hard thresholding (a specific instance of the PGD) achieves uniform recovery error rate $O(\sqrt{k\log(en/k)/m})$, matching the nonuniform rate up to a universal constant. Technically, the uniform guarantees for the PGD are obtained by showing that the gradient maps satisfy the restricted approximate invertibility condition uniformly over all signals. We demonstrate that this is a general approach to uniform recovery under nonlinear observations.
Read the full abstract
Statistics Theory
Vertex misalignment and changepoint localization in network time series
Inference for time series of networks often relies on accurate vertex correspondence between network realizations at different times. In practice, such vertex alignments can be misspecified or unknown. We study the impact of errorful vertex alignment on changepoint localization for dynamic networks through two illustrative models, with the key distinction being whether changepoint information is contained in marginal or joint distributions of the time-varying latent positions. We compare localization techniques ranging from the simple network statistic of average degree to the modern procedure of Euclidean mirrors. Our results demonstrate that understanding the interplay of marginal and joint information in the observed network time series is key to robust network inference.
Read the full abstract
Tuesday 21 April
Optimization and Control
Low-Rank KKT Updates and a Parallel Flipping Mechanism for Model-Based Derivative-Free Optimization
Model-based derivative-free optimization relies on quadratic interpolation, but maintaining these models typically requires $\mathcal{O}(m^3)$ linear system solves. We show that for the least Frobenius norm updating model, the associated KKT matrix possesses a fixed inner-product structure. Both single-point replacements and a proposed coordinate-axis flipping operation induce exact Rank-2 perturbations to this matrix. Using this structure, we derive an $\mathcal{O}(n^2)$ update formula for the KKT inverse, eliminating costly refactorizations at each iteration. We integrate the update into a parallel trust-region algorithm where workers independently flip interpolation axes, refresh local models, and synchronize the best configuration. Tests on 530 benchmark problems show the method reduces model-maintenance overhead and achieves higher success rates under tight function-evaluation budgets compared to standard solvers.
Read the full abstract
Analysis of PDEs
Monotonicity Property of Non-Archimedean Heat Equation
We prove the monotone dependence of the heat kernel corresponding to the Vladimirov-Taibleson non-Archimedean fractional differentiation operator $D^\alpha$ on the order $\alpha$.
Rings and Algebras
Smith-Orbit Classification of Extensions and Exact-Sequence Asymmetry for C4*-Modules
Let $R$ be a ring and let a $C4^{\ast}$-module mean a module all of whose submodules are $C4$-modules. We first determine its asymmetric exact-sequence behavior: kernel closure is unconditional, while explicit commutative examples disprove split-extension and cokernel closure. We then classify the finite-length torsion objects over a Dedekind domain. A primary component is $C4$ exactly when it is homocyclic, and it is $C4^{\ast}$ exactly when it is cyclic or semisimple; in finite length $C4^{\ast}$ and strongly $C4^{\ast}$ coincide. The main result is a complete orbit calculation over a discrete valuation ring $V$. Put $A=(V/(\pi^a))^r$, $C=(V/(\pi^c))^s$ and $m=\min\{a,c\}$. Then \[ \Ext^1_V(C,A)\cong \operatorname{Mat}_{r\times s}(V/(\pi^m)), \] and the $\operatorname{Aut}(A)\times\operatorname{Aut}(C)$-orbits are classified by a Smith profile $0\leq\nu_1\leq\cdots\leq\nu_q\leq m$, $q=\min\{r,s\}$. The corresponding middle term is \[ \bigoplus_{i=1}^{q} \bigl(V/(\pi^{\nu_i})\oplus V/(\pi^{a+c-\nu_i})\bigr) \oplus (V/(\pi^a))^{r-q}\oplus(V/(\pi^c))^{s-q}, \] where $V/(\pi^0)=0$. This gives exact orbit-level criteria: the middle term is $C4$ precisely for the zero orbit with $a=c$, or for an invertible square orbit with $r=s$; it is $C4^{\ast}$ precisely for the zero orbit with $a=c=1$, or for a unit scalar orbit with $r=s=1$. We reformulate the Smith data as a valuation–rank profile, determine the complete geometry and additivity of the preservation loci, and globalize the result prime by prime. Consequently every extension between arbitrary finite-length torsion $C4^{\ast}$-modules over a Dedekind domain is decided by explicit local orbit invariants.
Read the full abstract
Algebraic Geometry
Corrigendum to `Evaluation of motivic functions, non-nullity, and integrability in fibers', Advances in Mathematics, Vol. 409, Part A, Paper No. 108635, 29 pages, doi:10.1016/j.aim.2022.108635 (2022)
We correct the statements and proofs of the (auxiliary) Propositions 4.1 and 4.2 of our paper `Evaluation of motivic functions, non-nullity, and integrability in fibers' in Advances in Mathematics, Vol. 409, Part A, Paper No. 108635, 29 pages (2022), and we explain how the proofs of the main results can be adapted to work with those corrected propositions.
Read the full abstract
Probability · Cross-listed from physics.soc-ph
Risk sharing in cooperative game models for CO$_2$ storage with uncertain geology and pressure competition
With an increasing number of prospective geological CO$_2$ storage projects and potential pressure communication between different projects, risk sharing under uncertain geological conditions are relevant to many project operators. In this work, the project operators are modeled as agents in a stochastic cooperative game. The agents can have different risk attitudes, here defined as being willing to accept more or less uncertainty in the predicted storage of CO$_2$. This uncertainty stems from lack of knowledge of geological parameters as well as unknown future actions of competing agents, and the corresponding probability distributions need to be estimated by numerical simulation. The agents can choose to share commercial risk if collaboration is preferable to a baseline scenario of individual injection. If their operations affect each other by means of, e.g., pressure communication, there may be no unique natural definition of a baseline scenario. As a remedy, we suggest belief distributions that combine uncertainty in physical data with maximum entropy prior distributions over the sets of viable injection actions. For a realistic storage site, exemplified by the Utsira Formation in the North Sea, we present numerical results for both cases of pressure competition, and no hydraulic connections between different project operations. It is shown that risk averse agents benefit from collaboration when there is no pressure communication or other interference between agents. It is also demonstrated that pressure communication leads to large variability in the feasible injection rates, but the resulting belief distributions are nevertheless informative and useful for decision making about collaboration.
Read the full abstract
Optimization and Control
An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
We study the deterministic global optimization of trained Gaussian process posterior mean functions over hyperrectangular domains. Although the posterior mean function has a compact closed-form representation, its global optimization is challenging because it remains nonlinear and nonconvex. Existing exact deterministic approaches become increasingly difficult to scale as the number of training data points grows, leading to approximation-based methods that improve tractability by optimizing a modified (inexact) objective. In this work, we propose PALM-Mean, a piecewise-analytic lower-bounding framework embedded in reduced-space spatial branch-and-bound. At each node, kernel terms that are locally important are replaced by a sign-aware piecewise-linear relaxation in an appropriate scalar distance variable, while the remaining terms are bounded analytically in closed form. We show this hybrid approach yields a valid lower bound for the posterior mean, while limiting the size of the branch-and-bound subproblems. We establish validity of the node lower bounds and $\varepsilon$-global convergence of the resulting algorithm. Computational results on synthetic benchmarks and real-world application problems show that PALM-Mean improves scalability relative to representative general-purpose deterministic global solvers, particularly as the number of training data points increases.
Read the full abstract
Probability · Cross-listed from q-fin.TR
Dynamics of Periodic Bubbles and Crashes: Modeling Market Overheating and Panic Selling via Cubic Momentum
This paper proposes a simple and parsimonious discrete-time simulation model to describe the endogenous formation and periodic collapse of financial bubbles. While existing literature has extensively explored the statistical properties of locally explosive bubble dynamics, capturing the micro-level interplay of investor herd behavior and panic selling within a unified framework remains a challenge. Our model addresses this by introducing a cubic function of market momentum to determine the balance of trading directions. This mechanism drives both trend-following behavior during the bubble phase and sudden market crashes when the momentum exceeds a critical threshold. Furthermore, inspired by the self-exciting nature of the Hawkes process, the model endogenizes“market frenzy" by linking trading frequency directly to the accumulated momentum. Simulation results demonstrate that this minimal setup successfully replicates the complex, nonlinear dynamics of bubbles, including simultaneous surges in liquidity and price, followed by dramatic crashes.
Read the full abstract
Category Theory
The No Barber Principle: Towards Formalised Selection in the Inaccessible Game
The inaccessible game (Lawrence, 2025, 2026) is an information-theoretic dynamical system governed by three information loss axioms, a marginal entropy conservation constraint and maximum entropy dynamics. In this paper we look at selection in the game. Our aim is to develop a selection policy for the game rules based on a minimal set of assumptions. We seek necessary consistency constraints for self-determining dynamical systems. Specifically, we suggest that rules that quantify over distinctions they cannot internally represent risk impredicative-style circularity. Our criterion is motivated by an analogy with Russell's paradox. We formulate a no-barber principle which prohibits dynamics that appeal to external adjudicators or structure lying outside the system. To motivate our principle we examine Russell's paradox through its structural formalisation as a Lawvere diagonalisation. The marginal-entropy conservation in the game is a nontrivial entropy constraint which prohibits external structure. Through the no-barber principle we argue (i) the classical category FinProb, in which Shannon entropy is characterised, is cartesian and provides canonical diagonal (copying) maps that make Lawvere-style constructions expressible and is structurally incompatible with the no-copying instantiation of the no-barber principle studied here. (ii) the noncommutative category NCFinProb, in which von Neumann entropy is characterised, is symmetric monoidal and lacks canonical copying maps, making it a more natural candidate for the game's internal language.
Read the full abstract
Classical Analysis and ODEs
A counterexample to Abel-type asymptotics for scaled Volterra equations
We consider scaled Volterra equations of the form $f_n + n k*f_n = g$ for $n \in \mathbb{N}$, where $g$ is given and $f_n$ is sought. We show that global two-sided Abel-type bounds on a positive kernel $k$ do not force the solutions $f_n$ to converge to zero as $n \to +\infty$. More precisely, we construct a continuous strictly positive kernel globally comparable with the Abel kernel $x^{-1/2}$, and a continuous strictly positive $g$, for which a subsequence of $(f_n)_{n \in \mathbb{N}}$ diverges to $+\infty$ at some point $x_0 > 0$. Consequently, the resolvents associated with the scaled kernels $nk$ need not form a generalized approximate identity, in contrast to a couple of classical results.
Read the full abstract
Combinatorics · Cross-listed from stat.ML
Achieving the Kesten-Stigum bound in the non-uniform hypergraph stochastic block model
We study the community detection problem in the non-uniform hypergraph stochastic block model (HSBM), where hyperedges of varying sizes coexist. This setting captures higher-order and multi-view interactions and raises a fundamental question: can multiple uniform hypergraph layers below the detection threshold be combined to enable weak recovery? We answer this question by establishing a Kesten–Stigum-type bound for weak recovery in a general class of non-uniform HSBMs with $r$ blocks, generated according to multiple symmetric probability tensors. In the case $r=2$, we show that weak recovery is possible whenever the sum of the signal-to-noise ratios across all uniform hypergraph layers exceeds one, thereby confirming the positive part of a conjecture in (Chodrow et al., 2023). Moreover, we provide a polynomial-time spectral algorithm that achieves this threshold via an optimally weighted non-backtracking operator. For the unweighted non-backtracking matrix, our spectral method attains a different algorithmic threshold, also conjectured in (Chodrow et al., 2023). Our approach develops a spectral theory for weighted non-backtracking operators on non-uniform hypergraphs, including a precise characterization of outlier eigenvalues and eigenvector overlaps. We introduce a novel Ihara–Bass formula tailored to weighted non-uniform hypergraphs, which yields an efficient low-dimensional representation and leads to a provable spectral reconstruction algorithm. Taken together, these results provide a principled and computationally efficient approach to clustering in non-uniform hypergraphs, and highlight the role of optimal weighting in aggregating heterogeneous higher-order interactions.
Read the full abstract
History and Overview of Mathematics
Designing for the Development of Probabilistic Thinking: A Design-Based Research Study in Lower Secondary Education
Drawing on the Data and Predictions strand of the Indicazioni Nazionali per il curricolo 2012, this study proposes a problem based instructional approach to the teaching of probability. More specifically, the study adopts a design based research methodology structured in a single cycle consisting of two teaching interventions in the same class, carried out in two consecutive years. Within this framework, a set of carefully selected problems is employed to foster students engagement. These problems are designed not only to introduce probabilistic concepts, but also to stimulate students' communicative and argumentative skills. The selected tasks provide opportunities to promote key process goals (such as reasoning and proving, communicating, representing, and making connections) which are often overshadowed by a predominant focus on content goals. This approach aims to support teachers in addressing the difficulties they frequently encounter in guiding students conceptualization processes, particularly in bridging the gap between students intuitive reasoning and formal abstraction. At the same time, it seeks to help students develop more robust and flexible forms of thinking, enabling them to better navigate situations involving uncertainty in everyday life.
Read the full abstract
General Mathematics
On Weighted Star–Convex Graphs
The primary objective of this paper is to investigate the notions of geometric and sequential convexity within a graph-theoretic framework, with the aim of examining various structural properties and exploring the connection between these two branches of mathematics. A simple connected vertex-weighted graph $G(V,E)$ with a non-empty set of leaf vertices is said to be star-convex if there exists at least one node $u\in V(G)$ such that, for every chosen leaf vertex $v$, there is a monotone path (either increasing or decreasing) connecting $v$ to $u$. One of the main results states that a graph $G$ is star-convex if and only if there exists a tree $T\subseteq G$ that contains all leaf vertices and is itself star-convex. On the other hand, a sequence $\big(u_n\big)_{n=0}^{\infty}$ is said to be convex if it satisfies the following inequality $$ 2u_{i}\leq u_{i-1}+u_{i+1}\qquad \mbox{for all}\quad i\in \mathbb{N}. $$ We demonstrate that, under minimal assumptions, a class of convex sequences can be embedded into a spider graph so as to make it star-convex.
Read the full abstract
Information Theory
Watts-per-Intelligence Part II: Algorithmic Catalysis
We develop a thermodynamic theory of algorithmic catalysis within the watts per intelligence framework, identifying reusable computational structures that reduce irreversible operations for a task class while satisfying bounded restoration and structural selectivity constraints. We prove that any class specific speed-up is upper-bounded by the algorithmic mutual information between the substrate and the class descriptor, and that encoding this information incurs a minimum thermodynamic cost via Landauer erasure. Combining these results yields a coupling theorem that lower-bounds the deployment horizon required for an algorithmic catalyst to be energetically favourable. The framework is illustrated on an affine SAT class and situates contemporary learned systems within an information thermodynamic constraint on intelligent computation.
Read the full abstract
Group Theory
Addendum/Corrigendum to "On solubility of skew left braces and solutions of the Yang-Baxter equation"
In our previous work: Adv. Math. 455 (2024), no. 109880, solubility of solutions was introduced as an extension of solubility of skew braces in the classification context of non-degenerate solutions of the Yang-Baxter equation. One of our main results (Theorem C) proved that a skew brace is soluble if, and only if, its associated solution is soluble. A minor step depending on the definition of homomorphism of solutions was overlooked. In this work, proof of Theorem C is repaired by means of a new class of homomorphisms of solutions: i-homomorphisms of solutions. The importance of this new class is twofold: indecomposable solutions are characterised by means of i-simplicity of solutions, and i-kernels of i-homomorphisms generate ideals in structure skew braces of solutions. Hence, solubility of solutions is redefined as an opposite class of indecomposable solutions. The results obtained with this definition improve our previous outcomes: every soluble solution is proved to have a soluble structure skew brace, and consequently, Theorem C still holds. Several results stemming from this new analysis are outlined.
Read the full abstract
Number Theory
On the reciprocity law in $\mathbb{F}_{q}[t]$
In 1991, Rousseau gave a new proof of Gauss's quadratic reciprocity by comparing two distinct coset representations of the group $(\mathbb{Z}_{p}^{*} \times \mathbb{Z}_{q}^{*}) / U$ using the Chinese Remainder Theorem, without Gauss's Lemma. In this paper, we extend Rousseau's approach to $\mathbb{F}_{q}[t]$, providing a new, elementary proof of the reciprocity law for the $d$th power residue symbol, where $d$ is any divisor of $q-1$.
Read the full abstract
Mathematical Physics
Predictivity and Utility of Neural Surrogates of Multiscale PDEs
Scientific machine learning is increasingly being spoken of as universal emulators for classical numerical solvers for multi-scale partial differential equations, but most apparent successes can be explained by facts that also define their limits. Many successful benchmarks live on low-dimensional solution manifolds where any competent reduced model will interpolate well. More fundamentally, neural surrogates systematically under-resolve high-frequency content due to spectral bias, and coarse-graining compounds this problem through irreversible information loss. In many multi-scale problems, no architecture or training procedure can fully recover what the coarse representation discards. Two simple examples are used to characterize spectral bias, coarse-graining and error accumulation. We discuss why medium-range weather prediction on reanalysis data sits in a favorable sweet spot and why this will not generalize to genuinely chaotic multi-scale scenarios. We identify domains where neural surrogates offer genuine value, propose further research on neural-classical hybrids, and call for better reporting standards.
Read the full abstract
Analysis of PDEs
A critical note on back-and-forth Data Assimilation Nudging Algorithm
This work investigates the effectiveness of the Back-and-Forth Nudging (BFN) data assimilation algorithm, specifically its performance when employing the Azouani-Olson-Titi (AOT) continuous data assimilation downscaling nudging algorithm, for recovering initial conditions of dissipative dynamical systems. Contrary to previous reports in the literature, we show that, for several systems of interest, one can construct initial conditions that BFN cannot reliably recover. Our key finding is the construction of infinitely many distinct solutions for certain dissipative systems that share identical spatially sparse observational data. Since these observations are indistinguishable, no data assimilation method relying only on them can differentiate between these solutions or recover the correct initial condition. We illustrate these pathological initial conditions for the Lorenz 1963 model and several 1D partial differential equations: the heat equation, viscous linear transport, and viscous and inviscid Burgers equations. Our analytical results are supported by numerical simulations. To address the numerical ill-posedness of backward-in-time iterations, an essential step of BFN for dissipative models, we introduce a regularized backward step, the Voigt-regularized BFN (VBFN). We investigate its performance for the 2D Navier-Stokes equations and the viscous 1D KdV equation, comparing it with standard BFN and Diffusive BFN (dBFN). While VBFN improves numerical stability and reduces model bias relative to dBFN, it still cannot reconstruct the unobserved fine spatial scales of the reference solution. This reinforces our main conclusion: even with regularization, BFN-type algorithms are limited in recovering the full state, and in particular the initial data, from sparse spatial observations.
Read the full abstract
Algebraic Geometry
Non-Abelian p-Curvature and a Non-Abelian Katz's Formula
Let $k$ be a field of characteristic $p,$ and $f : X \to S$ a smooth proper morphism of smooth $k$-schemes. Katz's formula gives a relationship between the Kodaira–Spencer map of $f,$ and an invariant called the $p$-curvature of the Gauss–Manin connection associated to $f.$ Recently, Lam–Litt proved a variant of Katz's formula in non-abelian Hodge theory, and suggested that it should be possible to give a more conceptual proof of their formula using the stacky approach to $p$-adic Hodge theory. In this article, we realize their suggestion, explaining how the rather concrete phenomena observed by Katz and Lam–Litt can be explained in a conceptual way using sheared de Rham stacks, as developed by Bhatt–Kanaev–Vologodsky–Zhang and Drinfeld (though we prove a slightly different statement than Lam–Litt do). We do not assume the reader has any background in the theory of de Rham stacks.
Read the full abstract
Numerical Analysis
A posteriori error analysis, Pod-Deim reduced order geometrically parametrized models and unfitted FEMs
We develop and analyze a posteriori error estimators for a proper orthogonal decomposition-discrete empirical interpolation method (Pod-Deim) reduced order model applied to a parametric Poisson equation posed on a parameter-dependent domain defined by a level-set function. The full-order discretisations employ a cut finite element method (Cutfem) with Nitsche boundary conditions and ghost-penalty stabilization. Three complementary estimators are proposed: (i) Deim approximation quality indicators for the stiffness matrix and force vector, which are constant in the number of Pod modes, (ii) dual-norm residual estimators in both plain and Jacobi-preconditioned form, and (iii) a Pod tail-energy indicator. A rigorous theoretical framework is established, comprising a uniform coercivity result for the Cutfem bilinear form, an active-dof residual bound that accounts for ghost-penalty degrees of freedom, a combined a posteriori bound, and sharp effectivity analysis for the residual estimators. The key theoretical finding is that the large observed effectivity indices are explained by ghost-penalty degree-of-freedom inflation, and that restricting the residual to active degrees of freedom is predicted to reduce effectivity. Numerical experiments on a parametric ellipse domain with semi-axes confirm the theoretical predictions, achieve significant online speedup, and demonstrate algebraic convergence of the true error alongside exponential decay of the residual estimators.
Read the full abstract
Combinatorics
On Threshold Pairwise Compatibility Graphs
Pairwise Compatibility Graphs (PCGs) form a tree-metric graph class that originated in phylogeny and has since attracted sustained interest in graph theory. Several natural generalizations have been proposed in order to overcome the expressive limitations of classical PCGs, including $k$-interval-PCGs, $k$-OR-PCGs, and $k$-AND-PCGs. In this paper, we introduce $(k,t)$-threshold-PCGs, a threshold-based framework that unifies these generalized notions: adjacency is determined by whether at least $t$ among $k$ underlying PCG predicates accept the vertex pair. We investigate the expressive power of this model from both constructive and asymptotic viewpoints. On the positive side, we show that every graph on $n$ vertices is a $(n,t)$-threshold-PCG for every $1 \le t \le n$. On the negative side, we prove that for every fixed pair $(k,t)$, the class of $(k,t)$-threshold-PCGs is asymptotically rare among all graphs. As a consequence, we obtain sharp separations from previously studied models, including a strict expressive gap relative to $k$-interval-PCGs. We also study explicit obstruction families through incidence graphs and derive additional structural consequences for the conjunction case, including the strictness of the $k$-AND-PCG hierarchy and the failure of closure under complement.
Read the full abstract
Number Theory
On Uniqueness of Mock Theta Functions
We develop a resurgent approach to the problem of unique continuation of mock theta functions across their natural boundary. The starting point is the representation of the associated Mordell-Appell integrals as Laplace transforms of resurgent functions, which serve as the primary analytic objects. By rotating the Laplace contour by $\pi$, i.e. onto the Stokes line, one obtains, in all known cases, the mock-modular relations between the Mordell-Appell integrals and the corresponding unary series in $\hat q=e^{-\pi i \tau}$ and $\hat q_1=e^{-\pi i (-1/\tau)}$. We then prove that these relations admit a unique solution on the $q$-side, expressed in terms of $q=e^{\pi i \tau}$ and $q_1=e^{\pi i (-1/\tau)}$, with coefficients determined by the corresponding Mordell-Appell integrals. This yields a canonical continuation across the natural boundary, given by a resurgent extension of the classical principle of permanence of relations, and singles out a distinguished family of mock theta functions in each group. We present a complete analysis for the order 3 and 5 cases (mf3 and mf5). The method extends naturally to higher orders; a general theory will appear in a separate paper.
Read the full abstract
Optimization and Control
Decision-Focused Federated Learning Under Heterogeneous Objectives and Constraints
We consider Decision-Focused Federated Learning (DFFL), a predict-then-optimize setting in which multiple clients collaboratively train predictive models for downstream linear optimization problems without exchanging raw data. Besides the data heterogeneity typical of standard federated learning, clients may also have different objective functions and feasible regions. Building on the SPO+ surrogate loss, we derive heterogeneity bounds that separate objective shift, measured through cost-vector distances, from feasible-set shift, measured through support-function and shape-distance terms. We show that, for general compact feasible sets, small objective perturbations can still induce nonvanishing decision-focused loss discrepancies, while strongly convex feasible regions yield sharper stability-based bounds. We then lift these pointwise bounds to a local-versus-federated excess-risk comparison, showing that federation is beneficial when the statistical advantage of pooling exceeds a client-specific heterogeneity penalty. Computational experiments on polyhedral and strongly convex problems confirm that federation is substantially more robust under strongly convex feasible regions. Finally, we evaluate a simple validation-based interpolation between local and federated DFFL models. This interpolation mitigates the theoretical tradeoff and reduces aggregate regret and worst-client harm in both synthetic experiments and a PJM energy-pricing case study.
Read the full abstract
Optimization and Control
Forward-looking evolutionary game dynamics subject to exploration cost
We extend classical evolutionary game dynamics based on the momentary action choices of agents by accounting for two elements: forward-looking behavior and exploration cost. We focus on pairwise comparison protocols that cover major evolutionary game dynamics, such as replicator and logit models. In the proposed mathematical framework, agents update their actions by paying a cost so that a utility or its relative difference is maximized. We show that forward-looking behavior can be modeled as a coupling between the evolutionary game dynamic and static Hamilton-Jacobi-Bellman equation: a mean field game. The exploration cost and its constraint are naturally related to these equations as a function of the optimal Lagrangian multiplier serving as a relaxation parameter, and it is incorporated into the game as a constraint. We show that under certain conditions, our evolutionary game dynamic admits a unique solution. Finally, we computationally investigate one- and two-dimensional problems.