Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 26 March

Category Theory · Cross-listed from cs.LO

Stone Duality for Monads

We introduce a contravariant idempotent adjunction between (i) the category of ranked monads on $\mathsf{Set}$; and (ii) the category of internal categories and internal retrofunctors in the category of locales. The left adjoint takes a monad $T$-viewed as a notion of computation, following Moggi-to its localic behaviour category $\mathsf{LB}T$. This behaviour category is understood as "the universal transition system" for interacting with $T$: its "objects" are states and the "morphisms" are transitions. On the other hand, the right adjoint takes a localic category $\mathsf{LC}$-similarly understood as a transition system-to the monad $\Gamma\mathsf{LC}$ where $(\Gamma\mathsf{LC})A$ is the set of $A$-indexed families of local sections to the source map which jointly partition the locale of objects. The fixed points of this adjunction consist of (i) hyperaffine-unary monads, i.e., those monads where term $t$ admits a read-only operation $\bar{t}$ predicting the output of $t$; and (ii) ample localic categories, i.e., whose source maps are local homeomorphisms and whose locale of objects are strongly zero-dimensional. The hyperaffine-unary monads arise in earlier works by Johnstone and Garner as a syntactic characterization of those monads with Cartesian closed Eilenberg-Moore categories. This equivalence is the Stone duality for monads; so-called because it further restricts to the classical Stone duality by viewing a Boolean algebra $B$ as a monad of $B$-partitions and the corresponding Stone space as a localic category with only identity morphisms.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Provably Efficient Long-Time Exponential Decompositions of Non-Markovian Gaussian Baths

Gaussian baths are widely used to model non-Markovian environments, yet the cost of accurate simulation at long times remains poorly understood, especially when spectral densities exhibit nonanalytic behavior as in a range of realistic models. We rigorously bound the complexity of representing bath correlation functions on a time interval $[0,T]$ by sums of complex exponentials, as employed in recent variants of pseudomode and hierarchical equations of motion methods. These bounds make explicit the dependence on the maximal simulation time $T$, inverse temperature $\beta$, and the type and strength of singularities in an effective spectral density. For a broad class of spectral densities, the required number of exponentials is bounded independently of $T$, achieving time-uniform complexity. The $T$-dependence emerges only as polylogarithmic factors for spectral densities with strong singularities, such as step discontinuities and inverse power-law divergences. The temperature dependence is mild for bosonic environments and disappears entirely for fermionic environments. Thus, the true bottleneck for long-time simulation is not the simulation duration itself, but rather the presence of sharp nonanalytic features in the bath spectrum. Our results are instructive both for long-time simulation of non-Markovian open quantum systems, as well as for Markovian embeddings of classical generalized Langevin equations with memory kernels.
Read the full abstract

All authors Zhen Huang, Zhiyan Ding, Ke Wang, Jason Kaye, Xiantao Li, Lin Lin

Mathematical Physics · Cross-listed from hep-th

A Graphical Coaction for FRW Wavefunction Coefficients

We show that the wavefunction of the universe in theories of conformally coupled scalars in power-law Friedmann-Robertson-Walker (FRW) cosmologies satisfies a graphical coaction, by means of which we can understand its complete analytic structure in terms of the acyclic minors of Feynman graphs. Our construction extends to all particle multiplicities and any loop order, and if we isolate certain weight-one contributions, it reproduces the “kinematic flow” that encodes the differential equation of the wavefunction coefficients. Similarly, any discontinuity of the wavefunction coefficient is easily extracted from the coaction.
Read the full abstract

Algebraic Topology

Spectral Homotopy and the Spectral Fundamental Group

In this paper, we introduce an algebraic-topological invariant for commutative pm-rings, termed the spectral fundamental group, which is denoted by $\pi_{k}^{alg}(A)$. This group is defined via homotopy classes of loops within the space of induced spectral maps, which are generated by the $k$-algebra endomorphism monoid of the ring. We establish foundational properties of this invariant, proving that $\pi_{k}^{alg}(A)$ is an abelian group that naturally respects direct products and admits natural morphisms with respect to fully invariant subrings. Further, we establish an explicit isomorphism between the spectral fundamental group of certain continuous function rings and the classical fundamental group of their associated topological mapping spaces. Finally, utilizing a generalized dual number construction, we present an explicit example of a pm-ring that cannot be embedded into any function ring over a field of characteristic zero, yet possesses a nontrivial spectral fundamental group. This demonstrates that $\pi_{k}^{alg}(A)$ captures homotopical dynamics that are intrinsically algebraic.
Read the full abstract

Numerical Analysis

Fast and Accurate CP-HIFI Tensor Decompositions: Exploiting Kronecker Structure

Tensor decompositions are a fundamental tool in scientific computing and data analysis. In many applications – such as simulation data on irregular grids, surrogate modeling for parameterized PDEs, or spectroscopic measurements – the data has both discrete and continuous structure, and may only be observed at scattered sample points. The CP-HIFI (hybrid infinite-finite) decomposition generalizes the Canonical Polyadic (CP) tensor decomposition to settings where some factors are finite-dimensional vectors and others are functions drawn from infinite-dimensional spaces. The decomposition can be applied to a fully observed tensor (aligned) or, when only scattered observations are available, to a sparsely sampled tensor (unaligned). Current methods compute CP-HIFI factors by solving a sequence of dense linear systems arising from regularized least-squares problems to fit reproducing Kernel Hilbert space (RKHS) representations to the data, but these direct solves become computationally prohibitive as problem size grows. We propose new algorithms that achieve the same accuracy while being orders of magnitude faster. For aligned tensors, we exploit the Kronecker structure of the system to efficiently compute its eigendecomposition without ever forming the full system, reducing the solve to independent scalar equations. For unaligned tensors, we introduce a preconditioned conjugate gradient method, exploiting the problem's structure for fast matrix-vector products and efficient preconditioning. In our experiments, the proposed methods speed up the solution up to 500x compared to the prior naive direct methods, in line with the reduction in the theoretical computational complexity.
Read the full abstract

Algebraic Topology · Cross-listed from cs.LO

On the Formalization of Network Topology Matrices in HOL

Network topology matrices are algebraic representations of graphs that are widely used in modeling and analysis of various applications including electrical circuits, communication networks and transportation systems. In this paper, we propose to use Higher-Order-Logic (HOL) based interactive theorem proving to formalize network topology matrices. In particular, we formalize adjacency, degree, Laplacian and incidence matrices in the Isabelle/HOL proof assistant. Our formalization is based on modelling systems as networks using the notion of directed graphs (unweighted and weighted), where nodes act as components of the system and weighted edges capture the interconnection between them. Then, we formally verify various classical properties of these matrices, such as indexing and degree. We also prove the relationships between these matrices in order to provide a comprehensive formal reasoning support for analyzing systems modeled using network topology matrices. To illustrate the effectiveness of the proposed approach, we formally analyze the Kron reduction of the Laplacian matrix and verify the total power dissipation in a generic resistive electrical network, both commonly used in power flow analysis.
Read the full abstract

All authors Kubra Aksoy, Adnan Rashid, Osman Hasan, Sofiene Tahar

Rings and Algebras

On $(n,d)$-Coherence and Its Applications to Algebraic $\mathsf{K}$-Theory

We introduce a unified approach to finiteness conditions in homological algebra and algebraic $\mathsf{K}$-theory by studying the class of $(n,d)$-coherent rings, defined for $n\in\mathbb{N}^*$ and $d\in\mathbb{N}^*\cup \{\infty\}$. This framework simultaneously controls higher finiteness conditions and bounds on the projective dimensions of modules. In the context of algebraic $\mathsf{K}$-theory, we prove that, for a left $(n,d)$-coherent ring, the inclusion $\mathsf{proj}(R)\hookrightarrow\mathsf{FP}_n^{\leq d}(R)$ induces isomorphisms on all nonnegative $\mathsf{K}$-groups. We then introduce the corresponding relative notions of $\mathsf{FP}_n^{\leq d}$-injective, $\mathsf{FP}_n^{\leq d}$-projective, $\mathsf{FP}_n^{\leq d}$-flat, and $\mathsf{FP}_n^{\leq d}$-cotorsion modules, and obtain characterizations of $(n,d)$-coherent rings in terms of these classes. When $d\geq\gD(R)$ or $d=\infty$, our notions recover several previously studied classes and results.
Read the full abstract

Combinatorics

Modular Ackermann maps and hierarchical structures

We introduce and study modular truncations of the Ackermann function, formalized as discrete dynamical trajectories on the set of least non-negative residues. These maps form a hierarchy of rapidly increasing compositional complexity indexed by recursion depth. We investigate their structural properties, sensitivity to depth variation, and the induced distributions modulo powers of two. While such hierarchical constructions are superficially motivated by hash-type mixing functions, we analyze how powers of two interact with the recursive structure modulo $2^k$, leading to strong saturation effects in the depth $m=3$ case. Instead of the expected asymptotic equidistribution, an absorption phenomenon occurs where the uniform measure concentrates onto a localized subset of residues, driving the total variation distance from the uniform distribution to 1.
Read the full abstract

2603.25677 · 26 Mar · Version 2 completely revised. Following an analysis of the modular recurrence modulo powers of two, a universal absorption phenomenon was established, disproving the initial equidistribution conjecture. The title, abstract, and core sections have been updated to focus on this structural collapse

Representation Theory

Functorial embeddings associated with the Four Subspace Problem

We define a unified categorical framework for studying six subproblems arising from the classical Four Subspace Problem. For each subproblem, we construct a functor from its associated category to the category of representations of the quiver corresponding to the Four Subspace Problem. This approach gives a common structural setting for the six cases considered and allows a simultaneous and coherent analysis via functorial methods. We prove that the six functors are additive and fully faithful, and we show that none of them is dense. As a consequence, each functor induces an equivalence between the corresponding source category and a well-identified full subcategory of the target category. These equivalences provide an effective mechanism for transferring classification results and structural properties, thereby clarifying the structural interrelations among the categories studied.
Read the full abstract

Optimization and Control

Atomic Gradient Flows: Gradient Flows on Sparse Representations

One of the most popular approaches for solving total variation-regularized optimization problems in the space of measures are Particle Gradient Flows (PGFs). These restrict the problem to linear combinations of Dirac deltas and then perform a Euclidean gradient flow in the weights and positions, significantly reducing the computational cost while still decreasing the energy. In this work, we generalize PGFs to convex optimization problems in arbitrary Banach spaces, which we call Atomic Gradient Flows (AGFs). To this end, the crucial ingredient turns out to be the right notion of particles, chosen here as the extremal points of the unit ball of the regularizer. This choice is motivated by the Krein-Milman theorem, which ensures that minimizers can be approximated by linear combinations of extremal points. We investigate metric gradient flows of the optimization problem when restricted to such sparse representations, for which we define a suitable discretized functional that we show to be to be consistent with the original problem via the means of $\Gamma$-convergence. We prove that the resulting evolution of the latter is well-defined using a minimizing movement scheme, and we establish conditions ensuring $\lambda$-convexity and uniqueness of the flow. Then, using Choquet's theorem, we lift the problem into the Wasserstein space on weights and extremal points, and consider Wasserstein gradient flows in this lifted setting. Our main result is that the lifting of the AGF evolution is again a metric gradient flow in the Wasserstein space, verifying the consistency of the approach with respect to a Wasserstein-type dynamic. Finally, we illustrate the applicability of AGFs to several relevant infinite-dimensional problems, including optimization of functions of bounded variation and curves of measures regularized by Optimal Transport-type penalties.
Read the full abstract

Numerical Analysis

A Quasicontinuum Method with Optimized Local Maximum-Entropy Interpolation and Heaviside Enrichment for Heterogeneous Lattices

Lattice systems are effective for modeling heterogeneous materials, but their computational cost is often prohibitive. The QuasiContinuum (QC) method reduces this cost by interpolating the lattice response over a coarse finite-element mesh, yet material interfaces in heterogeneous systems still require fine discretizations. Enrichment strategies from the eXtended Finite Element Method (XFEM) address this by representing interfaces on nonconforming meshes. In this work, we combine Heaviside enrichment with meshless Local Maximum Entropy (LME) interpolation in the QC framework for heterogeneous lattice systems. We systematically investigate the role of the LME locality parameter and its optimization. The results show that optimized LME interpolation improves displacement accuracy by about one order of magnitude over QC with linear interpolation at the same number of degrees of freedom. In addition, the optimal locality-parameter fields are nonuniform near interfaces and exhibit systematic spatial structure. Based on these observations, we derive simple pattern-based rules that retain much of the benefit of full optimization at a fraction of the computational cost. The approach is demonstrated on three numerical examples.
Read the full abstract

Algebraic Topology

Geometric Points in Tensor Triangular Geometry

In this paper, we study geometric points in tensor triangular geometry. In doing so, we construct a counter-example to Balmer's Nerves of Steel conjecture using free constructions in higher Zariski geometry. We then go on to introduce and discuss constructible spectra in the context of tensor triangular geometry. For tensor triangulated categories satisfying a mild enhancement condition, we use these spectra to construct geometric incarnations of (homological or triangular) primes via maps to "pointlike" tensor triangulated categories.
Read the full abstract

Combinatorics

Isomorphic daisy cubes based on their $\tau$-graphs

We prove that if $A$ and $B$ are daisy cubes whose $\tau$-graphs are forests, then $A$ and $B$ are isomorphic if and only if their $\tau$-graphs are isomorphic. The result is applied to show that a daisy cube with at least one edge is the resonance graph of a plane bipartite graph $G$ if and only if its $\tau$-graph is a forest which is isomorphic to the inner dual of the subgraph of $G$ obtained by removing all forbidden edges. As a consequence, some well known properties of Fibonacci cubes and Lucas cubes are provided as examples with different proofs.
Read the full abstract

Representation Theory

The theta correspondence over finite fields

This set of lecture notes is an expanded version of a mini-course the author gave in March of 2025 for the program “Representation Theory & Noncommutative Geometry" at the Institut Henri Poincaré, Paris. The goal is to provide a survey of the main properties of the theta correspondence over finite fields of odd characteristic, including its compatibility with Harish-Chandra and Lusztig series, and with the Jordan decomposition of representations, as well as its full explicit description.
Read the full abstract

Optimization and Control

Instance-optimal stochastic convex optimization: Can we improve upon sample-average and robust stochastic approximation?

We study the unconstrained minimization of a smooth and strongly convex population loss function under a stochastic oracle that introduces both additive and multiplicative noise; this is a canonical and widely-studied setting that arises across operations research, signal processing, and machine learning. We begin by showing that standard approaches such as sample average approximation and robust (or averaged) stochastic approximation can lead to suboptimal – and in some cases arbitrarily poor – performance with realistic finite sample sizes. In contrast, we demonstrate that a carefully designed variance reduction strategy, which we term VISOR for short, can significantly outperform these approaches while using the same sample size. Our upper bounds are complemented by finite-sample, information-theoretic local minimax lower bounds, which highlight fundamental, instance-dependent factors that govern the performance of any estimator. Taken together, these results demonstrate that an accelerated variant of VISOR is instance-optimal, achieving the best possible sample complexity up to logarithmic factors while also attaining optimal oracle complexity. We apply our theory to generalized linear models and improve upon classical results. In particular, we obtain the best-known non-asymptotic, instance-dependent generalization error bounds for stochastic methods, even in linear regression.
Read the full abstract

Functional Analysis

On circular Kippenhahn curves and the Gau-Wang-Wu conjecture about nilpotent partial isometries

We study linear operators on a finite-dimensional space whose Kippenhahn curves consist of concentric circles centered at the origin. We say that such operators have Circularity property. One class of examples is rotationally invariant operators. To every operator with norm at most one, we associate an infinite sequence of partial isometries and study when Circularity property can be passed back and forth along that sequence. In particular, we introduce a class of operators for which every partial isometry in the aforementioned sequence has Circularity property, and show that this class is broader than the class of rotationally invariant operators. As a consequence, every such an operator provides a counterexample to the Gau–Wang–Wu conjecture about nilpotent partial isometries. We also discuss possible refinements of the conjecture. Finally, we propose a way to check whether a matrix is rotationally invariant, suitable for numerical experiments.
Read the full abstract

Dynamical Systems

Wind-tree tiling billiards and their trapping strips

We introduce a new dynamical system: the wind-tree tiling billiards. This system studies trajectories of a ray in Euclidean space which has a negative refractive index when encountering rectangular obstacles located at lattice points. We show that for almost every configuration of the system, trajectories with initial vertical direction are trapped in an infinite strip of the plane. This result is reminiscent of the propagation of light rays in Eaton lenses, as shown by Frączek and Schmoll.
Read the full abstract

Analysis of PDEs

Bubbling of almost critical points of anisotropic isoperimetric problems with degenerating ellipticity

Given a sequence of uniformly convex norms $ \phi_h $ on $ \mathbf{R}^{n+1} $ converging to an arbitrary norm $ \phi $, we prove rigidity of $ L^1 $-accumulation points of sequences of sets $ E_h \subseteq \mathbf{R}^{n+1} $ of finite perimeter, that are volume-constrained almost-critical points of the anisotropic surface energy functionals associated with $ \phi_h $. Here, almost criticality is measured in terms of the $ L^n $-deviation from being constant of the distributional anisotropic mean $ \phi_h $-curvature of (the varifold associated to) of the reduced boundaries of $ E_h $. We prove that such limits are finite union of disjoint, but possibly mutually tangent, $ \phi $-Wulff shapes.
Read the full abstract

Combinatorics

Critical moments of slices and slabs of the cube (and other polyhedral norms)

In this article, we present a unified algebraic-combinatorial framework for computing explicit, piecewise rational, and combinatorially indexed parametric formulas for volumes and higher moments of slices and slabs of polyhedral norm balls. Our main method builds on prior work concerning a combinatorial decomposition of the parameter space of all slices of a polytope. We extend this framework to slabs, and find a polynomial-time algorithm in fixed dimension. We also exhibit computational methods to obtain moments of arbitrary order for all slices or slabs of any polyhedral norm ball, and an algebraic framework for analyzing their critical points. In addition, we present an experimental study of the $d$-dimensional unit cube. Our analysis recovers and reinterprets the known volume formulas for slabs and slices of the two- and three-dimensional cubes, first obtained by König and Koldobsky. Moreover, our method identifies a new complete family of fourteen rational functions giving the volumes of slices and slabs of the four-dimensional cube. We further compute explicit higher moments of slices and slabs in dimensions two and three, and derive explicit formulas for moments of arbitrary order for slices of the two-dimensional cube, describing their critical points. For the four-dimensional cube, we further use these formulas to identify candidate global maxima and minima for slice and slab volumes; the candidates are verified to be critical points by exact symbolic computation and are checked numerically to give the global extrema.
Read the full abstract

All authors Marie-Charlotte Brandenburg, Jesús A. De Loera, Yu Luo, Chiara Meroni

Analysis of PDEs

A new formula for the Wasserstein distance between solutions to (nonlinear) continuity equations

Given two continuity equations with density-dependent velocities, we provide a new formula for the Wasserstein distance between the solutions in terms of the difference of velocities evaluated at the same density. The formula is particularly attractive to deduce quantitative estimates and rates of convergence for singular limits. We illustrate it using several examples. For the porous medium equation with exponent $m$, we prove that solutions are Lipschitz continuous with respect to $m$, providing a quantitative version of the result of Bénilan and Crandall. This result can be extended to a general aggregation-diffusion equation. We also study the limit $m \to \infty$ (the so-called mesa problem or the incompressible limit) and we recover the rate of convergence $1/{\sqrt{m}}$. Last but not least, we improve the rate of nonlocal-to-local convergence for the quadratic porous medium equation from recently obtained $\sqrt{\varepsilon}$ to numerically conjectured $\varepsilon$.
Read the full abstract

Algebraic Geometry

Isometric Embeddings and Hyperkähler Geometry of the Cotangent Bundle of Complex Projective Space via the Scheme of Rank-1 Projections

We show that the hyperkahler geometry of $T^*\mathbb{CP}^{n-1}$ can be described algebraically by the affine scheme of rank-1 projections, and that this description simultaneously yields explicit $SU(n)$-equivariant isometric embeddings \[ T^*\mathbb{CP}^{n-1} \hookrightarrow \mathbb{R}^{(n^2+1)^2}, \] as well as a generalization of the hyperkahler geometry of $T^*\mathbb{CP}^{n-1}$ to arbitrary commutative rings with involutions (and some noncommutative ones). In particular, we obtain para-hyperkahler and complex hyperkahler manifolds by taking the rings to be the split-complex numbers and bicomplex numbers, respectively. The functor of points of the scheme of rank-1 projections is the functor that maps a commutative ring $\mathcal{R}$ to the space of idempotents in $M_n(\mathcal{R})$ whose images are rank-1 projective modules. In particular, its space of $\mathbb{C}$-points is identified with $T^*\mathbb{CP}^{n-1}$.
Read the full abstract

Analysis of PDEs

Existence and Multiplicity results for Weakly coupled system of Pucci's extremal operator

In this work, we investigate the existence of multiple positive solutions for a weakly coupled system of nonlinear elliptic equations governed by Pucci extremal operators. Specifically, we consider the system: \[ \begin{cases} -{M}_{\lambda_1,\Lambda_1}^+(D^2u_1) = \mu f_1(u_1, u_2, \dots, u_n), & \text{in } \Omega, \\ -{M}_{\lambda_2,\Lambda_2}^+(D^2u_2) = \mu f_2(u_1, u_2, \dots, u_n), & \text{in } \Omega, \vdots \\ -{M}_{\lambda_n,\Lambda_n}^+(D^2u_n) = \mu f_n(u_1, u_2, \dots, u_n), & \text{in } \Omega, \\ u_1 = u_2 = \dots = u_n = 0, & \text{on } \partial\Omega, \end{cases} \] where $ {M}_{\lambda,\Lambda}^+ $ represents the Pucci extremal operator, $ \Omega $ is a bounded domain in $ \mathbb{R}^N $ with smooth boundary, and the nonlinear functions $ f_i: [0, \infty)^n \to [0, \infty) $ belong to the $ C^{1,\alpha} $ class. Our main results establish the existence and multiplicity of solutions for sufficiently large values of the parameter $ \mu > 0 $. The analysis relies on the method of sub and supersolutions, in conjunction with fixed-point arguments and bifurcation techniques.
Read the full abstract

Statistics Theory · Cross-listed from cs.DS

The Geometry of Efficient Nonconvex Sampling

We present an efficient algorithm for uniformly sampling from an arbitrary compact body $\mathcal{X} \subset \mathbb{R}^n$ from a warm start under isoperimetry and a natural volume growth condition. Our result provides a substantial common generalization of known results for convex bodies and star-shaped bodies. The complexity of the algorithm is polynomial in the dimension, the Poincaré constant of the uniform distribution on $\mathcal{X}$ and the volume growth constant of the set $\mathcal{X}$.
Read the full abstract

Probability

Fourier dimension of Mandelbrot cascades on planar curves

We consider multifractal Mandelbrot cascades supported on planar $C^2$ curves with nonvanishing curvature and show that their Fourier dimension is as large as possible, i.e., equal to the infimum of the lower pointwise dimension of the measure.

Number Theory

A conditional bound for the least prime in an arithmetic progression

Assuming the generalized Lindelöf hypothesis for Dirichlet $L$-functions, we establish that the least prime $p\equiv a\pmod{q}$ satisfies $p\ll_{\varepsilon} q^{2+\varepsilon}$. This achieves a bound that nearly matches the classical estimate implied by the generalized Riemann hypothesis.
Read the full abstract

Information Theory

Kakeya Conjecture and Conditional Kolmogorov Complexity

This paper develops an information-theoretic framework for algorithmic complexity under regular identifiable fibering. The central question is: when a decoder is given information about the fiber label in a fibered geometric set, how much can the residual description length be reduced, and when does this reduction fail to bring dimension below the ambient rate? We formulate a directional compression principle, proposing that sets admitting regular, identifiable fiber decompositions should remain informationally incompressible at ambient dimension, unless the fiber structure is degenerate or adaptively chosen. The principle is phrased in the language of algorithmic dimension and the point-to-set principle of Lutz and Lutz, which translates pointwise Kolmogorov complexity into Hausdorff dimension. We prove an exact analytical result: under effectively bi-Lipschitz, identifiable, and computable fibering, the complexity of a point splits additively as the sum of fiber-label complexity and along-fiber residual complexity, up to logarithmic overhead, via the chain rule for Kolmogorov complexity. The Kakeya conjecture (asserting that sets containing a unit segment in every direction have Hausdorff dimension n) motivates the framework. The conjecture was recently resolved in R^3 by Wang and Zahl; it remains open in dimension n >= 4, precisely because adaptive fiber selection undermines the naive conditional split in the general case. We isolate this adaptive-fibering obstruction as the key difficulty and propose a formal research program connecting geometric measure theory, algorithmic complexity, and information-theoretic compression.
Read the full abstract

Classical Analysis and ODEs

Extending Theorems of Boros and Menzer

We extend results of Boros and Menzer on the alternative equation $f(x)f(y)=0$ for generalized polynomials $f$, and their theorems on the conditional inequality $f(x)f(y)\ge 0$ for generalized monomials $f$ of even degree. We use similar methods and ideas. We replace the largeness, of the respective Borel plane set $D$, in the measure or in the Baire category sense, by its largeness in the mixed measure-category sense.
Read the full abstract

Probability

Stabilization of stochastic networks in Markovian environment

We establish criteria under which stochastic networks in a Markovian environment stabilize, thus confirming Conjecture 7.2 from Levine-Greco [GL23]. The networks evolve on finite connected graphs $G=(V,E)$, and their dynamics are encoded by $V \times V$ toppling matrices $M$, whose columns record the expected number of topplings when the environment is in stationarity. Stabilization and non-stabilization are characterized by a parameter $\rho$ which depends on the largest eigenvalue of the matrix $M+\alpha I$, with $\alpha=1+\max\{-M(v,v):v\in V\}$. The proofs rely on the toppling random walk, in which toppled vertices are sampled according to the eigenvector associated with the largest eigenvalue of $M$.
Read the full abstract

Algebraic Geometry

A birational version of K-stability for big classes

We introduce a theory of uniform K-stability for big line bundles on smooth projective varieties. This extends the existing theory both for varieties with ample line bundles, and for varieties with big anticanonical class. Our main result gives a valuative characterisation of uniform K-stability, through finite collections of divisorial valuations. We further prove that uniform K-stability is preserved under pullbacks and certain pushforwards, which implies that uniform K-stability is well-defined at the level of b-divisors.
Read the full abstract

Commutative Algebra

On Bass numbers of graded components of local cohomology modules supported on $\mathfrak{C}$-monomial ideals in mixed characteristic

Let $A$ be a Dedekind domain of characteristic zero such that for each height one prime ideal $\mathfrak{p}$ in $A$, the local ring $A_{\mathfrak{p}}$ has mixed characteristic with finite residue field. Suppose that $R=A[X_1,\ldots,X_n]$ is a standard $\mathbb{N}^n$-graded polynomial ring over $A$, i.e., $\operatorname{deg} A=\underline{0}\in \mathbb{N}^n$ and $\operatorname{deg}(X_j)=e_j\in \mathbb{N}^n$. Let $I$ be a $\mathfrak{C}$-monomial ideal of $R$ and let $M:= H^i_I(R)=\bigoplus_{\underline{u}\in \mathbb{Z}^n}M_{\underline{u}}$. Recently, the second author and S. Roy [2025, J. Algebra 681, 1-21] proved that for a fixed $\underline{u}\in\mathbb{Z}^n$, the Bass numbers $\mu_i(\mathfrak{p},M_{\underline{u}})$ are finite for each prime ideal $\mathfrak{p}$ in $A$ and for every $i\geq 0$. Let for a subset of $U$ of $\mathcal{S}=\{1, \ldots, n\}$, define a block to be the set $\displaystyle\mathcal{B}(U)=\{\underline{u} \in \mathbb{Z}^n \mid u_i \geq 0 \mbox{ if } i \in U \mbox{ and } u_i \leq -1 \mbox{ if } i \notin U \}$. Note that $\bigcup_{U\subseteq \mathcal{S}}\mathcal{B}(U)=\mathbb{Z}^n$. In this article, the main result we establish is that for a fixed prime ideal $\mathfrak{p}$ in $A$ and $i\geq 0$, the set of Bass numbers $\{\mu_i(\mathfrak{p},M_{\underline{u}})\mid \underline{u}\in \mathbb{Z}^n\}$ is constant on $\mathcal{B}(U)$ for each subset $U$ of $\{1, \ldots, n\}$. Our idea is to prove this by carrying out a comprehensive study of the structure theorem for the graded components of $M$ when $A$ is a complete DVR of mixed characteristic with finite residue field.
Read the full abstract