Number Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 9 March
Let $E/\mathbb{Q}$ be an elliptic curve and let $\rho_E \colon \operatorname{Gal}(\overline{\mathbb{Q}}/\mathbb{Q}) \to \operatorname{GL}(2, \widehat{\mathbb{Z}})$ be the adelic Galois representation attached to $E$. Much work has been done in recent years to study the image of $\rho_E$ (up to conjugation) as part of Mazur's so called “Program B.” In this paper, we describe and implement an efficient algorithm to compute the image of $\rho_E$ in $\operatorname{GL}(2, \widehat{\mathbb{Z}})$ (up to conjugation) for an elliptic curve $E/\mathbb{Q}$ with complex multiplication (CM) and $j$-invariant not $0$ or $1728$.
Classical Analysis and ODEs
Yet Another Characterisation of Classical Orthogonal Polynomials?
The NIST Handbook of Mathematical Functions (2010) and the NIST Digital Library of Mathematical Functions (2025) classify classical orthogonal polynomials through Bochner's 1929 algebraic-differential characterisation and its discretisation. Yet this classification rests on a narrow reading of Bochner's work and on a restricted notion of orthogonality that becomes inadequate once polynomials are characterised by their algebraic properties. As a result, algebraically equivalent families are treated as distinct, parameter domains are restricted, and families already implicit in Bochner's scheme are excluded. In the mid-1980s, Maroni challenged this view by extending the notion of classical orthogonal polynomials through duality theory on locally convex spaces, thereby reaching the algebraic limits latent in Bochner's framework. Yet when the notion was later enlarged to include further families, Maroni's criteria and rationale were largely set aside. To clarify this history, we revisit a less familiar line of development and use it to obtain a classification of classical orthogonal polynomials on linear lattices within Maroni's functional-analytic setting, beyond the positive-definite case. This classification recovers all known families as special cases, preserves orthogonality and the defining algebraic properties, places supposedly new families in their proper structural context, and shows that algebraically identical polynomials are often treated as distinct. Moreover, through a limit process in the weak topology of the continuous dual, we recover families implicit in Bochner's work and unify the continuous and discrete cases within a dual-topological framework. Thus, neither Bochner's classical characterisation nor its discrete analogue is modified to produce ad hoc families; both are recovered at the level of their intrinsic algebraic structure.
Read the full abstract
Statistics Theory
Bayesian inference of planted matchings: Local posterior approximation and infinite-volume limit
We study Bayesian inference of an unknown matching $\pi^*$ between two correlated random point sets $\{X_i\}_{i=1}^n$ and $\{Y_i\}_{i=1}^n$ in $[0,1]^d$, under a critical scaling $\|X_i-Y_{\pi^*(i)}\|_2 \asymp n^{-1/d}$, in both an exact matching model where all points are observed and a partial matching model where a fraction of points may be missing. Restricting to the simplest setting of $d=1$, in this work, we address the questions of (1) whether the posterior distribution over matchings is approximable by a local algorithm, and (2) whether marginal statistics of this posterior have a well-defined limit as $n \to \infty$. We answer both questions affirmatively for partial matching, where a decay-of-correlations arises for large $n$. For exact matching, we show that the posterior is approximable locally only after a global sorting of the points, and that defining a large-$n$ limit of marginal statistics requires a careful indexing of points in the Poisson point process limit of the data, based on a notion of flow. We leave as an open question the extensions of such results to dimensions $d \geq 2$.
Read the full abstract
Combinatorics
Subdivisions of root polytopes, generalized tropical oriented matroids, and generalized matching ensembles
We study a generalization of tropical oriented matroids by Ardila and Develin, and show that they are in bijection with subdivisions of root polytopes, which are sub-polytopes of a product of two simplices. We also study a generalization of a matching-based combinatorial model by Oh and Yoo in the special case of triangulations.
Read the full abstract
Statistics Theory
Minimax estimation for Varying Coefficient Model via Laguerre Series
We delve into the estimation of the functional coefficients and inference for varying coefficient model. Applying Laguerre series, we develop an estimator for the vector of functional coefficients that attains asymptotically optimal convergence rates in the minimax sense. These rates are derived for functional coefficients that belong to Laguerre-Sobolev space. The method is based on approximating the functional coefficients using truncated Laguerre series and choosing empirical Laguerre coefficients that minimize the least squares criterion. In addition, we establish the asymptotic normality of the estimator for the functional coefficients, construct their confidence intervals, and establish point-wise hypothesis tests about their true values. A simulations study is carried out to examine the finite-sample properties of the proposed methodology. A real data set is considered as well, and results based on the proposed methodology are compared to those based on selected existing approaches.
Read the full abstract
Optimization and Control
Rethinking Strict Dissipativity for Economic MPC
Stability of economic model predictive control can be proven under the assumption that a strict dissipativity condition holds. This assumption has a clear interpretation in terms of the so-called rotated stage cost, which must have its minimum at the optimal steady state. However, contrary to dissipativity, for strict dissipativity the storage function cannot be immediately related to the value function of an optimal control problem formulated with the economic stage cost. We propose the novel concept of two-storage strict dissipativity, which requires two storage functions to satisfy dissipativity and be separated by a positive definite function. This new condition can be immediately related to optimal control by means of value functions and might be easier to verify than strict dissipativity. Furthermore, we prove that two-storage strict dissipativity is sufficient and necessary for asymptotic stability, it is related to strict dissipativity, and also to alternative approaches relying on the so-called cost-to-travel. Finally, we discuss commonly used and new terminal cost designs that guarantee asymptotic stability in the finite-horizon case.
Read the full abstract
Dynamical Systems
The Reidemeister and the Nielsen numbers: growth rate, asymptotic behavior, dynamical zeta functions and the Gauss congruences
In the present paper, taking a dynamical point on view, we study the growth rate and asymptotic behavior of the sequences of the Reidemeister numbers and the sequences of the Reidemeister and the Nielsen coincidence numbers. We also prove the Gauss congruences for the sequence $\{R(\varphi^n,\psi^n)\}$ of the Reidemeister coincidence numbers of the tame pair $(\varphi,\psi)$ of endomorphisms of a torsion-free nilpotent group~$G$ of finite Prüfer rank. Furthermore, we prove the rationality of the Nielsen coincidence zeta function, the Gauss congruences for the sequence $\{N(f^n, g^n)\}$ of the Nielsen coincidence numbers and show that the growth rate exists for the sequence \{$N(f^n, g^n)\}$ of tame pair of maps $(f,g)$ of a compact nilmanifold to itself.
Read the full abstract
Number Theory
New Ramanujan-type congruences for overpartitions modulo $11$ and $13$
In this paper, we establish two new Ramanujan-type congruences for the overpartition function: $\overline{p}(11\times(8n+5))\equiv 0 \pmod{11}$ and $\overline{p}(13\times 2^6(8n+7))\equiv 0 \pmod{13}$. The proofs rely on the theory of modular forms. We conjecture potential Ramanujan-type congruences for overpartitions modulo 7, 17, 19 and 23.
Read the full abstract
Probability
A combinatorial formula for Wilson loop expectations on compact surfaces
We give an almost purely combinatorial expression for Wilson loop expectations of the Yang-Mills holonomy process with values in the unitary group on a compact oriented surface, possibly with boundary and arbitrary boundary conditions. Our main result computes the non-normalized expectation of products of traces of holonomies along an arbitrary family of immersed curves with transverse self-intersections and no triple points. It is expressed as a sum over assignments of highest weights of the unitary group to the connected components of the complement of the curves. Each term is a product of a Gaussian exponential factor, dimensions of unitary representations, and local contributions at the intersection points given by the sine or cosine of an angle determined by the surrounding highest weights. As an application, we obtain a new and short proof of the Makeenko-Migdal equations on arbitrary compact surfaces.
Read the full abstract
Commutative Algebra
Pseudo-Gorenstein$^{*}$ Graphs
Motivated by pseudo-Gorenstein rings in commutative algebra, introduced by Herzog et al., we define pseudo-Gorenstein$^{*}$ graphs and classify them in several natural graph families using independence polynomials.
Numerical Analysis
Finite element approximations of the stochastic Benjamin-Bona-Mahony equation with multiplicative noise
This paper is devoted to the numerical analysis of a fully discrete finite element approximation for the stochastic Benjamin-Bona-Mahony equation driven by multiplicative noise. We first establish the existence and uniqueness of solutions to the stochastic BBM equation within an appropriate variational framework and derive several stability estimates for the continuous problem, including an exponential stability result. For the numerical approximation, a conforming finite element method is employed for spatial discretization and is coupled with the implicit Euler-Maruyama scheme for time integration. The convergence of the fully discrete scheme is investigated under two different classes of multiplicative noise. When the noise coefficient is bounded, we obtain optimal strong error estimates in full expectation by combining exponential stability properties of both the stochastic BBM solution and its fully discrete counterpart with a stochastic Gronwall inequality. In the case of general multiplicative noise, where boundedness assumptions are no longer valid, a localization technique based on high-probability events in the sample space is introduced, leading to sub-optimal convergence rates in probability. Finally, numerical experiments are presented to corroborate the theoretical results and to demonstrate the performance of the proposed method.
Read the full abstract
Optimization and Control
First-Order Geometry, Spectral Compression, and Structural Compatibility under Bounded Computation
Optimization under structural constraints is typically analyzed through projection or penalty methods, obscuring the geometric mechanism by which constraints shape admissible dynamics. We propose an operator-theoretic formulation in which computational or feasibility limitations are encoded by self-adjoint operators defining locally reachable subspaces. In this setting, the optimal first-order improvement direction emerges as a pseudoinverse-weighted gradient, revealing how constraints induce a distorted ascent geometry. We further demonstrate that effective dynamics concentrate along dominant spectral modes, yielding a principled notion of spectral compression, and establish a compatibility principle that characterizes the existence of common admissible directions across multiple objectives. The resulting framework unifies gradient projection, spectral truncation, and multi-objective feasibility within a single geometric structure.
Read the full abstract
Combinatorics · Cross-listed from cs.DM
WELLDOC property for words generated by morphisms
In this paper, we study an abelian-type property of infinite words called well distributed occurrences, or WELLDOC for short. An infinite word $w$ on a $d$-ary alphabet has the WELLDOC property if, for each factor $u$ of $w$, positive integer $m$, and vector $v\in \mathbb{N}^d$, there is an occurrence of $u$ such that the Parikh vector of the prefix of $w$ preceding such occurrence is congruent to $v$ modulo $m$. The Parikh vector of a finite word $v$ on an alphabet has its $i$-th component equal to the number of occurrences of the $i$-th letter in $v$. We provide a criterion of the WELLDOC property for words generated by morphisms.
Read the full abstract
Mathematical Physics
Local Robustness of Bound States in the Continuum through Scattering-Matrix Eigenvector Continuation
We consider the diffraction of time-harmonic plane waves by a periodic structure, governed by the Helmholtz equation. Bound states in the continuum (BICs) are quasi-periodic fields that remain $L^{2}$-bounded over one period and occur at frequencies embedded in the continuous spectrum. Perturbations that break a BIC can lead to ultra-strong resonances, enabling various applications in photonics. Employing the implicit function theorem, we demonstrate how a simple BIC continuously deforms into a propagating field as system parameters vary in a neighborhood, with the frequency adjusting accordingly. In this setting, the incident coefficients of the field persist as an eigenvector of the scattering matrix with a fixed eigenvalue. By introducing a mapping $\mathcal{P}$ from the parameters to these coefficients, the zeros of $\mathcal{P}$ correspond precisely to BICs. When such a zero is isolated and the dimensions of the domain and codomain coincide, the BIC can be related to the mapping degree of $\mathcal{P}$ in a small neighborhood. This perspective clarifies the phase singularity associated with BICs and provides a general topological interpretation of their local robustness with respect to the given parameters. Moreover, it yields a practical numerical criterion for detecting and verifying BICs via computation of the mapping degree of $\mathcal{P}$.
Read the full abstract
Dynamical Systems · Cross-listed from cs.LG
NN-OpInf: an operator inference approach using structure-preserving composable neural networks
We propose neural network operator inference (NN-OpInf): a structure-preserving, composable, and minimally restrictive operator inference framework for the non-intrusive reduced-order modeling of dynamical systems. The approach learns latent dynamics from snapshot data, enforcing local operator structure such as skew-symmetry, (semi-)positive definiteness, and gradient preservation, while also reflecting complex dynamics by supporting additive compositions of heterogeneous operators. We present practical training strategies and analyze computational costs relative to linear and quadratic polynomial OpInf (P-OpInf). Numerical experiments across several nonlinear and parametric problems demonstrate improved accuracy, stability, and robustness over P-OpInf and prior NN-ROM formulations, particularly when the dynamics are not well represented by polynomial models. These results suggest that NN-OpInf can serve as an effective drop-in replacement for P-OpInf when the dynamics to be modeled contain non-polynomial nonlinearities, offering potential gains in accuracy and out-of-distribution performance at the expense of higher training computational costs and a more difficult, non-convex learning problem.
Read the full abstract
Analysis of PDEs
Point interactions and singular solutions to semilinear elliptic equations
We investigate the connection between semilinear elliptic PDEs with isolated singularities and stationary nonlinear Schrödinger equations with point interactions. In dimensions $d=2,3$, we establish a rigorous correspondence between their solutions, revealing two regimes depending on whether a boundary condition at the singularity can be imposed. This connection enables us to exploit operator-theoretic and variational methods that have not previously been applied to the study of isolated singularities. In the source regime, we prove the existence of infinitely many radial singular solutions, by applying the symmetric mountain pass theorem of Ambrosetti and Rabinowitz to the action functional associated with the point interaction. When $d=2$, a suitable uniqueness result allows us to characterize singular ground states (positive solutions) as action minimizers and to prove the existence of infinitely many nodal singular solutions.
Read the full abstract
Classical Analysis and ODEs
Asymmetric uniqueness sets in $\ell^q$
We exhibit an asymmetry phenomenon for uniqueness sets in $\ell^q$. Specifically, we construct sets that do not support measures with $\ell^q$-summable Fourier coefficients, yet simultaneously support measures whose positive frequencies decay faster than polynomials. In the language of Fourier uniqueness, this highlights a striking divergence between the unilateral and bilateral $\ell^q$ uniqueness problems.
Read the full abstract
Dynamical Systems · Cross-listed from eess.SY
Input Dexterity and Output Negotiation in Feedback-Linearizable Nonlinear Systems
We introduce a task-relative taxonomy of actuator inputs for nonlinear systems within the input-output feedback-linearization framework. Given a flat output specifying the task, inputs are classified as essential, redundant, or dexterity: essential inputs are required for exact linearization, redundant inputs can be removed without effect, and dexterity inputs can be deactivated while preserving exact linearization of a reduced task. We show that a subset is dexterity if and only if, under a suitable dynamic prolongation, it can appear as additional output channels (flat-input complement) on a common validity set. Whenever a family of systems obtained by (de)activating dexterity inputs admits a common prolongation, the family can be interpreted as a single prolonged system endowed with different output selections. This enables a unified linearizing controller that negotiates between full and reduced tasks without transients on shared outputs under compatibility and dwell-time conditions. Simulations on a fully actuated aerial platform illustrate graceful task downgrades from six-dimensional pose tracking as lateral-force channels are deactivated.
Read the full abstract
Functional Analysis
Classical finite dimensional fixed point methods for generalized functions
We prove Banach, Newton-Raphson and Brouwer fixed point theorems in the framework of generalized smooth functions, a minimal extension of Colombeau's theory (and hence of classical distribution theory) which makes it possible to model nonlinear singular problems, while at the same time sharing a number of fundamental properties with ordinary smooth functions, such as the closure with respect to composition and several non trivial classical theorems of the calculus. The proved results allows one to deal with equations of the form F(x)=0, where F is a generalized smooth function, in particular, a Sobolev-Schwartz distribution. We consider examples with singularities that are not included in the classical version of these theorems.
Read the full abstract
Optimization and Control
Intrinsic Sequentiality in P: Causal Limits of Parallel Computation
We study a polynomial-time decision problem in which each input encodes a depth-$N$ causal execution in which a single non-duplicable token must traverse an ordered sequence of steps, revealing at most $O(1)$ bits of routing information at each step. The uncertainty in the problem lies in identifying the delivery path through the relay network rather than in the final accept/reject outcome, which is defined solely by completion of the prescribed execution. A deterministic Turing machine executes the process in $\Theta(N)$ time. Using information-theoretic tools - specifically cut-set bounds for relay channels and Fano's inequality - we prove that any execution respecting the causal constraints requires $\Omega(N)$ units of causal time, thereby ruling out asymptotic parallel speedup. We further show that no classical $\mathbf{NC}$ circuit family can implement the process when circuit depth is interpreted as realizable parallel time. This identifies a class of polynomial-time problems with intrinsic causal structure and highlights a gap between logical parallelism and causal executability.
Read the full abstract
Mathematical Physics · Cross-listed from physics.class-ph
Physical properties of elementary particles: Inertia and Interaction
Matter has two physical properties: Inertia and interaction. If we define the center of mass of an elementary particle in relation to its inertia, and a center of interaction in relation to its interactive properties, there are only two possibilities to describe this elementary particle: that both points are the same or that they are different. If they are the same, what we describe is the point particle model, while if we consider them to be different, what we obtain is the description of an elementary spinning particle. If the center of interaction or center of charge is moving at the speed of light, completely determines also the dynamics of the center of mass, and when quantizing this model satisfies Dirac's equation. We obtain the classical description of the spinning Dirac particle. The general analysis of the interaction Lagrangian, suggests a modification of the minimal coupling Lagrangian, for a possible classical description of the strong and weak interaction.
Read the full abstract
Combinatorics
On order-compatible paths in infinite graphs
Two $a{-}b$ paths in a graph $G$ are order-compatible if their common vertices occur in the same order when travelling from $a$ to $b$. Suppose a graph contains an infinite number $\delta$ of edge-disjoint $a{-}b$ paths. G.A. Dirac asked whether there always exists a family of $\delta$ edge-disjoint $a{-}b$ paths that are pairwise order-compatible. Confirming a conjecture by B. Zelinka, we show that this holds provided that the given $\delta$ edge-disjoint $a{-}b$ paths have bounded length. Combining this with an earlier work of Zelinka, it follows that Dirac's question for an infinite cardinal $\delta$ has an affirmative answer if and only if $\delta$ has uncountable cofinality. As our second main result, we show that even when Dirac's question fails, it still holds that 'being connected by $\delta$ edge-disjoint, pairwise order-compatible paths' is an equivalence relation for all values of $\delta$. The most interesting case here is when $\delta$ is countable.
Read the full abstract
Group Theory
Cubic maps from the group of order $3$
The purpose of this note is to classify unital cubic maps from the cyclic group of order $3$ into an arbitrary non-abelian group. We show that the universal group admitting a unital cubic map from the cyclic group of order $3$ is infinite, give a concrete presentation and provide an infinite representation of it in ${\rm PSL}_3(\mathbb C)$, whose image is an arithmetic lattice commensurable with ${\rm PSL}_3(\mathbb Z[\omega])$, where $\omega$ is a primitive cube root of unity. As a consequence we obtain the existence of finite nilpotent groups of arbitrarily large nilpotency class admitting a unital cubic map from $C_3$ whose image generates the group.
Read the full abstract
Number Theory
Distributions of left prime truncations
The prime number 357686312646216567629137 is notable because of the unusual property that it remains prime successively on removing the left digit until there are no remaining digits. We explore here the distributions of the number of left prime truncations of integers and of the number of irreducible truncations of polynomials with coefficients over a finite field, focusing on the proportion among all $\ell$-digit numbers or polynomials, their variance, and the maximal proportion.
Read the full abstract
Functional Analysis
Spectrum of Hausdorff operators on weighted Bergman and Hardy spaces of the upper half-plane
We characterize the spectrum of Hausdorff operators on weighted Bergman and power weighted Hardy spaces of the upper half-plane.
Classical Analysis and ODEs
Cancellative sparse domination
We present a general sparse domination principle which respects the cancellative structure of the functions under study. We obtain sparse domination results in general measure spaces, including general martingale settings in one and two parameters, and in the Euclidean setting. In the one-parameter martingale setting, we obtain a sparse characterization of the $H^1$ norm. The proofs make critical use of precise level-set estimates for generalized versions of medians. Our results imply new, quantitatively sharp, weighted results for martingales and Calderón-Zygmund operators acting on $H^p$ spaces.
Read the full abstract
Information Theory
OFDM Waveform Optimization for Bistatic Integrated Sensing and Communications
This paper investigates the design of orthogonal frequency-division multiplexing (OFDM) waveforms for bistatic integrated sensing and communication (ISAC) systems. In the considered framework, an ISAC transmitter jointly optimizes subcarrier assignment and power allocation for a single OFDM waveform that simultaneously supports communication and sensing functionalities. Meanwhile, an ISAC receiver decodes information on communication subcarriers and estimates per-path propagation delays via exploiting pilot symbols on sensing subcarriers. We propose a joint path coefficient and delay estimation (JPCDE) scheme, revealing that the achievable communication data rate (CDR) is determined by the number of communication subcarriers, whereas the delay sensing accuracy is governed by the index distribution of sensing subcarriers. Building on this insight, we formulate an OFDM waveform optimization problem to maximize the CDR subject to sensing-accuracy and power-budget constraints. To solve this problem, we employ a quadratic transform and Lagrangian dual decomposition, which iteratively updates the subcarrier assignment and power allocation variables in closed-form. Our results reveal that a subcarrier is allocated for sensing if and only if its Fisher information gain exceeds the corresponding communication rate loss, while the power allocation for communication subcarriers exhibits a bounded water-filling structure. Simulation results demonstrate that the proposed frameworks substantially outperform existing baselines in both delay estimation accuracy and CDR.
Read the full abstract
Analysis of PDEs
Splitting methods for the Gross-Pitaevskii equation on the full space and vortex nucleation
We prove the convergence in Zhidkov spaces of the first-order Lie-Trotter and the second-order Strang splitting schemes for the time integration of the Gross-Pitaesvkii equation with a time-dependent potential and non-zero boundary conditions at infinity. We also show the conservation of the generalized mass and the near-preservation of the Ginzburg-Landau energy balance law. Numerical accuracy tests performed on a one-dimensional dark soliton corroborate our theoretical findings. We finally investigate the nucleation of quantum vortices in two experimentally relevant settings.
Read the full abstract
Quantum Algebra
Applications of the finite specializations of the $q$-deformed modular group
Recently, Morier-Genoud and Ovsienko introduced the $q$-deformed modular group. For the construction, they first gave a group $G_q \subset \operatorname{GL}(2, \mathbb{Z}[q^{\pm}])$ and then set $\operatorname{PSL}_q(2,\mathbb{Z}):=G_q/Z(G_q)$. We show that, for $\zeta \in \mathbb{C}^*$, $\operatorname{PSL}_q(2,\mathbb{Z})|_{q=\zeta}$ is finite, if and only if so is $G_q(\zeta):=G_q|_{q=\zeta} \subset \operatorname{GL}(2,\mathbb{C})$, if and only if $\zeta=\zeta_n$ for $n=2,3,4,5$, where $\zeta_n$ is a primitive $n$-th root of unity. Although this result is essentially available in the existing literature, we give a precise proof for further developments. For example, we show that the set of traces of elements in $G_q(\zeta)$ and the set of the special values at $\zeta$ of the normalized Jones polynomials of rational links are finite if and only if $\zeta =\zeta_n$ for $n=2,3,4,5$ and also for $n=6$. We also study the quantized Pythagorean triples.
Read the full abstract
Number Theory
On odd-spin $A_{1}^{(1)}$-string functions, cross-spin identities, and mock theta conjecture-like identities
Determining the explicit forms and modularity for string functions and branching coefficients for Kac–Moody algebras after Kac, Peterson, and Wakimoto is a long-standing, yet wide-open, problem and recently a connection has been made between positive admissible-level $A_{1}^{(1)}$-string functions and Ramanujan's mock theta functions. In this paper we obtain the polar-finite decomposition for the admissible-level $A_{1}^{(1)}$ character of odd spin, and we also find new mock theta conjecture-like identities for the odd-spin, $2/3$-level and $2/5$-level $A_{1}^{(1)}$-string functions.