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 25 February

Combinatorics

Pólya enumeration, wreath product symmetric functions, and moduli spaces of curves

We develop a calculus for $S_n$-equivariant Euler characteristics of moduli spaces of stable curves and stable maps. Our approach involves an enrichment of Pólya's cycle index polynomial of a graph to a certain algebra $\Lambda^{[2]}$ of wreath product symmetric functions. Building on foundational work of Macdonald, we prove that $\Lambda^{[2]}$ may be viewed as the Grothendieck ring of the category of polynomial functors which map symmetric sequences of vector spaces to vector spaces. This interpretation gives rise to an action of $\Lambda^{[2]}$ on the ordinary ring of symmetric functions $\Lambda$, which is described concretely in terms of Adams operations and skewing by power sums. This action lets us deduce appealing formulas, involving only ordinary symmetric functions, for generating functions of $S_n$-equivariant Euler characteristics.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Fundamental Limits on QBER and Distance in Quantum Key Distribution

Quantum key distribution (QKD) enables information-theoretic secure communication, yet its ultimate tolerance to noise and achievable transmission distance remain fundamentally constrained. We establish the maximum quantum bit error rate (QBER) compatible with secure QKD and derive corresponding upper bounds on communication distance. Our results follow from a fundamental capacity threshold for qubit Pauli channels and apply to protocols based on two or more mutually unbiased bases, using either single-photon or weak coherent sources. By connecting information-theoretic limits to realistic physical noise models, we obtain universal bounds on achievable distances in fiber and free-space links, including diffraction-limited constraints relevant to deep-space quantum communications. These findings clarify the ultimate noise robustness of QKD and delineate the fundamental boundaries of secure quantum communication.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Twisting BFSS & IKKT

In this note we initiate the study of “twisted holography” for the dualities involving the BFSS matrix quantum mechanics and the IKKT matrix model in their $N \rightarrow \infty$ limits. We identify the admissible twists of each model, compute their cohomology in the BV-BRST formalism, and identify them – in the planar limit and in perturbation theory around the trivial background – with corresponding twists of IIA and IIB string theories, respectively. The twisted gravitational duals make manifest certain infinite dimensional symmetry algebras. In the BFSS example, the dual IIA supergravity twists are also obtained as certain zero mode truncations of the minimal (1/16-BPS) and maximal (1/4-BPS) twists of eleven-dimensional supergravity.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Taxonomy of integrable and ground-state solvable models: Jastrow wave functions on graphs and parent Hamiltonians

We introduce a family of many-body systems of distinguishable continuous-variable particles in which interparticle interactions are set by the adjacency matrix of a graph. The ground-state wave function of such systems is of a generalized Jastrow form involving the product of pair-correlation functions over the edge set of the graph. These systems describe quantum fluids when the graph is complete, and the pair function has a well-defined permutation symmetry. In general, they provide the continuous-variable generalization of spin systems on graphs, with broken permutation symmetry. The corresponding parent Hamiltonian is shown to include (a) two-body interactions determined by the graph adjacency matrix and (b) three-body interactions over all possible 2-paths on the graph. Employing elements of graph theory, we chart the landscape of models, recovering known instances in the literature and providing numerous new examples of ground-state solvable models for which the system Hamiltonian, ground-state wave function, and corresponding energy eigenvalue are specified.
Read the full abstract

Information Theory

Queue occupancy and server size distribution of a queue length dependent vacation queue with an optional service

The discrete time queueing system is highly applicable to modern telecommunication systems, where it provides adaptive packet handling, congestion controlled security/inspection, energy efficient operation, and supports bursty traffic common in 5G, Internet of Things (IoT), and edge computing environments. In this article, we analyze an infinite-buffer discrete-time batch-arrival queue with single and multiple vacation policy where customers are served in batches, in two phases, namely first essential service (FES) and second optional service (SOS). In such systems, the FES corresponds to basic data processing or packet routing, while SOS represents secondary tasks such as encryption, error checking, data compression, or deep packet inspection that may not be necessary for every packet. Here, we derive the bivariate probability generating functions for the joint distribution of the number of packets waiting for transmission and the number are being processed immediately after the completion of both the FES and SOS. Furthermore, the complete joint distribution at arbitrary time slots, including vacation completion states, is established. Numerical illustrations demonstrate the applicability of the proposed framework, including an example with discrete phase type service time distribution. Finally, the sensitivity analysis of the key parameters on marginal system's probabilities and different performance measures have been investigated through several graphical representations.
Read the full abstract

Information Theory · Cross-listed from cs.LG

OmniZip: Learning a Unified and Lightweight Lossless Compressor for Multi-Modal Data

Lossless compression is essential for efficient data storage and transmission. Although learning-based lossless compressors achieve strong results, most of them are designed for a single modality, leading to redundant compressor deployments in multi-modal settings. Designing a unified multi-modal compressor is critical yet challenging, as different data types vary largely in format, dimension, and statistics. Multi-modal large language models offer a promising resolution but remain too complex for practical use. Thus, we propose OmniZip, a unified and lightweight lossless compressor for multi-modal data (like image, text, speech, tactile, database, and gene sequence). Built on a lightweight backbone, OmniZip incorporates three key components to enable efficient multi-modal lossless compression: a modality-unified tokenizer that reversibly transforms diverse data into tokens, a modality-routing context learning mechanism that enables flexible multi-modal context modeling, and a modality-routing feedforward design that further enhances the model's nonlinear representation flexibility. A reparameterization training strategy is used to enhance model capacity. OmniZip outperforms or matches other state-of-the-art compressors on multiple modalities, achieving 42%, 57%, 62% and 42%, 53% higher compression efficiency than gzip on CLIC-M, TouchandGo, enwik9, LibriSpeech, and WikiSQL datasets, respectively. It also supports near real-time inference on resource-constrained edge devices, reaching about 1MB/s on MacBook CPUs and iPhone NPUs. Our code is released at https://github.com/adminasmi/OmniZip-CVPR2026.
Read the full abstract

All authors Yan Zhao, Zhengxue Cheng, Junxuan Zhang, Dajiang Zhou, Qunshan Gu, Qi Wang, Li Song

Combinatorics

A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees

The maximum agreement forest (MAF) problem in phylogenetics takes as input a set t >= 2 of binary phylogenetic trees T on the same set of taxa X. It asks for a partition of X into the smallest number of blocks such that the subtrees induced by these blocks are disjoint and have common topology across all the trees in T. We produce a modified version of the well-known chain reduction rule in order to prove that after exhaustive application of reduction rules each tree has O( t * r * k ) leaves, where k is the natural parameter (the number of blocks) and r=min{max{k,3},t+1}}. We prove this bound for both the unrooted and rooted version of the problem, and demonstrate that the bound r, the length to which common chains are truncated, is tight. Our results constitute the first kernels for MAF in the t>2 regime.
Read the full abstract

Probability · Cross-listed from cs.LG

Support Tokens, Stability Margins, and a New Foundation for Robust LLMs

Self-attention is usually described as a flexible, content-adaptive way to mix a token with information from its past. We reinterpret causal self-attention transformers, the backbone of modern foundation models, within a probabilistic framework, much as classical PCA is extended to probabilistic PCA. This reformulation reveals a key structural consequence of the underlying change of variables: a barrier constraint emerges on the parameters of self-attention. The resulting geometry exposes a degeneracy boundary where the attention-induced mapping becomes locally ill-conditioned, yielding a stability-margin interpretation analogous to the margin in support vector machines. This, in turn, naturally gives rise to the concept of support tokens. We further show that causal transformers define a consistent stochastic process over infinite token sequences, providing a rigorous probabilistic foundation for sequence modeling. Building on this view, we derive a Bayesian MAP training objective that requires only a minimal modification to standard LLM training: adding a smooth log-barrier penalty to the usual cross-entropy loss. Empirically, the resulting training objective improves robustness to input perturbations and sharpens the margin geometry of the learned representations without sacrificing out-of-sample accuracy.
Read the full abstract

All authors Deepak Agarwal, Dhyey Dharmendrakumar Mavani, Suyash Gupta, Karthik Sethuraman, Tejas Dharamsi

Analysis of PDEs

Real involutive systems on compact Lie groups

On a compact connected Lie group $G$, we study the global solvability and the cohomology spaces of the differential complex associated with an essentially real involutive structure that is invariant under left translations. We prove that solvability in the first degree of the complex implies solvability in all other degrees, and furnish a converse for this fact under a certain commutativity hypothesis (that always holds when $G$ is a torus). Additionally, it is proved that the solvability holds when the structure comes from the Lie algebra of a closed subgroup of $G$. We also investigate real tube structures when $G$ is the base manifold.
Read the full abstract

All authors Gabriel Araújo, Igor A. Ferra, Max R. Jahnke, Luis F. Ragognette

Mathematical Physics · Cross-listed from quant-ph

Quantum jumps in open cavity optomechanics and Liouvillian versus Hamiltonian exceptional points

Exceptional points, where two or more eigenstates of a non-Hermitian system coalesce, are now of interest across many fields of physics, from the perspective of open-system dynamics, sensing, nonreciprocal transport, and topological phase transitions. In this work, we investigate exceptional points in cavity optomechanics, a platform of interest to diverse communities working on gravitational-wave detection, macroscopic quantum mechanics, quantum transduction, etc. Specifically, we clarify the role of quantum jumps in making a clear distinction between Liouvillian and Hamiltonian exceptional points in optomechanical systems. While the Liouvillian exceptional point arises from the unconditional Lindblad dynamics and is independent of the phonon-bath temperature, the Hamiltonian exceptional point emerges from the conditional no-jump evolution and acquires a thermal shift due to an enhanced conditional damping. Employing the thermofield formalism, we derive a unified spectral framework that interpolates between these regimes via an analytical hybrid-Liouvillian description. Remarkably, in the weak-quantum-jump regime, the exceptional point is perturbed only at the second order, highlighting the robustness of the Hamiltonian exceptional point under small hybrid perturbations. Our work reveals a continuous family of hybrid exceptional points, clarifies the operational and physical differences between the conditional and unconditional dissipative dynamics in optomechanical systems, and provides a probe for thermal baths.
Read the full abstract

Number Theory

Side lengths of cubes with vertices in $\mathbb Z^n$

We determine the set of side lengths of $d$-dimensional cubes with vertices in $\mathbb Z^n$ using Witt's cancellation theorem from the algebraic theory of quadratic forms.

Mathematical Physics · Cross-listed from quant-ph

Controlled jump in the Clifford hierarchy

We develop a simple and systematic route to higher levels of the qubit Clifford hierarchy by coherently controlling Clifford operations. Our approach is based on Pauli periodicity, defined for a Clifford unitary $U$ as the smallest integer $m\ge 1$ such that $U^{2^{m}}$ is a Pauli operator up to phase. We prove a sharp controlled-jump rule showing that the controlled gate $CU$ lies strictly in level $m+2$ of the hierarchy, and equivalently that $CU$ lies in level $k$ if $U^{2^{k-2}}$ is Pauli while no smaller positive power of $U$ is Pauli. We further quantify the resources required to realize large level jumps in the Clifford hierarchy by proving an essentially tight upper bound on Pauli periodicity as a function of the number of qubits, which implies that accessing high hierarchy levels through controlled Cliffords requires a number of target qubits that grows exponentially with the desired level. We complement this limitation with explicit infinite families of Pauli-periodic Cliffords whose controlled versions achieve asymptotically optimal jumps. As an application, we propose a protocol for preparing logical catalyst states that enable logical $Z^{1/2^k}$ phase gates via phase kickback from a single jumped Clifford.
Read the full abstract

Probability

A Cellular Representation of the Potts Lattice Higgs Model

The $i$-dimensional Potts lattice Higgs model is a random assignment of spins in $\mathbb{Z}_q$ to the $i$-dimensional cells of a cell complex induced by a Hamiltonian with a Potts interaction on the $(i+1)$-cells and an additional term playing the role of an external field. We develop a representation of this model as a pair of dependent plaquette percolations, and prove that Wilson line expectations can be expressed in terms of the probability of a topological event. As an application, we prove the existence of a phase transition for the Marcu–Fredenhagen ratio in the Potts lattice Higgs model on $\mathbb{Z}^d$ when $i=1.$
Read the full abstract

Algebraic Geometry

A characterization of projective space via lengths of extremal rays

We prove a new characterization of complex projective space using lengths of extremal rays.
Read the full abstract

All authors Osamu Fujino, Eric Jovinelly, Brian Lehmann, Eric Riedl

Commutative Algebra

Vanishing of local cohomology in unramified mixed characteristic

Given an ideal $I$ in a regular local ring $A$, the cohomological dimension of $I$ in $A$ is the index of the highest non-vanishing local cohomology of $A$ supported at $I$. Determining effective upper bounds on the cohomological dimension in terms of topological invariants of $\text{Spec}(A/I)$ is a central problem in commutative algebra. In equal characteristic, Faltings proved in 1980 a general bound on the cohomological dimension of an ideal in terms of its big height. In this article, we extend Faltings' result to the unramified mixed characteristic setting and show that the resulting bound is sharp.
Read the full abstract

Number Theory

Perfectoid unitary Shimura varieties and $p$-adic Eichler-Shimura map I

We investigate $p$-adic automorphic forms on unitary groups through the geometry of infinite-level unitary Shimura varieties and the Hodge-Tate period map. We first develop a perfectoid construction of overconvergent automorphic forms. Building on this, we establish a canonical overconvergent Eichler-Shimura map linking overconvergent cohomology to these $p$-adic automorphic forms. This map induces a comparison between the corresponding coherent sheaves on the eigenvariety, with applications to the study of its geometry and to $p$-adic $L$-functions.
Read the full abstract

Probability

Two-dimensional Coulomb gases with multiple outposts

We study two-dimensional Coulomb gases in the presence of $m\in\mathbb{N}_{>0}$ outposts. An outpost is a connected component of the coincidence set that lies outside the droplet. The case $m=1$ was previously investigated by Ameur, Charlier, and Cronvall. They showed that, as the total number of particles in the Coulomb gas tends to infinity, the number of particles accumulating near the outpost remains of order one and converges in distribution to the Heine distribution. In this work, we extend this analysis to the case of an arbitrary but fixed number $m$ of outposts. We prove that the joint distribution of the numbers of particles near the outposts converges to a multidimensional Heine distribution. Our results reveal a interesting phenomenon: although the outposts are geometrically disconnected, the particle count near each outpost is strongly correlated with the particle counts near all other outposts, not only the nearest ones (provided the outposts are not separated by a component of the droplet).
Read the full abstract

Combinatorics · Cross-listed from cs.CC

The Lens of Abelian Embeddings

We discuss a recent line of research investigating inverse theorems with respect to general k-wise correlations, and explain how such correlations arise in different contexts in mathematics. We outline some of the results that were established and their applications in discrete mathematics and theoretical computer science. We also mention some open problems for future research.
Read the full abstract

Combinatorics

Around homogeneity

Forty-five years ago, a young researcher in finite permutation group theory encountered a paper by Robert Woodrow. The homogeneous triangle-free graph Woodrow described there seemed to be an infinite analogue of the Higman–Sims graph which had played an important role in the researcher's thesis. The encounter changed the course of the researcher's career. This paper is the story of that event and its aftermath. The final section of the paper suggests that Fraïssé classes of rigid structures are a potentially interesting generalisation of Ramsey classes.
Read the full abstract

Statistics Theory

Confidence in confidence distributions!

The recent article `Satellite conjunction analysis and the false confidence theorem' (Balch, Martin, and Ferson, 2019, Proceedings of the Royal Society, Series A) points to certain difficulties with Bayesian analysis when used for models for satellite conjuntion and ensuing operative decisions. Here we supplement these previous analyses and findings with further insights, uncovering what we perceive of as being the crucial points, explained in a prototype setup where exact analysis is attainable. We also show that a different and frequentist method, involving confidence distributions, is free of the false confidence syndrome.
Read the full abstract

2602.22178 · 25 Feb · 5 pages, 2 figures. Statistical Research Report, Department of Mathematics, University of Oslo, February 2020, here arXiv'd February 2026. Published in Proceedings of the Royal Society, Series A, 2020, vo. 476, at this url: royalsocietypublishing.org/rspa/article/476/2237/20190781/56889

Optimization and Control

Applying a Random-Key Optimizer on Mixed Integer Programs

Mixed-Integer Programs (MIPs) are NP-hard optimization models that arise in a broad range of decision-making applications, including finance, logistics, energy systems, and network design. Although modern commercial solvers have achieved remarkable progress and perform effectively on many small- and medium-sized instances, their performance often degrades when confronted with large-cale or highly constrained formulations. This paper explores the use of the Random-Key Optimizer (RKO) framework as a flexible, metaheuristic alternative for computing high-quality solutions to MIPs through the design of problem-specific decoders. The proposed approach separates the search process from feasibility enforcement by operating in a continuous random-key space while mapping candidate solutions to feasible integer solutions via efficient decoding procedures. We evaluate the methodology on two representative and structurally distinct benchmark problems: the mean-variance Markowitz portfolio optimization problem with buy-in and cardinality constraints, and the Time-Dependent Traveling Salesman Problem. For each formulation, tailored decoders are developed to reduce the effective search space, promote feasibility, and accelerate convergence. Computational experiments demonstrate that RKO consistently produces competitive, and in several cases superior, solutions compared to a state-of-the-art commercial MIP solver, both in terms of solution quality and computational time. These results highlight the potential of RKO as a scalable and versatile heuristic framework for tackling challenging large-scale MIPs.
Read the full abstract

All authors Antonio A. Chaves, Mauricio G.C. Resende, Carise E. Schmidt, J. Kyle Brubaker, Helmut G. Katzgraber, Martin J.A. Schuetz

Number Theory

Burgess-type volume dependent bounds for character sums over $\mathbb{F}_{p^n}$

We establish a Burgess-type bound for short multiplicative character sums over finite fields $\mathbb{F}_{p^n}$. Let \[ B=\left\{\sum_{i=1}^{n}x_i\omega_i: N_i+1\le x_i\le N_i+H_i,1\le i\le n\right\}\subseteq\mathbb{F}_{p^n}, \] where $1\le H_i\le p$ for all $1\le i\le n$, and the side lengths satisfy $H_1\le H_2\le\cdots\le H_n.$ We prove that if the side lengths satisfy certain lower bounds in terms of the two largest side lengths, then a nontrivial cancellation occurs in the character sum over the boxes. This generalizes the work of Gabdullin \cite{GB} in dimensions $n=2,3$ to arbitrary dimension. This also generalizes the character sum estimate of Konyagin \cite{Kon} where each of the side lengths of the boxes are greater than $p^{1/4}$. The proof combines techniques from the geometry of numbers, multiplicative energy estimates, and Katz's bounds for multiplicative character sums.
Read the full abstract

Analysis of PDEs

Renormalised solutions to reaction-diffusion systems with interface conditions: Global existence and weak-strong uniqueness

We introduce an extension of the concept of renormalised solutions for entropy-dissipating reaction-diffusion systems due to J. Fischer (Arch. Ration. Mech. Anal. 218, 2015) to systems coupled by nonlinear interface conditions. For this notion of solution, we establish global existence as well as a weak-strong stability estimate. Our framework allows to handle entropy-dissipating interfacial transmission rates without growth restrictions, including power-law nonlinearities as arising in the thermodynamic modelling of dissipative bulk-interface systems via generalised gradient structures. Our analysis relies on suitable extensions of the species' densities across the interface as well as on a non-local truncated variant of the relative entropy.
Read the full abstract

Metric Geometry

(Semi-)Invariant Curves from Centers of Triangle Families

We study curves obtained by tracing triangle centers within special families of triangles, focusing on centers and families that yield (semi-)invariant triangle curves, meaning that varying the initial triangle changes the loci only by an affine transformation. We identify four two-parameter families of triangle centers that are semi-invariant and determine which are invariant, in the sense that the resulting curves for different initial triangles are related by a similarity transformation. We further observe that these centers, when combined with the aliquot triangle family, yield sheared Maclaurin trisectrices, whereas the nedian triangle family yields Limaçon trisectrices.
Read the full abstract

Algebraic Geometry

Pure extension of the theta divisor over the moduli space of abelian varieties

A theta divisor on the universal principally polarised abelian variety can be extended to a compactification either by taking the Zariski closure, or by taking the unique extension which is pure of weight 2. For the latter, following ideas of Yuan and Zhang, we need to pass to the category of adelic- or b-divisors. We show that the two choices of extension differ by a tropicalisation of the Riemann theta function. We prove an extension of Moret-Bailly's ”key formula” that features the pure weight 2 extension of the theta divisor, and discuss various arithmetic applications, including a ”universal” formula for the Néron–Tate height of a point. A key technical input is the systematic use of the theory of logarithmic abelian varieties due to Kajiwara, Kato, and Nakayama.
Read the full abstract

All authors Ana María Botero, José Ignacio Burgos Gil, David Holmes, Robin de Jong

Number Theory

Similitudes over fields with I^4=0

This article studies the set of R-equivalence classes of the group of proper projective similitudes of an algebra with involution of the first kind. The main results concern base fields of characteristic different from 2 over which every 9-dimensional quadratic form has a nontrivial zero. This includes function fields of p-adic curves and extensions of transcendence degree 3 of C. Main results of [28] and [29] are extended by relaxing the condition on the base field as well as on the Clifford invariant for orthogonal involutions.
Read the full abstract

Logic

Sheaves as oracle computations

In type theory, an oracle may be specified abstractly by a predicate whose domain is the type of queries asked of the oracle, and whose proofs are the oracle answers. Such a specification induces an oracle modality that captures a computational intuition about oracles: at each step of reasoning we either know the result, or we ask the oracle a query and proceed upon receiving an answer. We characterize an oracle modality as the least one forcing the given predicate. We establish an adjoint retraction between modalities and propositional containers, from which it follows that every modality is an oracle modality. The left adjoint maps sums to suprema, which makes suprema of modalities easy to compute when they are given in terms of oracle modalities. We also study sheaves for oracle modalities. We describe sheafification in terms of a quotient-inductive type of computation trees, and describe sheaves as algebras for the corresponding monad. We also introduce equifoliate trees, an intensional notion of oracle computation given by a (non-propositional) container. Equifoliate trees descend to sheaves, and modally cover them. As an application, we give a concrete description of all Lawvere-Tierney topologies in a realizability topos, closely related to a game-theoretic characterization by Takayuki Kihara.
Read the full abstract

Statistics Theory · Cross-listed from cs.LG

Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination

We study the basic task of mean estimation in the presence of mean-shift contamination. In the mean-shift contamination model, an adversary is allowed to replace a small constant fraction of the clean samples by samples drawn from arbitrarily shifted versions of the base distribution. Prior work characterized the sample complexity of this task for the special cases of the Gaussian and Laplace distributions. Specifically, it was shown that consistent estimation is possible in these cases, a property that is provably impossible in Huber's contamination model. An open question posed in earlier work was to determine the sample complexity of mean estimation in the mean-shift contamination model for general base distributions. In this work, we study and essentially resolve this open question. Specifically, we show that, under mild spectral conditions on the characteristic function of the (potentially multivariate) base distribution, there exists a sample-efficient algorithm that estimates the target mean to any desired accuracy. We complement our upper bound with a qualitatively matching sample complexity lower bound. Our techniques make critical use of Fourier analysis, and in particular introduce the notion of a Fourier witness as an essential ingredient of our upper and lower bounds.
Read the full abstract

All authors Ilias Diakonikolas, Giannis Iakovidis, Daniel M. Kane, Sihan Liu

Combinatorics

Enumeration of Nondegenerate $2 \times (k+1) \times k$ Hypermatrices

We consider the problem of enumerating hypermatrices of format $2 \times (k + 1) \times k$ over a finite field that have nonzero hyperdeterminant and whose nonzero entries are restricted to a plane partition. We conjecture an attractive product formula for the enumeration, and prove it in many cases. In general, we show that the enumeration is given (up to a power of $q - 1$) by a polynomial in $q$ with nonnegative integer coefficients, whose value at $q = 1$ enumerates a natural family of three-dimensional rook placements.
Read the full abstract

Number Theory

Second moment of $\textrm{GL(3)} \times \textrm{GL(2)}$ $L$–functions

For $M_1$ and $ M_2$ two distinct primes, let $ H_k^\star(M_1M_2, \psi)$ denote the set of primitive newforms of level $M_1M_2$, weight $k\geq 3$ and Nebentypus $\psi$ of conductor $M_1$. Let $\pi$ be a fixed $SL(3, \mathbb{Z})$ Hecke cusp form. We prove a Lindelöf–consistent upper bound for the second moment \[ \mathop{ \sum_{\substack{\psi(M_1) \\ \psi(-1)=(-1)^k }}} \sideset{}{^h}\sum_{f \in H_k^{\star}(M_1M_2,\psi)} |L(1/2, \pi \times f)|^2 \ll_{\pi,\epsilon} M_1^{1+\epsilon}\] in the range $M_2\leq M_1^{1+\epsilon}$.
Read the full abstract