Optimization and Control
PH-KAN: Port-Hamiltonian Kolmogorov-Arnold Network
Achraf El Messaoudi, Karim Cherifi, Yann Le Gorrec et al. (+1 more)
Data-driven machine learning approaches have become increasingly attractive for nonlinear system identification, but standard models often fail to preserve the underlying physical structure and remain difficult to interpret, especially when no analytical model is available. In this context, port-
Hamiltonian (pH) models provide a natural physics-informed representation. However, when these models are parameterized with standard multilayer perceptrons (MLPs), the learned constitutive components often remain poorly interpretable. In this paper, we propose a structure-preserving identification framework for nonlinear port-
Hamiltonian systems based on Kolmogorov-Arnold Networks (KANs). The proposed PH-KAN model parameterizes the interconnection
matrix, dissipation
matrix,
Hamiltonian, and input mapping using dedicated KAN blocks, while enforcing the port-
Hamiltonian constraints by construction. This yields constitutive representations in which the nonlinear functions defining the identified pH components can be explicitly inspected, leading to a more interpretable model than with standard MLP-based parameterizations.
Read the full abstract ▾
All authors Achraf El Messaoudi, Karim Cherifi, Yann Le Gorrec, Yongxin Wu
Commutative Algebra
On Hellus–Lyubeznik–Yildirim's conjecture of local cohomology modules
Alberto F. Boix and Majid Eghbali
The goal of this paper is to study the so–called Hellus–Lyubeznik–Yildirim (HLY)
conjecture, that predicts the following: given a regular local ring $(R,\mathfrak{m})$, and any ideal $I\subset R$, zero is an associated
prime ideal of the Matlis dual of any non–zero local
cohomology module supported on $I$. Among other results, we give some partial positive answers to this
conjecture in the following cases: when $\operatorname{depth} (R/I)=1$, when $\operatorname{depth} (R/I)=2$ under some extra assumptions, when $I$ is a squarefree monomial ideal inside a formal power series ring over a field, and when $R$ is a formal power series over a discrete valuation ring of mixed characteristic.
Read the full abstract ▾
Information Theory · Cross-listed from cs.LG
Agentic AI-Based Joint Computing and Networking via Mixture of Experts and Large Language Models
Robert-Jeron Reifert, Alaa Alameer Ahmad, Hayssam Dahrouj et al. (+1 more)
Future sixth-generation (6G) mobile networks are envisioned to be equipped with a diverse set of powerful, yet highly specialized, optimization experts. Such a promising
vision is concurrently expected to give rise to the need for scalable mechanisms that can select, combine, and orchestrate such experts based on high-level intent and uncertainty descriptions. In this paper, we propose an agentic artificial intelligence (AI)-based network optimization framework that integrates mixture of experts (MoE) architectures with large
language models (LLMs). Under the proposed framework, the employed LLM acts as a semantic gate to reason over operator objectives and dynamically compose suitable optimization
agents. The proposed framework is formulated in a model-agnostic manner and bridges human-readable network intents with low-level resource allocation decisions, enabling flexible optimization across heterogeneous objectives and operating conditions. As a representative instantiation, we apply the framework to a joint communication and computing network and design a library of specialized optimization experts covering throughput,
fairness, and delay-driven objectives under both regular and robust conditions. Numerical simulations demonstrate that the proposed agentic MoE framework consistently achieves near-optimal performance compared to exhaustive expert combinations while outperforming individual experts across diverse objectives, including delay minimization and throughput maximization.
Read the full abstract ▾
All authors Robert-Jeron Reifert, Alaa Alameer Ahmad, Hayssam Dahrouj, Aydin Sezgin
Representation Theory
The Dual Canonical Basis in the Spin Representation via the Temperley-Lieb Algebra
Rachel Chen
The
spin representation $(\mathbb C^2)^{\otimes n}$ has a dual canonical basis introduced by Lusztig that is important in many areas of
algebra, geometry, and physics. Khovanov observed that a portion of the dual canonical basis can be viewed diagrammatically through the Temperley-Lieb
algebra. We provide a simpler construction that we generalize to the entire dual canonical basis, and write explicit formulas to compute the dual canonical basis, and thus the canonical basis of the spherical module, as a byproduct. We reprove some of Khovanov's results using our new perspective. Furthermore, we use the Hecke
algebra to reprove the fact that the canonical basis is indeed dual to the dual canonical basis, leading to similar results about the canonical basis in $\mathcal M^*$ and $\mathcal N^*$, the dual spaces to the spherical and aspherical modules, as a byproduct. Finally, we present an alternative axiomatic definition of the canonical basis using diagrams.
Read the full abstract ▾
Complex Variables
Meromorphic Solutions of Difference Equations Involving Borel and Nevanlinna Exceptional Values
Molla Basir Ahamed and Vasudevarao Allu
The existence of meromorphic solutions to various difference equations has been extensively studied in recent years, the precise functional forms of such solutions – particularly when the function and its difference operators share values – remain largely unexplored. This paper addresses this research gap by investigating the sharing value problem between finite-order meromorphic functions $f(z)$ and their linear difference operators $L_{c}^{n}(f)$. Specifically, we consider functions having Borel or Nevanlinna exceptional values. We prove not only the existence but also characterize the explicit general meromorphic solutions to the difference equation $L_{c}^{n}(f)\equiv Af$ for $A\in\mathbb{C}\backslash\{0\}$. To validate our main results and demonstrate the necessity of our conditions, we provide several concrete examples. Furthermore, we investigate the existence and nature of both rational and transcendental meromorphic solutions for the second-order difference equation $b_{2}(z)f(z+2\eta)+b_{1}(z)f(z+\eta)+b_{0}(z)f(z)=b(z)$ with
polynomial coefficients.
Read the full abstract ▾
Complex Variables · Cross-listed from cond-mat.soft
i-Rheo-Tempo: A Model-Free, Quadrature-Free Reconstruction of the Shear Relaxation Modulus from Complex Viscosity
Jorge Ramírez and Manlio Tassieri
Reliable transformation between frequency- and time-domain material functions remains a central challenge in linear viscoelasticity due to finite bandwidth, discrete sampling, and experimental noise. We introduce \emph{i\text{-}Rheo-Tempo}, a quadrature-free method that reconstructs the shear relaxation modulus directly from dynamic measurements through an exact second-derivative representation of the complex viscosity. When the spectrum is approximated as piecewise linear, the inversion reduces to a compact interval-slope formulation based solely on local spectral properties, avoiding numerical quadrature, parametric fitting, and predefined relaxation spectra. The method is validated against a set of complex fluids including synthetic models,
polymer melts, industrial elastomers, comb
polymers, and broadband microrheology
datasets spanning nearly nine decades in frequency. In all cases, the reconstructed relaxation modulus is in quantitative agreement with independent time-domain measurements. These results demonstrate that \emph{i\text{-}Rheo-Tempo} provides a robust, model-free solution to the frequency-to-time inverse problem and, more generally, establishes a framework for recovering time-domain responses from experimentally measured complex spectra.
Read the full abstract ▾
History and Overview of Mathematics
Analogues of a formula of Ferrar: what I have learned from Semyon Yakubovich
Pedro Ribeiro
W. L. Ferrar seems to have been the first mathematician to clearly draw a connection between the functional aspects of a summation formula and the behavior of the Dirichlet series underlying it. Taking a formula due to him as a starting point, I will describe some new generalizations of Ferrar's formulas and how these were actually obtained after learning a great deal from Semyon. I also present a very concise overview of the underlying theory of summation formulas and how the Mellin transform has been the link between mine and Professor Yakubovich's interests.
Read the full abstract ▾
Information Theory · Cross-listed from cs.NI
Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies
Jingkai Luo and Yulin Shao
Large-scale multi-
agent communication has long faced a scalability bottleneck: fully connected networks require quadratic complexity, yet existing sparse
topologies rely on hand-crafted rules. This paper treats the communication graph itself as a design variable and proposes CayleyTopo, a family of circulant Cayley graphs whose generator sets are optimized to minimize diameter, directly targeting worst-case information propagation speed. To navigate the enormous search space of possible generator sets, we develop a lightweight reinforcement learning framework that injects a number-theoretic prior to favor structurally rich generators, alongside a message-propagation score that provides dense connectivity feedback during construction. The resulting CayleyTopo consistently outperforms existing hand-crafted
topologies, achieving faster information dissemination, greater resilience to link failures, and lower communication load, all while approaching the theoretical Moore bound. Our study opens the door to scalable, robust, and efficient communication foundations for future multi-
agent systems, where the graph itself becomes optimizable rather than a fixed constraint.
Read the full abstract ▾
Dynamical Systems
Shape Preserving Zipper Hidden Variable Fractal Interpolation Function
Chol Hui Yun, Yu Jong Pak, Mi Gyong Ri et al. (+1 more)
In this paper, we study a new class of zipper fractal interpolation functions (ZFIFs) constructed using a zipper hidden variable iterated function system (ZHVIFS). ZFIFs have more diverse shape than usual fractal interpolation functions, and the hidden variable iterated function system is more general than the iterated function system. Firstly, we introduce a ZHVIFS and construct univariate ZFIFs using the ZHVIFS. Next, we find the conditions on vertical scaling factors for the ZFIFs to preserve boundedness, positivity and piecewise slop of the data set, which are demonstrated through examples.
Read the full abstract ▾
All authors Chol Hui Yun, Yu Jong Pak, Mi Gyong Ri, Kyong Ju Ri
Numerical Analysis · Cross-listed from nlin.CD
Comparing an Ensemble Kalman Filter to a 4DVAR Data Assimilation System in Chaotic Dynamics
Fabrício Pereira Harter and Cleber Souza Corrêa
In this paper, the Ensemble Kalman Filter is compared with a 4DVAR Data Assimilation System in chaotic dynamics. The Lorenz model is chosen for its simplicity in structure and its dynamical similarities with primitive equation models, such as modern numerical weather
forecasting. It was examined whether the Ensemble Kalman Filter and 4DVAR are effective in tracking the control for 10%, 20%, and 40% of error in the initial conditions. With 10% of noise, the trajectories of both methods are almost perfect. With 20% of noise, the differences between the simulated trajectories and the observations, as well as the true trajectories, are rather small for the Ensemble Kalman Filter but almost perfect for 4DVAR. However, the differences become increasingly significant at the later part of the integration period for the Ensemble Kalman Filter, due to the chaotic behavior of the system. For the case with 40% error in the initial conditions, neither the Ensemble Kalman Filter nor 4DVAR could track the control with only three observations ingested. To evaluate a more realistic assimilation application, an experiment was created in which the Ensemble Kalman Filter ingested a single observation at the 180th time step in the X, Y, and Z Lorenz variables, and only in the X variable. The results show a perfect fit of 4DVAR and the control during a complete integration period, but the Ensemble Kalman Filter shows disagreement after the 80th time step. On the other hand, a considerable disagreement between the Ensemble Kalman Filter trajectories and the control is observed, as well as a total failure of 4DVAR. Better results were obtained for the case in which observations cover all the components of the model vector.
Read the full abstract ▾
Mathematical Physics · Cross-listed from physics.flu-dyn
Collective Dynamics of Vortex Clusters in Compact Fluid Domains: From Pair Interactions to a Quadrupole Description
Aswathy KR and Rickmoy Samanta
Clusters of co-rotating
vortices on compact fluid domains exhibit a simple collective dynamics, combining coherent global rotation with a slow breathing of the cluster size. In this work, we investigate an analytic model of
vortex interactions on a doubly periodic inviscid fluid domain, based on an exact representation in terms of the Schottky-Klein
prime function and its $q$-representation. The two-
vortex problem reduces to a single complex degree of freedom, from which explicit expressions for the orbital rotation frequency and dipole translation velocity are obtained. Building on this framework, we derive a small-cluster expansion that reveals a decomposition of the dynamics into universal planar interactions, isotropic
torus corrections, and geometry-induced anisotropic modes. At leading order, the collective dynamics is encoded in a single complex quadrupole moment: its real part governs corrections to the rotation rate, while its imaginary part controls the slow breathing of the cluster. These predictions are quantitatively confirmed by direct numerical simulations, establishing a reduced description of
vortex clusters on the flat
torus and compact fluid domains.
Read the full abstract ▾
Information Theory · Cross-listed from stat.ML
NS-RGS: Newton-Schulz based Riemannian gradient method for orthogonal group synchronization
Haiyang Peng, Deren Han, Xin Chen et al. (+1 more)
Group synchronization is a fundamental task involving the recovery of group elements from pairwise measurements. For orthogonal group synchronization, the most common approach reformulates the problem as a constrained nonconvex optimization and solves it using projection-based methods, such as the generalized power method. However, these methods rely on exact SVD or QR decompositions in each iteration, which are computationally expensive and become a bottleneck for large-scale problems. In this paper, we propose a Newton-Schulz-based Riemannian Gradient Scheme (NS-RGS) for orthogonal group synchronization that significantly reduces computational cost by replacing the SVD or QR step with the Newton-Schulz iteration. This approach leverages efficient
matrix multiplications and aligns perfectly with modern GPU/TPU architectures. By employing a refined leave-one-out analysis, we overcome the challenge arising from statistical dependencies, and establish that NS-RGS with spectral initialization achieves linear convergence to the target solution up to near-optimal statistical noise levels. Experiments on synthetic data and real-world global
alignment tasks demonstrate that NS-RGS attains accuracy comparable to state-of-the-art methods such as the generalized power method, while achieving nearly a 2$\times$ speedup.
Read the full abstract ▾
All authors Haiyang Peng, Deren Han, Xin Chen, Meng Huang
Mathematical Physics · Cross-listed from gr-qc
Electromagnetic wave propagation in static black hole spacetimes: an effective refractive index description in Schwarzschild geometry
Abdullah Guvendi, Omar Mustafa Semra Gurtas Dogan and Hassan Hassanabadi
We investigate electromagnetic wave propagation in static, spherically symmetric black hole spacetimes using a covariant and gauge-invariant framework based on the established Maxwell perturbation formalism. Building upon known parity decompositions and gauge-invariant master equations, we reformulate the resulting radial dynamics entirely within Schwarzschild coordinates and introduce an effective refractive-index description of electromagnetic propagation in curved spacetime. Starting from the source-free Maxwell equations on a curved background, electromagnetic perturbations are decomposed according to parity and systematically reduced to gauge-invariant dynamical variables without introducing auxiliary coordinate transformations or horizon-regular variables. Both axial and polar sectors are shown to obey the same parityindependent master equation, and their exact isospectrality emerges naturally as a direct consequence of Maxwell theory in four dimensions. By eliminating first-derivative terms through an appropriate field redefinition, the radial dynamics is cast into a Helmholtz-type equation, which motivates the introduction of an effective, position- and frequency-dependent refractive index encoding gravitational
redshift,
curvature effects, and angular momentum within a unified optical framework. Specializing to the Schwarzschild geometry, we obtain the refractive index in closed analytical form and analyze its behavior in the near-horizon, intermediate, and asymptotic regimes. The resulting description provides a transparent and physically intuitive interpretation of electromagnetic evanescence, and propagation in black hole spacetimes, and establishes a robust foundation for wave-optical, semiclassical, and numerical studies in more general static gravitational backgrounds.
Read the full abstract ▾
Probability
Probabilistic Weyl Law for Twisted Toeplitz Matrices with Rough Symbols
Lucas Noël
In this article, we study the convergence of the empirical spectral measure of twisted Toeplitz
matrices subject to small random perturbations. We show that the empirical spectral measure converges weakly in probability to the push-forward of the Lebesgue measure by the symbol. The symbol of the twisted Toeplitz
matrices is assumed to be smooth in frequency, and only piecewise Hölder continuous with respect to the position variable with discontinuities of jump type.
Read the full abstract ▾
Analysis of PDEs
Liouville Theorems Above the Critical $9/2$ Threshold for Stationary Navier-Stokes Equations
Gaston Vergara-Hermosilla
We establish new Liouville-type
theorems for the stationary Navier-Stokes equations in $\mathbb{R}^3$. A central open problem in this context is whether the classical $L^{9/2}(\mathbb{R}^3)$ condition of G.Galdi can be relaxed. In this note we show that this global integrability requirement can indeed be weakened. More precisely, we prove that triviality already follows under assumptions of the form $u \in L^{9/2 + \varepsilon(\cdot)}(\mathbb{R}^3)$, where $\varepsilon(\cdot)>0$. As a consequence, we obtain a localized Liouville
theorem: it is sufficient to impose this integrability condition only at infinity, with no additional assumptions on the behavior of $u$ inside a compact set. This highlights that the mechanism enforcing triviality is purely asymptotic. Our approach relies on a general uniqueness result in the framework of Lebesgue spaces with variable exponents, which naturally captures the coexistence of different integrability regimes across the domain.
Read the full abstract ▾
Optimization and Control
Stochastic Auto-conditioned Fast Gradient Methods with Optimal Rates
Yao Ji and Guanghui Lan
Achieving optimal rates for
stochastic composite convex optimization without prior knowledge of problem parameters remains a central challenge. In the deterministic setting, the auto-conditioned fast gradient method has recently been proposed to attain optimal accelerated rates without line-search procedures or prior knowledge of the Lipschitz smoothness constant, providing a natural prototype for parameter-free acceleration. However, extending this approach to the
stochastic setting has proven technically challenging and remains open. Existing parameter-free
stochastic methods either fail to achieve accelerated rates or rely on restrictive assumptions, such as bounded domains, bounded gradients, prior knowledge of the iteration horizon, or strictly sub-Gaussian noise. To address these limitations, we propose a
stochastic variant of the auto-conditioned fast gradient method, referred to as
stochastic AC-FGM. The proposed method is fully adaptive to the Lipschitz constant, the iteration horizon, and the noise level, enabling both adaptive stepsize selection and adaptive mini-batch sizing without line-search procedures. Under standard bounded conditional variance assumptions, we show that
stochastic AC-FGM achieves the optimal iteration complexity of $O(1/\sqrt{\varepsilon})$ and the optimal sample complexity of $O(1/\varepsilon^2)$.
Read the full abstract ▾
Dynamical Systems · Cross-listed from cs.GT
Constrained Policy Optimization for Provably Fair Order Matching
Zehua Cheng, Zhipeng Wang, Wei Dai et al. (+5 more)
Automated matching engines execute millions of orders per session, yet systematic asymmetries in latency, order size, and
market access compound into persistent execution disparities that erode participant trust. We formulate provably fair order matching as a Constrained Markov Decision Process and propose CPO-FOAM (Constrained Policy Optimization with Feedback-Optimized Adaptive Margins). An inner loop computes an analytic trust-region step on the Fisher information
manifold; a PID-controlled outer loop dynamically tightens safety margins, suppressing the sawtooth oscillations endemic to Lagrangian methods under non-stationary dynamics. Group
fairness (demographic parity, equalized odds) enters the CMDP cost vector while individual Lipschitz
fairness is enforced deterministically via spectral normalization. We prove BIBO stability and that the integral term drives steady-state violations to zero. On LOBSTER NASDAQ data across six
market regimes, CPO-FOAM recovers 95.9% of unconstrained throughput at 2.5% constraint violation frequency; on crypto-asset LOB data under MEV injection it captures 98.4% of the reward envelope at 3.2% CVF. The method scales sub-linearly to M=8 constraints, settles on-chain within one Ethereum block, and yields a 2.1X reward improvement on Safety-Gymnasium, confirming domain-agnostic generalization.
Read the full abstract ▾
All authors Zehua Cheng, Zhipeng Wang, Wei Dai, Wenhu Zhang, Vadzim Mahilny, David Shi, Elena Jia, Jiahao Sun
Combinatorics
The Exact Saturation Number for the Diamond
Maria-Romina Ivan and Sean Jaffe
What is the smallest size of a family of subsets of $[n]$ such that it does not contain an induced copy of $Q_2$ as a poset (known as the diamond), but adding a new set creates such a copy? It is easy to see that a maximal chain has this property, and thus the answer is at most $n+1$. Despite the simplicity of the diamond structure, the lower bound stagnated at $\sqrt n$ for quite some time, until recently the authors obtained a linear lower bound. In this paper, we fully solve this question showing that such a family must have size at least $n+1$.
Read the full abstract ▾
Probability
From stochastic individual-based models to free-boundary Hamilton-Jacobi equations
Nicolas Champagnat, Sylvie Méléard, Sepideh Mirrahimi et al. (+1 more)
We study a
stochastic branching model for a population structured by a quantitative phenotypic trait and subject to births, deaths, and mutations. In a regime of large population and small mutations, and in logarithmic scales of size and time, we derive a certain class of free boundary Hamilton-Jacobi equations with state constraints from the
stochastic individual-based system. This goes beyond the classical Hamilton-Jacobi equations obtained from deterministic models by taking into account the possible extinction of the system in certain regions of the trait space. The proof is obtained by combining methods for the analysis of Hamilton-Jacobi equations with probabilistic tools from the theory of large deviations and branching processes.
Read the full abstract ▾
All authors Nicolas Champagnat, Sylvie Méléard, Sepideh Mirrahimi, Viet Chi Tran
Geometric Topology
Structure and unique factorization in concordance groups of links
Kouki Sato and Akira Yasuhara
Donald and Owens introduced two link concordance groups with a marked component and showed that they contain the
knot concordance group as a direct summand with infinitely generated complements. While not explicitly posed by Donald and Owens, the problem of determining the structure of these complements arises naturally from their work. In this paper, we completely resolve this problem by proving that both complements are isomorphic to $\mathbb{Z}^{\infty} \oplus (\mathbb{Z}/2\mathbb{Z})^{\infty}$. Moreover, we introduce a notion of
prime element and establish a unique
prime decomposition
theorem. This yields a canonical normal form, providing a complete description of the group structure.
Read the full abstract ▾
Combinatorics
The nature of the spectrum of generalized Paley graphs and weak Waring numbers over finite fields
Ricardo A. Podestá and Denis E. Videla
We consider the family of generalized Paley graphs (GP-graphs for short) $\Gamma(k,q) = Cay(\mathbb{F}_q, (\mathbb{F}_q^*)^k)$, with $q=p^m$ and $p$
prime. We characterize all GP-graphs having real spectrum; namely, $Spec(\Gamma(k,q)) \subset \mathbb{R}$ if and only if $\Gamma(k,q)$ is undirected. We then study conditions for integrality in the spectrum and give a general method to produce integral GP-graphs through cyclotomic
polynomials. Using this, we construct several infinite families of integral GP-graphs. Next, we focus on directed GP-graphs (GP-digraphs). We show that GP-digraphs always have three or more
eigenvalues, and then we prove that there is only one kind of GP-digraphs having three different
eigenvalues: the oriented Paley graphs $\vec{\mathcal{P}}_q$ or disjoint unions of copies of them, $\vec{\mathcal{P}}_q \cup \cdots \cup \vec{\mathcal{P}}_q$. Then, we show that generically the GP-digraphs have period 1 (equivalently index of imprimitivity 1) except for $\Gamma(q-1,q)$ with $q$ odd, which is the disjoint union of oriented $p$-cycles, having period $p$. Finally, as an application, we study weak Waring numbers over finite fields through GP-graphs. In particular, we reduce the computation of the weak Waring numbers over finite fields to the computation of classic Waring numbers over finite fields, a result previously obtained by Cochrane and Cipra in 2012 by other means.
Read the full abstract ▾
Optimization and Control
Feedback control of Lagrange multipliers for non-smooth constrained optimization
V. Cerone, S. M. Fosson, S. Pirrera et al. (+2 more)
In this work, we develop a control-theoretic framework for constrained optimization problems with composite objective functions including non-differentiable terms. Building on the proximal augmented Lagrangian formulation, we construct a plant whose
equilibria correspond to the stationary points of the optimization problem. Within this framework, we propose two control strategies - a static controller and a dynamic controller - leading to two novel optimization
algorithms. We provide a theoretical analysis, establishing global exponential convergence under strong convexity assumptions. Finally, we demonstrate the effectiveness of the proposed methods through numerical experiments, benchmarking their performance against state-of-the-art approaches.
Read the full abstract ▾
All authors V. Cerone, S. M. Fosson, S. Pirrera, A. Re, D. Regruto
Functional Analysis
Some properties of unbounded truncated Toeplitz operators
Ali Chettih, Ameur Yagoub and Zohra Bendaoud
In this paper, we study closed densely defined unbounded truncated Toeplitz operators on model space, where u is an inner function, that commute with modified compressed shifts. The work also establishes properties related to their invertibility and self-adjointness.
Mathematical Physics
Noether-Type Theorems and the Generalized Herglotz Principle in $q$-Contact Geometry
Melvin Leok, Cristina Sardón and Xuefeng Zhao
We develop a unified
geometric framework for dissipative mechanical systems based on uniform $q$-contact
manifolds, which provide an extended phase space equipped with multiple contact $1$-forms. Within this setting, we construct both
Hamiltonian and Lagrangian formalisms and establish a generalized Noether-type
theorem describing the relationship between
symmetries and dissipated quantities. We further show that $q$-contact Lagrangian systems admit a genuine variational origin through a generalized Herglotz principle involving multiple action variables. The resulting $q$-contact Euler–Lagrange equations naturally depend on the scalar combination $\sum_{i=1}^q \partial L/\partial z_i$, reflecting the intrinsic structure of uniform $q$-contact geometry. We prove that this variational formulation is fully equivalent to the
geometric $q$-contact
Hamiltonian dynamics generated by the energy function. Several explicit examples involving multi-parameter dependent dynamics illustrate the effectiveness of the theory and demonstrate its potential to provide
geometric insight into complex dissipative systems, thereby extending the scope of classical Lagrangian mechanics beyond
symplectic and single-contact structures.
Read the full abstract ▾
Combinatorics
Stability and ribbon bases for the rank-selected homology of geometric lattices
Patricia Hersh and Sheila Sundaram
This paper analyzes the representation theoretic stability, in the sense of Thomas Church and Benson Farb, of the rank-selected homology of the Boolean
lattice and the partition
lattice, proving sharp uniform representation stability bounds in both cases. It proves a
conjecture of the first author and Reiner by giving the sharp stability bound for general rank sets for the partition
lattice. Along the way, a new homology basis sharing useful features with the polytabloid basis for Specht modules is introduced for the rank-selected homology and for the rank-selected Whitney homology of any
geometric lattice, resolving an old open question of Björner. These bases give a matroid theoretic analogue of Specht modules.
Read the full abstract ▾
Analysis of PDEs
On the blow-up of solutions to scale-invariant wave equations with damping and mass: Beyond the positive discriminant restriction
Mohamed Ali Hamza
This paper investigates the blow-up of solutions to scale-invariant semilinear wave equations featuring the damping term $\frac{\mu}{1+t} \partial_t u$, the mass term $\frac{\nu^2}{(1+t)^2} u$, and a time-derivative nonlinearity $| \partial_t u |^p$. The principal contribution of this work is the demonstration that the sign of the discriminant $\delta = (\mu-1)^2 - 4\nu^2$ is not a structural prerequisite for determining the blow-up range. Indeed, we show that even in the regime $\delta < 0$, the blow-up region remains invariant and is uniquely determined by the shifted dimension $n+\mu$, aligning with the Glassey-type critical exponent. Our result suggest that the classical restriction $\delta \ge 0$ is due to a technical tool rather than an intrinsic feature of the blow-up mechanism.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.LG
AE-ViT: Stable Long-Horizon Parametric Partial Differential Equations Modeling
Iva Mikuš, Boris Muha and Domagoj Vlah
Deep Learning Reduced Order Models (ROMs) are becoming increasingly popular as surrogate models for parametric partial differential equations (PDEs) due to their ability to handle high-dimensional data, approximate highly nonlinear mappings, and utilize GPUs. Existing approaches typically learn
evolution either on the full solution field, which requires capturing long-range spatial interactions at high computational cost, or on compressed latent representations obtained from autoencoders, which reduces the cost but often yields latent vectors that are difficult to evolve, since they primarily encode spatial information. Moreover, in parametric PDEs, the initial condition alone is not sufficient to determine the trajectory, and most current approaches are not evaluated on jointly predicting multiple solution components with differing magnitudes and parameter sensitivities. To address these challenges, we propose a joint model consisting of a convolutional encoder, a
transformer operating on latent representations, and a decoder for reconstruction. The main novelties are joint training with multi-stage parameter injection and coordinate channel injection. Parameters are injected at multiple stages to improve conditioning. Physical coordinates are encoded to provide spatial information. This allows the model to dynamically adapt its computations to the specific PDE parameters governing each system, rather than learning a single fixed response. Experiments on the Advection-
Diffusion-Reaction equation and Navier-Stokes flow around the cylinder wake demonstrate that our approach combines the efficiency of latent
evolution with the fidelity of full-field models, outperforming DL-ROMs, latent
transformers, and plain ViTs in multi-field prediction, reducing the relative rollout error by approximately $5$ times.
Read the full abstract ▾
Commutative Algebra
Congruence modules and Wiles defects of determinantal rings of maximal minors
Kashif Khan and Aryaman Maithani
Let $O$ be a discrete valuation ring and $A := O[X_{m \times n}]/I_{m}(X)$ the determinantal ring of maximal minors. We consider
algebra maps $\lambda \colon A \to O$, which is tantamount to choosing rank-deficient
matrices $a \in O^{m \times n}$. Following Iyengar–Khare–Manning, we compute the congruence module and the Wiles defect of $A$ at $\lambda$, expressing them in terms of the $(m - 1)$-sized minors of $a$.
Read the full abstract ▾
Logic · Cross-listed from cs.LO
The complexity of bisimilarity on pointmass processes
Martín Santiago Moroni and Pedro Sánchez Terraf
We assess the descriptive complexity of *bisimilarity* or "equality of behavior" on a family of Markov decision processes over uncountable standard Borel spaces, namely *nondeterministic labelled Markov processes* (NLMP). We show that bisimilarity is analytic for processes with a uniform assignment of finitely-supported measures to each state and label. More precisely, we obtain that bisimilarity on the space of countable Kripke frames (or labelled transition systems) is classifiable by countable structures. We show that bisimilarity of well-founded ("terminating") processes is Borel. We also provide a lower complexity bound by reducing the relation of eventual equality of binary sequences, $E_0$, to the former. As a consequence, there is no countable fragment of basic modal logic with denumerable conjunctions that characterizes bisimilarity for processes of small rank. We finally apply the previous Borel-definability to study the well-founded part of discrete uniform processes over continuous spaces.
Read the full abstract ▾
Number Theory
On canonicity for integral models of Shimura varieties with hyperspecial level
Keerthi Madapusi and Alex Youcis
We give a new definition – and in some cases, a new construction – of integral canonical models of Shimura varieties that uses the notion of an aperture appearing in work of Gardner–Madapusi on some
conjectures of Drinfeld. This applies to Shimura varieties of pre-abelian type at odd
primes of hyperspecial level, recovering and extending previous work of Kisin, Kim–Madapusi and Imai–Kato–Youcis, but also to exceptional Shimura varieties for large enough
primes. The characterization in the exceptional case is a priori different from the one recently shown by Bakker–Shankar–Tsimerman, and recovers many of their results, such as the existence of
prime-to-$p$ Hecke operators, the non-emptiness of the $\mu$-ordinary stratum and the theory of the canonical lift. In fact, we give a uniform proof of the non-emptiness of all possible Newton strata, and of the non-emptiness of Ekedahl–Oort strata and central leaves as well. An important ingredient in the proofs is a generalization of Tate's full faithfulness
theorem for $p$-divisible groups to the context of apertures. This leads to a mapping property for the integral canonical model that characterizes maps into it from all normal, flat and excellent schemes over $\mathbb{Z}_{(p)}$.
Read the full abstract ▾