Peer Revenue Publish or profit

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Sunday 29 March

Numerical Analysis

Rigorous Eigenvalue Bounds for Schrödinger Operators with Confining Potentials on $\mathbb{R}^2$

We propose a rigorous method for computing two-sided eigenvalue bounds of the Schrödinger operator $H=-\Delta+V$ with a confining potential on $\mathbb{R}^2$. The method combines domain truncation to a finite disk $D(R)$ on which the restricted eigenvalue problem is solved with a rigorous eigenvalue bound, where Liu's eigenvalue bound along with the Composite Enriched Crouzeix–Raviart (CECR) finite element method proposed plays a central role. Two concrete potentials are studied: the radially symmetric ring potential $V_1(x)=(|x|^2-1)^2$ and the Cartesian double-well $V_2(x)=(x_1^2-1)^2+x_2^2$. To author's knowledge, this paper reports the first rigorous eigenvalue bounds for Schrödinger operators on an unbounded domain.
Read the full abstract

Optimization and Control

LP-Based Algorithms for Scheduling in a Quantum Switch

We consider scheduling in a quantum switch with stochastic entanglement generation, finite quantum memories, and decoherence. The objective is to design a scheduling algorithm with polynomial-time computational complexity that stabilizes a nontrivial fraction of the capacity region. Scheduling in such a switch corresponds to finding a matching in a graph subject to additional constraints. We propose an LP-based policy, which finds a point in the matching polytope, which is further implemented using a randomized decomposition into matchings. The main challenge is that service over an edge is feasible only when entanglement is simultaneously available at both endpoint memories, so the effective service rates depend on the steady-state availability induced by the scheduling rule. To address this, we introduce a single-node reference Markov chain and derive lower bounds on achievable service rates in terms of the steady-state nonemptiness probabilities. We then use a Lyapunov drift argument to show that, whenever the request arrival rates lie within the resulting throughput region, the proposed algorithm stabilizes the request queues. We further analyze how the achievable throughput depends on entanglement generation rates, decoherence probabilities, and buffer sizes, and show that the throughput lower bound converges exponentially fast to its infinite-buffer limit as the memory size increases. Numerical results illustrate that the guaranteed throughput fraction is substantial for parameter regimes relevant to near-term quantum networking systems.
Read the full abstract

Classical Analysis and ODEs

Buffon Discrepancy and the Steinhaus Longimeter

Let $\Omega \subset \mathbb{R}^2$ be a convex set. We study the problem of distributing a one-dimensional set $S$ with total length $L$ so that for any line $\ell$ in $\mathbb{R}^2$ the number of intersections $\#(\ell \cap S)$ is proportional to the length $\mathcal{H}^1(\ell \cap \Omega)$ as much as possible; we use the term Buffon discrepancy for the largest error. A construction of Steinhaus can be generalized to prove the existence of sets with Buffon discrepancy $\lesssim L^{1/3}$. We also show that the unit disk $\mathbb{D}$ admits a set with uniformly bounded Buffon discrepancy as $L \rightarrow \infty$.
Read the full abstract

Dynamical Systems

On Unstable Fixed Points in Modern Continuous Hopfield Networks

The recently introduced continuous Hopfield network (see Ramsauer et al.) exhibits large memorization capabilities, which manifest as attractive fixed points of its update rule – a differentiable function consisting of two linear mappings composed with the scaled softmax function. The authors of the aforementioned work provide proofs for the existence and approximate position of such attractive fixed points. For the softmax function alone, the fixed point structure has been fully characterized in earlier work by P. Tiňo, from which it turns out that for sufficiently large scaling factors there are exponentially more unstable fixed points than attractive ones. In this work, we complement the findings of Ramsauer et al. by showing that, under natural geometric conditions on the vectors defining the continuous Hopfield network, unstable fixed points must occur, analogous to the findings of Tiňo. Our results show that, under these geometric conditions, continuous Hopfield networks necessarily admit additional unstable fixed points associated with higher-dimensional faces of the pattern polytope.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Distributed Online Submodular Maximization under Communication Delays: A Simultaneous Decision-Making Approach

We provide a distributed online algorithm for multi-agent submodular maximization under communication delays. We are motivated by the future distributed information-gathering tasks in unknown and dynamic environments, where utility functions naturally exhibit the diminishing-returns property, i.e., submodularity. Existing approaches for online submodular maximization either rely on sequential multi-hop communication, resulting in prohibitive delays and restrictive connectivity assumptions, or restrict each agent's coordination to its one-hop neighborhood only, thereby limiting the coordination performance. To address the issue, we provide the Distributed Online Greedy (DOG) algorithm, which integrates tools from adversarial bandit learning with delayed feedback to enable simultaneous decision-making across arbitrary network topologies. We provide the approximation performance of DOG against an optimal solution, capturing the suboptimality cost due to decentralization as a function of the network structure. Our analyses further reveal a trade-off between coordination performance and convergence time, determined by the magnitude of communication delays. By this trade-off, DOG spans the spectrum between the state-of-the-art fully centralized online coordination approach [1] and fully decentralized one-hop coordination approach [2].
Read the full abstract

Analysis of PDEs

Weakly nonlinear models for hydroelastic water waves

In this work, we derive reduced interface models for hydroelastic water waves coupled to a nonlinear viscoelastic plate. In a weakly nonlinear small-steepness regime we obtain bidirectional nonlocal evolution equations capturing the interface dynamics up to quadratic order, and we also derive two unidirectional models describing one-way propagation while retaining the leading dispersive and dissipative effects induced by the plate. Remarkably, one of the bidirectional model has a doubly nonlinear structure in the sense that there there is a nonlinear elliptic operator acting on the acceleration of the interface. We prove local well-posedness for the bidirectional model for small data via a two-parameter regularization and nested fixed points. For the unidirectional models, we obtain local well-posedness for arbitrary data and global well-posedness for small data.
Read the full abstract

Dynamical Systems · Cross-listed from nlin.CG

Probabilistic Cellular Automata: between deterministic Wolfram's rules 23, 77, 178 and 232

We study one dimensional binary Probabilistic Cellular Automaton (PCA) that interpolate between Wolfram's classical rules 23, 77, 178 and 232. These rules are the only ones that satisfy two criteria: (i) in the case of a majority in the neighborhood states, the central site takes either the majority state or the opposite and (ii) if the neighborhood states are tied, the central site either changes its current state or keeps it. The PCA is defined by two Bernoulli random variables with parameters $p,r \in [0,1]$, and we analytically solve small size cases by using a Markov process formulation. We derive analytical expressions for the probability of asymptotically reaching each possible global configuration as a function of $p$ and $r$, for all initial states. We show that for $0 < p,r < 1$, the asymptotic probability distributions of achieving any of the states for the PCA are independent of the initial conditions. This contrasts with the behavior of the deterministic Wolfram's rules 23 ($p=0,r=0$), 77 ($p=1,r=0$), 178 ($p=0,r=1$) and 232 ($p=1,r=1$), for which additional asymptotic states can occur, in particular periodic configurations Finally, we discuss applying this kind of PCA to describe opinion dynamics involving hesitant agents.
Read the full abstract

Differential Geometry

A note on the classification of four-dimensional gradient steady and expanding Ricci solitons

In this note, we study the classification of four-dimensional complete gradient steady and expanding Ricci solitons. Specifically, under the asymptotically cylindrical (respectively, asymptotically conical) assumption, we classify gradient steady (respectively, expanding) Ricci solitons with half-harmonic Weyl curvature. In addition, we obtain a partial classification of four-dimensional gradient expanding Ricci solitons with half-nonnegative isotropic curvature.
Read the full abstract

Analysis of PDEs

Sharp long distance upper bounds for solutions of Leibenson's equation on Riemannian manifolds

We consider on Riemannian manifolds the Leibenson equation $\partial _{t}u=\Delta _{p}u^{q}$ that is also known as a doubly nonlinear evolution equation. We prove sharp upper estimates of weak subsolutions to this equation on Riemannian manifolds with non-negative Ricci curvature in the whole range of $p>1$ and $q>0$ satisfying $q(p-1)<1$. In this way, we improve the result of \cite{Grigoryan2024a} and prove Conjecture 1.2 from \cite{Grigoryan2024a}.
Read the full abstract

Category Theory

Higher algebra in $t$-structured tensor triangulated $\infty$-categories

We generalize fundamental notions of higher algebra, traditionally developed within the $\infty$-category of spectra, to presentably symmetric monoidal stable $\infty$-categories equipped with compatible accessible $t$-structures, which we call $ttt$-$\infty$-categories. Under a natural structural condition, which we call “projective rigidity”, we establish higher categorical analogues of Lazard's theorem and prove the existence and universal property of Cohn localizations. Furthermore, we generalize higher almost ring theory to the $ttt$-$\infty$-categorical setting, showing that $\pi_0$-epimorphic idempotent algebras are in natural bijection with idempotent ideals. Additionally, by exploiting deformation theory, we establish a general \text{\texté}tale rigidity theorem. Finally, we characterize the moduli of such projectively rigid $ttt$-$\infty$-categories and show that the $\infty$-category of $\mathrm{Sp}$-valued presheaves on the $1$-dimensional framed cobordism $\infty$-category is universal among them.
Read the full abstract

Combinatorics

Graphs with core(G) = nucleus(G)

Let $G$ be a finite simple graph. An independent set $I$ of $G$ is critical if $\left|I\right|-\left|N(I)\right|\ge\left|J\right|-\left|N(J)\right|$ for every independent set $J$ of $G$. A critical independent set is maximum if it has maximum cardinality. The $core$ and the $nucleus$ of $G$ are defined as the intersection of all maximum independent sets and the intersection of all maximum critical independent sets, respectively. In 2019, Jarden, Levit, and Mandrescu posed the problem of characterizing the graphs satisfying $core(G)=nucleus(G)$. In this paper, we provide a complete solution to this problem. Using Larson's independence decomposition, which partitions any graph into a König–Egerváry component $L_G$ an a $2$-bicritical component $L_G^c$, we establish that $core(G)=nucleus(G)$ holds if and only if $core ({L_G^c})=\emptyset$ and no vertex of $corona(G)$ lies in the boundary between $L_G$ and $L_G^c$. We also show that the same boundary condition is equivalent to the identity $diadem(G)=corona(G) \cap L(G)$. Several consequences and related structural properties are also derived.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Complementarity Beyond Definite Causal Order

Wave–particle duality is a cornerstone of quantum mechanics, traditionally formulated under definite causal order. We investigate how complementarity is modified when the temporal order of operations is coherently superposed, as in the quantum switch. We show that no universal, state-independent, linear additive complementarity relation exists that combines spatial coherence, path distinguishability, and causal coherence within a common unit-normalized bound. This result follows from explicit extremal constructions in the quantum-switch family: although the three quantities are derived from the same global switch state, the standard spatial duality relation can be saturated while the reduced control coherence is simultaneously maximal. Tracing out the order qubit recovers the standard duality relation at the level of the reduced quanton–detector state, while coherence associated with alternative causal orders remains inaccessible in this reduced description. To characterize this contribution, we introduce causal coherence, defined as the coherence of the reduced order qubit in the causal-order basis. We further show that complementarity admits a state-dependent entropic formulation based on incompatible measurements on the causal degree of freedom, which arises from a universal uncertainty principle and provides a canonical operationally meaningful description. These results show that operational formulations of complementarity can depend on causal structure and cannot, in general, be fully characterized at the level of reduced quantum states alone.
Read the full abstract

Information Theory · Cross-listed from quant-ph

Benchmarking simulation of hybrid decoding scheme for parity-encoded spin systems

This paper presents classical benchmark simulations of a practical hybrid decoding scheme for parity-encoded spin systems, which is well-suited to the development of quantum annealing devices based on on-chip superconducting technology. We compared the performance of finding the optimal solution using two embedding schemes for emulating all-to-all connectivity from local interactions: the SLHZ scheme, proposed by Sourlas, Lechner, Hauke, and Zoller, and the commonly used minor embedding (ME) scheme. We found that the SLHZ scheme is more efficient than the ME scheme when combined with postreadout classical decoding based on the classical bit-flipping algorithm, although the SLHZ scheme itself is substantially less efficient than the ME scheme.
Read the full abstract

Analysis of PDEs

The Triality of Radial Nonlinear Dynamics: Analysis of Riccati, Schrödinger, and Hamilton–Jacobi–Bellman Equations

This study develops a unified mathematical framework for the analysis of radial differential equations, revealing a fundamental connection between three distinct classes of problems: the nonlinear Riccati equation, the linear Schrödinger equation, and the Hamilton–Jacobi–Bellman equation for stochastic control. We establish the existence and uniqueness of regular solutions on both bounded and unbounded domains, deriving sharp growth rates and exact asymptotic plateaus through a general barrier theory. A detailed sensitivity analysis of the noise intensity parameter identifies the transition between deterministic and diffusion-dominated regimes via singular perturbation methods. These theoretical results are reinforced by numerical simulations that validate the predicted feedback laws, confirm the convexity–concavity structure of the triality, and illustrate the stability of the system. The resulting framework clarifies the duality between global wave functions and local dynamical drifts, providing a rigorous foundation for the study of multidimensional stochastic processes under central potentials.
Read the full abstract

Differential Geometry

Cut loci and diameters of the Berger lens spaces

In this paper, we study Riemannian metrics on the three-dimensional lens spaces that are deformations of the standard Riemannian metric along the fibers of the Hopf fibration. In other words, these metrics are axisymmetric. There is a one-parametric family of such metrics. This family tends to an axisymmetric sub-Riemannian metric. We find the cut loci and the cut times using methods from geometric control theory. It turns out that the cut loci and the cut times converge to the cut locus and the cut time for the sub-Riemannian structure, which has already been studied. Moreover, we get some lower bounds for the diameter of these Riemannian metrics. These bounds coincide with the exact values of diameters for the lens spaces L(p;1).
Read the full abstract

Functional Analysis

Tauberian pairs of closed subspaces of a Banach space

We introduce the notions of tauberian, cotauberian and weakly compact pair of closed subspaces of a Banach space. The theory produced by these notions is richer than that of the corresponding operators since an operator can be regarded as a suitable pair of closed subspaces. We investigate into these classes of pairs of subspaces and describe several applications in order to define some notions of indecomposability for Banach spaces and in order to extend definitions from the case of bounded operators to the case of closed operators.
Read the full abstract

Information Theory

An infinite family of non-extendable MRD codes

In the realm of rank-metric codes, Maximum Rank Distance (MRD) codes are optimal algebraic structures attaining the Singleton-like bound. A major open problem in this field is determining whether an MRD code can be extended to a longer one while preserving its optimality. This work investigates $\mathbb{F}_{q^m}$-linear MRD codes that are non-extendable but do not attain the maximum possible length. Geometrically, these correspond to scattered subspaces with respect to hyperplanes that are maximal with respect to inclusion but not of maximum dimension. By exploiting this geometric connection, we introduce the first infinite family of non-extendable $[4,2,3]_{q^5/q}$ MRD codes. Furthermore, we prove that these codes are self-dual up to equivalence.
Read the full abstract

All authors Daniele Bartoli, Alessandro Giannoni, Giuseppe Marino, Alessandro Neri

Information Theory · Cross-listed from eess.SP

Extremum-Based Joint Compression and Detection for Distributed Sensing

We study joint compression and detection in distributed sensing systems motivated by emerging applications such as IoT-based localization. Two spatially separated sensors observe noisy signals and can exchange only a $k$-bit message over a reliable one-way low-rate link. One sensor compresses its observation into a $k$-bit description to help the other decide whether their observations share a common underlying signal or are statistically independent. We propose a simple extremum-based strategy, in which the encoder sends the index of its largest sample and the decoder performs a scalar threshold test. We derive exact nonasymptotic false-alarm and misdetection probabilities and validate the analysis with representative simulations.
Read the full abstract

Algebraic Geometry

Contraherent cosheaves of contramodules on Noetherian formal schemes

There are two main results in this paper: the MGM equivalence between the conventional derived categories of abelian/exact categories, and the derived co-contra correspondence (i.e., an equivalence between the coderived and the contraderived category). Firstly, for any Noetherian formal scheme that is either of finite Krull dimension or semi-separated, we construct a triangulated equivalence between the conventional unbounded derived categories of the abelian category of quasi-coherent torsion sheaves and the exact category of contraherent cosheaves of contramodules. A natural dedualizing complex of quasi-coherent torsion sheaves is constructed and used for that purpose. Secondly, for any Noetherian formal scheme with a dualizing complex of quasi-coherent torsion sheaves, we construct a triangulated equivalence between the coderived category of quasi-coherent torsion sheaves and the contraderived category of contraherent cosheaves of contramodules. The exact category of contraherent cosheaves of contramodules on a locally Noetherian formal scheme, as well as the exact categories of locally contraherent cosheaves of contramodules (with respect to a given open covering) are defined and discussed in this paper. The exposition in the section of preliminaries in adic commutative algebra is worked out in the greater generality of arbitrary commutative rings with adic topologies (of finitely generated ideals).
Read the full abstract

2603.27732 · 29 Mar · LaTeX 2e with xy-pic and mathx, mathrsfs, and yswab fonts; 321 pages, 26 commutative diagrams; v.8: Sections 1.4 and 4.11 inserted, Sections 5.7 and 6.4-6.6 added; v.9: Remark 5.3.3 and Lemma A.2.6 inserted, Section 1.7 inserted, new Sections 7 and 8 added; v.10: new Lemmas 2.6.3 and 2.13.8 inserted, Section 1.7 expanded, new Section 4.9 inserted, new Sections 2.20, 7.12 and 8.5-8.7 added

Logic

Arbitrary models of the complete first-order theories of FDZ-rings

In this paper, we study arbitrary models of the first-order theory of a ring $A$ where the additive group $A$ is a finitely generated abelian group. Following an earlier paper by this author, Alexei G. Myasnikov and Francis Oger, we call these rings the FDZ-rings or FDZ-algebras. The rings considered are not necessarily unitary, commutative, or associative. We provide criteria for such rings to be quasi finitely axiomatizable (QFA) or bi-interpretable with the ring of integers $\mathbb Z$. We shall also describe all rings elementarily equivalent to such a ring $A$ given certain constraints on $A$.
Read the full abstract

Numerical Analysis

Global Convergence for an n-Dimensional Coefficient Inverse Problem for a Wave-Like Equation with a Single Location of the Point Source

In this paper, the first globally convergent numerical method is developed for an $n-$Dimensional coefficient inverse problem for a wave-like equation with the unknown potential in the most challenging case when the Dirac $% \delta -$ function is present in one of initial conditions for that equation and only a single location of the point source is used. Based on a Carleman estimate, convergence analysis is carried out. This analysis ensures the global convergence of the proposed numerical method, i.e. its convergence to the true solution is rigorously guaranteed regardless on the availabilty of a good first guess about this solution. A certain uniqueness theorem is proven as well. Extensive computational experiments with noisy data for both 2-Dimensional and 3-Dimensional cases demonstrate a high reconstruction accuracy.
Read the full abstract

All authors Michael V. Klibanov, Jingzhi Li, Tian Niu, Vladimir G. Romanov

Number Theory

The Davenport-Lewis-Schinzel problem on the reducibility of $f(X)-g(Y)$

We solve the problem of Davenport–Lewis–Schinzel (DLS), originating in the 1950s, regarding the reducibility of $f(X)-g(Y)\in\mathbb C[X,Y]$. This yields an almost-complete solution to the Hilbert–Siegel problem: For a polynomial map $f$ whose composition factors avoid only very specific low-degree polynomials, we explicitly describe over which integers the fibers of $f$ are reducible. We further apply the solution to stability of iterates of $f$ in arithmetic dynamics, and to solving the functional equation $f(X)=g(Y)$ in $X,Y\in\mathbb{C}(z)$.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Induced replication and the assessment of models

We study the assessment of semiparametric and other highly-parametrised models from the perspective of foundational principles of parametric statistical inference. In doing so, we highlight the possibility of avoiding the usual semiparametric considerations, which typically require estimation of nuisance components through kernel smoothing or basis expansion, with the associated difficulties of tuning-parameter choice that blur the distinction between estimation and model assessment. A key aspect is the inducement of replication under the postulated model. This can be cast in terms of some non-standard inferential separations, in the vein of Fisherian ancillarity/co-ancillarity and sufficiency/co-sufficiency separations, allowing the replacement of out-of-sample prediction error as a criterion for semiparametric model assessment by a type of within-sample prediction error. Framed in this light are new methodological contributions in multiple example settings, including model assessment for the proportional hazards model, for a time-dependent Poisson process with semiparametric intensity function, and for matched-pair and two-group examples. Also subsumed within the framework is a post-reduction inference approach to the construction of confidence sets of sparse regression models. Numerical work confirms recovery of nominal error rates under the postulated model and high sensitivity to departures in the direction of semiparametric alternatives. We conclude by emphasising open challenges and unifying perspectives.
Read the full abstract

Numerical Analysis

Releasing the pressure: High-order surface flow discretizations via discrete Helmholtz-Hodge decompositions

We present a discrete Helmholtz–Hodge decomposition for H(div)-conforming Brezzi–Douglas–Marini (BDM) finite elements on triangulated surfaces of arbitrary topology. The divergence-free BDM subspace is split L2-orthogonally into rotated gradients of a continuous streamfunction space and a finite-dimensional space of discrete harmonic fields whose dimension equals the first Betti number of the surface. Consequently, any incompressible flow discretized on this subspace can be reformulated with a scalar streamfunction and finitely many harmonic coefficients as the only unknowns. This eliminates the pressure and the saddle-point structure while ensuring exact tangentiality, pointwise divergence-freeness, and pressure-robustness. We present a randomized algorithm for constructing the harmonic basis and discuss implementation aspects including hybridization, efficient treatment of the harmonic unknowns, and pressure reconstruction. Numerical experiments for unsteady surface Navier–Stokes equations on a trefoil knot and a multiply-connected sculpture surface demonstrate the method and illustrate the physical role of the harmonic velocity component.
Read the full abstract

All authors Tim Brüers, Christoph Lehrenfeld, Tim van Beeck, Max Wardetzky

Functional Analysis

Cayley–Hamilton tuples: an interplay between algebraic varieties and joint spectra

We introduce the notion of Cayley–Hamilton tuples: these are commuting operator tuples that are annihilated by a non-zero polynomial and such that its Taylor joint spectrum coincides with the algebraic variety determined by its annihilating ideal. Commuting matrix tuples are Cayley–Hamilton tuples. We provide two families of Cayley–Hamilton tuples in the infinite dimensional setting with additional details. What arises as a by-product is a concrete characterization of distinguished varieties in the polydisk in terms of Taylor joint spectrum of commuting isometries. These varieties have been of interest in various fields of mathematics over the last two decades. The Taylor and Waelbroeck joint spectrum of a Cayley–Hamilton tuple are shown to be the same. It is also shown that the support of the annihilating ideal of a Cayley–Hamilton tuple is the same as its joint spectrum. As an application, we deduce an algebraic characterization of bi-variate polynomials whose zero set intersected with the closed bidisk is the joint spectrum of a commuting isometric pair.
Read the full abstract

Probability

Bridging Schrödinger and Bass: A Semimartingale Optimal Transport Problem with Diffusion Control

We study a semimartingale optimal transport problem interpolating between the Schrödinger bridge and the stretched Brownian motion associated with the Bass solution of the Skorokhod embedding problem. The cost combines an entropy term on the drift with a quadratic penalization of the diffusion coefficient, leading to a stochastic control problem over drift and volatility. We establish a complete duality theory for this problem, despite the lack of coercivity in the diffusion component. In particular, we prove strong duality and dual attainment, and derive an equivalent reduced dual formulation in terms of a variational problem over terminal potentials. Optimal solutions are characterized by a coupled Schrödinger-Bass bridge system, involving a backward heat potential and a transport map given by the gradient of a $\beta$-convex function. This system interpolates between the classical Schrödinger system and the Bass martingale transport. Our results furnish a unified framework encompassing entropic and martingale optimal transport, and yield a variational foundation for data-driven diffusion models.
Read the full abstract

All authors Pierre Henry-Labordere, Grégoire Loeper, Othmane Mazhar, Huyên Pham, Nizar Touzi

Number Theory

Galois representation of the product of two Drinfeld modules of generic characteristic

We study the adelic Galois representations attached to products of two Drinfeld modules of generic characteristic. As a function-field analogue of Serre's open image theorem for products of elliptic curves, we show that the image of the joint adelic representation is commensurable with the subgroup defined by the natural determinant compatibility conditions if and only if at least one of the two Drinfeld modules has potential complex multiplication, or the two modules are not geometrically isogenous up to any Frobenius twist. Our proof combines Pink's theory of minimal quasi-models, explicit reciprocity laws from global class field theory, and an analysis of residual Galois representations. As an arithmetic application, we prove a torsion finiteness result: if one of the Drinfeld modules has no potential complex multiplication and the two are not geometrically isogenous up to any Frobenius twist, then that Drinfeld module has only finitely many torsion points over the compositum of the maximal abelian extension of the base field and the torsion field of the other module. This is an analogue of the classical results of Ribet and Zarhin for abelian varieties.
Read the full abstract

2603.27710 · 29 Mar · Compared with v3, this 40-page version removes the strong supersingular reduction condition from the main theorem, making the adelic open image result unconditional. We also prove a stronger torsion-finiteness result. The manuscript has been thoroughly revised for clarity; comments are welcome

Representation Theory

Pseudo-torsion classes

For a finite dimensional algebra $\Lambda$, we consider a torsion class $G$ in $mod$-$\Lambda$, which is not necessarily functorially finite. We construct a wall-and-chamber structure for $G$ where the chambers are the connected components of the complement of the union of walls. We call these “pseudo-chambers”. We also consider “infinitesimal chambers". To each pseudo-chamber $U$ we associate a “pseudo-torsion class” $P(U)$ and a “pseudo-torsionfree class” $Q(U)$ and show that they determine $U$. Furthermore, we show that if both $P(U)$ and $Q(U)$ are finitely generated, then $U$ is an open set. We consider “green paths” in the stability space and associate to them Harder-Narasimhan stratifications of $G$. This paper is part of a series of papers whose goal is to study the “ghosts” which are remnants of the indecomposable $\Lambda$-modules which do not lie in $G$. In the special case when our torsion class is all of $mod$-$\Lambda$, we are in the classical well-known setting. All of our results apply to this classical setting. The “pseudo-torsion classes” are torsion classes. We point out that we do not take the closure of the set of walls. So, we get more pseudo-chambers and our results are new even in this classical setting.
Read the full abstract

Numerical Analysis

Auto-Stabilized Weak Galerkin Finite Element Methods for Biot's consolidation model on Non-Convex Polytopal Meshes

This paper presents an auto-stabilized weak Galerkin (WG) finite element method for the Biot's consolidation model within the classical displacement-pressure two-field formulation. Unlike traditional WG approaches, the proposed scheme achieves numerical stability without the requirement of traditional stabilizers. Spatial discretization is performed using weak Galerkin finite elements for both displacement and pressure approximations, while a backward Euler scheme is employed for temporal discretization to ensure a fully implicit and stable formulation. We establish the well-posedness of the resulting linear system at each time step and provide a rigorous error analysis, deriving optimal-order convergence. A significant merit of this WG scheme is its flexibility on general shape-regular polytopal meshes, including those with non-convex geometries. By utilizing bubble functions as a primary analytical tool, the method produces stable, oscillation-free pressure approximations without specialized treatment. Numerical experiments are presented to validate the theoretical convergence rates and demonstrate the computational efficiency and robustness of the auto-stabilized formulation.
Read the full abstract

Analysis of PDEs

On principal eigenpairs for the (p,q)-Laplacian in exterior domain

We consider an eigenvalue problem of the form \begin{equation*} \left\{\begin{array}{rclll} -\Delta_{p} u -\Delta_{q} u&=& \lambda K(x)|u|^{p-2}u & \mbox{ in } \Omega^e u&=&0\qquad \quad &\mbox{ on } \partial \Omega u(x) &\to& 0 &\mbox{ as } |x| \to \infty\,, \end{array}\right. \end{equation*} where $\Omega^e$ is the exterior of a simply connected, bounded domain $\Omega$ in $\mathbb{R}^N$, $p, q \in (1, N)$ with $p \neq q$, $0 < K \in L^{\infty}(\Omega^e) \cap L^{\frac{N}{p}}(\Omega^e)$, and $\lambda \in \mathbb{R}$. We establish the existence of an unbounded set of the principal eigenvalues and corresponding eigenfunctions. Moreover, we establish the regularity, positivity and the asymptotic profiles of these eigenfunctions with respect to the eigenvalue parameter $\lambda$. We use the fibering method of S.~I. Pohozaev to prove our results.
Read the full abstract