Peer Revenue Equity in science

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Wednesday 18 February

Optimization and Control · Cross-listed from cs.LG

On the Mechanism and Dynamics of Modular Addition: Fourier Features, Lottery Ticket, and Grokking

We present a comprehensive analysis of how two-layer neural networks learn features to solve the modular addition task. Our work provides a full mechanistic interpretation of the learned model and a theoretical explanation of its training dynamics. While prior work has identified that individual neurons learn single-frequency Fourier features and phase alignment, it does not fully explain how these features combine into a global solution. We bridge this gap by formalizing a diversification condition that emerges during training when overparametrized, consisting of two parts: phase symmetry and frequency diversification. We prove that these properties allow the network to collectively approximate a flawed indicator function on the correct logic for the modular addition task. While individual neurons produce noisy signals, the phase symmetry enables a majority-voting scheme that cancels out noise, allowing the network to robustly identify the correct sum. Furthermore, we explain the emergence of these features under random initialization via a lottery ticket mechanism. Our gradient flow analysis proves that frequencies compete within each neuron, with the "winner" determined by its initial spectral magnitude and phase alignment. From a technical standpoint, we provide a rigorous characterization of the layer-wise phase coupling dynamics and formalize the competitive landscape using the ODE comparison lemma. Finally, we use these insights to demystify grokking, characterizing it as a three-stage process involving memorization followed by two generalization phases, driven by the competition between loss minimization and weight decay.
Read the full abstract

All authors Jianliang He, Leda Wang, Siyu Chen, Zhuoran Yang

Dynamical Systems

Predicting Generalized Steady States in Aperiodically Forced Mechanical Systems

The existence of generalized steady states (GSSs) in nonlinear mechanical systems under moderate temporally aperiodic forcing has only been shown recently. Here we derive systematic expansions for such GSSs and construct a numerical algorithm that yields explicit and arbitrarily refinable approximations for GSSs without the need for an initial convergence period. This is to be contrasted with a direct numerical integration of the system, whose convergence is hard to assess or is even undefined for short, transient forcing. When at least the linear part of the equations of motion is known, our GSS algorithm outperforms available data-driven neural-network-based techniques for predicting forced response in structural dynamics problems. In a fully equation-driven setting, our GSS computations are shown to be faster than a direct numerical integration of forced nonlinear finite-element models of beams and shells.
Read the full abstract

All authors Roshan S. Kaundinya, Isabella Thiel, Bálint Kaszás, Shobhit Jain, George Haller

Information Theory · Cross-listed from eess.SP

A New Perspective on Scale: A Novel Transform for NMR Envelope Extraction

Envelope extraction in nuclear magnetic resonance (NMR) is a fundamental step for processing the data space generated by this technique. Envelope detection accuracy improves with increasing the number of sampling points; however, we propose a novel transform that enables acceptable envelope extraction with significantly fewer sampling points, even without meeting the Nyquist rate. In this paper, we challenge the traditional scale definition and demonstrate that classic scaling lacks a physical referent in all situations. To achieve this aim, we introduce a scale based on the variations of space-invariant states, rather than the observable characteristics of matter and energy. According to this definition of the scale, we distinguished two kinds of observers: scale-variant and scale-invariant. We demonstrated that converting a scale-variant observer to a scale-invariant observer is equivalent to envelop extraction. To analyse and study the theories presented in the paper, we have designed and implemented an Earth-field NMR setup and used real data generated by it to evaluate the performance of the proposed envelope-detection transform. We compared the output of the proposed transform with that of classic and state-of-the-art methods for parameter recovery of NMR signals.
Read the full abstract

Probability

Ray-Knight theorems for the local times of rebirthed Markov processes

We prove generalizations of the first and second Ray-Knight theorems, for a large class of non-symmetric strong Markov processes. These results link the local times of the Markov process with the squares of associated Gaussian processes. This connection allows us to establish results about the exact modulus of continuity (in the spatial variable) of the local times. Our approach is different from earlier treatments which were based on associated permanental processes rather than Gaussian processes. The type of process with which we work can be described as follows. Start with a symmetric Markov process with finite lifetime; upon its death resurrect it at a place in the state space chosen at random, independent of the past. Continue in this way, resurrecting at each death, to obtain a recurrent process. The rebirthing procedure destroys the symmetry of the original process, leading to a large class of non-symmetric processes. The main results are illustrated by many examples.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Supersymmetry and Nonreciprocity

Nonreciprocal theories are used to model a broad array of non-equilibrium phenomena found in nature ranging from biological systems like networks of neurons to the behavior of overflowing water fountains. This includes systems broadly classified as active matter systems. We show that the stochastic theories which describe nonreciprocal interactions can be mapped into quantum field theories described by a supersymmetric action with a single supercharge. The theories are generically non-Hermitian. This generalizes the past work of Parisi and Sourlas on reciprocal theories, which model systems with interactions derived from potentials.
Read the full abstract

Algebraic Geometry

Classifying binary quadratic forms using Clifford invariants

We functorially identify similarity classes of line-bundle-valued quadratic forms on rank two vector bundles with isomorphism classes of pairs consisting of the degree zero and the degree one parts of the associated generalized Clifford algebras. As applications, we generalize the Gauss Composition and explore connections with Picard groups of quadratic algebras.
Read the full abstract

Numerical Analysis

Fast, High-Accuracy, Randomized Nullspace Computations for Tall Matrices

In this paper, we develop RLOBPCG, an efficient method for computing a small number of singular triplets corresponding to the smallest singular values of large, tall matrices. The algorithm combines randomized preconditioner from the sketch-and-precondition techniques with the LOBPCG eigensolver: a small sketch is used to construct a high-quality preconditioner, and LOBPCG is run on the Gram matrix to refine the singular vector. Under the standard subspace embedding assumption and a modest singular value gap between the two smallest singular values, we prove that RLOBPCG converges geometrically to the minimum singular vector. In numerical experiments, RLOBPCG achieves near-optimal accuracy on matrices with up to $10^6$ rows, outperforming classical LOBPCG and Lanczos methods by a speedup of up to $12\times$ and maintaining robustness when other iterative methods fail to converge.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Efficient Tail-Aware Generative Optimization via Flow Model Fine-Tuning

Fine-tuning pre-trained diffusion and flow models to optimize downstream utilities is central to real-world deployment. Existing entropy-regularized methods primarily maximize expected reward, providing no mechanism to shape tail behavior. However, tail control is often essential: the lower tail determines reliability by limiting low-reward failures, while the upper tail enables discovery by prioritizing rare, high-reward outcomes. In this work, we present Tail-aware Flow Fine-Tuning (TFFT), a principled and efficient distributional fine-tuning algorithm based on the Conditional Value-at-Risk (CVaR). We address two distinct tail-shaping goals: right-CVaR for seeking novel samples in the high-reward tail and left-CVaR for controlling worst-case samples in the low-reward tail. Unlike prior approaches that rely on non-linear optimization, we leverage the variational dual formulation of CVaR to decompose it into a decoupled two-stage procedure: a lightweight one-dimensional threshold optimization step, and a single entropy-regularized fine-tuning process via a specific pseudo-reward. This decomposition achieves CVaR fine-tuning efficiently with computational cost comparable to standard expected fine-tuning methods. We demonstrate the effectiveness of TFFT across illustrative experiments, high-dimensional text-to-image generation, and molecular design.
Read the full abstract

All authors Zifan Wang, Riccardo De Santi, Xiaoyu Mo, Michael M. Zavlanos, Andreas Krause, Karl H. Johansson

Statistics Theory · Cross-listed from stat.ME

First versus full or first versus last: U-statistic change-point tests under fixed and local alternatives

The use of U-statistics in the change-point context has received considerable attention in the literature. We compare two approaches of constructing CUSUM-type change-point tests, which we call the first-vs-full and first-vs-last approach. Both have been pursued by different authors. The question naturally arises if the two tests substantially differ and, if so, which of them is better in which data situation. In large samples, both tests are similar: they are asymptotically equivalent under the null hypothesis and under sequences of local alternatives. In small samples, there may be quite noticeable differences, which is in line with a different asymptotic behavior under fixed alternatives. We derive a simple criterion for deciding which test is more powerful. We examine the examples Gini's mean difference, the sample variance, and Kendall's tau in detail. Particularly, when testing for changes in scale by Gini's mean difference, we show that the first-vs-full approach has a higher power if and only if the scale changes from a smaller to a larger value – regardless of the population distribution or the location of the change. The asymptotic derivations are under weak dependence. The results are illustrated by numerical simulations and data examples.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

From Multipartite Entanglement to TQFT

At long distances, a gapped phase of matter is described by a topological quantum field theory (TQFT). We conjecture a tight and concrete relationship between the genuine $(d+1)$-partite entanglement – labelled by a $d$-dimensional manifold $M$ – in the ground state of a $(d-1)+1$-dimensional gapped theory and the partition function of the low energy TQFT on $M$. Under certain assumptions, the conjecture implies that for $d=3$, the ground state wavefunction can determine the modular tensor category description of the low energy TQFT. We verify our conjecture for general (2+1)-dimensional Levin-Wen string-net models.
Read the full abstract

Number Theory

Algebraic representatives of the ratios $\zeta(2n+1)/\pi^{2n}$ and $\beta(2n)/\pi^{2n-1}$

In \cite{TallaWaffo2025arxiv2511.02843} we introduced even polynomials $\Xi_n,\Lambda_n\in\mathbb{Q}[x]$ arising from integral representations of $\beta(2n)/\pi^{2n-1}$ and $\zeta(2n+1)/\pi^{2n}$. In this paper we give explicit closed formulae for these polynomials in terms of Eulerian numbers and study their structural properties. These properties may prove useful in studies on the arithmetic nature of the ratios $\beta(2n)/\pi^{2n}$ and $\zeta(2n+1)/\pi^{2n+1}.$
Read the full abstract

Functional Analysis

Perturbation analysis of tensor $(\mathcal{B},\mathcal{C})$-inverse via Einstein product

We investigate the influence of a relatively small perturbation on various generalized inverses functions or quantities derived from a tensor $\mathcal{A}$.When a small tensor perturbation \(\mathcal{E}\) is introduced, it becomes challenging to analyze generalized inverses of the perturbed tensor \( \mathcal{D} =\mathcal{A}+\mathcal{E}\) and to determine how this perturbation affects a generalized inverse of $\mathcal{A}$.Our main goal is to understand the relationship between $\mathcal{D}^\Game$ and \( \mathcal{A}^\Game \), where $(\cdot)^\Game$ denotes a specific generalized inverse or a class of generalized inverses.In particular, classes of tensor inner, outer, and $(\mathcal{B},\mathcal{C})$ inverses are considered.
Read the full abstract

All authors Daochang Zhang, Jingqian Li, Dijana Mosic, Predrag S. Stanimirovic

Numerical Analysis · Cross-listed from eess.IV

Structured Analytic Mappings for Point Set Registration

We present an analytic approximation model for non-rigid point set registration, grounded in the multivariate Taylor expansion of vector-valued functions. By exploiting the algebraic structure of Taylor expansions, we construct a structured function space spanned by truncated basis terms, allowing smooth deformations to be represented with low complexity and explicit form. To estimate mappings within this space, we develop a quasi-Newton optimization algorithm that progressively lifts the identity map into higher-order analytic forms. This structured framework unifies rigid, affine, and nonlinear deformations under a single closed-form formulation, without relying on kernel functions or high-dimensional parameterizations. The proposed model is embedded into a standard ICP loop – using (by default) nearest-neighbor correspondences – resulting in Analytic-ICP, an efficient registration algorithm with quasi-linear time complexity. Experiments on 2D and 3D datasets demonstrate that Analytic-ICP achieves higher accuracy and faster convergence than classical methods such as CPD and TPS-RPM, particularly for small and smooth deformations.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

A Generalization of the Parametric Amplifier with Dunkl Derivative: Spectral and Statistical Properties

We study the parametric amplifier Hamiltonian within the framework of the Dunkl formalism. We introduce the Dunkl creation and annihilation operators and show that their quadratic combinations generate an $su(1,1)$ Lie algebra. The spectral problem is solved exactly using two algebraic methods: the $su(1,1)$ tilting transformation and the generalized Bogoliubov transformation. The exact energy spectrum and the corresponding eigenfunctions are obtained in terms of the Dunkl number coherent states. Furthermore, we compute the Mandel $Q$ parameter and the second-order correlation function $g^{(2)}(0)$ to analyze the statistical properties of the Dunkl squeezed states. We show that, for the squeezed vacuum, the Mandel parameter remains independent of the Dunkl deformation, whereas the correlation function exhibits an explicit dependence on the Dunkl parameter $\mu$, which modifies the photon bunching effects. Finally, we show that our results reduce to the standard parametric amplifier case in the limit of vanishing Dunkl deformation parameter.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Knowledge-Embedded Latent Projection for Robust Representation Learning

Latent space models are widely used for analyzing high-dimensional discrete data matrices, such as patient-feature matrices in electronic health records (EHRs), by capturing complex dependence structures through low-dimensional embeddings. However, estimation becomes challenging in the imbalanced regime, where one matrix dimension is much larger than the other. In EHR applications, cohort sizes are often limited by disease prevalence or data availability, whereas the feature space remains extremely large due to the breadth of medical coding system. Motivated by the increasing availability of external semantic embeddings, such as pre-trained embeddings of clinical concepts in EHRs, we propose a knowledge-embedded latent projection model that leverages semantic side information to regularize representation learning. Specifically, we model column embeddings as smooth functions of semantic embeddings via a mapping in a reproducing kernel Hilbert space. We develop a computationally efficient two-step estimation procedure that combines semantically guided subspace construction via kernel principal component analysis with scalable projected gradient descent. We establish estimation error bounds that characterize the trade-off between statistical error and approximation error induced by the kernel projection. Furthermore, we provide local convergence guarantees for our non-convex optimization procedure. Extensive simulation studies and a real-world EHR application demonstrate the effectiveness of the proposed method.
Read the full abstract

All authors Weijing Tang, Ming Yuan, Zongqi Xia, Tianxi Cai

Information Theory

The Role of Common Randomness Replication in Symmetric PIR on Graph-Based Replicated Systems

In symmetric private information retrieval (SPIR), a user communicates with multiple servers to retrieve from them a message in a database, while not revealing the message index to any individual server (user privacy), and learning no additional information about the database (database privacy). We study the problem of SPIR on graph-replicated database systems, where each node of the graph represents a server and each link represents a message. Each message is replicated at exactly two servers; those at which the link representing the message is incident. To ensure database privacy, the servers share a set of common randomness, independent of the database and the user's desired message index. We study two cases of common randomness distribution to the servers: i) graph-replicated common randomness, and ii) fully-replicated common randomness. Given a graph-replicated database system, in i), we assign one randomness variable independently to every pair of servers sharing a message, while in ii), we assign an identical set of randomness variable to all servers, irrespective of the underlying graph. In both settings, our goal is to characterize the SPIR capacity, i.e., the maximum number of desired message symbols retrieved per downloaded symbol, and quantify the minimum amount of common randomness required to achieve the capacity. To this goal, in setting i), we derive a general lower bound on the SPIR capacity, and show it to be tight for path and regular graphs through a matching converse. Moreover, we establish that the minimum size of common randomness required for SPIR is equal to the message size. In setting ii), the SPIR capacity improves over the first, more restrictive setting. We show this through capacity lower bounds for a class of graphs, by constructing SPIR schemes from PIR schemes.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Numerical study of non-relativistic quantum systems and small oscillations induced in a helically twisted geometry

We investigate bound states of a non-relativistic scalar particle in a three-dimensional helically twisted (torsional) geometry, considering both the free case and the presence of external radial interactions. The dynamics is described by the Schrödinger equation on a curved spatial background and, when included, by minimal coupling to a magnetic vector potential incorporating an Aharonov–Bohm flux. After separation of variables, the problem reduces to a one-dimensional radial eigenvalue equation governed by an effective potential that combines torsion-induced Coulomb-like and centrifugal-like structures with magnetic/flux-dependent terms and optional model interactions. Because closed-form analytic solutions are not reliable over the parameter ranges required for systematic scans, we compute spectra and eigenfunctions numerically by formulating the radial equation as a self-adjoint Sturm–Liouville problem and solving it with a finite-difference discretization on a truncated radial domain, with explicit convergence control. We analyze four representative scenarios: (i) no external potential, (ii) Cornell-type confinement, (iii) Kratzer-type interaction, and (iv) the small-oscillation regime around the minimum of a Morse potential. We present systematic trends of the low-lying levels as functions of the torsion parameter, magnetic field, and azimuthal sector, and we show that geometric couplings alone can produce effective confinement even in the absence of an external interaction.
Read the full abstract

All authors C. F. S. Pereira, R. L. L. Vitória, A. R. Soares, B.B. Silva, H. Belich, Edilberto O. Silva

Combinatorics

Disjoint Correspondence Colorings for $K_5$-Minor-free Graphs

Thomassen famously proved that every planar graph is 5-choosable. We explore variants of this result, focusing on finding disjoint correspondence colorings, in the more general class of $K_5$-minor-free graphs. Correspondence colorings generalize list colorings as follows. Given a graph $G$ and a positive integer $t$, a correspondence $t$-cover $\textbf{M}$ assigns to each $v\in V(G)$ a set of allowable colors $\{1_v,\ldots,t_v\}$ and to each edge $vw\in E(G)$ a matching between $\{1_v,\ldots,t_v\}$ and $\{1_w,\ldots,t_w\}$. An $\textbf{M}$-coloring $\varphi$ picks for each vertex $v$ a color $\varphi(v)$ (from the set $\{1_v,\ldots,t_v\}$) such that for each edge $vw\in E(G)$ the colors $\varphi(v),\varphi(w)$ are not matched to each other. Two $\textbf{M}$-colorings $\varphi_1,\varphi_2$ of $G$ are called disjoint if $\varphi_1(v)\ne\varphi_2(v)$ for all $v\in V(G)$. For every $K_5$-minor-free graph $G$ and every correspondence 6-cover $\textbf{M}$ of $G$, we construct 3 pairwise disjoint $\textbf{M}$-colorings $\varphi_1,\varphi_2,\varphi_3$. In contrast, we provide examples of $K_5$-minor-free graphs and correspondence 5-covers $\textbf{M}$ that do not admit 3 disjoint $\textbf{M}$-colorings.
Read the full abstract

Mathematical Physics

Two-mode dominance and deterministic parameter bias bounds for equatorial Kerr-de Sitter ringdown

We study scalar waves on subextremal Kerr-de Sitter spacetimes in a compact slow-rotation regime and at a fixed overtone index. Working initially at a fixed cosmological constant $\Lambda>0$ and uniformly for $(M,a)$ in a compact slow-rotation set, using the meromorphic/Fredholm framework for quasinormal modes and a semiclassical equatorial labeling proved in a companion paper, we establish a quantitative two-mode dominance theorem in an equatorial high-frequency package: after exact azimuthal reduction, microlocal equatorial localization, and analytic pole selection by entire localization weights constructed from equatorial pseudopoles, the $k=\pm\ell$ sector signals are each governed by a single quasinormal exponential, up to an explicitly controlled tail and an $\mathcal O(\ell^{-\infty})$ contribution from all other poles. We then develop a fully deterministic frequency-extraction stability estimate based on time-shift invariance, and combine it with the two-mode dominance result and the companion paper's inverse stability theorem to obtain an explicit parameter bias bound for ringdown-based recovery of $(M,a)$. Finally, using the companion paper's three-parameter inverse theorem and a damping observable based on the scaled imaginary part of one equatorial mode, we propagate the same deterministic error chain to a local bias bound for recovery of $(M,a,\Lambda)$ on compact parameter sets with $|a|$ bounded away from $0$. As a further consequence, we obtain a localized pseudospectral stability statement for the equatorial resolvent package, quantifying how large microlocalized resolvent norms enforce proximity to the labeled equatorial poles. The resulting estimates clarify the conditioning mechanisms (start time, window length, shift step, and detector nondegeneracy) and provide a rigorous PDE-to-data interface for high-frequency black-hole spectroscopy.
Read the full abstract

Algebraic Geometry

Generalized determinantal representation of hypersurfaces

In this article we extend the notion of determinantal representation of hypersurfaces to the determinantal representation of sections of the determinant line bundle of a vector bundle. We give several examples, and prove some necessary conditions for existence of determinantal representation. As an application, we show that for any integer $d \geq 1,$ there is an indecomposable vector bundle $E_d$ of rank $2$ on $\mathbb{P}^2$ such that almost all curves of degree $d$ of $\mathbb{P}^2$ arise as the degeneracy loci of a pair of holomorphic sections of $E_d$, upto an automorphism of $\mathbb{P}^2$. We use this result to obtain a linear algebraic application.
Read the full abstract

Dynamical Systems

Cantor sets in higher dimensions II: Optimal dimension constraint for stable intersections

It is well known that a pair of compact sets in $\mathbb{R}^d$ ($d \in \mathbb{N}$) can be separated by small deformations if the sum of their upper box dimensions is less than $d$. In this paper, we demonstrate that this dimension constraint is optimal for regular Cantor sets. Specifically, for any prescribed upper box dimensions whose sum is greater than $d$, we construct classes of pairs of regular Cantor sets that exhibit $C^{1+\alpha}$-stable intersections. Our method is geometrically flexible, enabling the construction of examples with arbitrarily small thickness in both projectively hyperbolic and nearly conformal regimes. These results also extend to the complex setting for holomorphic Cantor sets in $\mathbb{C}^d$. The proof relies on the "covering criterion" for stable intersection introduced in the first part of this series [NZ25], which generalizes the "recurrent compact set criterion" of Moreira-Yoccoz to higher dimensions.
Read the full abstract

Mathematical Physics

Exponential concentration of fluctuations in mean-field boson dynamics

We study the mean-field dynamics of a system of $N$ interacting bosons starting from an initially condensated state. For a broad class of mean-field Hamiltonians, including models with arbitrary bounded interactions and models with unbounded interaction potentials, we prove that the probability of having $n$ particles outside the condensate decays exponentially in $n$ for any finite evolution time. Our results strengthen previously known bounds that provide only polynomial control on the probability of having $n$ excitations.
Read the full abstract

Classical Analysis and ODEs

A.E. Convergence vs Boundedness

We extend Stein's maximal theorem to the bilinear setting. Let $M$ be a homogeneous space with a transitive action of a compact abelian group, and let $1 \le p,q \le 2$ and $1/2 \le r \le 1$ satisfy $1/p + 1/q = 1/r$. For a family of translation-invariant bilinear operators \[ T_m : L^p(M) \times L^q(M) \to L^r(M), \qquad m \in \mathbb{N}, \] that converge almost everywhere, we prove that the associated maximal operator \[ T^*(f,g) = \sup_m |T_m(f,g)| \] is of weak type $L^p(M) \times L^q(M) \to L^{r,\infty}(M)$. The proof relies on probabilistic methods and a bilinear extension of Stein's lemma for double Rademacher series. We also establish a bilinear analogue of Sawyer's extension of Stein's theorem for positive bilinear operators commuting with a mixing family of measure-preserving transformations. Applications include strong-type boundedness of maximal bilinear tail operators associated with ergodic transformations in the natural exponent range $r = (1/p + 1/q)^{-1}$ for $p,q > 1$, as well as almost everywhere convergence results for bilinear Bochner–Riesz means and other bilinear ergodic averages on the torus.
Read the full abstract

Analysis of PDEs

Hierarchical paraproducts

We outline an extension of paraproduct decompositions for compositions of the form $A(f)$ where $A \in C^{d}(\mathbb{R}), f \in \Lambda_{\alpha}([0,1]^d)$ developed in [arXiv:2503.12629] and [arXiv:2508.13322] to settings where $(A \in C^1(\mathbb{R}),f \in \Lambda_{\alpha}(X))$ and $ (A \in C^2(\mathbb{R}),f \in \Lambda_{\alpha}(X \times Y))$. To do so, we construct partition trees on $X$ and $X \times Y$ such that analysis with respect to scale is sensible. We obtain results resembling those of [arXiv:2503.12629] and [arXiv:2508.13322], but with the finite sets $X$ and $X \times Y $ as support. In particular we construct the paraproduct $\Pi_{A',A''}^{L,S}: f \to \tilde{A}_{L,S}(f) + \Delta_{L,S}(A,f)$ such that $\Delta_{L,S}(A,f) \in \Lambda_{2\alpha}(X \times Y)$ and $\lVert \Delta_{L,S}(A,f) \rVert_{\Lambda_{2\alpha}(X \times Y)} \leq C_A \lVert f \rVert_{\Lambda_{\alpha}(X \times Y)}$. Analogous results are obtained when the support is just one finite set, $X$. This extension is motivated by situations where one wishes to separate the singular and smooth components of such compositions in graph signal processing environments.
Read the full abstract

Differential Geometry

Existence of constant mean curvature surfaces with controlled topology in 3-manifolds

We establish the existence of a non-trivial, branched immersion of a closed Riemann surface $\Sigma$ with constant mean curvature (CMC) $H$ into any closed, orientable 3-manifold $\mathcal{M}$, for almost every prescribed value of $H$. The genus of the surface $\Sigma$ is bounded from above by the Heegaard genus $h$ of $\mathcal{M}$. Starting from a family of sweep-outs of $\mathcal{M}$ by surfaces of genus $h$, we apply a min-max construction for a family $\{E_{H,\sigma}\}_\sigma$ of perturbations of the energy involving the second fundamental form of the immersions to produce almost-critical points $u_k$ of $E_{H,\sigma}$. We then show, following ideas introduced by Rivière and developed by Pigati and Rivière, that the maps $u_k$ converge to a "CMC-parametrized varifold". This limiting object is then shown to be a smooth, branched immersion with the prescribed mean curvature $H$.
Read the full abstract

Analysis of PDEs

Symmetry properties for positive solutions of mixed boundary value problems in a sub-spherical sector

In this paper, we investigate the symmetry properties of positive solutions $u$ to a semilinear elliptic equation under mixed Dirichlet-Neumann boundary conditions in symmetric domains. First, we establish a maximum principle tailored to mixed-boundary problems in domains of either small volume or narrow width, thereby enabling the application of the moving plane method. Secondly, in contrast to the purely Dirichlet case, a key challenge is to establish the non-vanishing of the tangential derivative of $u$ along the Neumann boundary. To address this, we employ local analysis techniques of angular derivatives, as introduced by Hartman and Wintner [Amer. J. Math., 1953]. Thirdly, we identify the signs of directional derivatives of $u$ along sections of the moving line. Using a planar sub-spherical sector as an example, we illustrate how these new innovative techniques and the moving plane method can be combined to derive symmetry and monotonicity results, particularly when the amplitude is less than or equal to $2\pi/3$.
Read the full abstract

Combinatorics

Comparability of random permutations in the strong Bruhat order

The (strong) Bruhat order for permutations provides a partial ordering defined as follows: two permutations are comparable if one can be obtained from the other by a sequence of adjacent transpositions that each increase the number of inversions by $1$. Given two random permutations, what is the probability that they are comparable in the Bruhat order? This problem was first considered in a 2006 work of Hammett and Pittel, which showed an exponential lower bound and a polynomial upper bound. The lower bound was very recently improved to the subexponential bound of $\exp(-n^{1/2 + o(1)})$ by Boretsky, Cornejo, Hodges, Horn, Lesnevich, and McAllister. Hammett and Pittel predicted that the probability should decrease polynomially. We show that the probability decreases faster than any polynomial and is on the order of $\exp(-\Theta(\log^2 n))$.
Read the full abstract

Commutative Algebra

Macaulay Constants and Vanishing of Cohomology

Dubé introduced cone decompositions and their Macaulay constants and used them to obtain an upper bound on the degrees of the generators in a Gröbner basis of an ideal. Liang extended the theory to submodules of a free module. In this paper, Macaulay constants of any finitely generated graded module $M$ over a polynomial ring are introduced by adapting the concept of a cone decomposition to $M$. It is shown that these constants provide upper bounds for the degrees in which the local cohomology modules of $M$ are not zero. The results include an upper bound on the Castelnuovo-Mumford regularity of $M$ and a generalization of Gotzmann's Regularity Theorem from ideals to modules. As an application, an upper bound on the Castelnuovo-Mumford regularity of any coherent sheaf on projective space is established. The mentioned bounds are sharp even for cyclic modules. Furthermore, Macaulay constants are utilized to provide a characterization of Hilbert polynomials of finitely generated graded modules.
Read the full abstract

Probability

A Rough Functional Breuer-Major Theorem

We extend the functional Breuer-Major theorem by Nourdin and Nualart (2020) to the space of rough paths. The proof of tightness combines the multiplication formula for iterated Malliavin divergences, due to Furlan and Gubinelli (2019), with Meyer's inequality and a Kolmogorov-type criterion for the r-variation of cadlag rough paths, due to Chevyrev et al. (2022). Since martingale techniques do not apply, we obtain the convergence of the finite-dimensional distributions through a bespoke version of Slutsky's lemma: First, we overcome the lack of hypercontractivity by an iterated integration-by-parts scheme which reduces the remaining analysis to finite Wiener chaos; crucially, this argument relies on Malliavin differentiability of the nonlinearity but not on chaos decay and, as a consequence, encompasses the centred absolute value function. Second, in the spirit of the law of large numbers, we show that the diagonal of the second-order process converges to an explicit symmetric correction term. Finally, we compute all the moments of the remaining process and, through a fine combinatorial analysis, show that they converge to those of the Stratonovich Brownian rough path perturbed by an antisymmetric area correction, as computed by a suitable amendment of Fawcett's theorem. All of these steps benefit from a major combinatorial reduction that is implied by the original argument of Breuer and Major (1983).
Read the full abstract

Category Theory · Cross-listed from cs.LO

Causal and Compositional Abstraction

Abstracting from a low level to a more explanatory high level of description, and ideally while preserving causal structure, is fundamental to scientific practice, to causal inference problems, and to robust, efficient and interpretable AI. We present a general account of abstractions between low and high level models as natural transformations, focusing on the case of causal models. This provides a new formalisation of causal abstraction, unifying several notions in the literature, including constructive causal abstraction, Q-$\tau$ consistency, abstractions based on interchange interventions, and `distributed' causal abstractions. Our approach is formalised in terms of category theory, and uses the general notion of a compositional model with a given set of queries and semantics in a monoidal, cd- or Markov category; causal models and their queries such as interventions being special cases. We identify two basic notions of abstraction: downward abstractions mapping queries from high to low level; and upward abstractions, mapping concrete queries such as Do-interventions from low to high. Although usually presented as the latter, we show how common causal abstractions may, more fundamentally, be understood in terms of the former. Our approach also leads us to consider a new stronger notion of `component-level' abstraction, applying to the individual components of a model. In particular, this yields a novel, strengthened form of constructive causal abstraction at the mechanism-level, for which we prove characterisation results. Finally, we show that abstraction can be generalised to further compositional models, including those with a quantum semantics implemented by quantum circuits, and we take first steps in exploring abstractions between quantum compositional circuit models and high-level classical causal models as a means to explainable quantum AI.
Read the full abstract