Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 1 April
These notes give a brief introduction to differential Harnack inequalities and summarise the main results of the mini-course “Li-Yau and Harnack estimates for nonlocal diffusion problems”, presented by the author at the Seasonal School on PDEs “Oscillation Phenomena, PDEs, and Applications: A Comprehensive School in Mathematical Analysis”, held at Ghent University in October 2025.
Probability
Quantitative central limit theorem for an integrated periodogram via the fourth moment theorem
We revisit the central limit theorem for integrated periodograms, equivalently for Toeplitz quadratic forms of stationary Gaussian sequences. Under a regular-variation assumption allowing long-memory singularities and slowly varying corrections, we prove a quantitative central limit theorem in 1-Wasserstein distance. The proof uses a second Wiener chaos representation and the Malliavin-Stein method (in particular, the Fourth Moment Theorem), reducing normal approximation to (i) variance asymptotics and (ii) an explicit control of the fourth cumulant via trace estimates for an associated integral operator. For convenience, we provide self-contained kernel estimates (Dirichlet-type bounds, convolution inequalities, and a weighted Schur test) used in the argument.
Read the full abstract
Functional Analysis
Existence of extremal functions in higher-order affine Sobolev inequalities
In this article, we prove the existence of extremal functions in higher-order affine Sobolev inequalities. Proofs rely on concentration-compactness methods in spaces of integer or fractional regularity. The tools we use, available in spaces of arbitrary regularity, might be of independent interest.
Read the full abstract
Commutative Algebra
Explicit minimal generating sets of a family of prime ideals with unbounded minimal number of generators in a three-dimensional power series ring
We display a new family of prime ideals with unbounded minimal number of generators in a three-dimensional power series ring over a field of characteristic zero. These primes are obtained as the kernel of a quasi-monomial algebra homomorphism. Up to constant coefficients, determined by some specific linear systems with binomial entries, we describe their minimal generating polynomial sets. The advantage of our family with respect to some previous work is, on the one hand, the explicit description of the generating sets and, on the other hand, the simplicity of the exponents of the aforementioned quasi-monomial homomorphism. We also provide a code in Python which states and solves the linear systems that lead to a complete description of the minimal generating sets with a "Gröbner-free" approach.
Read the full abstract
Probability
Large deviations of the periodic Toda chain
This work establishes a large deviation principle for the spectral measure of the Lax matrix associated to the periodic Toda chain of $N$ particles, subject to a generalised Gibbs measure. This large deviation principle is governed by a rate function which can be regarded as a generalisation of the free energy of the system. Such a large deviation principle is proven both for the model when the momentum is constrained to be zero and when it is allowed to fluctuate. Moreover, the large deviation principle is proven directly at the level of the representation of the generalised Gibbs partition function given in terms of the variables realising the classical separation of variables, i.e. rectifying the equations of motion. As such, this work paves the way towards the computation of the thermodynamic limit of dynamical correlation functions in the Toda chain subject to generalised Gibbs ensemble statistics.
Read the full abstract
Dynamical Systems
Neural Ordinary Differential Equations for Modeling Socio-Economic Dynamics
Poverty is a complex dynamic challenge that cannot be adequately captured using predefined differential equations. Nowadays, artificial machine learning (ML) methods have demonstrated significant potential in modelling real-world dynamical systems. Among these, Neural Ordinary Differential Equations (Neural ODEs) have emerged as a powerful, data-driven approach for learning continuous-time dynamics directly from observations. This chapter applies the Neural ODE framework to analyze poverty dynamics in the Indian state of Odisha. Specifically, we utilize time-series data from 2007 to 2020 on the key indicators of economic development and poverty reduction. Within the Neural ODE architecture, the temporal gradient of the system is represented by a multi-layer perceptron (MLP). The obtained neural dynamical system is integrated using a numerical ODE solver to obtain the trajectory of over time. In backpropagation, the adjoint sensitivity method is utilized for gradient computation during training to facilitate effective backpropagation through the ODE solver. The trained Neural ODE model reproduces the observed data with high accuracy. This demonstrates the capability of Neural ODE to capture the dynamics of the poverty indicator of concrete-structured households. The obtained results show that ML methods, such as Neural ODEs, can serve as effective tools for modeling socioeconomic transitions. It can provide policymakers with reliable projections, supporting more informed and effective decision-making for poverty alleviation.
Read the full abstract
Probability
The contact process on a bipartite spatial network
We study the contact process on a random bipartite connection hypergraph generated from two Poisson point processes, with mark-dependent connection thresholds. For asymmetric infection rates and asymmetric power law tail decays of the two degree distributions, we determine the dominant survival strategies in all parameter regimes and provide asymptotics for the epidemic probability up to logarithmic factors.
Read the full abstract
Probability
The Critical Patch Size Problem in Random Graphs
The problem of critical patch size – a threshold condition for population persistence – is investigated in the context of discrete habitats, modeled as graphs with a distinguished subset of vertices acting as sinks. These sinks impose boundary-like constraints analogous to Dirichlet conditions in continuous domains. The population proliferates locally at the vertices and diffuse across the network through the graph Laplacian. In the sinks the population cannot survive. The Dirichlet eigenvalue of the habitat is defined as the smallest eigenvalue of the principal submatrix of the Laplacian obtained by removing the rows and columns associated with sink vertices. This spectral parameter governs the habitat's viability: survival occurs when the Dirichlet eigenvalue of the habitat lies below a critical reaction-to-diffusion ratio. We study survival conditions for a sequence of random habitats built on binomial random graphs. We establish a law of large numbers for the corresponding sequence of Dirichlet eigenvalues and prove the emergence of a sharp threshold phenomenon: with high probability, a large random habitat is either viable or non-viable, depending on whether the reaction-to-diffusion ratio lies below or above this threshold. Our results provide the first general spectral theory for critical patch size on graphs, with implications for ecology, synthetic biology, and the modeling of processes on brain connectomes.
Read the full abstract
Dynamical Systems
Marchal's family of periodic orbits. I: Stability of inclined co-orbital planetary systems
At the Lagrange relative equilibrium of the three-body problem, for all values of the masses, the elliptic eigenvalues associated with vertical eigenvectors give rise to spatial quasi-periodic orbits, which become periodic in a rotating frame. In 2009, by averaging out the fast frequencies, Christian Marchal showed that these orbits, which are fixed points in the restricted average problem, form a oneparameter family connecting L 4 to L 5 . Using perturbation methods, we show the persistence of this family in the average three-body problem for nonzero masses in the limit where one mass is dominant over the other two (known as the planetary problem). We also give an analytical approximation valid for mutual inclinations less than 60 $\bullet$ . Then, using purely numerical methods, we show that this family exists in the full three-body problem (neither restricted nor average) for a wide range of masses, beyond the planetary case. We also show that the stability of its orbits evolves along the family, with inclined systems remaining stable for masses exceeding the Gascheau's value (also known as Routh's critical value). Finally, we show the impact of this family's stability on the global dynamics of the co-orbital region as well as its high instability for mutual inclinations exceeding 60 $\bullet$ .
Read the full abstract
Optimization and Control · Cross-listed from quant-ph
Beyond Quantum Advantage: Improved Classical Algorithms for the Binary Paint Shop Problem
The binary paint shop problem (BPSP) is an APX-hard optimization problem in which, given $n$ car models that occur twice in a sequence of length $2n$, the objective is to find a colouring sequence such that each car model pair is painted differently while minimizing the number of times the paint is swapped along the sequence. A recent classical heuristic, known as the recursive star greedy (RSG) algorithm, is conjectured to achieve an expected paint swap ratio of $0.361$, thereby outperforming the Quantum Approximate Optimization Algorithm (QAOA) with circuit depth $p=7$. Since the performance of the QAOA with logarithmic circuit depth is instance independent, the average paint swap-ratio is upper-bounded by the QAOA. We provide an improved upper-bound of the BPSP by extending the QAOA to depth $p=17$, outputting an expected paint swap ratio of $0.334$ via an exact computation while numerical extrapolation suggests a further reduction to a value of $0.295$. To provide hardware-relevant comparisons, we additionally implement the BPSP on a D-Wave Quantum Annealer Advantage 2, obtaining a minimum paint swap ratio of $0.329$. Given that the QAOA with logarithmic circuit depth does not exhibit a quantum advantage for sparse optimization problems such as the BPSP, this implies the existence of a classical algorithm that outperforms both the RSG algorithm and logarithmic depth QAOA. We provide numerical evidence that the Mean-Field Approximate Optimization Algorithm (MF-AOA) is one such algorithm, yielding a paint swap ratio of approximately $0.280$ beating all known classical and quantum algorithms for the BPSP.
Read the full abstract
Probability
Allowing for imprecision in the game-theoretic characterisation of the Poisson process
In their 1993 paper 'Forecasting point and continuous processes: Prequential analysis' in Test, Vovk put forward a game-theoretic definition of the Poisson process. A key assumption therein is that the rate of the Poisson process is known or specified exactly. In contrast, I replace this assumption with the less stringent – and arguably more realistic – one that the available information about the process takes the form of bounds on the rate rather than a single, exact value. The resulting process has properties similar to the standard, 'precise' Poisson process, albeit with an imprecise flavour to them, thus justifying the moniker 'imprecise Poisson process'.
Read the full abstract
Statistics Theory · Cross-listed from astro-ph.CO
A Geometric Theory of Cosmological Structure via Entropic Curvature in Wasserstein Space
We construct a geometric framework for cosmological large-scale structure based on optimal transport theory and Wasserstein geometry. In this framework, Ricci curvature on the probability measure space $\mathcal{P}_2(M)$ is characterized by the geodesic convexity of entropy and is formulated as the response of probability distributions to optimal transport. We introduce effective Ricci curvatures $K_{\mathrm{eff}}^{(\infty)}$ and $K_{\mathrm{eff}}^{(N)}$ associated with Kullback–Leibler-type and Rényi-type entropies, corresponding respectively to the curvature-dimension conditions CD$(K,\infty)$ and CD$(K,N)$. By localizing these curvatures to finite scales using local and reference measures, we construct curvature indicators applicable to observational data. Under a local quadratic approximation, the effective curvature reduces to the Hessian of the log-density, showing that conventional Hessian-based structure classifications arise as a limiting case of the present framework. We further show that effective curvature depends on observational scale and formulate this dependence as a scale flow, distinct from Ricci flow because it describes a change of resolution rather than a time evolution of geometry. Treating curvature as a random field then extends the statistical description of density fields: curvature statistics are given by higher-order weighted integrals of the power spectrum and by spatial derivatives of the correlation function, emphasizing geometric rather than amplitude information. This framework provides a unified connection between optimal transport geometry and cosmological structure analysis, and offers a new perspective on multiscale structure and nonlinear statistics.
Read the full abstract
Probability · Cross-listed from cs.CC
On the average-case complexity landscape for Tensor-Isomorphism-complete problems over finite fields
In Grochow and Qiao (SIAM J. Comput., 2023), the complexity class Tensor Isomorphism (TI) was introduced and isomorphism problems for groups, algebras, and polynomials were shown to be TI-complete. In this paper, we study average-case algorithms for several TI-complete problems over finite fields, including algebra isomorphism, matrix code conjugacy, and $4$-tensor isomorphism. Our main results reveal a rich landscape of average-case complexities of Tensor Isomorphism problems, despite their equivalence in the worst-case setting. Over the finite field of order $q$, we devise (1) average-case polynomial-time algorithms for algebra isomorphism and matrix code conjugacy that succeed for $1/\Theta(q)$ fraction of inputs; (2) an average-case polynomial-time algorithm for the $4$-tensor isomorphism that succeeds for $1/q^{\Theta(1)}$ fraction of inputs; and (3) an average-case polynomial-time algorithm for the orthogonal $3$-tensor isomorphism that succeed for $1-1/\poly(n)$ fraction of $n\times n\times n$ tensors. Our main technical contribution is to introduce the spectral properties of random matrices into algorithms for TI-complete problems. This leads to not only new algorithms but also new questions in random matrix theory over finite fields. To settle these questions, we need to extend both the generating function approach as in Neumann and Praeger (J. London Math. Soc., 1998) and the character sum method of Gorodetsky and Rodgers (Trans. Amer. Math. Soc., 2021).
Read the full abstract
Dynamical Systems
Hausdorff Dimension of Growth Rate Level Sets in $\theta$-expansions
We investigate the Hausdorff dimension of level sets defined by digit growth rates in $\theta$-expansions, a generalization of regular continued fractions. For any $\alpha \geq 0$, we prove that the set \[ E_\theta(\alpha) = \left\{ x \in [0, \theta] \setminus \mathbb{Q} : \lim_{n \to {+}\infty} \frac{L_{n,\theta}(x) \log n \log \log n}{S_{n,\theta}(x) - L_{n,\theta}(x)} = \alpha \right\} \] has full Hausdorff dimension. This extends previous work of Zhang and {Lü (2016) on regular continued fractions to the broader framework of $\theta$-expansions. The proof involves constructing explicit subsets with controlled digit growth and establishing dimension preservation through Hölder-continuous mappings.
Read the full abstract
Statistics Theory
Empirical tail dependence functions in high dimensions: uniform linearizations and inference
The analysis of extremal dependence in high dimensions is a key challenge in modern extreme-value statistics. Existing methodology primarily focuses on modeling and estimation of extremal dependence structures, often supported by concentration bounds for empirical tail quantities. However, comparatively little is known about general inferential procedures in high-dimensional extremes. In this paper, we develop foundational results that enable inference for rank-based empirical tail dependence coefficients, stable tail dependence functions, and functionals derived from them. We start by establishing finite-sample probability bounds that quantify the linearization error for such estimators uniformly over collections of coordinates. Moreover, we derive high-dimensional central limit theorems and establish the validity of multiplier bootstrap procedures for collections of empirical tail dependence statistics. Within an asymptotic framework, our results allow the dimension to grow exponentially with the effective sample size. We illustrate the usefulness of the results through two applications: uniform expansions and normal approximations for M-estimators of tail dependence parameters and inference for spatial isotropy based on collections of tail dependence functions.
Read the full abstract
Group Theory
On Normalizers of Parabolic Subgroups of Quaternionic Reflection Groups
By work of Howlett and Muraleedaran–Taylor, a parabolic subgroup of a real or complex reflection group always admits a complement in its normalizer. In this note, we investigate this phenomenon for quaternionic reflection groups. Here, in contrast to the real and complex setting, we find that complements of parabolic subgroups do not exist in general. Indeed, there are infinitely many examples of quaternionic reflection groups in arbitrary rank greater than 2 with a parabolic subgroup that does not admit a complement in its normalizer. We give a full classification of parabolic subgroups of irreducible quaternionic reflection groups and describe their complements, if the latter exist.
Read the full abstract
Information Theory · Cross-listed from eess.SP
SAR/ISAR Imaging in 6G Network
Imaging is a crucial sensing function that finds wide applications in environmental reconstruction, autonomous driving, etc. However, the signal processing methods for existing radio imaging techniques, such as millimeter wave (mmWave) imaging, require high-resolution range estimation enabled by Gigahertz-level or even Terahertz-level bandwidth, and cannot be applied in 6G integrated sensing and communication (ISAC) network with Megahertz-level bandwidth. This paper proposes two novel high-resolution radio imaging schemes that can work on the 6G signals with limited bandwidth - bandwidth-independent synthetic aperture radar (BI-SAR), where the movable base station (BS) revolves along the static targets by 360 degrees; as well as bandwidth-independent inverse synthetic aperture radar (BI-ISAR), where the BS is static and the targets revolve along an axis by 360 degrees. Different from conventional SAR and ISAR counterparts that rely on range estimation, our proposed imaging schemes solely utilize Doppler information to perform imaging without any range information. The main technical challenge of our schemes lies in the anisotropic scattering functions over different directions, which hinder the coherent synthesis of the backscattered signals from all directions. We design an iterative adaptive approach-based Doppler association (IAA-DA) algorithm to tackle the above issue. Moreover, we also derive the imaging resolution to characterize the reconstruction quality. Real-world experiments are provided to show the feasibility and the effectiveness of our proposed 6G imaging schemes.
Read the full abstract
Rings and Algebras
Cohomological invariants of hermitian forms that detect hyperbolicity
By using unramified cohomology groups, we construct a full sequence of cohomological invariants for hermitian forms of any (orthogonal, symplectic or unitary) type that can be used to detect hyperbolicity. The base central simple algebra can have arbitrary degree and the base field can have arbitrary characteristic. In the orthogonal case, we work with hermitian pairs, and we apply our construction to show that over fields of separable dimension 3, hermitian pairs over quaternion algebras with trivial classical invariants are hyperbolic. This last result extends a result of Berhuy to arbitrary characteristic.
Read the full abstract
Analysis of PDEs
Verifying Well-Posedness of Linear PDEs using Convex Optimization
Ensuring that a PDE model is well-posed is a necessary precursor to any form of analysis, control, or numerical simulation. Although the Lumer–Phillips theorem provides necessary and sufficient conditions for well-posedness of dissipative PDEs, these conditions must hold only on the domain of the PDE—a proper subspace of $L_{2}$—which can make them difficult to verify in practice. In this paper, we show how the Lumer–Phillips conditions for PDEs can be tested more conveniently using the equivalent Partial Integral Equation (PIE) representation. This representation introduces a fundamental state in the Hilbert space $L_{2}$ and provides a bijection between this state space and the PDE domain. Using this bijection, we reformulate the Lumer–Phillips conditions as operator inequalities on $L_{2}$. We show how these inequalities can be tested using convex optimization methods, establishing an upper bound on the exponential growth rate of solutions. We demonstrate the effectiveness of the proposed approach by verifying well-posedness for several classical examples of parabolic and hyperbolic PDEs.
Read the full abstract
Optimization and Control
An Accelerated Proximal Bundle Method with Momentum
Proximal bundle methods (PBM) are a powerful class of algorithms for convex optimization. Compared to gradient descent, PBM constructs more accurate surrogate models that incorporate gradients and function values from multiple past iterations, which leads to faster and more robust convergence. However, for smooth convex problems, PBM only achieves an O(1/k) convergence rate, which is inferior to the optimal O(1/k^2) rate. To bridge this gap, we propose an accelerated proximal bundle method (APBM) that integrates Nesterov's momentum into PBM. We prove that under standard assumptions, APBM achieves the optimal O(1/k^2) convergence rate. Numerical experiments demonstrate the effectiveness of the proposed APBM.
Read the full abstract
General Topology
The category of probabilistic metric spaces
The paper is devoted to a categorical study of the category of probabilistic metric spaces. The study is based on an isomorphic description of the category of probabilistic metric spaces. The isomorphic description was obtained in [3] and is in terms of objects that are sets endowed with a collection of distances, where the distances involved do not satisfy the triangle inequality but fulfil a mixed triangle condition instead. The morphisms are levelwise non-expansive maps. We show that the category of probabilistic metric spaces is a monotopological category over the category of sets. We describe the regular closure on a probabilistic space and prove that it coincides with the closure in the underlying strong topology. This enables us to characterize the class of all epimorphisms as the dense maps and the class of all regular monomorphisms as the closed embeddings in terms of the closure operator. We prove that the category of extended metric spaces with non-expansive maps is both coreflectively and reflectively embedded in the category of probabilistic metric spaces.
Read the full abstract
Differential Geometry
Rigidity of the Borell-Brascamp-Lieb Inequality on Weighted Riemannian Manifolds
In this paper we discuss some results regarding the rigidity of the Borell-Brascamp-Lieb inequality and the Brunn-Minkowski inequality. We show a theorem of rigidity on curvature and measure of the Borell-Brascamp-Lieb inequality, a generalisation of the curvature rigidity theorem by Balogh and Kristály (Advances in Mathematics 339: 453-494, 2018, arXiv:1704.04180) to the weighted setting. We present some rigidity results of the Brunn-Minkowski inequality and a few further open problems.
Read the full abstract
Optimization and Control · Cross-listed from stat.ML
Scenario theory for multi-criteria data-driven decision making
The scenario approach provides a powerful data-driven framework for designing solutions under uncertainty with rigorous probabilistic robustness guarantees. Existing theory, however, primarily addresses assessing robustness with respect to a single appropriateness criterion for the solution based on a dataset, whereas many practical applications - including multi-agent decision problems - require the simultaneous consideration of multiple criteria and the assessment of their robustness based on multiple datasets, one per criterion. This paper develops a general scenario theory for multi-criteria data-driven decision making. A central innovation lies in the collective treatment of the risks associated with violations of individual criteria, which yields substantially more accurate robustness certificates than those derived from a naive application of standard results. In turn, this approach enables a sharper quantification of the robustness level with which all criteria are simultaneously satisfied. The proposed framework applies broadly to multi-criteria data-driven decision problems, providing a principled, scalable, and theoretically grounded methodology for design under uncertainty.
Read the full abstract
Dynamical Systems
Activation Saturation and Floquet Spectrum Collapse in Neural ODEs
We prove that activation saturation imposes a structural dynamical limitation on autonomous Neural ODEs $\dot{h}=f_\theta(h)$ with saturating activations ($\tanh$, sigmoid, etc.): if $q$ hidden layers of the MLP $f_\theta$ satisfy $|\sigma'|\le\delta$ on a region~$U$, the input Jacobian is attenuated as $\norm{Df_\theta(x)}\le C(U)$ (for activations with $\sup_{x}|\sigma'(x)|\le 1$, e.g.\ $\tanh$ and sigmoid, this reduces to $C_W\delta^q$), forcing every Floquet (Lyapunov) exponen along any $T$-periodic orbit $\gamma\subset U$ into the interval $[-C(U),\;C(U)]$. This is a collapse of the Floquet spectrum: as saturation deepens ($\delta\to 0$), all exponents are driven to zero, limiting both strong contraction and chaotic sensitivity. The obstruction is structural – it constrains the learned vector field at inference time, independent of training quality. As a secondary contribution, for activations with $\sigma'>0$, a saturation-weighted spectral factorisation yields a refined bound $\widetilde{C}(U)\le C(U)$ whose improvement is amplified exponentially in~$T$ at the flow level. All results are numerically illustrated on the Stuart–Landau oscillator; the bounds provide a theoretical explanation for the empirically observed failure of $\tanh$-NODEs on the Morris–Lecar neuron model.
Read the full abstract
Spectral Theory
The direct spectral problem for indefinite canonical systems
For indefinite (Pontryagin space) canonical systems that contain an inner singularity we prove the existence of generalised boundary values at the singularity, which are used to formulate interface conditions. With the help of such interface conditions we construct the monodromy matrix of the canonical system and write it as a product of matrices, which separates the contributions of the Hamiltonian function and the finitely many discrete parameters that are associated with the singularity.
Read the full abstract
Numerical Analysis · Cross-listed from eess.SY
Sequential Monte Carlo for Network Resilience Assessment and Control
Resilience is emerging as a key requirement for next-generation wireless communication systems, requiring the ability to assess and control rare, path-dependent failure events arising from sequential degradation and delayed recovery. In this work, we develop a sequential Monte Carlo (SMC) framework for resilience assessment and control in networked systems. Resilience failures are formulated as staged, path-dependent events and represented through a reaction-coordinate-based decomposition that captures the progression toward non-recovery. Building on this structure, we propose a multilevel splitting approach with fixed, semantically interpretable levels and a budget-adaptive population control mechanism that dynamically allocates computational effort under a fixed total simulation cost. The framework is further extended to incorporate mitigation policies by leveraging SMC checkpoints for policy evaluation, comparison, and state-contingent selection via simulation-based lookahead. A delay-critical wireless network use case is considered to demonstrate the approach. Numerical results show that the proposed SMC method significantly outperforms standard Monte Carlo in estimating rare non-recovery probabilities and enables effective policy-driven recovery under varying system conditions. The results highlight the potential of SMC as a practical tool for resilience-oriented analysis and control in future communication systems.
Read the full abstract
Geometric Topology
Computing Alexander polynomials for arborescent links
Alexander polynomial was born one century ago, but explicit formulas have been found for only a few families of links. In this paper, we present an efficient method of computing Alexander polynomial for arborescent links. Applying this method, we express the Alexander polynomials of Montesinos links in terms of certain polynomials associated to rational tangles which can be computed recursively. Specifically, we deduce explicit closed formulas for all pretzel links.
Read the full abstract
Information Theory · Cross-listed from cs.LG
Toward Robust Open-set Adaptation: Synapse Consolidation Inspired by Rac1/MAPK Pathways
Large Language Models (LLMs) generalize across tasks through reusable representations and flexible reasoning, yet remain brittle in real deployment when faced with evolving tasks and continual distribution shift. While test-time adaptation addresses this by updating models with unsupervised objectives on test data, prevailing methods are fundamentally limited by their neglect of source knowledge preservation and adaptation signal reliability. Inspired by how Drosophila orchestrates memory update by balancing retroactive and proactive interference via Rac1 and MAPK pathways, we design Synapse Consolidation (SyCo) with two core components: a Rac1-inspired plasticity confiner and a MAPK-inspired update controller. The former dynamically confines plasticity to a tail-gradient subspace that is less critical for source knowledge, enabling rapid specialization while preserving source representations. The latter uses a tiered controller to suppress noisy updates and consolidate useful adaptations under non-stationary streams. To further model real deployments with multiple sources and continually emerging tasks, we introduce Multi-source Open-set Adaptation (MOA) setting, where a model is trained on multiple labeled source tasks and then adapts on open, non-stationary unlabeled test streams mixing seen and unseen tasks with partial overlap in label and intent space. Across 18 NLP datasets under the MOA setting, SyCo consistently outperforms strong baselines, achieving 78.31% on unseen-task adaptation and 85.37% versus unseen-data shifts, setting a new state-of-the-art.
Read the full abstract
Quantum Algebra
Formal Deformation quantization as a Fréchet algebra
We define a Fréchet topology on the space $C^\infty(X)[[\hbar]]$ of formal smooth functions on a symplectic manifold $X$, by constructing a sequence of semi-norms on it. For any star product $\star$ on $C^\infty(X)[[\hbar]]$ making it a formal deformation quantization of $X$, we will show that the quantum product $\star$ is jointly continuous, and making it a Fréchet algebra. We will show a quantum Weierstrass theorem which says quantum polynomials are locally dense in all formal smooth functions. We will also show that the canonical trace of any formal deformation quantization is continuous under this Fréchet topology.
Read the full abstract
Metric Geometry
Bistable Quad-Nets Composed of Four-Bar Linkages
We study a novel type of mechanical structures, composed of spatial four-bar linkages, that are bistable, that is, they allow for two distinct configurations. These structures have an interpretation as quad nets in the Study quadric which we use to prove existence of assemblies with an unbounded number of links and joints. We propose a purely geometric construction of such objects, starting from infinitesimally flexible quad nets in Euclidean space and applying Whiteley de-averaging. This point of view situates the problem within the broader framework of discrete differential geometry and enables the construction of bistable structures from well-known classes of quad nets, such as discrete minimal surfaces. In contrast to many other construction methods for bistable structures, our approach does not rely on numerical optimization and it allows for simple control of relevant geometric parameters such as axis positions and snap angles.