Papers

Fix an odd prime $p$ and let $f$ be a $p$-non-ordinary cuspidal eigen-newform of weight $2\leq k\leq p+1$. We construct a pair of bounded $p$-adic $L$-functions associated to $f$ by decomposing the unbounded $p$-adic $L$-functions in terms of an explicit logarithm-type matrix whose definition does not require $p$-adic Hodge theory. Using this decomposition, we compute asymptotic formulas for the Iwasawa invariants of Mazur–Tate elements attached to non-ordinary forms of weight $\leq p+1$. As a corollary, we obtain a relation between the signed Iwasawa invariants of $p$-non-ordinary and $p$-congruent cuspforms of weights 2 and $p+1$, generalizing previous results in the $a_p=0$ case.

While district heating networks are a key component of the energy transition, their operational planning is challenging due to substantial uncertainty in heat demand. We study how unit-commitment schedules can account for this uncertainty and what reliability costs. By adapting chance-constrained programming (CC) and conditional value-at-risk (CVaR) optimization to the mixed-integer unit-commitment problem for district-heating networks, we can compute optimal unit-commitment schedules under demand uncertainty. We generate heat demand scenarios using a Bayesian model, which explicitly quantifies forecasting uncertainty and yields predictive distributions as input to the network optimization. To handle the inherent uncertainty in heat demand, we apply two stochastic optimization approaches that exploit this distribution: chance-constrained programming limits the probability of unmet demand, and in our scenario-based setting reduces to a deterministic MIP in which demand is replaced by an empirical quantile, while CVaR optimization penalizes severe shortfalls in the tail of the distribution. We evaluate the approaches both on real-world data from the Berlin district heating network and on a benchmark set of synthetic, realistically parameterized instances of varying sizes. The results show that the two methods are complementary: CC cheaply traces the high-reliability end of the cost–reliability trade-off and reveals the physical reliability limit of the network, whereas CVaR covers the low-cost, risk-tolerant regime at considerably higher computational effort.

Large-scale formalization of advanced mathematics requires more than translating individual statements: it must reconstruct a coherent theory distributed across heterogeneous sources. This process raises four challenges: discovering implicit dependencies, correcting source defects, preserving semantic fidelity, and reconciling cross-source misalignments. We present FormaTheoria, an end-to-end, AI-assisted workflow that coordinates source acquisition, formalization, proof construction, recursive dependency discovery, independent review, and reconciliation, while preserving provenance and protecting approved declarations. A shared agent framework supports long-horizon execution through tool use, context compaction, review-gated termination, section-level source context, and dependency-aware batch parallelization. Applying FormaTheoria to major components of the Classification of Finite Simple Groups (CFSG), we construct a machine-checked Lean development extending through the Bender–Suzuki theorem and encompassing the Feit–Thompson Odd Order Theorem, Glauberman's $Z^*$ theorem, and the Brauer–Suzuki theorem. This development verifies an extensive body of deeply interdependent finite-group theory while providing a foundation for continuing the CFSG formalization. An empirical analysis of the code and recorded construction process supports the practical relevance of the identified challenges and illustrates the roles of the corresponding workflow components. Together, these results demonstrate how AI-assisted workflows can reconstruct mathematically significant formal theories from distributed literature by combining language-model agents with formal verification, structured review, and explicit dependency management.

We determine the sharp constants in the one-sided John-Nirenberg inequality for functions of bounded lower oscillation on an interval. More precisely, if $f\in\BLO(I_0)$, then $$ \sup_{I\subseteq I_0}\frac{1}{|I|} \left|\left\{x\in I: f(x)-\essinf_I f>\lambda\right\}\right| \le c_1\exp\left(-\frac{c_2\lambda}{\norm{f}_{\BLO(I_0)}}\right), \qquad \lambda>0, $$ with the usual interpretation when $\|f\|_{\mathrm{BLO}(I_0)}=0$. The sharp constants are $c_1^*=e$ and $c_2^*=1$. We give a proof based on the Riesz rising sun lemma and an independent Bellman function proof. Finally, we present several consequences of the sharp estimate.

In this paper, we investigate a broad class of systems for which Katok's intermediate entropy conjecture holds. In particular, we show that a dynamical system with an amenable group action satisfies Katok's intermediate entropy conjecture provided that it has the specification property and is asymptotically entropy expansive.

Every statistic on laws with finite pth moment that is additive across independent risks and monotone in mean-preserving spreads depends only on an additive function of the mean when p is strictly less than 2, and only on such a function and a nonnegative multiple of the variance when p is no less than 2.

Given two elliptic curves defined over $\mathbb{Q}$ and a rational prime $p$, we study the product of their residual Galois representations. Using Goursat's lemma, we explicitly enumerate and completely characterize all possible images of such product representations. We also define associated invariants to these image groups, which we call witness ratios, and we explain their computational utility and their relationship to the well-known Sturm bound for testing congruences between modular forms.

We establish exponential contraction for underdamped Langevin diffusions with nonconvex confining potentials and possibly superlinear forces. The force satisfies a polynomial local Lipschitz bound with exponent $\ell\geq0$, and the potential has a lower bound of order $m\geq2$, with $3\ell<2m$. Under radial confinement and a potential–dissipation inequality, we construct an explicit weighted Kantorovich transportation cost in which the Markov semigroup contracts probability laws exponentially. The estimate holds for all nonnegative times, with prefactor one and an explicit positive rate, without a smallness condition on the local Lipschitz coefficient. The proof combines localized reflection–synchronous coupling with an exponential Lyapunov weight. A radius-dependent shift of the position–velocity difference balances the local force contribution to the distance drift, while distinct localization scales in position and velocity exploit the growth of the potential. Together, these choices yield a dissipative estimate for the weighted cost with a vanishing regularization error. The regularized couplings preserve the Langevin marginals, so passage to weak limits yields contraction for all initial laws with finite transportation cost. Consequently, the dynamics converge exponentially to the Gibbs measure within the corresponding finite-cost class. The assumptions include quartic double-well potentials of arbitrary amplitude. Numerical experiments for asymmetric quartic wells examine transportation between two initial laws and quantify the conservatism of the explicit rate.

A proper conflict-free (PCF) $k$-coloring of a graph $G$ is a proper $k$-coloring such that there exists a color that appears exactly once in the neighborhood of every non-isolated vertex $v\in V(G)$. The PCF chromatic number, denoted by $\chi_{pcf}(G)$, is the least integer $k$ such that there exists a PCF $k$-coloring of $G$. Given a graph $G$ and a positive integer $k$, PCF $k$-COLORABILITY is to decide whether $G$ admits a PCF $k$-coloring. Ahn et al. [Discrete Appl. Math. 377 (2025) 10-17] proved that PCF $k$-COLORABILITY is NP-complete for bipartite graphs. We strengthen this result by proving that PCF $k$-COLORABILITY is NP-complete for perfect elimination bipartite graphs, which is a proper subclass of bipartite graphs. We also show that the PCF chromatic number of a graph cannot be approximated within $O(n^{1-\varepsilon})$ unless P=NP, for any $\varepsilon>0$. On the positive side, we provide linear-time algorithms for PCF $k$-COLORABILITY in block graphs, proper interval graphs, chain graphs, and pseudo-split graphs. We show that $\chi_{pcf}(G)\leq \omega(G)+1$ for block graphs, proper interval graphs, and pseudo-split graphs (except $C_5$), and we characterize all graphs for which the equality holds.

We develop an analytical theory of anomalous transport in a noninteracting Anderson model with heavy-tailed hopping amplitudes. The broad distribution of hopping amplitudes gives rise to an extended intermediate-time regime with a subdiffusive effective exponent, despite the absence of interactions or genuine many-body effects. By solving the transport equations analytically, we derive the time dependence of the mean-square displacement and identify a continuous crossover from an intermediate anomalous regime to asymptotically diffusive transport. As the localization transition is approached, the spatial extent of the subdiffusive window diverges parametrically, while the crossover to conventional diffusion remains finite in units of $\Gamma_0^{-1}$. This produces an increasingly broad anomalous transport regime in space that can closely resemble Griffiths-type transport observed near the many-body localization transition. Our results demonstrate that rare hopping processes alone provide a microscopic single-particle mechanism for robust transport anomalies, establishing an analytical benchmark for distinguishing interaction-induced effects from disorder-driven dynamics.

Let P be a finite spherical set. We prove that if P admits a solvable group of isometries acting transitively on it, then every r-coloring of a sufficiently high-dimensional sphere of radius slightly larger than the circumradius of P contains a monochromatic congruent copy of P. Our proof builds on the group-theoretic argument of Kriz and combines it with a topological method that may be of independent interest.

We initiate a study of centrally extended ($\textit{anomalous}$) symmetries in Kähler geometry, focusing on the simplest, and most ubiquitous, Abelian case. In particular, we provide a local description of the geometry admitting such isometries. A long-standing no-go theorem asserts that there is an obstruction to gauging such symmetries in the purely Kähler framework. Utilizing the language of sypersymmetry, we then show that these symmetries may be gauged within the setup of generalized Kähler geometry. Our results may be applied to quotients, T-dualities, etc.

This paper develops an adaptive time-stepping Euler–Maruyama scheme for stochastic differential equations (SDEs) with non-globally Lipschitz drift and diffusion coefficients. By dynamically adjusting the timestep at each iteration, the proposed scheme effectively prevents numerical instability. We prove the moment boundedness of the numerical solution and establish a $1/2$-order strong convergence rate both on finite-time intervals and uniformly in time. Furthermore, the scheme faithfully inherits the $p$th moment exponential stability of the underlying SDE. For long-time ergodic dynamics, we establish the polynomial ergodicity of the numerical invariant measure. Moreover, we show that the numerical invariant measure converges to the invariant measure of the underlying SDE at an optimal rate of $1/2$ in the $L^q$-Wasserstein distance. Numerical experiments confirm our theoretical results and indicate the superior accuracy and computational performance of the proposed scheme over several fixed-step and existing adaptive methods.

We prove that the asymptotic cone of any non-abelian free group equipped with the bi-invariant word metric has elements of order 2.

Let $X$ be an isotropic log-concave random vector in $\mathbb{R}^n$ and let $G$ be standard Gaussian. Starting from the first moment comparison for gauges, we derive corresponding estimates at arbitrary moment orders. For every gauge $\phi$ and every $q\geqslant 1$, $$ \|\phi(G)\|_q\leqslant C\sqrt{\ln(en)+q}\,\|\phi(X)\|_q,\qquad \|\phi(X)\|_q\leqslant C\left(\sqrt{\ln(en)}+\psi(X)\sqrt q\right)\|\phi(G)\|_q. $$ Applied to support functions, this gives the sharp worst case order $C\sqrt{\ln(en)}$ for the $L_2$-Sudakov constant and quantitative $L_p$-Sudakov estimates. Combining, at each level of Latala's dyadic chain, the strongest of the three quantitative $L_p$-Sudakov estimates used here yields $$ \left(\mathbb{E}\|Y\|^p\right)^{1/p}\leqslant C\left(n^{1/4}\sqrt{\ln(en)}\,\ln(e+\ln(en))\,\mathbb{E}\|X\|+\sigma_p(Y)\right) $$ whenever the weak moments of $Y$ are dominated by those of $X$. In a second direction, we study the generalized dual Sudakov problem for the self generated metrics associated with $Z_r(X)^\circ$ and prove dimension free packing estimates for $Z_p(X)$. We also obtain mean norm estimates for centroid bodies, factorization through arbitrary symmetric convex bodies and an affine dimensional refinement.

We study when an equidimensional toric morphism is forced to be a projective-space bundle. Our main result is an affine rigidity theorem: if the base space is affine, the toric relative canonical divisor is $\mathbb Q$-Cartier, and its negative has degree greater than the relative dimension on every complete curve, then the morphism is equivariantly a trivial projective-space bundle. As an application, we derive a projective-space-bundle theorem for equidimensional toric contractions associated to long extremal rays, without assuming $\mathbb Q$-factoriality.

We study the exterior Dirichlet problem for the mixed Hessian quotient equation \[ \frac{\sigma_k(\eta(D^2 u))}{\sigma_l(\eta(D^2 u))} = 1, \] where $\eta(M) = (\operatorname{tr} M)I - M$. We establish existence and uniqueness of smooth admissible solutions with prescribed quadratic asymptotics at infinity, and obtain full derivative decay of the remainder. The proof relies on a three-stage subsolution construction.

Electroporoelasticity equations couple Maxwell's equations with Biot's poroelasticity model and admit severe Poisson locking in standard conforming finite element discretizations when the Lamé constant is large. In this paper, we provide a rigorous analysis of the Poisson locking phenomenon for three-dimensional quasi-static electroporoelasticity equations and show that the spatial convergence order of conforming finite element approximations is reduced in the nearly incompressible regime. To eliminate this locking effect, we introduce a five-field formulation and a fully discrete high-order finite element method. We prove uniform stability with respect to large Lamé constant. Based on this, we establish a locking-free scheme by deriving its uniform error estimates with respect to the Lamé coefficient. The analysis covers the fully coupled electromagnetic-poroelastic system and applies to high-order elements in three dimensions. Extensive numerical experiments are presented to verify the theoretical convergence rates and demonstrate robustness with respect to the Lamé parameter.

In this paper, we give an explicit construction of surface measures on a class of surfaces with arbitrary, possibly infinite, codimension in $\ell^2$. These measures are constructed from local representations associated with a fixed Gaussian product measure. We then establish local and global Gauss–Green-type formulas, introduce a notion of top-degree differential form, and derive an associated Stokes-type identity. We also determine the orientation of the boundary induced by the orientation of the surface. Moreover, therelationship between $\mathcal F$-continuity and Borel measurability is examined,which reveals a phenomenon specific to the infinite-dimensional setting.

In the published paper [T10], K. Trimèche presented a proof of the statement that for suitable nonnegative multiplicities and regular arguments, the representing measures of Dunkl's intertwining operator and its dual are absolutely continuous with respect to Lebesgue measure. In this note, we argue that the essential proofs of this paper are not correct.

Consider a point-to-point communication system in which the transmitter holds a binary message of length $m$ and transmits a corresponding codeword of length $n$. The receiver's goal is to recover a Boolean function of that message, where the function is unknown to the transmitter, but chosen from a known class $F$. We are interested in the asymptotic relationship of $m$ and $n$: given $n$, how large can $m$ be (asymptotically), such that the value of the Boolean function can be recovered reliably? This problem generalizes the identification-via-channels framework introduced by Ahlswede and Dueck. In this paper, we formulate the notion of computation capacity, and derive achievability and converse results for a large class of functions $F$, characterized by the Hamming weight of functions. Different from the classical transmission problem, the performance of the function computation problem is jointly characterized by the computation capacity and the rate function, namely how $m$ scales with $n$ asymptotically. Our results give a complete characterization of the rate function of the computation problem, and provide upper and lower bounds on the computation capacity, where they differ by a factor of at most $2$.

We show how to extend Makdisi's algorithms to compute explicitly with the Poincaré torsor on the Jacobian of an algebraic curve.

We give a detailed proof of interior $W^{2,p}$ regularity for uniformly elliptic equations in nondivergence form \[ a^{ij}(x)D_{ij}u+b^i(x)D_i u=f. \] The leading matrix is assumed to have sufficiently small mean oscillation on the balls under consideration. The proof uses a modern real-variable argument: a constant-coefficient harmonic replacement yields a sharp-function estimate for the Hessian, and the Fefferman–Stein and Hardy–Littlewood theorems permit the coefficient error to be absorbed. A parameter estimate, obtained by Agmon's auxiliary-variable argument, supplies a consistent resolvent on all $L^p$ spaces and makes the subsequent gain of integrability non-circular. The first-order term is retained throughout and is controlled by the scale-invariant quantity $R^{1-n/q}\|b\|_{L^q(B_R)}$, with $q>\max\{n,p\}$. As a consequence, coefficients in $\VMO_{\rm loc}$ give the usual local $W^{2,p}$ regularity for every finite $p$.

For a number field $K$, a prime $p$ and a finite set of tame places $S$ we consider the groups $G_{K,S}$ - the Galois groups of the maximal pro-$p$ extension of $K$ unramified outside $S$. The tame Fontaine–Mazur Conjecture predicts that these groups have no nontrivial uniformly powerful pro-$p$ quotients. In this paper we develop a new approach to this problem using Bockstein spectral sequences and Lie-theoretic tools. This allows us to extend and refine an earlier method due to J.~Labute, who was only able to consider the case where $p^2\nmid N(\mathfrak{q})-1$ for each $\mathfrak{q}\in S$. Based on this we develop a method to verify the uniform Fontaine–Mazur property for many $G_{K,S}$ with $|S|=3$ arbitrary. Under mild conditions on $K$ we show that for infinitely many triples $S$, the groups $G_{K,S}$ have no nontrivial uniform quotients. We also exhibit a large class of these groups, which are infinite. Finally, we present numerical evidence indicating that the criteria developed here detect the uniform Fontaine–Mazur property with very high probability for $|S|=3$.

We prove Sobolev space well-posedness of the decoupled potential integral equations. Using basic pseudo-differential techniques, discrete stability is obtained for the standard $L^2$-pairing, and we deduce spectral convergence for high-order schemes employing discontinuous basis functions, or with additional element-wise tangential continuity imposed in the vectorial part of the system. The schemes are shown to be much better conditioned than a mature commercial EFIE/CFIE solver. In many cases appearing almost independent of wavenumber, mesh density, and the order.

Fractal structures generated through nonlinear breather interactions are investigated for the $(2+1)$-dimensional Konopelchenko–Dubrovsky (KD) equation by means of the Hirota bilinear method. The bilinear form of the system is first derived, after which breather interaction solutions are constructed analytically through suitable auxiliary functions. It is shown that the interaction of breather waves in the coupled nonlinear environment gives rise to highly intricate multiscale patterns exhibiting self-similar behaviour under successive magnification. To characterize the geometric complexity of the obtained structures, a three-dimensional voxel-based box-counting method is employed. The computed dimensions are found to be non-integer, confirming the fractal nature of the generated patterns. In addition, relative error analysis, standard error estimation, bootstrap standard deviation and convergence analysis are performed to examine the robustness and reproducibility of the estimated dimensions. The present work suggests that nonlinear breather interactions in coupled dispersive systems may provide a natural mechanism for the emergence of fractal geometries and complex multiscale structures. The combined analytical and quantitative framework developed here may provide further insight into nonlinear energy localization and scale-dependent structures arising in fluid dynamics, plasma physics and nonlinear wave propagation.

In systems with infinitely many degrees of freedom, fundamental results from quantum information theory can fail. An important example is the uniqueness of purifications: Even when two subsystems, described by commuting von Neumann algebras $A$ and $B$, are tomographically complete, purifications of a state on $A$ need not be related by unitaries in $B$. It was recently shown that this occurs precisely when Haag duality fails, i.e., when the commutant $B'$ is strictly larger than $A$. This raises the question of which fundamental entanglement properties survive in such a setting. We show that, for a pure global state, the ability to steer any ensemble decomposition of the marginal state on $A$ by measurements on $B$ is equivalent to the existence of a state-preserving conditional expectation from $B'$ onto $A$. This establishes a direct connection between quantum steering and subfactor theory. The key observation is that steering is equivalent to the existence of extensions of ensemble decompositions from $A$ to $B'$. Working with general Jordan algebras, we prove that unital positive maps have state-preserving left inverses if and only if ensemble decompositions can be lifted. For the inclusion $A\hookrightarrow B'$, a left inverse is precisely a conditional expectation, yielding the characterization above.

We introduce the notion of moderate and rapid decay nearby cycles relative to a holomorphic function $f$ for an arbitrary holonomic $\mathcal{D}$-module. They are proved to be $\mathbb{R}$-constructible complexes on the product of the special fiber of the function and the circle $S^1$ parametrizing the values of $f/|f|$. Duality properties are proved by B.\,Hepler and A.\,Hohl [HH25], and we also prove them in special cases. Relations with the irregularity complexes as defined by Z.\,Mebkhout are given. Most of the arguments rely on the results of T.\,Mochizuki [Moc14].

Linear Quadratic Stochastic Optimal Control (LQ-SOC) establishes a fundamental framework for steering noisy dynamical systems and has recently gained renewed interest in the machine learning community. However, current state-of-the-art policy-based methods suffer from prohibitive computational costs and instability due to their heavy reliance on full-trajectory simulation. To overcome these limitations, we propose a paradigm shift toward a value-based approach by revisiting Path Integral Control (PIC). Although standard PIC suffers from the same high-variance bottleneck as policy-based methods, we discover that by truncating and marginalizing the original path integral formulation, we can derive a temporal recursive form of the value function. Building upon this theoretical foundation, we propose the Path Integral Value Matching (PI-VM) algorithm. Specifically, we employ temporal-difference learning to approximate the recursive value dynamics, and further integrate the Girsanov theorem with experience replay to enable off-policy training. We benchmark PI-VM against SOTA policy-based methods across various SOC benchmarks and sampling tasks. Empirical results demonstrate that PI-VM matches SOTA precision with an order-of-magnitude efficiency gain in low-dimensional settings, while effectively mitigating mode collapse in high-dimensional scenarios. Consequently, PI-VM offers a scalable solution for solving complex SOC problems.

We study necessary and sufficient conditions on $\gamma$ for several classes of polynomials of the form $X+\gamma \operatorname{Tr}_{q}^{q^n}(h(X))$ to be permutation polynomials over finite field $\mathbb{F}_{q^n}$, where $q$ is a prime power, $n$ is a positive integer, and $\operatorname{Tr}_{q}^{q^n}(\cdot)$ denotes the relative trace function from $\mathbb{F}_{q^n}$ to $\mathbb{F}_q$. In addition, we completely characterize the permutation polynomials of the form \( X+\gamma\operatorname{Tr}_{q}^{q^n}(h(X)) \) over $\mathbb{F}_{q^n}$, with their compositional inverses, where \( h(X)=c_1X+c_2X^2+X^2\operatorname{Tr}_{q}^{q^n}(X), \) $c_1,c_2\in\mathbb{F}_q.$