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)

Wednesday 6 May

Probability

The Efron-Stein inequality for identically distributed pairs

We prove that the classical Efron–Stein inequality holds for independent exchangeable pairs \((X_i,Y_i)\). The same inequality fails for independent identically distributed pairs; a simple trigonometric counterexample shows that the trivial Cauchy–Schwarz bound of factor \(n\) is sharp. When each random variable takes at most \(k_i\) values, a useful bound still holds with explicit constant \(\rho(k)\le\max_i k_i/2\).
Read the full abstract

Information Theory · Cross-listed from cs.LG

Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees

We study zero-shot conditional sampling with pretrained diffusion models for linear inverse problems, including inpainting and super-resolution. In these problems, the observation determines only part of the unknown signal. The remaining degrees of freedom must be sampled according to the correct conditional data distribution. Existing projection-based samplers enforce measurement consistency by correcting the observed component during reverse diffusion. However, measurement consistency alone does not determine how probability mass should be distributed along the feasible set, and this can lead to biased conditional samples. We analyze this issue through a normal–tangent decomposition of the score function. For Gaussian noising, the observed-direction score is exactly determined by the measurement; only the tangent conditional score is unknown. We prove that the error from replacing this score by the unconditional tangent score is upper bounded by a dimension-free conditional mutual information between observed and unobserved components. This gives an information-theoretic decomposition into initialization and pathwise score-mismatch errors. Motivated by the theory, we propose a projected-Langevin initialization followed by guided reverse denoising, which outperforms a strong projection-based baseline in inpainting and super-resolution experiments.
Read the full abstract

Dynamical Systems · Cross-listed from q-bio.PE

Chapter 2: Geometry of the Fitness Surface and Trajectory Dynamics of Replicator Systems

We study the geometry of the mean fitness surface of replicator systems and its relationship to evolutionary trajectory dynamics. Using the symmetric–antisymmetric decomposition of the fitness landscape matrix, we derive an explicit formula for the rate of change of mean fitness and establish necessary conditions for its monotonicity along trajectories. In general, replicator trajectories do not reach the maximum of the fitness surface, even in the presence of a unique asymptotically stable equilibrium. We characterise, in terms of the symmetric and antisymmetric parts of the fitness matrix, the precise conditions under which an equilibrium coincides with a local extremum of the fitness surface. Circulant matrices are identified as a natural and nontrivial class satisfying these conditions. We establish a two-way connection between fitness surface maxima and evolutionarily stable states: evolutionary stability implies a local fitness maximum, and the converse holds under the identified structural conditions. When the unique asymptotically stable equilibrium is a local maximum, it is evolutionarily stable and realises the global maximum of the fitness surface; an unstable equilibrium forces the global maximum to the boundary of the simplex. The framework is extended to general Lotka–Volterra systems, where an analogue of mean fitness is shown to share the same extremal properties. Results are illustrated through six examples spanning autocatalytic and hypercyclic replication, a parametric family exhibiting Andronov–Hopf bifurcation and heteroclinic cycles, and the Eigen quasispecies model.
Read the full abstract

Optimization and Control

Meta-learning for sample-efficient Bayesian optimisation of fed-batch processes

The optimisation of fed-batch (bio)chemical process recipes is subject to inherent, underlying, and unmeasurable fluctuations across batches, whose trajectories are difficult to model and costly to measure. Bayesian Optimisation (BayesOpt) is a powerful tool for sampling and optimisation of expensive-to-measure functions. Gaussian Processes (GPs), the surrogate models used in BayesOpt, are static, forecast poorly, and lack generalisation across experiments, limiting their applicability to time-varying batch processes with stochastic parameters, i.e., process fluctuations. This work investigates System-Aware Neural ODE Processes (SANODEP) as a meta-learning model to overcome the limitations of GPs and increase few-shot optimisation performance in BayesOpt. Using a penicillin batch production case study, we find that SANODEP outperforms GP-based BayesOpt in the low-data regime, resulting in improved objectives when few experimental runs are performed. These improvements are observed in both on- and off-distribution batches, highlighting the generalisation capabilities of SANODEP. Using this approach, batch process operators can accelerate the initial optimisation steps in BayesOpt by deploying meta-learning or optimise the process with fewer experiments when the experimental cost is high.
Read the full abstract

All authors Becky Langdon, Gabriel D. Patrón, Chrysoula D. Kappatou, Robert M. Lee, Behrang Shafei, Jixiang Qing, Ruth Misener, Mark van der Wilk, Calvin Tsay

Analysis of PDEs

Semi-global solutions to the Goursat problem for second-order hyper-quasilinear hyperbolic systems with lineary dependent principal coefficients and applications to the vacuum Einstein equations

In this work, we significantly extend the results of D. Houpa, 2006 on the Goursat problem for second-order semi-linear hyperbolic systems to the broader framwork of second-order hyper-quasilinear hyperbolic systems of Goursat type, in which the coefficients of the second-order derivatives depend linearly on the unknown. By adapting techniques inspired by Y. Foures (Choquet)- Bruhat, Acta Mathematica, 1952. we show that in the Sobolev type spaces for the Goursat problem quasilinear hyperbolic of the second order considered, the solution exists and is defined in the vicinity of the meeting characteristic hypersurfaces which carry the initial data. As an application, in harmonic gauge, we derive a semi-global existence and uniqueness result for the vacuum Einstein equations.
Read the full abstract

Dynamical Systems

Producing Quality Pseudorandomness with a Generalized Gauss Continued-Fraction Map

Well-known chaotic maps, such as the logistic and tent maps, have been used to generate cryptographically secure pseudorandomness, yet we know of no efforts which attempt to utilize the Gauss continued-fraction map, a known chaotic map, as a starting point for producing quality pseudorandom output. In this paper, we consider the family of $r$-continued-fraction maps, which generalize the Gauss map, and use them to generate pseudorandom output which outperforms many standard generators, such as the Mersenne Twister, in statistical quality, as ascertained by the use of the Dieharder, PractRand, and TestU01 suites. In this way, we demonstrate the potential viability of these maps as a starting point for novel generators, and provide practical motivation for further study of the properties of both the exact and finite-precision $r$-continued-fraction maps.
Read the full abstract

2605.05378 · 6 May · 18 pages, 6 figures. The algorithm was simplified and retested using the same randomness testing suites as previous versions. The code for the generator is now included in the paper. The mathematical description of the algorithm was substantially revised. Some superfluous analysis of test results was omitted to improve readability. Two paragraphs were added to the concluding section

Logic

Towards an Inferentialist Account of Information Through Proof-theoretic Semantics

Information is one of the most widely-discussed concepts of the current era. However, a great deal of insightful work notwithstanding, it is yet to be given wholly convincing logical or mathematical foundations. Without them, we lack adequate reasoning tools for understanding the complex ecosystems of systems upon which the society depends. We seek to rectify this by taking a first step towards developing an inferentialist semantic theory of information. There are three key interacting components. First, conceptual analysis: the metaphysics of information. Dretske expressed the key concepts of information in terms of intentionality, truth, and transmissibility. We replace truth with inferability, and trace the consequences of this replacement. Second, logic: proof-theoretic semantics (P-tS) provides a mathematical-logical realization of inferentialist reasoning. Using P-tS, we develop the first steps towards a mathematical-logical theory of an inferentialist primitive unit of information, the 'inferon'. This proof-theoretic approach counterpoints the model-theoretic view of information articulated in situation theory. Furthermore, we argue that it facilitates addressing all three components of van Benthem and Martinez's categorization of the understandings of information, as range, as correlation, and as code. Our focus is on information-as-correlation. Third, systems: the P-tS tools we develop provide the basis for a mathematical account of distributed systems modelling – a key tool from informatics for understanding the organization of information processing systems. This yields a reasoning-based theory of information flow in models of distributed systems. Overall, we seek to give a conceptually rigorous mathematical-logical account of information and its role within informatics, grounded in inference and reasoning.
Read the full abstract

Combinatorics

Balanced bipartite distance of $K_4$-free graphs

We show that every $K_4$-free graph on $n$ vertices can be made balanced bipartite by removing at most $\frac{n^2}{9}$ edges. This proves a conjecture of Balogh, Clemen, and Lidický, and generalizes both Sudakov's result on the bipartite distance of $K_4$-free graphs and Reiher's result on the sparse half of $K_4$-free graphs.
Read the full abstract

All authors József Balogh, Ignacy Buczek, Andrzej Grzesik, Piotr Kuc

Optimization and Control · Cross-listed from cs.LG

Feature Starvation as Geometric Instability in Sparse Autoencoders

Sparse autoencoders (SAEs) are used to disentangle the dense, polysemantic internal representations of large language models (LLMs) into interpretable, monosemantic concepts. However, standard $\ell_1$-regularized SAEs suffer from feature starvation (dead neurons) and shrinkage bias, often requiring computationally expensive heuristic resampling and nondifferentiable hard-masking methods to bypass these challenges. We argue that feature starvation is not merely an empirical artifact of poor data diversity, but a fundamental optimization-geometric pathology of overcomplete dictionaries: the $\ell_1$-induced sparse coding map is unstable and fundamentally misaligned with shallow, amortized encoders. To address this structural instability, we introduce adaptive elastic net SAEs (AEN-SAEs), a fully differentiable architecture grounded in classical sparse regression. AEN-SAEs combine an $\ell_2$ structural term that enforces strong convexity and Lipschitz stability with adaptive $\ell_1$ reweighting that eliminates shrinkage bias and suppresses spurious features, thereby jointly controlling the curvature and interaction structure of the induced polyhedral geometry. Theoretically, we show that AEN-SAEs yield a Lipschitz-continuous sparse coding map and recover the global feature support under mild assumptions. Empirically, across synthetic settings and LLMs (Pythia 70M, Llama 3.1 8B), AEN-SAEs mitigate feature starvation without auxiliary heuristics while maintaining competitive reconstruction abilities.
Read the full abstract

Optimization and Control · Cross-listed from cs.RO

Passive Fault Tolerance through Tension-to-Thrust Feed-Forward: Hybrid Input-to-State Stability for Decentralized Multi-UAV Slung-Load Transport under Abrupt Cable Severance

Abrupt cable severance in multi-UAV slung-load transport redistributes load and changes the active constraint set, leaving limited time for fault diagnosis and reconfiguration. Existing controllers rely on coordinated force allocation, peer-state exchange, or fixed cable topology, and therefore lack a certified decentralized recovery mechanism for unannounced severance. We present a passive architecture that routes each vehicle's measured cable tension directly into its altitude thrust command, $T_i^{\mathrm{ff}}=T_i$, while a surrounding proportional-derivative, anti-swing, and projection cascade preserves local tracking feasibility. The main contribution is a conditional hybrid practical input-to-state-stability certificate that composes a slack-excursion-bounded taut-cable reduction, bounded post-severance Lyapunov jumps, inter-fault decay, and per-fault-cycle contraction $\rho \in (0,1)$ into an explicit recovery envelope under stated actuator, slack, and dwell assumptions. We validate the controller in Drake multibody simulation with five vehicles, a 10 kg payload, Kelvin-Voigt cables, Dryden wind, and single- and dual-severance schedules: the closed loop attains 0.312-0.328 m RMSE, 76.1-95.2 mm peak sag, and recovery within one payload-pendulum period. Disabling the identity inflates cruise error by 34-39% and peak sag by 3.6x-4.0x, identifying local tension feed-forward as the dominant passive recovery mechanism in the tested decentralized cascade.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Towards Wedge Construction of Four-Dimensional Non-Supersymmetric Theories and Torsion Classes

Motivated by recent proposals relating non-supersymmetric Type 0A theory to M-theory compactified on a singular wedge geometry, we study an M-theory compactification on a seven-manifold with G_2 structure, realized as a deformed K3 fibration over a compact three-manifold. In the Morrison–Vafa limit, the deformed K3 may be described locally as a non-trivial torus fibration over a base that is itself a pinched circle fibered over an interval. Once the doubled-spectrum decomposition and the local pinched structure are specified, we show that the G_2 torsion classes provide a natural and efficient way to characterize both the torsion of the seven-manifold and the resulting supersymmetry breaking in four dimensions. Reducing the system to ten dimensions in two inequivalent ways leads respectively to Type 0A and Type 0 heterotic theories compactified on two different non-Kahler manifolds, for which the SU(3) torsion classes furnish the appropriate mathematical description. In particular, we argue that the pinching deformation lies in the 27 of G_2, and that under the two reductions it is distributed differently into the W_2 and W_3 torsion classes of the corresponding SU(3) structures. In the supersymmetric limit, and under suitable assumptions, the two resulting theories may become U-dual to one another. Away from that limit, however, we argue that any such duality should be treated with considerable caution.
Read the full abstract

Geometric Topology

The Heegaard Floer d-invariant for more rational homology spheres

The Heegaard Floer d-invariant for a rational homology sphere Y and spin$^c$-structure $\mathfrak{s}$ is defined as the minimal absolute grading of a generator of $HF^+(Y; \mathfrak{s})$. In 2005, Némethi used lattice homology to compute the d-invariant for a particular class of negative-definite plumbed rational homology spheres, and conjectured that his formula should hold for all negative-definite plumbed rational homology spheres. In this paper, we use Zemke's isomorphism between lattice and Heegaard Floer homology to prove Némethi's conjecture.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Automorphic Structures of Heterotic Vacua

We study moduli stabilization in 4D effective field theories with Sp(4,$\mathbb{Z}$) self-duality inspired by heterotic orbifold compactifications with Wilson lines. The target-space duality group of these theories is enhanced from SL$(2,\mathbb{Z})$ to Sp$(4,\mathbb{Z})$, making Siegel modular forms the appropriate language to formulate the effective supergravity action. We construct the corresponding effective theory including moduli-dependent threshold corrections to the gauge kinetic function and nonperturbative effects in the superpotential. The degeneration limit of the Wilson lines distinguishes different sectors and dictates which combination of cusp forms appears in threshold corrections. We compute the resulting scalar potential and prove several general statements about its extrema. In particular, we show that the fixed points of Sp$(4,\mathbb{Z})$ are extrema of the potential, and derive genus-2 analogues of no-go theorems for de Sitter vacua. Finally, we show how positive-energy metastable minima can arise once supersymmetry is broken in the dilaton direction by nonperturbative contributions to the Kähler potential.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Analytical Angle-Finding and Series Expansions for Quantum Signal Processing via Orthogonal Polynomial Theory

Quantum signal processing is a powerful framework in quantum algorithms, playing a central role in Hamiltonian simulation and related applications. The sequence of polynomials implemented at each step of this protocol provides a polynomial basis for block-encoding any polynomial of a unitary. We characterize the achievable polynomial bases in terms of their orthogonality or biorthogonality with respect to a linear functional admitting an integral representation. Explicit expressions for the quantum signal processing angles are derived for families of polynomial sequences, including Hermite, Jacobi, and Rogers-Szegő polynomials. We show that $2n+2$ rotation angles are required to encode a sequence of polynomials in these classes up to degree $n$. We use this result to show that an $\epsilon$-approximation of a smooth function $f$ can be block-encoded using $O(\log(1/\epsilon))$ gates via its Hermite series expansion. The connections established with the theory of orthogonal and biorthogonal polynomials lead to a new method for solving the quantum signal processing angle-finding problem, yielding explicit expressions for the angles. They also provide a complete characterization of the polynomials achievable by $\mathrm{SU}(1,1)$-QSP in terms of their roots. Biorthogonality properties are shown to hold in the bivariate QSP setting, yielding a set of necessary conditions for achievable polynomials.
Read the full abstract

Combinatorics

Induced Lorentzian and volume polynomials

Suppose one has a party of $m$ people, whose expertise collectively covers $n$ topics. Given a subset $T$ of the topics, one wishes to form a panel of $|T|$ people from the party such that $T$ can be covered by assigning a distinct topic to each panel member with the expertise. We show that the numbers of such panels, as $T$ varies, form a Lorentzian polynomial. We achieve this by showing that a certain linear operator on polynomials, which we call the “inducing operator” for its connection to induced (poly)matroids, preserves Lorentzian polynomials and realizable volume polynomials.
Read the full abstract

Commutative Algebra

Quasi sdf-absorbing ideals in commutative rings

This paper introduces and studies quasi sdf-absorbing ideals as a generalization of sdf-absorbing ideals. We investigate the stability of this property under various constructions, including localization, surjective images, Nagata idealizations, and amalgamations. We establish conditions under which the radical of such ideals is prime and discuss a specific class of rings where quasi sdf-absorption implies the sdf-absorbing primary property. The study concludes with a classification of these ideals in Z and examples distinguishing them from related ideal classes.
Read the full abstract

All authors Violeta Leoreanu-Fotea, Ece Yetkin Celikel, Tarik Arabaci, Unsal Tekir

Information Theory · Cross-listed from cs.LG

Expert Routing for Communication-Efficient MoE via Finite Expert Banks

Resource-efficient machine learning increasingly uses sparse Mixture-of-Experts (MoE) architectures, where the gate acts as both a learning component and a routing interface controlling computation, communication, and accuracy. Motivated by finite-rate interpretations of MoE gating, we treat the gate as a stochastic channel and use $I(X;T)$ to quantify the routing information available to the selected expert. To make the associated information quantities tractable beyond synthetic examples, we develop a finite-bank MNIST construction using pretrained CNN experts and a discrete, data-dependent selection rule. Since the selected model belongs to a finite candidate set, the algorithmic mutual information $I(S;W)$ admits a closed-form discrete-entropy estimator from the empirical posterior $q(W|S)$. Sweeping a data-dependence parameter $\alpha$, we observe that $\widehat I(S;W)$ monotonically tracks the generalization gap, while the Xu-Raginsky bound exhibits the expected looseness. We also compare with a uniform union-bound baseline and introduce an empirical estimator of $I(X;T)$ together with a Blahut-Arimoto procedure for tracing an accuracy-rate curve over the expert bank. The proposed framework provides a practical tool for analyzing resource-aware MoE inference systems and for interpreting $I(X;T)$ and $D(R_g)$ as design proxies for efficient expert routing.
Read the full abstract

Information Theory

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.
Read the full abstract

Information Theory

Optimizing Bit-Labeling of Voronoi Constellations

We optimize the bit-to-symbol map of the $D_4$ and $E_8$ root lattices in reference to bit error rate, by implementing two searches on a performance metric, Hamming Density. The first search is a traditional gradient descent and the second is an efficient search using twisted theta functions. We hold other sources of lattice gain constant by fixing the lattice constellation, and consider basis changes that permute the integer labelings of the lattice points. After searching the possible basis matrices for $D_4$ and $E_8$, we found up to 0.09 dB of gain in $D_4$ bit error rate curves, and up to 0.36 dB of gain in $E_8$ compared to the standard bases commonly used in literature at a BER of $10^{-4}$, which is on the scale of gain from Gray coding uncoded QAMs.
Read the full abstract

All authors Carilyn Rumrill, David Muzzey, Connor Davis, Stephen Mackes, Dan Chew

Representation Theory

A Pinned Local Langlands Correspondence for Depth-Zero Supercuspidal Representations

We construct a pinning-normalized local Langlands correspondence for depth-zero supercuspidal representations of a connected reductive group over a non-archimedean local field. After fixing a pinned splitting of the quasi-split inner form, we obtain a canonical bijection between irreducible depth-zero supercuspidal representations and relevant cuspidal enhanced depth-zero Langlands parameters. The construction is organized around the two pieces naturally present in a depth-zero type: a tame toral part and a finite cuspidal representation of a parahoric quotient. The toral part is matched using the local Langlands correspondence for maximally unramified elliptic tori and normalized \(L\)-embeddings. The finite cuspidal part is compared with the parameter side by a pinned Jordan decomposition for the relevant finite reductive quotients. Since these quotients may be disconnected, the finite comparison must retain the Clifford-theoretic data that records the possible extension ambiguity. On the connected unipotent part we use the correspondence of Feng–Opdam–Solleveld for supercuspidal unipotent representations. Combining the toral, unipotent, and Clifford-theoretic pieces gives the enhanced parameter attached to a depth-zero supercuspidal representation, and the inverse map is obtained by reversing the same construction. The correspondence is canonical relative to the fixed pinned normalization. It is compatible with the tame inertial parameter attached to the depth-zero character, with weakly unramified twists, and with central characters via the torus correspondence. Under the DeBacker–Reeder logarithm hypothesis, the dimension-weighted packet distributions attached to the resulting packets are stable.
Read the full abstract

Number Theory

On a polynomial involving quadratic residues modulo primes

Let $p$ be an odd prime, and define $$G_p(x)=\prod_{k=1}^{(p-1)/2}\left(x-e^{2\pi i k^2/p}\right).$$ In this paper we study values of $G_p(x)$ at roots of unity via Galois theory, and confirm some previous conjectures. For example, for any primitive tenth root $\zeta$ of unity, we prove that $$G_p(\zeta)=\begin{cases}(-1)^{|\{1\le k\le \frac {p+9}{10}:\ (\frac kp)=-1\}|} &\text{if}\ p\equiv21\pmod{40}, \\(-1)^{|\{1\le k\le\frac {p+1}{10}:\ (\frac kp)=-1\}|}\zeta^{2}&\text{if}\ p\equiv 29\pmod{40}, \end{cases}$$ where $(\frac kp)$ denotes the Legendre symbol.
Read the full abstract

Optimization and Control

S-LCG: Structured Linear Congruential Generator-Based Deterministic Algorithm for Search and Optimization

This study presents a novel deterministic optimization algorithm based on a special variant of the Linear Congruential Generator (LCG). While conventional algorithms generally operate within the search space, the introduced technique follows a two-level architecture. In particular, an external loop that adaptively balances between exploration and exploitation, while the internal loop evaluates solutions. It is motivated by the intrinsic structure of the generator, the reason behind naming it the Structured Linear Congruential Generator (S- LCG). which enjoys a number of unique characteristics as follows: 1) a memoryless scheme, which ensures non-overlapping sequences based on distinct seeds, thus ensuring no evaluation redundancy; 2) bit splitting representation, which converts LCG states into multi-dimensional points to overcome the Marsaglia lattice effect; 3) adaptive exploration-exploitation of the generator space, which leads to implicit optimization of the surrogate smooth objective function; and 4) constant information gathering speed to avoid the problem of premature convergence. Extensive testing on 26 benchmark functions across dimensions d = 2 to 30 demonstrates that S-LCG comes within 1% of the global optimum in 83.3% of 138 cases (100% at d = 2, 81.2% at d = 30) while the nearest competitor GA achieved 75.4%. Statistical validation shows that S-LCG outperforms eight cutting-edge binary algorithms. Furthermore, its practical value is confirmed by validation on three constrained engineering design problems. In the end, S-LCG offers an optimization framework that is strictly reproducible and requires only one sensitive parameter to be tuned.
Read the full abstract

Algebraic Topology

Stable homotopy theory of higher categories

Stable homotopy theory is governed by the principle that inverting the operation of forming loop spaces produces representing objects for homology theories. We show that this principle is not specific to topology but reflects an intrinsic structural feature of higher category theory: inverting the operation of forming endomorphism $(\infty,\infty)$-categories leads to a stable homotopy theory of higher categories, in which higher categories play the role of spaces and categorical spectra represent homology theories of higher categories. This theory necessarily requires enrichment in the Gray tensor product, reflecting its genuinely higher-categorical nature. Classical stable homotopy theory is recovered by passing to classifying spaces. Its fundamental mechanisms arise as shadows of richer categorical phenomena: stabilization is governed by a categorical Freudenthal suspension theorem, whose classical counterpart arises by passing to classifying spaces. Our main result is a categorical Brown representability theorem classifying homology theories of higher categories by categorical spectra. As a consequence, categorical homology theories give rise to categorical analogues of long exact sequences and to homological algebra of higher categories. As guiding example we study categorical homology, the categorical homology theory whose coeffients are the natural numbers, and prove a Hurewicz theorem and Eilenberg-Zilber theorem.
Read the full abstract

Probability

Grokability in five inequalities

In this note, we report five mathematical discoveries made in collaboration with Grok, all of which have been subsequently verified by the authors. These include an improved lower bound on the maximal Gaussian perimeter of convex sets in $\mathbb{R}^n$, sharper $L_2$-$L_1$ moment comparison inequalities on the Hamming cube $\{-1,1\}^n$, a strengthened autoconvolution inequality, improved asymptotic bounds on the size of the largest $g$-Sidon sets in $\{1,\dots,n\}$, and an optimal balanced Szarek's inequality.
Read the full abstract

Classical Analysis and ODEs

Almost-Orthogonality in Lp Spaces: A Case Study with Grok

Carbery proposed the following sharpened form of triangle inequality for many functions: for any $p\ge 2$ and any finite sequence $(f_j)_j\subset L^p$ we have \[ \Big\|\sum_j f_j\Big\|_p \ \le\ \left(\sup_{j} \sum_{k} \alpha_{jk}^{\,c}\right)^{1/p'} \Big(\sum_j \|f_j\|_p^p\Big)^{1/p}, \] where $c=2$, $1/p+1/p'=1$, and $\alpha_{jk}=\sqrt{\frac{\|f_{j}f_{k}\|_{p/2}}{\|f_{j}\|_{p}\|f_{k}\|_{p}}}$. In the first part of this paper we construct a counterexample showing that this inequality fails for every $p>2$. We then prove that if an estimate of the above form holds, the exponent must satisfy $c\le p'$. Finally, at the critical exponent $c=p'$, we establish the inequality for all integer values $p\ge 2$. In the second part of the paper we obtain a sharp three-function bound \[ \Big\|\sum_{j=1}^{3} f_j\Big\|_p \ \le\ \left(1+2\Gamma^{c(p)}\right)^{1/p'} \Big(\sum_{j=1}^{3} \|f_j\|_p^p\Big)^{1/p}, \] where $p \geq 3$, $c(p) = \frac{2\ln(2)}{(p-2)\ln(3)+2\ln(2)}$ and $\Gamma=\Gamma(f_1,f_2,f_3)\in[0,1]$ quantifies the degree of orthogonality among $f_1,f_2,f_3$. The exponent $c(p)$ is optimal, and improves upon the power $r(p) = \frac{6}{5p-4}$ obtained previously by Carlen, Frank, and Lieb. Some intermediate lemmas and inequalities appearing in this work were explored with the assistance of the large language model Grok.
Read the full abstract

All authors Ziang Chen, Jaume de Dios Pont, Paata Ivanisvili, Jose Madrid, Haozhu Wang

Information Theory · Cross-listed from stat.ML

Sharp Capacity Thresholds in Linear Associative Memory: From Top-1 Retrieval to Tail-Average Learning

How many key-value associations can a $d\times d$ linear memory store? The answer depends not only on the $d^2$ degrees of freedom in the memory matrix, but also on the retrieval criterion. Under isotropic Gaussian embeddings, we prove a sharp threshold for top-1 retrieval, where every signal must beat its largest distractor: the critical value of $d^2/(n\log n)$ is $2$. Above the threshold, we explicitly construct a linear memory that retrieves all $n$ associations with high probability; below it, no data-dependent linear memory can do so. The $\log n$ factor is therefore the unavoidable extreme-value cost of winner-take-all decoding. Without the logarithmic factor—that is, when $n/d^2\to\alpha\in(0,\infty)$—simultaneous top-1 retrieval is impossible. The matched target can nevertheless remain near the top of the ranking. We capture this weaker retrieval goal with the Tail-Average Margin (TAM), which, for list size $k$, compares each signal with the average of its $k$ strongest competitors; a positive TAM margin certifies that the target belongs to the top-$k$ candidate list. When $k/n\to r\in(0,1)$, we learn the memory by empirical risk minimization with a smoothed TAM objective and derive an exact high-dimensional characterization through a two-parameter scalar variational problem. The result gives limiting laws for signal and competitor scores, margins, and percentile ranks. Sending the ridge parameter to zero after the high-dimensional limit yields a closed-form critical load $\alpha_c(r)$ separating vanishing from positive average loss. The analysis in this work also develops a coupled leave-one-out method for matrix-valued empirical risk problems in which each sample enters many dependent comparisons, a tool that may be useful beyond associative memory.
Read the full abstract

All authors Nicholas Barnfield, Juno Kim, Eshaan Nichani, Jason D. Lee, Yue M. Lu

Number Theory

Appell function proofs of recent and old mock theta function identities

In this note we give new proofs of two recent mock theta function identities discovered by Garvan and Mukhopadhyay. We also give a new proof of an old mock theta function identity of Watson. Using the setting of Appell function properties as first introduced and developed by Hickerson and Mortenson, we demonstrate that the identities are similar to certain tenth-order and sixth-order mock theta function identities found in Ramanujan's lost notebook. Our approach suggests more identities like those of Garvan and Mukhopadhyay.
Read the full abstract

Dynamical Systems

Boundaries of Baker domains of entire functions. A finer approach

We consider transcendental entire functions having doubly parabolic Baker domains, such that the Denjoy-Wolff point of the associated inner function is not a singularity. We describe in a very precise way the dynamics on the boundary from a measure-theoretical point of view. Applications of such results lead to a better understanding of the topology and the dynamics on the boundaries. In particular, we improve some of the results in [N. Fagella and A. Jové, A model for boundary dynamics of Baker domains], for the Baker domain of $z+e^{-z}$. In fact, our conclusions are obtained by applying new results established here on the dynamics of the radial extension of one component doubly parabolic inner functions, which strengthen those of [O. Ivrii and M. Urbański, Inner functions, composition operators, symbolic dynamics and thermodynamic formalism].
Read the full abstract

Analysis of PDEs

Numerical study of the 2D Kaup-Broer-Kuperschmidt Boussinesq system

In this work we consider the well posed version of the Kaup-Broer-Kuperschmidt system in two dimensions. We numerically construct soliton type solutions and show that they are unstable both against dispersion and singularity formation. Further, we study line solitons and their stability, as well as generally localised initial data. In either case we fail to find stable structures.
Read the full abstract

All authors Théo Gaudry, Christian Klein, Jean-Claude Saut, Nikola Stoilov

Combinatorics

Note on zero-sum magic squares on Abelian groups

Let $(\Gamma,+)$ be an Abelian group of order $n^2$. A $\Gamma$-magic square of order $n$ is an $n\times n$ array whose entries are pairwise distinct elements of $\Gamma$ such that all row sums, column sums, and the two main diagonal sums are equal to the same element $\mu \in \Gamma$, called the magic constant. A combinatorial design is called $\Gamma$-additive if its point set is a subset of an Abelian group $\Gamma$ and every block has sum zero. If the point set coincides with $\Gamma$, the design is said to be strictly $\Gamma$-additive. Motivated by this notion, we construct $\Gamma$-magic squares with magic constant $\mu=0$ whose rows, columns, and two main diagonals can be used as blocks of a strictly $\Gamma$-additive design. We call such a square zero-sum $\Gamma$-magic square. In this paper, we establish necessary and sufficient conditions for the existence of zero-sum $\Gamma$-magic squares.
Read the full abstract