Algebraic Geometry
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 26 March
We study the perfectoid pure threshold with respect to $p$, an invariant of singularities in mixed characteristic $(0,p)$ arising from perfectoid purity. In this paper, we compute perfectoid pure thresholds for lifts of rational double points. We show that the set of such thresholds is contained in $\mathbb{Q}$ and satisfies the ascending chain condition. In characteristic $2$, all reciprocals of positive integers occur, and $0$ is the unique accumulation point.
Logic · Cross-listed from cs.LO
Normal forms in cubical type theory
This note documents the specification of normal forms in cubical type theory. The definition is already present in the proof of normalization for cubical type theory, but we present it in a more traditional style explicitly for reference.
Number Theory
Igusa Stacks and the Cohomology of Shimura Varieties II
We construct Igusa stacks for all Shimura varieties of abelian type and derive consequences for the cohomology of these Shimura varieties. As an application, we prove that the Fargues–Scholze local Langlands correspondence agrees with the semi-simplification of the local Langlands correspondences constructed by Arthur, Mok and others, for all classical groups of type $A$, $B$ and $D$; this extends work of Hamann, Bertoloni Meli–Hamann–Nguyen and Peng.
Read the full abstract
Number Theory
On the Density of Coprime Reductions of Elliptic Curves
Given non-CM elliptic curves $E_1$ and $E_2$ over $\mathbb{Q}$, we study the natural density of primes $p$ of good reduction for which the orders of the groups $E_1(\mathbb{F}_p)$ and $E_2(\mathbb{F}_p)$ are coprime. This problem may be viewed as an elliptic curve analogue of the classical question concerning the density of coprime integer pairs. Motivated by Zywina's refinement of the Koblitz conjecture, we formulate a conjecture for the density of such primes. We prove that the series defining this constant converges and admits an almost Euler product expansion. In the case of Serre pairs, we give a closed formula for the constant and use it to prove a moments result describing the distribution of these constants as $(E_1, E_2)$ varies.
Read the full abstract
History and Overview of Mathematics
Shaping the Future of Mathematics in the Age of AI
Artificial intelligence is transforming mathematics at a speed and scale that demand active engagement from the mathematical community. We examine five areas where this transformation is particularly pressing: values, practice, teaching, technology, and ethics. We offer recommendations on safeguarding our intellectual autonomy, rethinking our practice, broadening curricula, building academically oriented infrastructure, and developing shared ethical principles - with the aim of ensuring that the future of mathematics is shaped by the community itself.
Read the full abstract
Optimization and Control
Geometry-Aware Langevin Sampling for Matrix-Valued Graph Learning
Bayesian inference over positive semidefinite (PSD) matrix-valued parameters arises in structured covariance estimation, graph-Laplacian precision models, and multi-output graph learning, but Euclidean proposals often mix poorly near the cone boundary. We propose \ConeMALA, a geometry-aware Metropolis-adjusted Langevin algorithm whose proposal geometry is induced by the model's log-determinant structure. For a PSD-weighted graph with edge kernels $W_e\succeq 0$, block Laplacian $L(W)$ , and stabilizer $R\succ 0$, the lifted precision matrix $X(W)=L(W)+R\in \mathbb S_{++}^{md}$ defines the log-determinant energy $\Phi(W)=-\log\det X(W).$ We show that the Hessian of $\Phi$ is the pullback of the affine-invariant SPD metric under the map $W\mapsto X(W)$, yielding explicit intrinsic Langevin proposals with Metropolis-Hastings correction using the closed-form SPD exponential-map Jacobian. We validate the metric on rank-one PSD edge perturbations for $d=5$, obtaining essentially exact agreement between analytic curvature scores and finite-difference curvatures. In intrinsic SPD posterior and matrix-valued graph Gaussian experiments, \ConeMALA achieves stable multichain diagnostics and substantially higher ESS/sec than Euclidean MALA and generic RMALA, while a PDHMC-like finite-difference baseline is accurate but computationally prohibitive at larger graph sizes. These results show that pullback log-determinant geometry provides a practical route to uncertainty quantification in PSD-constrained graph learning.
Read the full abstract
Rings and Algebras
The algebra of invariants of a complete path algebra
We prove that the algebra of invariants of a complete path algebra under the action of a homogeneous group of continuous algebra automorphisms is a complete path algebra and preserves finite or tame representation type.
Analysis of PDEs
Polynomial growth of Sobolev norms of solutions of the fractional NLS equation on $\mathbb{T}^d$
We study polynomial growth of Sobolev norms for the defocusing fractional nonlinear Schrödinger equation on the standard torus $\mathbb{T}^d$, $d \ge 2$. Uniform stationary phase and a frequency-dependent subdivision of time give Strichartz estimates which yield local well-posedness and, for the cubic equation, unconditional polynomial growth when $\alpha > d^2/(d+2)$. The local theory and growth estimates extend to every integer-power nonlinearity $|u|^{2\sigma}u$, with explicit thresholds and growth exponents. In the final section, we identify a further approach to improving the polynomial growth bounds. By combining our arguments with the circle method, we obtain stronger Strichartz estimates, which yield local well-posedness at lower regularity and improved polynomial growth bounds.
Read the full abstract
Analysis of PDEs
Convergence of the self-dual abelian Higgs gradient flow
Given an initial data configuration $(A^{\mathrm{in}}, \phi^{\mathrm{in}})$ on $\mathbb R^2$ such that the self-dual abelian Higgs energy is near the minimum energy within its topological class, we prove that its evolution under the self-dual abelian Higgs gradient flow in temporal gauge converges exponentially as $t \to \infty$ with respect to the $(H^1 \times L^2)$-metric to a minimiser of the energy. Furthermore, we show that the convergence of the scalar field $\phi$ may be upgraded to the $H^1$-metric provided the additional assumption on the potential that $A^{\mathrm{in}} \in L^p (\mathbb R^2)$ for $2 < p < \infty$. As a corollary, we obtain a quantitative stability for the self-dual abelian Higgs energy which improves upon the previous result of Halavati (arXiv:2310.04866) and partially resolves the open problem posed in his article.
Read the full abstract
Probability
Inconsistency Probability of Sparse Equations over F2
Let n denote the number of variables and m the number of equations in a sparse polynomial system over the binary field. We study the inconsistency probability of randomly generated sparse polynomial systems over the binary field, where each equation depends on at most k variables and the number of variables grows. Associating the system with a hypergraph, we show that the inconsistency probability depends strongly on structural properties of this hypergraph, not only on n,m, and k. Using inclusion–exclusion, we derive general bounds and obtain tight asymptotics for complete k-uniform hypergraphs. In the 2-sparse case, we provide explicit formulas for paths and stars, characterize extremal trees and forests, and conjecture a formula for cycles. These results have implications for SAT solving and cryptanalysis.
Read the full abstract
Combinatorics
Bijectivity of a generalized Pak-Stanley labeling
The Pak-Stanley labeling is a bijection between the regions of the $m$-Shi arrangement and the $m$-parking functions. Mazin generalized this labeling to every deformation of the braid arrangement and proved that this labeling is always surjective onto a set of directed multigraph parking functions. We provide a right inverse to the generalized Pak-Stanley labeling, and identify a class $\mathcal{C}$ of arrangements for which this labeling is bijective. The class $\mathcal{C}$ includes the multi-Shi arrangements and the multi-Catalan arrangements. We also show that the arrangements in $\mathcal{C}$ are the only transitive arrangements for which the generalized Pak-Stanley labeling is bijective.
Read the full abstract
Wednesday 25 March
Optimization and Control
Variational Contraction Conditions for Iterative Algorithms in Multi-Population Discrete-Time Regularized Mean-Field Games
In this work, we study the contraction conditions of iterative algorithms for stationary and finite-horizon discrete-time regularized mean-field games (MFGs) with multiple populations, where each population only interacts with the state distributions of the other populations. Due to the high dimensionality caused by the interaction of different populations, contraction rates for these algorithms cannot, in general, be expressed in terms of radicals. By studying the dynamics of these iterative algorithms and assuming that the system components of each population's MFG are Lipschitz continuous, we present explicit (eventual) contraction conditions for each algorithm in any normed space, relying only on these Lipschitz parameters. As a consequence of these contraction conditions, we provide convergence rates of finite-horizon mean-field equilibria to infinite-horizon stationary (and non-stationary) mean-field equilibria (MFEs), under restrictions on a variational characterization of the dynamics of these iterative algorithms. In the single-population case, the restrictions we impose on this variational characterization to obtain these convergence results are less restrictive than previous results in the literature.
Read the full abstract
General Topology
A criterion for Cauchy sequences in db-metric spaces
In this note a criterion for Cauchy sequences is proved which refines the one presented in `Cauchy sequences in b-metric spaces', Topology Appl. 373 (2025) 109477.
General Mathematics
4-D Visualization of Minkowski Quaternionic Point Set Operations
The contribution emphasizes the geometric modeling point of view on Minkowski point set operations. In this paper, the Minkowski product is specified as the quaternionic product. Selected point sets are visualized using double orthogonal projection and perspective projection from four-dimensional to three-dimensional space. In particular, we demonstrate the generation of sets containing circles (Clifford torus, 3-sphere), lines (quadratic cone), or both.
Read the full abstract
Information Theory · Cross-listed from quant-ph
Decoder Dependence in Surface-Code Threshold Estimation with Native Gottesman-Kitaev-Preskill Digitization and Parallelized Sampling
We quantify decoder dependence in surface-code threshold studies under two matched regimes: Pauli noise and native GKP-style Gaussian displacement digitization. Using LiDMaS+ v1.1.0, we benchmark MWPM, Union-Find (UF), Belief Propagation (BP), and neural-guided MWPM with fixed seeds, identical sweep grids, and unified reporting across runs 06–14. At $d=5$ and $\sigma=0.20$, MWPM and UF define the Pareto frontier, with (runtime, LER) = (1.341 s, 0.2273) and (1.332 s, 0.2303); neural-guided MWPM is slower and less accurate (1.396 s, 0.3730), and BP is dominated (7.640 s, 0.6107). Crossing-bootstrap diagnostics are stable only for MWPM, with median $\sigma^\star_{3,5}=0.10$ (1911/2000 valid) and $\sigma^\star_{5,7}=0.1375$ (1941/2000 valid), while other decoders show no valid crossing samples. Dense-window scanning over $\sigma \in [0.08,0.24]$ returns NaN crossings for all decoders, confirming estimator- and window-sensitive threshold localization. Rank-stability and effect-size bootstrap analyses reinforce ordering robustness: BP remains rank 4, neural-guided MWPM rank 3, and MWPM-UF differences are small ($\Delta_{\mathrm{MWPM-UF}}=-0.00383$, 95% interval $[-0.0104,0.00329]$) across $\sigma \in [0.05,0.35]$. Threaded execution preserves statistical fidelity while improving throughput: $1.34\times$ speedup in Pauli mode and $1.94\times$ in native GKP mode, with mean $|\Delta\mathrm{LER}|$ $6.07\times10^{-3}$ and $5.20\times10^{-3}$, respectively. We therefore recommend estimator-conditional threshold reporting coupled to runtime-fidelity checks for reproducible hardware-facing practical future decoder benchmarking workflows.
Read the full abstract
General Mathematics
A Geometric Approach to Structure-Preserving Integrators for Mechanical Systems
We develop a geometric framework for the numerical integration of mechanical systems evolving on manifolds. After briefly reviewing classical numerical methods and highlighting their limitations and shortcomings in non-flat (non-Euclidean) spaces, we include a short interlude reviewing the differential geometric notions required in the sequel. We then introduce retraction maps as intrinsic generalizations of the Riemannian exponential, which induce discretization maps tailored to manifold-valued dynamics. Adopting the Tulczyjew unified viewpoint, mechanical systems are formulated as Lagrangian submanifolds, providing a natural and coordinate-free foundation for the construction of structure-preserving integrators for both Hamiltonian and Lagrangian systems. The framework is specialized to Lie groups, where parallelizability allows for the global trivialization of tangent and cotangent bundles and the systematic derivation of integrators for Euler-Poincare and Lie-Poisson equations. The effectiveness of the proposed approach is illustrated through the rigid body and heavy top, and is further extended to the construction of a geometric integrator for an underactuated mechanical system-a quadrotor-demonstrating the applicability of the framework beyond fully symmetric systems and toward problems relevant in robotics and control.
Read the full abstract
Combinatorics
The geometry of a counting formula for deformations of the braid arrangement
We consider real hyperplane arrangements whose hyperplanes are of the form $\{x_i - x_j = s\}$ for some integer $s$, which we call deformations of the braid arrangement. In 2018, Bernardi gave a counting formula for the number of regions of any deformation of the braid arrangement $\mathcal{A}$ as a signed sum over some decorated trees. He further showed that each of these decorated trees can be associated to a region $R$ of the arrangement $\mathcal{A}$, and hence we can consider the contribution of each region to the signed sum. Bernardi also implicitly showed that for transitive arrangements, the contribution of any region of the arrangement is $1$. We remove the transitivity condition, showing that for any deformation of the braid arrangement the contribution of a region to the signed sum is $1$. This provides an alternative proof of the original counting formula, and sheds light on the geometry underlying the formula. We further use this new geometric understanding to better understand the contribution of a tree.
Read the full abstract
Combinatorics
On invariant subrings of Orlik–Solomon and Varchenko–Gel'fand algebras in type A
We provide simple presentations in terms of generators and relations for the invariant subring of both the Orlik–Solomon algebra and Varchenko–Gel'fand ring of the type $A_n$ reflection arrangement acted upon by the type $A_{n-1}$ reflection group. This may be interpreted as a presentation for the cohomology of the “mixed configuration space" of $n$ red points and one blue point. We provide increasingly refined descriptions of the invariant ring starting with the total dimension and ending with the simple presentation in terms of generators and relations.
Read the full abstract
Combinatorics
The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
We give a near-linear time 4-coloring algorithm for planar graphs, improving on the previous quadratic time algorithm by Robertson et al. from 1996. Such an algorithm cannot be achieved by the known proofs of the Four Color Theorem (4CT). Technically speaking, we show the following significant generalization of the 4CT: every planar triangulation contains linearly many pairwise non-touching reducible configurations or pairwise non-crossing obstructing cycles of length at most 5 (which all allow for making effective 4-coloring reductions). The known proofs of the 4CT only show the existence of a single reducible configuration or obstructing cycle in the above statement. The existence is proved using the discharging method based on combinatorial curvature. It identifies reducible configurations in parts where the local neighborhood has positive combinatorial curvature. Our result significantly strengthens the known proofs of 4CT, showing that we can also find reductions in large “flat" parts where the curvature is zero, and moreover, we can make reductions almost anywhere in a given planar graph. This also opens possibilities for extensions to higher surfaces since we can find such flat parts in any large-width triangulation of any fixed surface. From a computational perspective, the old proofs allowed us to apply induction on a problem that is smaller by some additive constant. The inductive step took linear time, resulting in a quadratic total time. With our linear number of reducible configurations or obstructing cycles, we can reduce the problem size by a constant factor. Our inductive step takes $O(n\log n)$ time, yielding a 4-coloring in $O(n\log n)$ total time. To efficiently handle a linear number of reducible configurations, we need them to be sufficiently robust to be useful in other applications. All our reducible configurations are what is known as D-reducible.
Read the full abstract
Mathematical Physics · Cross-listed from nlin.SI
Deautonomising the Lyness mapping
We examine the Lyness mapping (an integrable $N$th-order discrete system which can be generated from a one-dimensional reduction of the Hirota-Miwa equation) from the point of view of deautonomisation. We show that only the $N=2$ case can be deautonomised when one works with the standard form of the mapping. However it turns out that deautonomisation is possible for arbitrary $N$ when one considers the derivative form of the Lyness mapping. The deautonomisation of the derivative of the $N=2$ case leads to a result we have never met before: the secular dependence in the coefficients of the mapping enters through two different exponential terms instead of just a single one. As a consequence, it turns out that a limit of this multiplicative dependence towards an additive one is possible without modifying the dependent variable. Finally, the analysis of the `late' singularity confinement of the $N=2$ case leads to a novel realisation of the full-deautonomisation principle: the dynamical degree is not given (as is customary) simply by the solution of some linear or multiplicative equation, but is present in the growth of the non-linear (and non-integrable) late-confinement conditions.
Read the full abstract
Mathematical Physics
The Dynamic Doppler Spectrum Induced by Nonlinear Sensor Motion: Relativistic Kinematics and 4D Frenet-Serret Spacetime Geometry
Fundamental to the analysis of nonlinear relativistic motion is the precise characterization of the induced dynamic Doppler effects. In this work, we analyze the electromagnetic signals observed by non-inertial receivers using two frameworks to describe the relativistic motion. We first consider observer paths described by higher-order kinematic 4 vectors: relativistic acceleration and jolt. The dynamic Doppler effects of relativistic acceleration and jolt are exponential spectral broadening and exponential amplitude growth or decay. We derive compact expressions for the spectrum transformation resulting from relativistic acceleration and jolt. The jolt induces nonlinear skewed chirps in observed signals. Next we consider observer paths described by the 4D Frenet-Serret frame and the curvature and torsion of the observer path. We obtain descriptions of the amplitude and phase fluctuations of the signal in terms of the geometric parameters of curvature and torsion. Concise, interpretable descriptions of non-inertial dynamic Doppler effects provide a useful diagnostic and predictive tool for engineering applications including radar, sensing, and communications systems.
Read the full abstract
Geometric Topology
Asymptotically geodesic hypersurfaces and the fundamental groups of hyperbolic manifolds
We consider closed hypersurfaces smoothly immersed in hyperbolic manifolds up to homotopy and commensurability. We prove that if a closed hyperbolic manifold $M$ contains a sequence of asymptotically geodesic hypersurfaces, then $\pi_1(M)$ is virtually special and hence linear over integers. If $M$ (dimension at least 3) is, in addition, arithmetic of type I, we constructs a sequence of hypersurfaces which are asymptotically geodesic (but not totally geodesic), strongly filling, and equidistributing in the Grassmann bundle over $M$. This partially answers a question of Al Assal–Lowe. As a corollary, for each cocompact arithmetic lattice $\Gamma$ of $SO(n+1,1)$ of type I, there exist infinitely many arithmetic and infinitely many non-arithmetic cocompact lattices $H$ of $SO(n,1)$ that admit monomorphisms into $\Gamma$ which do not extend to a Lie group homomorphism from $SO(n,1)$ into $SO(n+1,1)$.
Read the full abstract
Logic · Cross-listed from cs.LO
A Dual-Threshold Probabilistic Knowing Value Logic
We introduce a dual-threshold probabilistic knowing value logic for uncertain multi-agent settings. The framework captures within a single formalism both probabilistic-threshold attitudes toward propositions and high-confidence attitudes toward term values, thereby connecting probabilistic epistemic logic with classical knowing value logic. It is especially motivated by privacy-sensitive scenarios in which an attacker assigns high posterior probability to a candidate sensitive value without guaranteeing that it is the true one. The main idea is to separate the threshold domains of propositional and value-oriented operators. While $K_i^\theta$ ranges over the full rational threshold interval, the knowing-value operator $Kv_i^\eta(t)$ is restricted to $(\frac{1}{2},1]$. This high-threshold restriction has a structural effect: once $\eta>\frac{1}{2}$, two distinct values cannot both satisfy the threshold, so uniqueness becomes automatic. Over probabilistic models with countably additive measures, $Kv_i^\eta(t)$ is interpreted as non-factive high-confidence value locking. We establish sound axiomatic systems for the framework and develop a two-layer construction based on type-space distributions and assignment-configuration mappings. This resolves the joint realization problem arising from probabilistic mass allocation and value-sensitive constraints, and yields a structured weak-completeness theorem for the high-threshold fragment.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Interpretable Causal Graphical Models for Equilibrium Systems with Confounding
In applications, quantities of interest are often modelled in equilibrium or an equilibrium solution is sought. The presence of confounding makes causal inference in this setting challenging. We provide interpretable graphical models for equilibrium systems with confounding using anterial graphs (Lauritzen and Sadeghi, 2018), a class of graphs containing directed acyclic graphs, ancestral graphs, and chain graphs. In this setting, we provide valid graphical representations of both counterfactual variables and observational variables, which we relate to counterfactual graphs (Shpitser and Pearl, 2007) and single-world intervention graphs (Richardson and Robins,2013). As an application of this graphical representation, we provide an element-wise procedure of selecting adjustment sets that flexibly include and exclude given covariates.
Read the full abstract
Operator Algebras
Uniformity and isotypic smallness for quantum-group representations
Compact-group representations on Banach spaces are known to be norm-continuous precisely when they have finite spectra. For a quantum group with continuous-function algebra $\mathcal{C}(\mathbb{G})$ norm continuity can be cast analogously as the bounded weak$^*$-norm continuity of the representation's attached maps $\mathcal{C}(\mathbb{G})^*\to \mathrm{End}(E)$ and its mirror counterpart $E_{\le 1}\times E^*_{\le 1}\to \mathcal{C}(\mathbb{G})$. While the uniformity/isotypic finiteness equivalence no longer holds generally, it does (for the latter map) for compact quantum groups either coamenable or having dimension-bounded irreducible representations. This generalizes the aforementioned classical variant, providing two independent quantum-specific mechanisms of recovering it.
Read the full abstract
Analysis of PDEs
Selection of pushed pattern-forming fronts in the FitzHugh-Nagumo system
We establish nonlinear stability of fronts that describe the creation of a periodic pattern through the invasion of an unstable state. Our results concern pushed fronts, that is, fronts whose propagation is driven by a localized mode at the front interface. We prove that these pushed pattern-forming fronts attract initial data supported on a half-line, and therefore determine both propagation speeds and selected wave numbers for invasion from localized initial conditions. This provides to our knowledge the first proof of the marginal stability conjecture for pattern-forming fronts, thereby confirming universal wave number selection laws widely used in the physics literature. We present our analysis in the specific setting of the FitzHugh-Nagumo system, but our methods can be applied to general dissipative PDE models which exhibit pattern formation. The main technical challenge is to control the interaction between the localized mode driving the propagation and outgoing diffusive modes in the wake of the front. Through a subtle far-field/core decomposition of the linearized evolution, we resolve this interaction and describe the nonlinear response of the front to perturbations as a dynamically driven phase mixing problem for the pattern in the wake. The methods we develop are generally useful in any setting involving the interaction of localized modes and outward diffusive transport, such as in the nonlinear stability of undercompressive viscous shock waves or source defects.
Read the full abstract
Classical Analysis and ODEs
A further q-analogue of Gosper's strange series
Recently, the second author [Ramanujan J. 2026] introduced and proved a $q$-series identity that appears to provide the first known $q$-analogue of an evaluation for a ${}_{2}F_{1}$-series known as Gosper's strange series. Yamaguchi's derivation of this $q$-analogue relies on three-term relations for ${}_{2}\phi_{1}$-series along with Heine's transformation of ${}_{2}\phi_{1}$-series. In this note, we introduce and prove, using a $q$-analogue of a series evaluation technique relying on an Abel-type summation lemma, a further $q$-analogue of Gosper's ${}_{2}F_{1}$-identity that is inequivalent to Yamaguchi's $q$-analogue, and we also apply this technique to construct an alternative and simplified proof of Yamaguchi's $q$-analogue, together with a ${}_{3}\phi_{2}$-series variant of Heine's $q$-analogue of Gauss's hypergeometric formula, a ${}_{6}\phi_{5}$-series variant and two ${}_{4}\phi_{3}$-series variants of the $q$-analogue of Kummer's identity due to Bailey and Daum, along with a $q$-analogue of a result obtained by Cantarini [Ramanujan J. 2022] via Fourier-Legendre theory and related to Ramanujan's first series for $\frac{1}{\pi}$.
Read the full abstract
General Mathematics
Boundary Framework, Rear Morphology, and Rectangular Ears in the Partition Graph
We study the outer geometry of the partition graph $G_n$, focusing on its canonical front-and-side framework, the family of nontrivial rectangular partitions, and the rear structures suggested by the visible geometry of the graph. We formalize the boundary framework $\mathcal B_n=\mathcal M_n\cup\mathcal L_n\cup\mathcal R_n$, where $\mathcal M_n$ is the main chain and $\mathcal L_n,\mathcal R_n$ are the left and right side edges, and we isolate the nontrivial rectangular family $\mathrm{Rect}^*(n)=\{(a^b):ab=n,\ a,b\ge2\}$ as a canonical discrete family marking the rear part of $G_n$. We prove that every nontrivial rectangular vertex $\rho=(a^b)$ has degree $2$, has exactly two explicitly described neighbors, and lies in a unique triangle of $G_n$. This leads to the notions of a rectangular ear, its attachment pair, and its support edge. We also prove that $\mathrm{Rect}^*(n)$ is an independent set in $G_n$, so the weak rectangular contour is not a graph-theoretic chain but a discrete rear marker family. For every genuinely rear rectangular ear, namely for $a,b\ge3$, we show that its support edge lies in a tetrahedral configuration of the clique complex $K_n=\mathrm{Cl}(G_n)$. To organize the interaction between different ears, we introduce support zones, support distances, and support corridors between attachment pairs. The paper also records a natural divisor-theoretic indexing of the rectangular family, presents a computational atlas in small and large ranges, and concludes with open problems concerning support-zone connectivity, inter-ear corridors, and canonical rear contours in $G_n$.
Read the full abstract
Numerical Analysis
Weak and entropy physics-informed neural networks for conservation laws
We propose Weak and Entropy PINNs (WE-PINNs) for the approximation of entropy solutions to nonlinear hyperbolic conservation laws. Standard physics-informed neural networks enforce governing equations in strong differential form, an approach that becomes structurally inconsistent in the presence of discontinuities due to the divergence of strong-form residuals near shocks. The proposed method replaces pointwise residual minimization with a space–time weak formulation derived from the divergence theorem. Conservation is enforced through boundary flux integrals over dynamically sampled space–time control volumes, yielding a mesh-free control-volume framework that remains well-defined for discontinuous solutions. Entropy admissibility is incorporated in integral form to ensure uniqueness and physical consistency of the weak solution. The resulting loss functional combines space–time flux balance and entropy inequalities, without resorting to dual-norm saddle-point formulations, auxiliary potential networks, or fixed discretization meshes. This makes the proposed method remarkably easy to implement, requiring only a simple standard neural network architecture. We establish a rigorous convergence analysis linking the network's loss function to the $L^1$ error towards the entropy solution, providing the first explicit $L^1$ convergence rate for a mesh-free control-volume PINN formulation via the Bouchut-Perthame framework for scalar conservation laws. Numerical experiments on the Burgers equation, the shallow water equations, and the compressible Euler equations demonstrate accurate shock resolution and robust performance in both smooth and shock-dominated regimes.
Read the full abstract
Complex Variables
Canonical sheaves at isolated canonical Gorenstein singularities
It is well known that the Grauert-Riemenschneider canonical sheaf $\mathcal{K}_X$ of holomorphic square-integrable $n$-forms is a central tool in $L^2$-theory for the $\overline\partial$-operator on a singular complex space $X$ of pure dimension $n$. It was shown a few years ago that a comprehensive $L^2$-theory requires also the study of the sheaf $\mathcal{K}_X^s$ of holomorphic square-integrable $n$-forms with a Dirichlet boundary condition at the singular set of $X$. In the present paper, we describe and classify the behaviour of $\mathcal{K}_X^s$ in isolated canonical Gorenstein singularities, and give applications to the $L^2$-theory for the $\overline\partial$-operator on such spaces.