Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 5 May

Rings and Algebras

Central series of cocommutative Hopf braces

By extending some classical results known for groups and skew braces, we define and investigate central series of cocommutative Hopf braces. Both left and right central series are defined using a $\star$-product that measures the difference between the two algebra operations, and naturally leads to introducing the notions of socle and of annihilator of a cocommutative Hopf brace. We characterize the central extensions relative to the subcategories of cocommutative Hopf algebras and of commutative and cocommutative Hopf algebras, respectively. Since the category of cocommutative Hopf braces is semi-abelian and it has enough projectives with respect to the class of cleft extensions, one can then establish suitable Hopf formulae for their homology. These are expressed in terms of the corresponding notions of relative commutators of cocommutative Hopf braces. In particular, the one relative to the subcategory of commutative and cocommutative Hopf algebras turns out to be the Huq commutator.
Read the full abstract

Functional Analysis

Generalized outer linearizations and extremal properties of rotational epi-symmetrizations

We develop a functional extension of an extremal principle by Schneider (Monatsh. Math., 1967) by introducing generalized outer linearizations of convex functions. Given a coercive convex function on $\mathbb{R}^n$, a generalized outer linearization is defined as a convex minorant represented by a general but function-dependent set of slopes, thereby extending classical outer representations of convex bodies by supporting halfspaces. This representation converts geometric outer approximations by supporting halfspaces into functional approximations by supporting affine functions, and replaces outer normal data by a dual sampling problem in the domain of the Legendre–Fenchel transform. On a standard class of coercive convex functions, we derive a general extremal principle, showing that the rotational epi-symmetrization maximizes best approximations under outer linearizations of any monotone, concave functional that is upper semicontinuous with respect to epi-convergence. A central feature of the analysis is that it is carried out in the natural class of coercive, but not necessarily super-coercive, convex functions. Working in this setting introduces intricate topological and variational difficulties, which are addressed using refined duality and epi-convergence arguments. As an application of our main results, we derive a functional version of Urysohn's inequality, as well as an analytic extension of a classical covering result of Firey and Groemer (J. London Math. Soc., 1964). Finally, we prove an extremal inequality related to the piecewise affine approximation of convex functions.
Read the full abstract

Differential Geometry

An Affine Invariant Minkowski Problem

In Euclidean space, the generalised Minkowski problem asks, for a given finite Radon measure $\mu$ on the unit sphere $\mathbb{S}^d$, to find a compact convex set $K$ with area measure $\mu$. For convex sets in the Minkowski space invariant under an affine deformation of a uniform lattice of $\mathrm{SO}_0(d,1)$, the analogous Minkowski problem was considered and solved by Barbot–Béguin–Zeghib (partially) and Bonsante–Fillastre. By a theorem of Mess–Barbot–Bonsante, that also solves the Minkowski problem in flat Lorentzian spacetimes with compact hyperbolic Cauchy surface. We consider convex domains of the oriented real affine space $\mathbb{R}^{d+1}$ which are invariant under a subgroup of affine transformations obtained by adding translation parts to a discrete subgroup of $\mathrm{SL} (\mathbb{R}^{d+1})$ dividing a convex cone. We prove that those convex domains satisfy a local Steiner Formula, allowing to introduce natural area measures and define an affine invariant Minkowski problem. We then solve that Minkowski problem through a variational method using the convexity of a covolume functional. We also give an interpretation of those results in some "affine spacetimes", which were introduced by the author in a preceding work.
Read the full abstract

Combinatorics

A note on cycles in cyclically $4$-edge-connected cubic planar graphs

Let $H$ be obtained from a cyclically $4$-edge-connected cubic planar graph $Y$ other than $K_4$ by deleting two adjacent vertices. We provide a short proof that if $H$ has circumference at least $k$ for some even integer $k \ge 4$, then $H$ contains a cycle of length between $k$ and $3k/2$. As a consequence, we show that the line graph $G$ of $Y$ contains a cycle of length $l$ avoiding any prescribed vertex of $G$, for every $l \in \{3\} \cup \{5, \dots, |V(G)| - 1\}$. The proofs integrate Euler's formula and the Three Edge Lemma, established by Thomas and Yu, and independently by Sanders, in a novel way. This work was partially motivated by conjectures of Bondy and Malkevitch.
Read the full abstract

Optimization and Control

The Distributionally Robust Cyclic Inventory Routing Problem

We study the cyclic inventory routing problem that involves joint decisions on vehicle routing and inventory replenishment on an infinite, cyclic horizon. It considers a single warehouse and a set of geographically dispersed retailers. We model retailer demand as random variables with uncertain distributions belonging to a moment-based ambiguity set. We develop a distributionally robust optimization formulation that minimizes the worst-case expected cost over the ambiguity set, while ensuring service reliability through a distributionally robust chance constraint. Our main results are that we prove that the worst-case expected inventory cost is attained under a multi-point distribution, which can be identified a posteriori via linear programming, and that the distributionally robust chance constraint can be reformulated into near-equivalent deterministic forms. This yields a deterministic reformulation of the original problem. To solve it, we design a nested branch-and-price framework, in which the first level partitions retailers into clusters, and the second level concerns routing and replenishment decisions within each cluster. Computational experiments on both synthetic instances and real-world data from SAIC Volkswagen Automobile Co., Ltd. demonstrate the effectiveness and efficiency of the proposed approach.
Read the full abstract

All authors Menglei Jia, Albert H. Schrotenboer, Ahmadreza Marandi, Feng Chen

Statistics Theory

Safe and Sharp Honest Inference for Nonparametric Estimation via Empirical Bernstein Calibration

Constructing honest confidence intervals often depends on reliable bias control and accurate calibration based on asymptotic normality, including standard-normal and folded-normal calibration. Substantial progress has been made in correcting or controlling smoothing bias, including robust bias correction and bias-aware inference. We first show that, even after smoothing bias has been well corrected or controlled, asymptotic-normality-based calibration may still be a binding source of finite-sample undercoverage. Thus, the resulting intervals may struggle to achieve the minimax shrinkage rate and uniformly small undercoverage error simultaneously. Instead of using distributional approximation, we calibrate the radius directly by combining an empirical Bernstein bound, a data-driven variance proxy, Lepski-type bandwidth selection, and a bias-aware fixed-length-radius criterion. The formal theory covers nonparametric regression and density estimation, with regression results ranging from local-polynomial to sieve estimators. The resulting empirical Bernstein confidence intervals are safe and sharp. Uniformly over functions with $S$-th order local smoothness, both one-sided and two-sided intervals attain nominal coverage up to $o(n^{-2S/(2S+1)})$, or exponential remainders under bounded or sub-Gaussian conditions, while their widths shrink at the minimax rate $n^{-S/(2S+1)}$ (or up to a $\sqrt{\log n}$-level factor). The calibration principle is modular and can also be combined with other existing bias-control strategies, like robust bias correction. Thus, the contribution of this paper is not a bias-control device but a new angle of calibration. Compared with asymptotic-normality-based calibration, empirical Bernstein calibration safely and conveniently converts the specified smoothness into both coverage accuracy and interval-length efficiency. Simulations support the theory.
Read the full abstract

Optimization and Control · Cross-listed from quant-ph

Computation of entanglement for quantum states by a Consensus-Based Optimization method

The computation of quantum entanglement can be formulated as a high-dimensional nonconvex optimization problem with orthogonality constraints. In this work, we propose structure-preserving consensus-based optimization (CBO) methods for entanglement computation, with one approach based on a Hermitian formulation and the other evolving directly on the unitary manifold. To handle the variable dimension of the feasible set, we introduce a cross-dimensional interaction mechanism allowing exchange of information between particles of different sizes. Numerical experiments demonstrate that the proposed methods achieve accurate approximations.
Read the full abstract

Optimization and Control

On the Induced Norms of Matrices and Grothendieck problems

We study the induced matrix norm $\|\bA\|_{q \to r}$, whose exact value has been known only in a few classical cases. Determining this norm has long been regarded as difficult due to the highly non-convex nature of its variational definition. Existing works offer numerical estimates or analytic bounds but no exact formula. In this paper we present a purely analytic framework that determines $\|\bA\|_{q \to r}$ exactly for all $q, r \ge 1$ for several classes of important matrices. For these matrices, using a direct connection between the induced norms and Grothendieck problems, our results also simultaneously provide exact values for the later.
Read the full abstract

Optimization and Control

Learning Dominant States in Elementary Resource Constrained Shortest Path Problems

In this work, we investigate whether machine learning can be leveraged to identify promising states in dynamic programming algorithms, focusing on Elementary Resource Constrained Shortest Path Problems (ERCSPP). More in detail, we solved 41 single resource instances from SPPRCLIB using iterative relaxation techniques through the PathWyse library, systematically collecting all generated states (i.e. labels). We designed ad-hoc features computable in constant time and constructed two datasets: one containing all generated labels (G) and another with only those inserted into data pools (I), totaling several hundred million labels. Machine learning tools are then employed to explore these datasets, revealing significant patterns between successive relaxations. Leveraging these insights, we propose a normalization approach and apply supervised learning techniques to distinguish dominating states, both within subsequent relaxations of the same problem and in previously unseen instances. Our results demonstrate the effectiveness of this approach on Dataset G, while for Dataset I, performance varies, showing strong results within the same instance but declining for unseen ones. Overall, these findings open new perspectives for the development of data-driven dynamic programming algorithms.
Read the full abstract

Statistics Theory

Improved estimation of positive powers of scale parameters of exponential distributions under a prior information

Estimating unknown parameters subject to prior constraints is important in statistical inference, particularly in fields such as reliability analysis, survival studies, and engineering, where prior structural information about the parameters is often available. Incorporating such prior information makes the analysis more realistic and usually yields better estimates than methods that ignore such information. In this article, we consider the problem of estimating the positive power of the scale parameter of a two-shifted exponential population under a prior ordering constraint on scale parameters. We derive sufficient conditions under which equivariant estimators are shown to dominate others under scale-invariant strictly convex loss functions. In addition, we derived various estimators that dominate the best affine equivariant estimators (BAEE). Moreover, we derive a smooth estimator which dominates the BAEE using an integrated approach, and we further show that it is a generalized Bayes estimator under a non-informative prior. We also provide an improved estimator based on the Pitman closeness criterion. An extensive simulation study has been done for computational purposes. Finally, we provided real examples to implement the results.
Read the full abstract

Optimization and Control

Exact and Evolutionary Algorithms for Sequential Multi-Objective Transmission Topology Planning

We study day-ahead transmission topology control for high-voltage grid operation under $N-1$ security constraints. The operational task is to select, over a 24-hour horizon, a sequence of substation topologies obtained via busbar-coupler switching to relieve line overloads while limiting switching effort and topological complexity. We formulate this task as a sequential multi-objective optimization problem with four objectives used in TSO decision making: worst-case $N-1$ line loading, maximum topological depth, number of topology changes, and time spent outside the reference topology. We propose an exact block algorithm that exploits the temporal structure of topology plans: consecutive hours with the same topology are represented as blocks, enabling enumeration of the complete Pareto front over the admissible set of topologies under fixed operational bounds on depth and switching. We also develop a tailored NSGA-III-based evolutionary heuristic and evaluate it against the exact front. Using real operational data from the Dutch high-voltage transmission grid operated by TenneT, the block algorithm computes the exact front for a highly congested day in under three minutes after topology-level load-flow preprocessing. The exact front reveals low-switching plans with no DC $N-1$ thermal overloads that the tested evolutionary search fails to find. The proposed method, therefore, provides both a practical day-ahead decision-support tool for transmission operators and a benchmark for heuristic and learning-based topology-control methods.
Read the full abstract

All authors Job Groeneveld, Miguel Muñoz, Jan Viebahn, Alessandro Zocca

Statistics Theory · Cross-listed from cs.LG

Vanishing L2 regularization for the softmax Multi Armed Bandit

Multi Armed Bandit (MAB) algorithms are a cornerstone of reinforcement learning and have been studied both theoretically and numerically. One of the most commonly used implementation uses a softmax mapping to prescribe the optimal policy and served as the foundation for downstream algorithms, including REINFORCE. Distinct from vanilla approaches, we consider here the L2 regularized softmax policy gradient where a quadratic term is subtracted from the mean reward. Previous studies exploiting convexity failed to identify a suitable theoretical framework to analyze its convergence when the regularization parameter vanishes. We prove here theoretical convergence results and confirm empirically that this regime makes the L2 regularization numerically advantageous on standard benchmarks.
Read the full abstract

Numerical Analysis

A high-order rectilinear Lagrangian method based on the geometric conservation law

This paper presents a mesh moving strategy for high-order Lagrangian method on quadrilateral meshes. The primary evidence of this method stems from principle of area conservative linearization and the asymptotic properties of the velocity. The former strictly adheres to the requirements of geometric conservation laws, while the latter provides a high-order accuracy guarantee. Two smooth vortex test cases verify the feasibility of the proposed scheme.
Read the full abstract

Group Theory

Solvability of the radical in pseudo-finite groups with the DCC on centralizers up to finite index

The subgroup generated by all solvable normal subgroups in a pseudo-finite group with the descending chain condition on centralizers up to finite index is solvable. Additionally, there is no finitely generated pseudo-finite group whose definable sections satisfy such a chain condition on centralizers.
Read the full abstract

Analysis of PDEs

Stochastic Tamed Navier–Stokes Equations with Wiener and Jump Noise on $\mathbb R^3$. I. Maximal Local $L^p$-Well-Posedness

We establish maximal local $L^p$-well-posedness, for $p>3$, for the stochastic tamed Navier–Stokes equations on $\mathbb R^3$ driven simultaneously by multiplicative cylindrical Wiener noise and a compensated Poisson random measure. For divergence-free initial data $ u_0\in L^p\bigl(\Omega,\mathcal F_0; L^p(\mathbb R^3;\mathbb R^3)\bigr), $ we prove existence and pathwise uniqueness of a local strong solution with $L^p$-valued càdlàg trajectories and the local $L^p$-energy regularity. For solutions driven by the same noises, we establish localized Lipschitz dependence on the initial datum in the path supremum and space–time norms. The discontinuous forcing makes the whole-space Gaussian construction non formal as stopping levels may be overshot by jumps, while convergence of the compensated-Poisson term requires simultaneous control of its quadratic and $p$th integrability modes. We resolve these difficulties by a jump-compatible localization based on strict pre-exit bounds and predictable left limits. We further establish bounded-time restart and stochastic pasting on the prescribed stochastic basis. The resulting family of attainable lifetimes is upward directed and yields a unique maximal local strong solution, which inherits the localized dependence estimate. Continuation criteria, blow-up alternatives, and global well-posedness under stronger finite-energy hypotheses are treated in the companion Part~II.
Read the full abstract

2605.03734 · 5 May · Substantially revised and reorganized. The original manuscript has been split into two papers. This version develops the maximal local $L^p$-strong well-posedness theory for stochastic tamed Navier–Stokes equations on $\mathbb{R}^3$ with Wiener and jump noise. The global results in v1–v2 have been removed and will appear separately with additional results

Analysis of PDEs

Sharp Stability for the Affine Fractional Sobolev Inequality

In this paper, we prove a sharp quantitative stability result for the affine fractional \(L^2\)-Sobolev inequality in \(\dot H^s(\mathbb R^n)\), \(0<s<1\), introduced by Haddad–Ludwig (Math. Ann. 388 (2024), 1091–1115). In particular, we identify the kernel of the affine Hessian, determine the sharp local spectral gap, and show that the optimal global stability constant is strictly smaller than the corresponding local spectral value.
Read the full abstract

Optimization and Control

Global exponential stabilization of a force- and torque-actuated unicycle by flexible-step MPC

We study the problem of global exponential stabilization of a force- and torque-controlled unicycle model in discrete time. To this end, we extend a recently introduced approach to model predictive control (MPC) in which a flexible number of inputs is implemented in every iteration. We present the first flexible-step MPC protocol with state-dependent weights for average descent. Notably, the proposed method relies neither on a suitable design of running or terminal cost functions nor on a suitable choice of terminal constraints. Instead, stability is guaranteed through a generalized discrete-time control Lyapunov function. We establish a new theoretical framework for global exponential stabilization of general nonlinear discrete-time control systems by flexible-step MPC. The obtained results go beyond the unicycle example. However, given the importance of the unicycle dynamics, we make that a focal point of our work. For the particular case of the dynamic (second-order) unicycle model, we show that global exponential stability cannot be attained in the classical sense, but in a slightly weaker sense. The proposed flexible-step MPC method is shown to induce the best possible notion of global exponential stability for this model. We provide explicit rules for the choice of parameters, which guarantee feasibility and global exponential stability. Our numerical simulations show that the discrete MPC method also works very well in applications to a continuous-time torque-actuated unicycle.
Read the full abstract

All authors Ala Kolsi, Christian Ebenbauer, Bahman Gharesifard, Raik Suttner

Probability

Potential Hessian Ascent III: Sampling the Sherrington–Kirkpatrick Model at Beta < 1/2

We give a polynomial-time algorithm to sample from the Gibbs measure of the Sherrington-Kirkpatrick model with negligible total-variation distance (TVD) error up to inverse temperature $\beta < 1/2$. Prior work obtained TVD error guarantees only up to $\beta\approx 0.295$, while results covering the entire replica-symmetric regime $\beta < 1$ gave guarantees only in Wasserstein distance. Our approach demonstrates that the same potential Hessian ascent previously developed for optimization also functions as a sampling algorithm by implementing algorithmic stochastic localization at high temperature. By estimating the covariance of the tilted Gibbs distribution via Gaussian integration by parts, overlap concentration, and precise cavity estimates, we show that a Hessian-ascent process achieves an $O(1)$ Wasserstein error guarantee for finite-time localization, improving on the previous $o(n)$. A careful comparison of stochastic localization with the Hessian ascent process and a free probability argument controlling the diagonal sub-algebra of the Hessian improves this to $O(1)$ in KL divergence. We then use Jarzynski's equality with rejection sampling, along with entropy contraction on the time-$T$ localized distribution, to refine the error to $o(1)$ in TVD up to a constant time $T$ and to complete the sampling with the polarized walk.
Read the full abstract

All authors Ewan Davies, Holden Lee, Juspreet Singh Sandhu, Jonathan Shi

Analysis of PDEs

A Two-Phase Free Boundary Problem for Axisymmetric Subsonic Euler Flows with Contact Discontinuities

We study a free boundary problem for the three-dimensional steady compressible Euler equations in an infinitely long circular cylinder. The free boundary is a contact discontinuity separating an axisymmetric rotational subsonic flow and an axisymmetric potential subsonic flow, neither of which is prescribed a priori. The pressure continuity condition couples two unknown Euler phases through an unknown interface, leading to a genuinely two-phase free boundary problem. Using a Helmholtz decomposition, we reformulate the pressure continuity condition as nonlinear boundary conditions for the Helmholtz variables and develop a coupled iteration framework that simultaneously determines the free boundary and the two flow fields. Uniform estimates independent of the truncation length allow us to pass to the infinite-length limit and construct global solutions. We further establish the downstream asymptotic behavior of solutions, showing that the contact discontinuity becomes asymptotically cylindrical and that the radial velocity vanishes at infinity. To the best of our knowledge, this provides the first existence result and asymptotic characterization for a genuinely two-phase free boundary problem involving a contact discontinuity between an unknown rotational subsonic flow and an unknown potential subsonic flow in a three-dimensional infinitely long cylinder.
Read the full abstract

Optimization and Control

One-Dimensional Nonnegative Spline Smoothing via Convex Semi-Infinite Programming with a Cutting-Plane Method

Spline functions are smooth piecewise polynomials widely used for interpolation and smoothing, and nonnegative spline smoothing is also studied for nonnegative data. Previous research used sufficient conditions for the nonnegativity of spline functions because necessary and sufficient conditions for the nonnegativity are infinitely many linear inequalities, which are difficult to handle in optimization algorithms. This conventional method quickly computes a nonnegative spline function via quadratic programming (QP), but the optimal solution may be slightly degraded by using the sufficient condition. In this paper, we express 1D nonnegative spline smoothing as a convex semi-infinite programming (CSIP) problem that directly deals with infinite inequality constraints. As optimization algorithms for general SIP problems, local-reduction-based sequential quadratic programming (LRSQP) methods are used, but their convergence performance deteriorates for certain problems due to multiple approximations during updates. To quickly solve the CSIP problem, we propose a cutting-plane (CP) method. In the proposed method, after giving an initial solution by the standard spline smoothing, we find the minimizer of each polynomial piece by using the closed-form solution for a low-degree polynomial or a numerical solution for a high-degree polynomial. If the minimum value is negative, then such minimizer is added into the constraint of the problem to guarantee the nonnegativity. This constrained problem is quickly solved via QP, and we find the minimizer of each polynomial piece again. We repeat these procedures until there are no negative minimum values. The proposed method guarantees convergence to the original CSIP solution, and its effectiveness is demonstrated in numerical experiments by comparison to the conventional methods, QP under the sufficient condition and CSIP using the MATLAB LRSQP algorithm.
Read the full abstract

Functional Analysis

Kadison duality for partially convex sets

This paper extends the Kadison duality between compact convex sets and function systems to the setting of partial convexity. A partially convex set is a set that is convex in a designated set of convex variables when the others are held fixed. We introduce the notion of a regular partially convex set and identify its dual as a finitely generated free module over a commutative C*-algebra endowed with a compatible Archimedean order unit structure. We call such spaces free order unit modules. We prove that for any compact regular partially convex set K, the space of continuous functions on K that are affine in the convex variables is the canonical example of such a module. Conversely, we show that the partially convex state space of a free order unit module is a compact regular partially convex set. Our main result establishes a duality between compact regular partially convex sets and free order unit modules. We also establish a Stone-Weierstrass-type theorem, demonstrating that partially affine polynomials are dense in the space of continuous partially affine functions on any compact regular partially convex set. Finally, we prove a Hahn-Banach-type separation theorem of compact partially convex sets from their outer points.
Read the full abstract

Quantum Algebra

Modular functors and CFT correlators via double categories

We point out that double categories provide a natural setting for modular functors obtained by a (bicategorical) string-net construction: The source of the modular functor – which is now a double functor – is a symmetric monoidal double category of bordisms, with bordisms as horizontal morphisms and smooth embeddings of manifolds as vertical morphisms. The target of the modular functor is a double category with profunctors and functors as horizontal and vertical morphisms. The correlators and field functors for a conformal field theory based on a pivotal monoidal category $\mathcal C$ can then be understood in the unified setting of a vertical transformation between the modular functors for two pointed pivotal bicategories, the delooping of $\mathcal C$ and the bicategory of $\Delta$-separable symmetric Frobenius algebras in $\mathcal C$. Using skein theoretic methods, we show that this vertical transformation is an equivalence, which implies that field functors are equivalences of categories and that universal correlators are isomorphisms of vector spaces.
Read the full abstract

Analysis of PDEs

Singular semilinear elliptic equations in nondivergence form

We study the singular semilinear equation $-Pu = \frac{f}{u^\gamma}$ on a bounded domain $\Omega$ with Dirichlet condition $u \equiv 0$ on $\partial \Omega$ , where $P$ is a second-order elliptic differential operator in nondivergence form. We obtain the existence of a solution under the assumptions that $\Omega \in C^{1,1}$ and $P$ has $C^1$ coefficients, as well as the uniqueness of solutions in $L^1(\Omega)$, under the assumptions that $\Omega \in C^2$ and $P$ has $C^2$ coefficients. Our proofs are based on a novel combination of tools, such as recently obtained nonlinear variants of Gagliardo–Nirenberg inequalities, estimates of Green functions, and new variants of Kato-type inequalities.
Read the full abstract

Probability

Scaling Limits of Bivariate Nearly-Unstable Hawkes Processes and Applications to Rough Volatility

We study a pair of nearly-unstable Hawkes processes coupled through a one-directional, or triangular, cross-excitation: the first component evolves autonomously and excites the second, but not conversely. Each component is self-exciting through a heavy-tailed memory kernel, and the two kernels are allowed to have different tail indices, so that the limiting components exhibit genuinely different degrees of roughness. As the system approaches criticality, we prove that the suitably rescaled intensity vector converges weakly to the unique solution of a coupled system of stochastic Volterra equations of rough-volatility type. The first limiting component is autonomous, while the second is driven both by its own noise and by an inherited noise transmitted from the first component through an effective cross-kernel. This cross-kernel is the convolution of the two limiting Mittag-Leffler kernels and therefore combines the two memory structures. As a consequence, we obtain a short-time cross-decorrelation law: although the two components are coupled, their functional correlation vanishes at small time scales at an explicit polynomial rate. This time-dependent correlation distinguishes the limit from independent rough processes and from classical bivariate rough models with constant Brownian correlation.
Read the full abstract

Statistics Theory

LAN property for the parameter of the jump rate in mean field interacting systems of neurons

In the context of a large system of $N$ neurons interacting through spike events in a mean-field regime as $N\to \infty$, we characterize the estimation of a multidimensional parameter in the spiking rate, when the neural states are observed over a fixed time horizon. We first prove the local asymptotic normality (LAN) property and leverage classical theory to establish the asymptotic efficiency of the maximum likelihood estimator. While the theory of Ibragimov and Hasminskii yields strong results, up to global asymptotic minimax bound, its applicability appears currently limited to models without state resets at spike times. Following then Höpfner's classical approach, we nevertheless derive, in a general setting including neuron reset, the consistency, asymptotic normality and local asymptotic minimax optimality of the estimator. Keywords: Local Asymptotic Normality (LAN); Mean-field regime; Interacting particle system; Multidimensional parameter estimation; Jump rate estimation; Maximum likelihood estimator (MLE); Asymptotic minimax optimality
Read the full abstract

Numerical Analysis

Error Analysis of Time-Dependent Test Functions in the Semi-Lagrangian Discontinuous Finite Element Scheme Based on the Characteristic Galerkin Method

This paper studies the time-dependent test-function error in the characteristic Galerkin-type semi-Lagrangian discontinuous finite element (CSLDG) method caused by numerical integration errors of the characteristic ODE solver, and its effect on convergence. Unlike classical finite element methods and standard DG methods, the test functions in CSLDG are constructed by characteristic backtracking. As a result, ODE errors affect not only the upstream integration region but also enter directly into the discrete weak formulation through perturbations of the test function support. Neglecting mesh geometric errors, we introduce an ideal auxiliary solution and an auxiliary solution retaining the test-function error, and derive the corresponding error equation and recursive relations. First, based on a global time-dependent test-function error analysis, we show that the optimal $L^2$ convergence order of the $P^K$-CSLDG method is preserved provided that the ODE solver order satisfies $D\ge 2K+3+d$. We then propose a new analysis based on the propagation of local modal coefficient errors, which controls the error cell by cell through the actual modal update formulas and recovers the global $L^2$ estimate. This leads to an improved sufficient condition $D\ge K+1+\frac{d}{2}$. The results show that the required ODE accuracy depends strongly on the analytical route, and that the modal-coefficient-based analysis is both closer to the actual implementation and more consistent with numerical observations.
Read the full abstract

Statistics Theory

Local estimation of transition rates of jump processes through discretization

We investigate the Poisson regression method for Markov and semi-Markov jump processes from a nonparametric angle, allowing the lengths of the time and duration intervals in the partition to vary with the number of observations. Imposing no structural assumptions on the true intensities, we obtain asymptotic normality of the occurence/exposure rates under appropriate shrinking conditions on the partition lengths. We derive asymptotic normality results for both Markov and semi-Markov models using only classical central limit theorems and elementary results for counting processes. All results are illustrated on both simulated and real data.
Read the full abstract

Functional Analysis

Cyclicity via weak$^\ast$ sequential cyclicity in Radially weighted Besov spaces

A radially weighted Besov space $H$ is a space of holomorphic functions on the unit ball $\mathbb{B}_d \subseteq \mathbb{C}^d$ whose $N$-th radial derivative is square integrable with respect to a given admissible radial measure. We write $Mult(H)$ for its multiplier algebra. The cyclic vectors in $H$ are those functions $f$ whose multiplier multiples are dense in $H$. We call a multiplier has the complete Pick property. However, in more general radially weighted Besov spaces there may be multipliers that are cyclic, but not weak$^\ast$ sequentially cyclic. For bounded holomorphic functions $f$ with no zeros in $\mathbb{B}_d$, we obtain a condition on $\log f$ that implies the cyclicity of $f$ in $H$ and yields invertibility properties for $1/f$ within an associated Smirnov-type class. This condition is formulated in terms of weak$^\ast$ sequentially cyclic multipliers and can often be verified using a comparison principle: if $f, g \in Mult(H)$ satisfy $|f| \leq |g|$ and if $f$ is weak$^\ast$ sequentially cyclic, then $g$ is also weak$^\ast$ sequentially cyclic. These results provide new insights into cyclicity phenomena in radially weighted Besov spaces in settings, where $H$ fails to be a complete Pick space.
Read the full abstract

Combinatorics

Small Matrices with Small Inverses: Unimodular Zerofree Cases

We consider unimodular matrices $M$ such that neither $M$ nor $M^{-1}$ contain zero entries. Matrices typically exhibit a trade-off: small $M$ imply large $M^{-1}$. We investigate rare cases where both remain small, classify these matrices up to symmetry, and discuss aspects of this balanced setting.
Read the full abstract

Rings and Algebras

On Regular Quantum Commutative Algebras

Let $K$ be an algebraically closed field of characteristic different from $2$. We provide a positive solution to the Bahturin–Regev conjecture in the general finite-dimensional (non-graded) setting, assuming that $\operatorname{char}(K)$ does not divide the quantum length of a minimal regular quantum commutative decomposition. Furthermore, we obtain a criterion, formulated in terms of regular quantum commutative decompositions, under which a set-grading on a semisimple associative algebra is realized as a group grading.
Read the full abstract