Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Sunday 29 March
Ramírez and Rider (2009) established that the hard edge of the spectrum of the $\beta$-Laguerre ensemble converges, in the high-dimensional limit, to the bottom of the spectrum of the stochastic Bessel operator. Using stochastic analysis tools, we prove that, in the high-temperature limit ($\beta \to 0$), the rescaled eigenvalue point process of this operator converges to a non-trivial limiting point process. This limit is characterized by a family of coupled diffusions and differs from a Poisson point process due to its interaction with the hard edge. Exploiting this diffusion characterization, we establish exact large deviation asymptotics for the largest eigenvalues. Furthermore, for an explicit range of the parameters, we relate this limiting process to the finite-$n$ $\beta$-Laguerre ensemble, conjecturing an exact distributional match with the infinite sum of its independent exponential gaps. As a byproduct of our analysis, we also formulate a conjecture regarding an explicit integral formula for the probability that a reflected Brownian motion with a constant drift hits an affine line, generalizing a formula of Salminen and Yor (2011).
Algebraic Geometry
Numerical inequalities for quasi-projective surfaces
Let $V$ be a smooth quasi-projective complex surface with compactification $(X,D)$ and set $\overline P_1(V):=h^0(X,K_X+D)$, $\overline q(V):=h^0(X,\Omega^1_X(\log D))$. We prove that $\overline P_1(V)\ge \overline q(V)-1$ if $V$ has maximal Albanese dimension and $\overline P_1(V)\ge\frac 16( \overline q(V)-5)$ otherwise. Both bounds are sharp.
Read the full abstract
Analysis of PDEs
Global axisymmetric solutions and incompressible limit for the 3D isentropic compressible Navier-Stokes equations in annular cylinders with swirl and large initial data
We establish the global existence of weak solutions to the isentropic compressible Navier-Stokes equations in three-dimensional annular cylinders with Navier-slip boundary conditions, allowing large axisymmetric initial data and vacuum states, provided that the bulk viscosity is sufficiently large. We identify a regime in which compressible and incompressible effects coexist. The compressible component interacts with pressure and density to produce an effective dissipation mechanism, while the divergence-free component enjoys improved regularity. This shows that large bulk viscosity strongly suppresses the compressible effect, thereby relaxing restrictions on the size of the initial data. Moreover, such solutions converge globally in time to weak solutions of the inhomogeneous incompressible Navier-Stokes system as the bulk viscosity tends to infinity. The proof relies on a Desjardins-type logarithmic interpolation inequality and Friedrichs-type commutator estimates. Our results build upon the works of Hoff (Indiana Univ. Math. J. 41 (1992), pp. 1225-1302) and Danchin-Mucha (Comm. Pure Appl. Math. 76 (2023), pp. 3437-3492), and further develop Hoff-type time-weighted estimates uniform in the bulk viscosity in the presence of boundaries.
Read the full abstract
Numerical Analysis
Stability Analysis of Monolithic Globally Divergence-Free ALE-HDG Methods for Fluid-Structure Interaction
In this paper, we propose two monolithic fully discrete finite element methods for fluid-structure interaction (FSI) based on a novel Piola-type Arbitrary Lagrangian-Eulerian (ALE) mapping. For the temporal discretization, we apply the backward Euler method to both the non-conservative and conservative formulations. For the spatial discretization, we adopt arbitrary order hybridizable discontinuous Galerkin (HDG) methods for the incompressible Navier-Stokes and linear elasticity equations, and a continuous Galerkin (CG) method for the fluid mesh movement. We derive stability results for both the temporal semi-discretization and the fully discretization, and show that the velocity approximations of the fully discrete schemes are globally divergence-free. Several numerical experiments are performed to verify the performance of the proposed methods.
Read the full abstract
Algebraic Geometry
On Chasles' Quadrilateral Theorem
Chasles' Quadrilateral Theorem is a classical statement about four tangents to a conic that simultaneously circumscribe a circle. In its various formulations, it relates the concurrence of certain lines to the existence of confocal conics or inscribed circles. We show that several classical and modern versions of this theorem are affected by subtle ambiguities arising from multiple solutions in the underlying geometric constructions. These ambiguities often enter through seemingly natural extensions of otherwise correct statements. We provide a systematic analysis of these issues and present coherent formulations of the theorem that avoid these inconsistencies. In particular, we interpret the theorem in a projective framework and relate it to the Cayley-Bacharach theorem, which explains the underlying incidence structure.
Read the full abstract
Optimization and Control
Huber-based Robust System Identification with Near-Optimal Guarantees Across Independent and Adversarial Regimes
Dynamical systems can confront one of two extreme types of disturbances: persistent zero-mean independent noise, and sparse nonzero-mean adversarial attacks, depending on the specific scenario being modeled. While mean-based estimators like least-squares are well-suited for the former, a median-based approach such as the $\ell_1$-norm estimator is required for the latter. In this paper, we propose a Huber-based estimator, characterized by a threshold constant $\mu$, to identify the governing matrix of a linearly parameterized nonlinear system from a single trajectory of length $T$. This formulation bridges the gap between mean- and median-based estimation, achieving provably robust error in both extreme disturbance scenarios under mild assumptions. In particular, for persistent zero-mean noise with a positive probability density around zero, the proposed estimator achieves an $\mathcal{O}(1/\sqrt{T})$ error rate if the disturbance is symmetric or the basis functions are linear. For arbitrary nonzero-mean attacks that occur at each time with probability smaller than 0.5, the error is bounded by $\mathcal{O}(\mu)$. We validate our theoretical results with experiments illustrating that integrating our approach into frameworks like SINDy yields robust identification of discrete-time systems.
Read the full abstract
Mathematical Physics · Cross-listed from eess.SY
Structure-Preserving Learning of Nonholonomic Dynamics
Data-driven modeling is playing an increasing role in robotics and control, yet standard learning methods typically ignore the geometric structure of nonholonomic systems. As a consequence, the learned dynamics may violate the nonholonomic constraints and produce physically inconsistent motions. In this paper, we introduce a structure-preserving Gaussian process (GP) framework for learning nonholonomic dynamics. Our main ingredient is a nonholonomic matrix-valued kernel that incorporates the constraint distribution directly into the GP prior. This construction ensures that the learned vector field satisfies the nonholonomic constraints for all inputs. We show that the proposed kernel is positive semidefinite, characterize its associated reproducing kernel Hilbert space as a space of admissible vector fields, and prove that the resulting estimator admits a coordinate representation adapted to the constraint distribution. We also establish the consistency of the learned model. Numerical simulations on a vertical rolling disk illustrate the effectiveness of the proposed approach.
Read the full abstract
Optimization and Control · Cross-listed from cs.CV
A Robust Low-Rank Prior Model for Structured Cartoon-Texture Image Decomposition with Heavy-Tailed Noise
Cartoon-texture image decomposition is a fundamental yet challenging problem in image processing. A significant hurdle in achieving accurate decomposition is the pervasive presence of noise in the observed images, which severely impedes robust results. To address the challenging problem of cartoon-texture decomposition in the presence of heavy-tailed noise, we in this paper propose a robust low-rank prior model. Our approach departs from conventional models by adopting the Huber loss function as the data-fidelity term, rather than the traditional $\ell_2$-norm, while retaining the total variation norm and nuclear norm to characterize the cartoon and texture components, respectively. Given the inherent structure, we employ two implementable operator splitting algorithms, tailored to different degradation operators. Extensive numerical experiments, particularly on image restoration tasks under high-intensity heavy-tailed noise, efficiently demonstrate the superior performance of our model.
Read the full abstract
Statistics Theory
On the role of symmetry for staircase mechanisms in local differential privacy efficiency across different privacy regimes
We investigate the structural foundations of statistical efficiency under $\alpha$-local differential privacy, with a focus on maximizing Fisher information. Building on the role of continuous staircase mechanisms, we identify a fundamental symmetry regarding the extremal values $1$ and $e^{\alpha}$. We demonstrate that when the optimal measure satisfies this symmetry, the Fisher information admits a closed-form expression. More generally, we derive a decomposition of the Fisher information into symmetric and asymmetric components, scaling as $\alpha^{2}$ and $\alpha^{3}$, respectively, for $\alpha \to 0$. This reveals that, if in the high-privacy regime asymmetry is negligible, it is no longer the case as privacy constraints are relaxed. Motivated by this, we introduce a class of fully asymmetric privacy mechanisms constructed via pushforward mappings, proving that-unlike their symmetric counterparts-they recover the full Fisher information of the non-private model as $\alpha \to \infty$. We bridge the gap between theory and practice by providing a tractable implementation of these mechanisms, governed by a tuning parameter $c$. This parameter allows for a smooth interpolation between the symmetric regime and the fully asymmetric regime. Furthermore, we demonstrate the versatility of this framework by showing that it encompasses the binomial mechanism as a limiting case.
Read the full abstract
Mathematical Physics
Homothetic Hodge$-$de Rham Theory and a Geometric Regularization of Elliptic Boundary Value Problems
We introduce a homothetic extension of classical Weyl integrable geometry by generalizing the usual linear gauge transformations to affine homothetic transformations centered at a distinguished harmonic, scale-invariant form $\alpha_d$. After relinearizing these affine gauge transformations via a suitable shift of variables, we obtain a twisted exterior calculus that is structurally equivalent to the Witten deformation of the de Rham complex. On this basis, we develop a corresponding homothetic Hodge theory: we define a twisted adjoint and homothetic Laplacian, and prove a homothetic Hodge decomposition theorem on compact Riemannian manifolds. In the context of partial differential equations, we show that the scalar homothetic Laplacian provides a rigorous diffuse interface (volume penalization) representation of elliptic boundary value problems. Modeling the Weyl scale field as a fixed distribution localized near a hypersurface, the resulting lower order geometric terms form a penalty layer that enforces Dirichlet, Neumann, or Cauchy data within a single geometric equation. This formulation yields consistent weak solutions even in the presence of classically incompatible Cauchy data. As an application, we construct a nonsingular model for point sources in elliptic field equations, which preserves the correct Coulombian far field while removing the core singularity and yielding finite field energy.
Read the full abstract
Combinatorics
Lifting and Folding: A Framework for Unstable Graphs and TF-Cousins
A graph G is unstable if its canonical double cover CDC(G) has strictly more automorphisms than Aut(G) x Z_2; a related but distinct question is when two non-isomorphic graphs share the same CDC. We place both problems in one framework of lifting and guided folding, and show that each is governed by the same datum: the conjugacy classes of strongly switching involutions in Aut(CDC(G)). Folding the lift of a two-fold isomorphism along a guide always returns a graph TF-isomorphic to the original. If it is not isomorphic to it, the two form a TF-cousin pair; if two distinct guides both return an isomorphic copy, the graph is unstable. From a seed pair (C_k u C_k, C_2k) with k odd, the construction gives TF-cousin pairs and unstable graphs of every order from 6 on. We introduce the claw graphs CG(n) and prove that CG(n) and CG'(n) are TF-cousins if and only if n is odd; for n = 1 they are the Petersen graph and a cubic companion on 10 vertices, with the Desargues graph as their common CDC. We conjecture that in every TF-cousin pair one member contains two vertex-disjoint copies of C_k and the other contains C_2k for some odd k, and that every unstable asymmetric graph contains both C_k and C_2k for some odd k; the first is verified for all connected graphs on at most 9 vertices.
Read the full abstract
Optimization and Control
Control Forward-Backward Consistency: Quantifying the Accuracy of Koopman Control Family Models
This paper extends the forward-backward consistency index, originally introduced in Koopman modeling of systems without input, to the setting of control systems, providing a closed-form computable measure of accuracy for data-driven models associated with the Koopman Control Family (KCF). Building on a forward-backward regression perspective, we introduce the control forward-backward consistency matrix and demonstrate that it possesses several favorable properties. Our main result establishes that the relative root-mean-square error of KCF function predictors is strictly bounded by the square root of the control consistency index, defined as the maximum eigenvalue of the consistency matrix. This provides a sharp, closed-form computable error bound for finite-dimensional KCF models. We further specialize this bound to the widely used lifted linear and bilinear models. We also discuss how the control consistency index can be incorporated into optimization-based modeling and illustrate the methodology via simulations.
Read the full abstract
Logic
Modal Exchangeability: Centered Symmetry and the Credal Architecture of Kripke Frames
We ask what happens when the index set carries modal structure, with possibilities organized into a Kripke frame. We define modal exchangeability as invariance under accessibility-preserving automorphisms that fix a designated base world, and derive a representation theorem for countable frames. The orbit decomposition of the centered symmetry group governs the within-orbit structure: worlds in the same orbit are conditionally identically distributed, and on orbits satisfying a richness condition and countable infinitude they are conditionally i.i.d. given a rigid orbit-specific directing measure. Point-homogeneous S5 frames yield a single de Finetti parameter; S4 frames may admit multiple orbits, with the richer orbits carrying rigid directing measures and the remainder carrying only weaker invariant structure. Two applications follow. First, the orbit decomposition determines whether learning pools globally or remains orbit-local. Second, it supplies a mechanism for structural credal fine-graining indexed to orbit regions, distinct from hyperintensionality in the strict sense of distinguishing coextensive propositions.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Fast localization of anomalous patches in spatial data under dependence
We propose a scalable, provably accurate method for localizing an unknown number of multiple axis-aligned anomalous patches in spatial data under a general class of spatial dependence. Motivated by the practical need to detect localized changes rather than completely segment large spatial grids, we first introduce both a naive and a significantly faster intelligent-sampling-based estimator for a single patch. We then extend this methodology to the highly challenging multiple-patch setting and propose a two-stage Spatial Patch Localization of Anomalies under DEpendence procedure (SPLADE). Under mild conditions on signal strength, separation from the boundary, inter-patch separation, and a uniform Gaussian approximation, we establish simultaneous consistency for the estimated number of patches and for each individual patch boundary. Extensive numerical results based on synthetic data scenarios demonstrate that the proposed method exhibits significant computational and accuracy gains over competing approaches, as well as robustness to moderate and severe spatial dependence. Finally, we demonstrate the real-world utility of the proposed method by applying it to frame-to-frame video surveillance data, where it accurately detects small, closely separated subjects, a task where existing methods are significantly slower and highly prone to spurious detections due to not accounting for spatial dependence. A second application on 3D fibrous media is deferred to the Appendix.
Read the full abstract
Combinatorics
Root lattices over totally real fields
A root lattice is a finite rank $\mathbb{Z}$-lattice generated by elements $x$ satisfying $x\cdot x=2$. It is well-known that the root lattices have an $ADE$ classification and they play a prominent role in the study of even unimodular lattices. The notion of root lattices can be naturally generalized to lattices over the ring of integers $\mathcal{O}$ of a totally real field $K$. In the case where $K$ is a real quadratic field, such lattices were classified by Mimura in 1979, and this classification has been used by several researchers in the study of even unimodular $\mathcal{O}$-lattices. In this paper, we extend this classification to arbitrary totally real fields. The irreducible root lattices of rank greater than $2$ are indexed by finite Coxeter systems. All the rank $2$ root lattices are realized as orders in quadratic extensions of $K$ and their classification requires some technique from algebraic number theory.
Read the full abstract
Numerical Analysis
Quasiperiodic Elliptic Operators: Projection Method and Convergence Analysis
Quasiperiodic elliptic operators (QEOs) serve as fundamental models in both mathematics and physics, as exemplified by their role in the numerical modeling of one-dimensional photonic quasicrystals. However, distinct from periodic elliptic operators, approximating eigenpairs for QEOs poses significant challenges, particularly in capturing the full spectral structure (notably the continuous spectrum) and deriving convergence guarantees in the absence of compactness. In this paper, we develop a high-accuracy numerical method to compute eigenpairs of QEOs based on the projection method, which embeds quasiperiodic operators into a higher-dimensional periodic torus. To address the non-compactness issue, we construct a directional-derivative Hilbert space along irrational manifolds of a high-dimensional torus and characterize operators equivalent to QEOs within this space. By integrating spectral theory for non-compact operators into the Babuška-Osborn eigenproblem framework, we establish rigorous convergence analysis and prove that our method achieves spectral accuracy. Numerical experiments validate the accuracy and efficiency of the proposed method, including a one-dimensional photonic quasicrystal and two- and three-dimensional QEOs.
Read the full abstract
Statistics Theory · Cross-listed from stat.ME
Extension of coupling via the Projection of Optimal Transport
In many statistical settings, two types of data are available: coupled data, which preserve the joint structure among variables but are limited in size due to cost or privacy constraints, and marginal data, which are available at larger scales but lack joint structure. Since standard methods require coupled data, marginal information is often discarded. We propose a fully nonparametric procedure that integrates decoupled marginal data with a limited amount of coupled data to improve the downstream analysis. The approach can be understood as an extension of coupling via projection in optimal transport. Specifically, the estimator is a solution for the optimal transport projection over the space of probability measures, which genuinely provides a natural geometric interpretation. Not only is its stability established, but its sample complexity is also derived using recent advances in statistical optimal transport. In addition to this, we present its explicit formula based on “shadow," a notion introduced by Eckstein and Nutz. Furthermore, the estimator can be approximated in almost linear time and in parallel by entropic shadow, which demonstrates the theoretical and practical strengths of our methods. Lastly, we present experiments with real and synthetic data to justify the performance of our method.
Read the full abstract
Analysis of PDEs
A Class of Degenerate Hyperbolic Equations with Neumann Boundary Conditions and Its Application to Observability
We establish a mixed observability inequality for a class of degenerate hyperbolic equations on the cylindrical domain $\Omega = \mathbb{T} \times (0,1)$ with mixed Neumann Dirichlet boundary conditions. The degeneracy acts only in the radial variable, whereas the periodic angular variable allows propagation with a strong tangential component, making a direct top boundary observation delicate. For $\alpha \in [1,2)$, we prove that the solution can be controlled by a boundary observation on the top boundary together with an interior observation on a narrow strip. The proof combines a weighted functional framework, improved regularity, a cutoff decomposition in the angular variable, a multiplier argument for the localized component, and an energy estimate for the remainder.
Read the full abstract
Information Theory
Field-Assisted Molecular Communication: Girsanov-Based Channel Modeling and Dynamic Waveform Optimization
Analytical modeling of field-assisted molecular communication under dynamic electric fields is fundamentally challenging due to the coupling between stochastic transport and complex boundary geometries, which renders conventional partial differential equation (PDE) approaches intractable. In this work, we introduce an effective stochastic modeling approach to address this challenge. By leveraging trajectory-reweighting techniques, we derive analytically tractable channel impulse response (CIR) expressions for both fully-absorbing and passive spherical receivers, where the latter serves as an exact theoretical baseline to validate our modeling accuracy. Building upon these models, we establish a dynamic waveform design framework for system optimization. Under a maximum a posteriori decision-feedback equalizer (MAP-DFE) framework, we show that the first-slot received probability serves as the primary determinant of the bit error probability (BEP), while inter-symbol interference manifests as higher-order corrections. Exploiting the monotonic response of the fully-absorbing architecture and using the limitations of the passive model to justify this strategic focus, we reformulate BEP minimization into a distance-based optimization problem. We propose a unified, low-complexity Maximize Received Probability (MRP) algorithm, encompassing the Maximize Hitting Probability (MHP) and Maximize Sensing Probability (MSP) methods, to dynamically enhance desired signals and suppress inter-symbol interference. Numerical results validate the accuracy of the proposed modeling approach and demonstrate near-optimal detection performance.
Read the full abstract
Analysis of PDEs
Uniqueness of bounded solutions to the fuzzy Landau and multiespecies Landau equations
We prove uniqueness of weak solutions to the fuzzy Landau equation and the multiespecies Landau system under suitable integrability assumptions. The results are based on explicit stability estimates in the 2-Wasserstein distance for a broader class of nonlinear equations with singular coefficients. Interestingly, this class includes the 2D incompressible Euler equations, the Vlasov-Poisson system, and the Patlak-Keller-Segel model, thereby recovering known uniqueness results within a unified framework. Our approach builds on the stochastic coupling method introduced by Fournier and Guerin for the homogeneous Landau equation, which we recast in a more analytic form. In addition, we present an alternative argument based on the symmetrization technique of Guillen and Silvestre, yielding comparable stability estimates.
Read the full abstract
Mathematical Physics
Pseudo-magnetism in a strained discrete honeycomb lattice
Slowly varying nonuniform strains of non-magnetic wave propagating media with honeycomb symmetry induce an effective- or pseudo-magnetic field, a phenomenon observed first in graphene, and later in photonic crystals and other physical settings. Starting with a discrete nearest-neighbor tight-binding model of a non-uniformly strained honeycomb medium, we derive the continuum effective magnetic Dirac Hamiltonian governing the envelope dynamics of wave packets, which are spectrally localized near a Dirac point (conical band degeneracy) of the unperturbed honeycomb. For unidirectional deformations of bounded gradient, which preserve translation invariance along the ”armchair” direction, we prove the existence of time-harmonic states which are plane-wave like (pseudo-periodic) along the armchair direction and exponentially localized transverse to it. We also obtain the leading order multi-scale structure of such modes for small deformation gradients. Their transverse localization are determined by the eigenstates of a one dimensional effective Dirac Hamiltonian. Our rigorous results apply to deformations which induce an approximate perpendicular constant pseudo-magnetic field (Landau gauge), and yield states with nearly flat band (Landau level) spectrum and hence very high density of states. In contrast, the analogous deformation which preserves translations in the zigzag direction induces no such localization. Corroborating numerical simulations for the different deformation types are presented.
Read the full abstract
Analysis of PDEs
Co-moving volumes and Reynolds transport theorem in DiPerna-Lions theory
Co-moving volumes and Reynolds transport theorem along a fluid flow are fundamental ingredients for deriving balance laws in fluid mechanics, where the classical theory of flow maps of ODEs associated to smooth vector fields plays a central role. In connection with weak solutions of the Navier-Stokes equations, DiPerna-Lions (Invent. Math. 1989) generalized the classical notions of ODEs and flow maps to vector fields in Sobolev spaces. DiPerna-Lions theory also characterizes the evolution of the measure of the inverse image of each Borel measurable set under generalized flow maps in terms of the divergence of vector fields. On the other hand, the image of a measurable set under generalized flow maps, which corresponds to a co-moving volume in the classical theory, is not necessarily measurable, even though the flow map is measurable. In this paper, we show that if a Borel measurable set is trimmed by removing a null set depending on the pair of evolution time and initial time but not on the initial set, its image becomes Borel measurable, and its measure is consistent with the measure of the classical untrimmed case in the smooth approximation limit. Then, by defining co-moving volumes with such a trimming procedure, we prove a version of Reynolds transport theorem for generalized flow maps. While the usual DiPerna-Lions theory mainly treats transport through compositions with flow maps and push-forward measures, our proofs are organized with the direct treatment of forward images in mind. The approach makes the passage from classical material transport to generalized flows explicit. In particular, it clarifies the measurability of suitably trimmed forward images and their stability under smooth approximation.
Read the full abstract
Combinatorics
An extension of Katsuda-Urakawa's Faber-Krahn inequality
In this paper, motivated by our previous work \cite{HY}, we prove that the minimum of the first Dirichlet eigenvalues for the normalized combinatorial $p$-Laplacian on connected finite graphs with boundary consisting of $n$ edges is only achieved by the tadpole graph $T_{n,3}$. This result extends the Faber-Krahn inequality of Katsuda-Urakawa \cite{KU} to normalized combinatorial $p$-Laplacians. Our argument is much simpler than that of Katsuda-Urakawa.
Read the full abstract
Group Theory
Thick Difference Sets of Haar Null Compact Sets in Locally Compact Groups
Let \(G\) be a non-discrete, locally compact group with Haar measure \(m\). We prove that there exists a compact set \(K \subset G\) with \(m(K)=0\) such that \(KK^{-1}\) contains a neighborhood of the identity. Moreover, such a set may be constructed inside any prescribed neighborhood of the identity.
Read the full abstract
Numerical Analysis
A limiter-based approach to construct high-order fully-discrete entropy stable explicit DG schemes for hyperbolic conservation laws
This paper presents a class of novel high-order fully-discrete entropy stable (ES) discontinuous Galerkin (DG) schemes with explicit time discretization. The proposed methodology exploits a critical observation from [4] that the cell averages of classical DG solutions with forward Euler time stepping satisfy an “entropy-stable-like” property. Building on this result, fully-discrete entropy stability is rigorously enforced through a simple Zhang–Shu-type scaling limiter [65] applied as a post-processing step, without modifying the underlying spatial discretization. Furthermore, the proposed methodology can simultaneously enforce multiple discrete cell entropy inequalities, a capability unavailable in existing ES DG schemes. High-order accuracy in time is achieved by using strong-stability-preserving multistep methods. Theoretically, we prove that the proposed scheme indeed maintains high-order accuracy and establish a Lax–Wendroff-type theorem showing that the limit of the numerical solutions, if it exists, satisfies the desired entropy inequality. Extensive numerical tests for scalar equations and systems, including the nonconvex Buckley–Leverett problem and extreme examples of Euler equations, demonstrate optimal accuracy, enforcement of multiple entropy conditions, and strong robustness.
Read the full abstract
Number Theory
The congruence subgroup property for $S$-arithmetic subgroups of simple algebraic groups when $S$ has positive Dirichlet density
Let $G$ be an absolutely almost simple simply connected algebraic group defined over a number field $K$, and let $M/K$ be the minimal Galois extension over which $G$ becomes an inner form of a split group. Assume that $G$ satisfies the Margulis-Platonov conjecture over $K$. We prove that if $S$ is a set of valuations of $K$ that contains all archimedean ones but does not contain any nonarchimedean valuations $v$ for which $G$ is anisotropic over the completion $K_v$ such that its intersection $S \cap \mathrm{Spl}(M/K)$ with the set $\mathrm{Spl}(M/K)$ of nonarchimedean valuations of $K$ that split completely in $M$ has positive Dirichlet density, then the congruence kernel $C^S(G)$ is trivial. This result provides additional evidence for Serre's Congruence Subgroup Conjecture. The proof does not involve any case-by-case considerations and relies on previous results concerning the congruence kernel and recent results on almost strong approximation.
Read the full abstract
History and Overview of Mathematics
English translation of Frobenius' and Stickelberger's "On the theory of elliptic functions"
This is an English translation and digitisation of Frobenius' and Stickelberger's "On the theory of elliptic functions" first published in Journal fur die reine und angewandte Mathematik (Crelle's journal), 83, 175-179 (1877) with the title "Zur Theorie der elliptischen Functionen". The paper derives what is now known as the Frobenius and Stickelberger determinant formula for elliptic functions and generalises determinants derived by Hermite and Kiepert.
Read the full abstract
Statistics Theory
Optimal Demixing of Nonparametric Densities
Motivated by applications in statistics and machine learning, we consider a problem of unmixing convex combinations of nonparametric densities. Suppose we observe $n$ groups of samples, where the $i$th group consists of $N_i$ independent samples from a $d$-variate density $f_i(x)=\sum_{k=1}^K \pi_i(k)g_k(x)$. Here, each $g_k(x)$ is a nonparametric density, and each $\pi_i$ is a $K$-dimensional mixed membership vector. We aim to estimate $g_1(x), \ldots,g_K(x)$. This problem generalizes topic modeling from discrete to continuous variables and finds its applications in LLMs with word embeddings. In this paper, we propose an estimator for the above problem, which modifies the classical kernel density estimator by assigning group-specific weights that are computed by topic modeling on histogram vectors and de-biased by U-statistics. For any $\beta>0$, assuming that each $g_k(x)$ is in the Nikol'ski class with a smooth parameter $\beta$, we show that the sum of integrated squared errors of the constructed estimators has a convergence rate that depends on $n$, $K$, $d$, and the per-group sample size $N$. We also provide a matching lower bound, which suggests that our estimator is rate-optimal.
Read the full abstract
Algebraic Geometry
Towards a characterization of toric hyperkähler varieties among symplectic singularities II
This is a continuation of arXiv: 2408.03012. We answer affirmatively Question 5.10 posed in the previous article. More precisely, let $(X, \omega)$ be a conical symplectic variety of dimension $2n$ with $wt(\omega) = 2$, which has a projective symplectic resolution. Assume that $X$ admits an effective Hamiltonian action of an $n$-dimensional algebraic torus $T^n$, compatible with the conical $\mathbf{C}^*$-action. Then we prove that there is a $T^n$-equivariant algebraic isomorphism $(X, \omega) \cong (Y(A,0), \omega_{Y(A,0)})$ for a toric hyperkahler variety $Y(A, 0)$ with $A$ unimodular.
Read the full abstract
Saturday 28 March
Combinatorics
The SOS Rank of a $5 \times 4$ Biquadratic Form via Orthogonality
Biquadratic forms arise naturally in polynomial optimization, tensor analysis, and quantum information theory. A key problem is determining the minimal number of squares needed in a sum-of-squares (SOS) representation of such a form, known as its SOS rank. For fixed dimensions $(m,n)$, the maximum possible SOS rank over all biquadratic forms in $m$ and $n$ variables is denoted $\operatorname{BSR}(m,n)$. Recent advances have established lower bounds on $\operatorname{BSR}(m,n)$ via combinatorial constructions involving bipartite graphs and the orthogonality method. In particular, for the case $(m,n)=(5,4)$, it was shown that $\operatorname{BSR}(5,4)\ge 11$ using only nondegenerate 2-edges. In this paper, we extend this framework by incorporating a degenerate $2$-edge, which introduces a cross term where the two $y$-indices coincide. We construct an explicit $5\times 4$ biquadratic form and apply the orthogonality method to prove that its SOS rank is $12$, thereby improving the lower bound to $\operatorname{BSR}(5,4)\ge12$. This result demonstrates that degenerate $2$-edges yield additional algebraic flexibility beyond purely combinatorial bounds and extends the applicability of the orthogonality method to forms with cross terms involving identical $y$-indices.