Numerical Analysis
A finite-difference summation-by-parts, conditionally stable partitioned algorithm for conjugate heat transfer problems
Sarah Nataj, David C. Del Rey Fernández, David Brown et al. (+1 more)
In this work, we design and analyze a novel, provably conditionally stable, weakly coupled partitioned scheme to solve the conjugate heat transfer (CHT) problem. We consider a model CHT problem consisting of linear advection-
diffusion and heat equations, coupled at an interface through continuity of temperature and heat flux. We employ high-order summation-by-parts finite-difference operators in conjunction with simultaneous-approximation-terms (SATs) in curvilinear coordinates for spatial derivatives, combined with first- and second-order time discretizations and temporal extrapolation at the interface. Energy stability is maintained by carefully selecting SAT parameters at the interface. A range of coupling parameters are explored to identify those that yield a stable scheme, and a stepwise approach for choosing SAT parameters that ensure stability is given. The effectiveness of the method is demonstrated through numerical experiments in a two-dimensional model problem on a rectangular domain with curvilinear grids. The proposed approach enables the development of high-order, conditionally stable partitioned solvers suitable for general geometries.
Read the full abstract ▾
All authors Sarah Nataj, David C. Del Rey Fernández, David Brown, Rajeev Jaiman
General Mathematics
Steady Flow of Natural Gas in Pipeline Networks via Solution of a Nonlinear Differential-Algebraic System of Equations
Shriram Srinivasan and Kaarthik Sundar
In the consideration of steady-state flow of gas in pipeline networks, the exclusion of
gravity and nonlinear inertial effects (convective acceleration) leads to a fortuitous simplification in the governing equations to yield a system of nonlinear algebraic equations. Consequently, there are no studies that quantify the effect of
gravity and inertial effects on the flow of gas in pipeline networks or delineate regimes of flow conditions wherein the effects are significant or negligible. In addressing this need, we consider the steady-state flow equations in pipeline networks without neglecting the gravitational and inertial terms and in place of a system of algebraic equations (one for each pipe), this approach results in a nonlinear system of first-order ordinary differential equations (ODEs) which are coupled through algebraic equations that appear in the form of boundary conditions on the pressure and balance of mass flows at either end. One of our main contributions in this article is to demonstrate how the Newton-Raphson
algorithm can still be used to solve the coupled nonlinear differential-algebraic system by utilizing the appropriate forward sensitivity ODEs to evaluate the Jacobian terms arising in the iterative scheme. We also propose a variable transformation that alleviates the poor scaling of the ODE, and we introduce a two-point collocation scheme as a coarse approximation of the system from which to find initial guesses for the Newton iterations. Simulation studies were conducted for a single pipe as well as a large-scale pipeline network with real data. From these studies, we concluded that while the effect of
gravity is important, the inertial effect was negligible in all cases. The proposed methodology is applicable to a wide class of pipeline and thermal-fluid networks beyond natural gas, including
liquid pipelines and hydrogen transport.
Read the full abstract ▾
Dynamical Systems
Periodic orbits of reversible Lagrangian systems without self-intersections and Mañé genericity
Hans-Bert Rademacher
Bernard [3] showed that a Mañé generic convex
Hamiltonian has only non-degenerate periodic orbits on a given energy level. We show that one can use this result to prove that for a generic potential the
prime periodic orbits of fixed energy of a Lagrangian system of classical type on a compact
manifold of dimension $n\ge 3$ do not have self-intersections and do not intersect each other.
Read the full abstract ▾
Optimization and Control
A note on diffusive solutions of the Lyapunov and Riccati inequalities for quasi-monotone (QM) mappings on cones
Oliver Mason
We consider three key properties of Metzler and nonnegative
matrices and extensions of these to classes of self-dual proper convex cones. Specifically, we study mappings that are quasi-monotone (QM) with respect to a cone $K$ and discuss results extending D-stability, diagonal Lyapunov stability, and diagonal Riccati stability to this setting. Mappings that act diffusively with respect to the cone are used as generalisations of diagonal
matrices. Relationships with recent results for symmetric cones obtained using Jordan algebraic methods are also discussed.
Read the full abstract ▾
Geometric Topology
4-dimensional Skein modules, Handle attachments, and Tangles
Gage Martin, Mary Stelow and Mira Wattal
Skein lasagna modules are a recent tool developed for the study of 4-
manifolds. We provide general formula for 1-, 2-, and 3-handle attachments for skein modules defined with any functorial link theory in $S^3 \times I$ generalizing existing formula of Chen, Manolescu-Neithalath, Manolescu-Walker-Wedrich, and Ren-Willis. These formula are derived from a complete description of the gluing homomorphism on skein modules. For this description, we introduce a variation of these skein modules in the presence of distinguished 3-
manifolds in the boundary. A similar construction was recently introduced independently by Blackwell-Krushkal-Luo.
Read the full abstract ▾
Optimization and Control
Duality methods in stochastic optimal control
Peter Bank and Filippo de Feo
We prove two duality descriptions of the value function for a generic
stochastic optimal control problem. These yield sharp bounds for the value function and also hold when the
diffusion is controlled, a case left open by the literature so far. We also give duality descriptions for singular control problems.
Read the full abstract ▾
Numerical Analysis
Variational optimization approach for reconstruction of dielectric permittivity and conductivity functions using partial boundary measurements
Eric Lindström and Larisa Beilina
We present a variational optimization approach for the solution of a coefficient inverse problem of simultaneous reconstruction of the dielectric permittivity and conductivity functions in time-dependent Maxwell's system using limited boundary observations of the electric field. The variational optimization approach is based on constructing a weak form of a Lagrangian which allows to use finite element based reconstruction
algorithms. The optimality conditions for the Lagrangian and stability estimate for the adjoint problem are derived, as well as Frechét differentiability of it and of the regularized Tikhonov functional are also presented. Two- and three-dimensional numerical studies confirm our theoretical investigations.
Read the full abstract ▾
Optimization and Control
Optimality conditions via exact penalty functions
Vsevolod Ivanov Ivanov
In this paper, we obtain optimality conditions for the problem with inequality, equality and closed set constraints in terms of the lower Hadamard derivative. The results are obtained applying exact penalty functions.
Group Theory
Enumeration of Nilpotent Loops by Orbit Counting
Fariha Iftikhar and Gábor P. Nagy
We study central extensions of nilpotent loops by elementary abelian $p$-groups using normalized cocycles. By introducing an affine
automorphism group acting on the full cocycle space, we obtain a direct correspondence between affine orbits and isomorphism classes of central extensions. This framework yields an efficient orbit-counting method for enumerating nilpotent loops. We reproduce the known results for orders less than 24, and enumerate the nilpotent loops of order 24 with center of size at least 3.
Read the full abstract ▾
Optimization and Control
Maxwell Strata in the sub-Riemannian problem on solvable, nonnilpotent regular three-dimensional Lie groups
Adriano Da Silva, Lino Grama, Douglas Duarte Novaes et al. (+1 more)
In this paper, we study the sub-Riemannian problem associated with contact structures on connected, simply connected, solvable, non-nilpotent, regular three-dimensional Lie groups. For these groups, the vertical component of the
Hamiltonian system takes the form of a perturbed pendulum. A qualitative phase-space analysis allows us to prove that this vertical component exhibits nontrivial
symmetries. In particular, we are able to fully characterize the Maxwell set corresponding to these
symmetries, and show that its first Maxwell time coincides with the period of the pendulum for almost all geodesics. This result yields an explicit upper bound for the cut time in terms of the period of the pendulum.
Read the full abstract ▾
All authors Adriano Da Silva, Lino Grama, Douglas Duarte Novaes, Margarita Quispe Tusco
Numerical Analysis · Cross-listed from physics.flu-dyn
Impact of Structure-Preserving Discretizations on Compressible Wall-Bounded Turbulence of Thermally Perfect Gases
Alessandro Aiello, Andrea Palumbo, Carlo De Michele et al. (+1 more)
Direct numerical simulations of compressible turbulent channel flow at supersonic and hypersonic Mach numbers are performed using a thermally perfect gas model for CO$_2$. The objective is to assess the role of structure-preserving discretizations of the convective terms in high-enthalpy regimes, with particular emphasis on
entropy conservation, kinetic-energy preservation, and consistency with the thermodynamic closure. The comparative analysis of various formulations examines their impact on robustness, thermodynamic fluctuations, and
turbulence statistics across a range of Mach numbers. Differences among formulations are found to originate primarily in the treatment of thermodynamic variables and progressively influence the dynamical fields as compressibility effects intensify. In particular, the coupling between
entropy consistency and pressure discretization is shown to affect Reynolds stresses and mean flow properties in high-speed regimes. Overall, the results indicate that consistency between the numerical formulation and the thermodynamic model contributes significantly to the reliable simulation of high-enthalpy compressible
turbulence. The study systematically assesses
entropy-conservative discretizations for thermally perfect gases in wall-bounded flows and examines their impact on thermodynamic-dynamic coupling at high Mach numbers.
Read the full abstract ▾
All authors Alessandro Aiello, Andrea Palumbo, Carlo De Michele, Gennaro Coppola
Numerical Analysis
Solving and learning advective multiscale Darcian dynamics with the Neural Basis Method
Yuhe Wang and Min Wang
Physics-governed models are increasingly paired with machine learning for accelerated predictions, yet most "physics–informed" formulations treat the governing equations as a penalty loss whose scale and meaning are set by heuristic balancing. This blurs operator structure, thereby confounding solution approximation error with governing-equation enforcement error and making the solving and learning progress hard to interpret and control. Here we introduce the Neural Basis Method, a projection-based formulation that couples a predefined, physics-conforming neural basis space with an operator-induced residual metric to obtain a well-conditioned deterministic minimization. Stability and reliability then hinge on this metric: the residual is not merely an optimization objective but a computable certificate tied to approximation and enforcement, remaining stable under basis enrichment and yielding reduced coordinates that are learnable across parametric instances. We use advective multiscale Darcian dynamics as a concrete demonstration of this broader point. Our method produce accurate and robust solutions in single solves and enable fast and effective parametric inference with operator learning.
Read the full abstract ▾
Probability
A logical approach to concentration
Michael Benedikt and Maksim Zhukovskii
Concentration results say that a sequence of random variables becomes progressively concentrated around the mean. Such results are common in the study of functions of random graphs. We introduce a real-valued logic with various aggregate operators on graphs, including summation, and prove that every term in the
language, seen as a random variable on random graphs within the classical Erdős-Rényi random graph model, is concentrated. We prove this for dense and sparse variants of Erdős-Rényi graphs. On the one hand, our results extend the line of work originating with Fagin and Glebskii et al. on zero-one laws for dense random graphs, as well as the zero-one law of Shelah and Spencer for sparse random graphs. On the other hand, they can be seen as a meta-
theorem for inferring concentration results on random graphs, and we give examples of such applications.
Read the full abstract ▾
Number Theory
Fermat's Last Theorem for Selmer sections
Benjamin Steklov
We prove, in the context of the section
conjecture, that every Selmer section over $\mathbb{Q}$ of the affine Fermat curve with exponent $\ell$ is cuspidal for $\ell\geq 7$.
Statistics Theory · Cross-listed from cs.LG
Bayesian Optimality of In-Context Learning with Selective State Spaces
Di Zhang and Jiaqi Xing
We propose
Bayesian optimal sequential prediction as a new principle for understanding in-context learning (ICL). Unlike interpretations framing
Transformers as performing implicit gradient descent, we formalize ICL as meta-learning over latent sequence tasks. For tasks governed by Linear Gaussian State Space Models (LG-SSMs), we prove a meta-trained selective SSM asymptotically implements the Bayes-optimal predictor, converging to the posterior predictive mean. We further establish a statistical separation from gradient descent, constructing tasks with temporally correlated noise where the optimal
Bayesian predictor strictly outperforms any empirical risk minimization (ERM)
estimator. Since
Transformers can be seen as performing implicit ERM, this demonstrates selective SSMs achieve lower asymptotic risk due to superior statistical efficiency. Experiments on synthetic LG-SSM tasks and a character-level Markov
benchmark confirm selective SSMs converge faster to Bayes-optimal risk, show superior sample efficiency with longer contexts in structured-noise settings, and track latent states more robustly than linear
Transformers. This reframes ICL from "implicit optimization" to "optimal inference," explaining the efficiency of selective SSMs and offering a principled basis for architecture design.
Read the full abstract ▾
Spectral Theory
On the Vertex Seidel Energy of Graphs
Kalpesh M. Popat and Enide Andrade
We introduce the vertex Seidel energy via the diagonal entries of the absolute Seidel
matrix. We establish a spectral formula, compute exact values for several graph families, derive bounds, and present a Coulson-type integral representation for analytical study of this invariant. We also show that vertex Seidel energy is invariant under Seidel switching and complementation.
Read the full abstract ▾
Information Theory · Cross-listed from cs.MA
Reasoning-Native Agentic Communication for 6G
Hyowoon Seo, Joonho Seon, Jin Young Kim et al. (+3 more)
Future 6G networks will interconnect not only devices, but autonomous machines that continuously sense, reason, and act. In such environments, communication can no longer be understood solely as delivering bits or even preserving semantic meaning. Even when two
agents interpret the same information correctly, they may still behave inconsistently if their internal
reasoning processes evolve differently. We refer to this emerging challenge as belief divergence. This article introduces
reasoning native agentic communication, a new paradigm in which communication is explicitly designed to address belief divergence rather than merely transmitting representations. Instead of triggering transmissions based only on channel conditions or data relevance, the proposed framework activates communication according to predicted misalignment in
agents internal belief states. We present a
reasoning native architecture that augments the conventional communication stack with a coordination plane grounded in a shared knowledge structure and bounded belief modeling. Through enabling mechanisms and representative multi
agent scenarios, we illustrate how such an approach can prevent coordination drift and maintain coherent behavior across heterogeneous systems. By reframing communication as a regulator of distributed
reasoning,
reasoning native agentic communication enables 6G networks to act as an active harmonizer of autonomous intelligence.
Read the full abstract ▾
All authors Hyowoon Seo, Joonho Seon, Jin Young Kim, Mehdi Bennis, Wan Choi, Dong In Kim
Geometric Topology
Dehn quandles of surfaces and their bounded cohomology
Pankaj Kapari, Deepanshi Saraf and Mahender Singh
We introduce new families of quandles associated with closed orientable surfaces that can distinguish surfaces up to homeomorphism. These quandles generalize the classical Dehn quandle and are defined, respectively, on isotopy classes of unoriented essential closed curves and on integral weighted multicurves. We establish their fundamental algebraic properties and construct a natural quandle covering relating the two families. We further investigate their large-scale geometry and prove that they are unbounded with respect to the quandle metric. We determine their second bounded quandle
cohomology and show that its dimension equals the cardinality of the continuum. We also establish a quandle-theoretic analogue of the Gromov Mapping
Theorem, showing that the natural projection from an abelian quandle extension onto its base quandle induces an injection on bounded quandle
cohomology in every degree. Finally, motivated by recent developments in quandle
algebras, we study idempotents in the integral quandle
algebras associated with the classical Dehn quandle. In particular, we prove that the integral quandle
algebra of the Dehn quandle of the
torus admits no non-trivial idempotents.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Benchmarking quantum phase-space methods for near-resonant light propagation
Mojdeh S. Najafabadi, Joel F. Corney, Luis Sanchez Soto et al. (+1 more)
We study the dynamics of light interacting with a near-resonant atomic medium using the truncated Wigner and positive P phase-space representations. The atomic degrees of freedom are described using the Jordan-Schwinger mapping. The dynamics is first analyzed under
unitary evolution and subsequently in the presence of an optical reservoir. While both approaches capture the main features of the light-matter dynamics, we find that the truncated Wigner approximation exhibits noticeable deviations for stronger interaction strengths and when reservoir-induced noise becomes significant.
Read the full abstract ▾
All authors Mojdeh S. Najafabadi, Joel F. Corney, Luis Sanchez Soto, Gerd Leuchs
Information Theory · Cross-listed from cs.LG
MARS: Margin and Semantic-Aware Data Augmentation for Reward Modeling
Payel Bhattacharjee, Osvaldo Simeone and Ravi Tandon
Reward modeling is central to RLHF, RLAIF, and PPO-based
alignment, but its reliability is often limited by scarce and heterogeneous human preference data. In this paper, we introduce MARS (Margin and Semantic-Aware Data Augmentation for Reward Modeling), an adaptive augmentation framework for controlled low-resource reward modeling. MARS allocates more augmentation to low-margin preference pairs and uses semantic-distance-based refinement to improve chosen-rejected contrast before generating synthetic preference samples. Across three preference
datasets, two reward-model backbones, and downstream
alignment evaluations, MARS improves average RewardBench performance and
alignment win rates over uniform augmentation, WoN, and AdaBoost-style baselines. Ablations and independent-judge evaluations suggest that the gains are not solely explained by semantic refinement alone or GPT-4.1 judge coupling.
Read the full abstract ▾
Combinatorics
On Sets of Monochromatic Objects in Bicolored Point Sets
Sujoy Bhore and Konrad Swanepoel
Let $P$ be a set of $n$ points in the plane, not all on a line, each colored red or blue. The classical Motzkin–Rabin
theorem guarantees the existence of a monochromatic line. Motivated by the seminal work of Green and Tao (2013) on the Sylvester-Gallai
theorem, we investigate the quantitative and structural properties of monochromatic
geometric objects, such as lines, circles, and conics. We first show that if no line contains more than three points, then for all sufficiently large $n$ there are at least $n^{2}/24 - O(1)$ monochromatic lines. We then show a converse of a
theorem of Jamison (1986): Given $n\ge 6$ blue points and $n$ red points, if the blue points lie on a conic and every line through two blue points contains a red point, then all red points are collinear. We also settle the smallest nontrivial case of a
conjecture of Milićević (2018) by showing that if we have $5$ blue points with no three collinear and $5$ red points, if the blue points lie on a conic and every line through two blue points contains a red point, then all $10$ points lie on a cubic curve. Further, we analyze the random setting and show that, for any non-collinear set of $n\ge 10$ points independently colored red or blue, the expected number of monochromatic lines is minimized by the near-pencil configuration. Finally, we examine monochromatic circles and conics, and exhibit several natural families in which no such monochromatic objects exist.
Read the full abstract ▾
Dynamical Systems · Cross-listed from quant-ph
The Hidden Nature of Non-Markovianity
Jihong Cai, Advith Govindarajan and Marius Junge
The theory of open
quantum systems served as a tool to prepare
entanglement at the beginning stage of
quantum technology and more recently provides an important tool for state preparation. Dynamics given by time dependent Lindbladians are Markovian and lead to decoherence, decay of correlation and convergence to
equilibrium. In contrast Non-Markovian evolutions can outperform their Markovian counterparts by enhancing
memory. In this letter we compare the trajectories of Markovian and Non-Markovian evolutions starting from a fixed initial value. It turns out that under mild assumptions every trajectory can be obtained from a family of time dependent Lindbladians. Hence Non-Markovianity is invisible if single trajectories are concerned.
Read the full abstract ▾
Metric Geometry
The strength of a geometric simplex
Olga Anosova and Vitaliy Kurlin
The basic input for many real objects is a finite cloud of unordered points. The strongest equivalence between objects in practice is rigid motion in a Euclidean space. A recent
polynomial-time classification of point clouds required a Lipschitz continuous function that vanishes on degenerate simplices, while the usual volume is not Lipschitz. We define the strength of any
geometric simplex and prove its continuity under perturbations with explicit bounds for Lipschitz constants.
Read the full abstract ▾
Differential Geometry
Carlo Mantegazza and Francesca Oronzio
We discuss some properties of the distance functions on Riemannian
manifolds and we relate their behavior to the geometry of the
manifolds. This leads to alternative proofs of some "classical"
theorems connecting
curvature and
topology.
Probability
Giorgio Cipolloni, László Erdős and Oleksii Kolupaiev
We prove that the point process of the
eigenvalues of real or complex non-Hermitian
matrices $X$ with independent, identically distributed entries is hyperuniform: the variance of the number of
eigenvalues in a subdomain $\Omega$ of the spectrum is much smaller than the volume of $\Omega$. Our main technical novelty is a very precise computation of the covariance between the resolvents of the Hermitization of $X-z_1, X-z_2$, for two distinct complex parameters $z_1,z_2$.
Read the full abstract ▾
Functional Analysis
Towards direct $L^2$-bounds for maximal partial sums of Walsh–Fourier series: The case of dyadic partial sums
Joseph D. Lakey
We outline an approach to obtain direct $L^2$ estimates not requiring interpolation for so-called linearized partial sums operators associated with expansions in Walsh functions. We focus specifically on a simpler case of dyadic partial sums but also outline a second approach to proving bounds on general linearized partial sums.
Read the full abstract ▾
Algebraic Geometry
Generically log smooth families via generators and relations
Simon Felten
Let $f\colon X \to \mathbb{A}^1_t$ be an affine flat morphism of finite type, and let $V = f^{-1}(0)$. Then, we obtain a morphism of log schemes $f\colon (X|V) \to (\mathbb{A}^1_t|0)$. In this article, we develop algorithmic tools to study the log-
geometric properties of $f$ by means of a presentation \[\Gamma(X,\mathcal{O}_X) = \Bbbk[t,x_1,\ldots,x_n]/(f_1,\ldots,f_r).\] We obtain similar tools for projective flat morphisms when the homogeneous coordinate ring is given by generators and relations. We provide an implementation of our
algorithms in Macaulay2. In a slightly different direction, we give some results on the sheaf $\mathcal{LS}_V$ of log smooth structures on a toroidal crossing scheme $(V,\mathcal{P},\bar\rho)$.
Read the full abstract ▾
Classical Analysis and ODEs
Power weight inequalities for spherical maximal functions
Marco Fraccaroli, Joris Roos and Andreas Seeger
This paper is about spherical maximal functions with general dilation sets acting on functions in weighted $L^p(|x|^\alpha)$ spaces. Aside from endpoint cases, a complete description of the allowable ranges of $p$, $\alpha$ is given in terms of the Legendre–Assouad function of the dilation set. This settles, up to endpoints, an open problem of Duoandikoetxea and Seijo.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.AI
AutoNumerics: An Autonomous, PDE-Agnostic Multi-Agent Pipeline for Scientific Computing
Jianda Du, Youran Sun and Haizhao Yang
PDEs are central to scientific and engineering modeling, yet designing accurate numerical solvers typically requires substantial mathematical expertise and manual tuning. Recent neural network-based approaches improve flexibility but often demand high computational cost and suffer from limited interpretability. We introduce AutoNumerics, a multi-
agent framework that autonomously designs, implements, debugs, and verifies numerical solvers for general PDEs directly from natural
language descriptions. Unlike black-box neural solvers, our framework generates transparent solvers grounded in classical numerical analysis. We introduce a coarse-to-fine execution strategy and a residual-based self-verification mechanism. Experiments on 24 canonical and real-world PDE problems demonstrate that AutoNumerics achieves competitive or superior accuracy compared to existing neural and LLM-based baselines, and correctly selects numerical schemes based on PDE structural properties, suggesting its viability as an accessible paradigm for automated PDE solving.
Read the full abstract ▾
Statistics Theory
Asymptotically Optimal Sequential Testing with Markovian Data
Alhad Sethi, Kavali Sofia Sagar, Shubhada Agrawal et al. (+2 more)
We study one-sided and $\alpha$-correct sequential hypothesis testing for data generated by an ergodic, finite-state Markov chain. The null hypothesis is that the unknown transition
matrix belongs to a prescribed set $P$ of
stochastic matrices, and the alternative corresponds to a disjoint set $Q$. We establish a non-asymptotic instance-dependent lower bound on the expected stopping time of any valid sequential test under the alternative, which is asymptotically tight. Our novel analysis improves the existing lower bounds, which are either asymptotic or provably sub-optimal in this setting. Our lower bound incorporates both the stationary distribution and the transition structure induced by the unknown Markov chain. We further propose an optimal test whose expected stopping time matches this lower bound asymptotically as $\alpha \to 0$. We illustrate the usefulness of our framework through applications to sequential detection of model misspecification in Markov Chain Monte Carlo and to testing structural properties, such as the linearity of transition dynamics, in Markov decision processes. Our findings yield a sharp and general characterization of optimal sequential testing procedures under Markovian dependence.
Read the full abstract ▾
All authors Alhad Sethi, Kavali Sofia Sagar, Shubhada Agrawal, Debabrota Basu, P. N. Karthik