Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 15 March

Optimization and Control

Second order necessary conditions for quantum stochastic optimal control problems

This paper aims to establish second order necessary conditions for optimal control in quantum stochastic systems. We employ a variational approach, analogous to methods in classical stochastic control, to analyze systems governed by quantum stochastic differential equations driven by fermionic Brownian motion, where the control enters both the drift and diffusion terms. This result provides a theoretical foundation for further exploration of optimization problems and their practical applications in the field of quantum stochastic control.
Read the full abstract

Analysis of PDEs

On the $q$-analogue of Duhamel's principle

In this paper, we revisit the classical Duhamel's principle and provide a self-contained proof of this fundamental tool for linear evolution equations and systems of coupled equations. Moreover, we establish a $q$-analogue of Duhamel's principle for $q$-evolution equations of order $k\geq 1$ generated by Jackson's $q$-difference operator.
Read the full abstract

Optimization and Control

Strong convergence, perturbation resilience and superiorization of Generalized Modular String-Averaging with infinitely many input operators

We study the strong convergence and bounded perturbation resilience of iterative algorithms based on the Generalized Modular String-Averaging (GMSA) procedure for infinite sequences of input operators under a general admissible control. These methods address a variety of feasibility-seeking problems in real Hilbert spaces, including the common fixed point problem and the convex feasibility problem. In addition to the general case, involving certain strongly quasi-nonexpansive input operators, we consider a specific subclass of their corresponding relaxed firmly nonexpansive operators. This subclass proves useful for establishing bounded perturbation resilience. We further demonstrate the applicability of our strong convergence results, within the GMSA framework, to the Superiorization Methodology and to Dynamic String-Averaging, analyzing the behavior of a superiorized version of our main algorithm. The novelty and significance of this work is that it not only includes a variety of earlier algorithms as special cases but, more importantly, it allows the use of modular options of string-averaging that give rise to new, hitherto unavailable, algorithmic schemes with emphasis on infinitely many input operators. The strong convergence guarantees and the applications for superiorization and dynamic string-averaging are also important facets.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

On aggregation-quantization permutability problem for discrete-time Markov chains

Given random walk on a graph, the corresponding discrete-time quantum walk can be constructed using the method proposed by Szegedy. On the other hand, given a partition of the set of states of a Markov chain, one can study the corresponding aggregated process. We extend the aggregation technique to the level of quantum Markov chains. We provide conditions under which application of these two operations - Szegedy's quantization and aggregation - give the same result. These consist of the strong lumpability of the underlying Markov chain supplemented by nonlinear relations, generalizing Kolmogorov's cycle condition, that account for the coefficients of both the original and the aggregated transition matrices. In particular, we show that the conditions are satisfied in the case of the random walk on graphs equipped with equitable partitions. We present several examples, which include the classical/quantum walks on Platonic solids. We discuss also relation of discrete-time classical/quantum walks on $N$-dimensional hypercube and the Ehrenfests urn model with $N$ particles. We apply our technique for of discrete-time walks on Cayley graphs of free groups. We also compare our results with those obtained using Cantero-Moral-Velazquez uniformization of unitary matrices.
Read the full abstract

Group Theory

On SS-quasinormalities of the maximal subgroup series of finite groups

Let $G$ be finite group. A subgroup $H$ of $G$ is said to be an $SS$-quasinormal subgroup of $G$, if there exists a subgroup $B$ of $G$ such that $G = HB$ and $H$ permutes with every Sylow subgroup of $B$. Let $\Omega: G=G_0>G_1>\cdots>G_{n-1}>G_n=1$ be a maximal subgroup series of $G$, where $G_i$ is a maximal subgroup of $G_{i-1}$ for every $i = 1, \ldots , n$. In this paper, we investigate the finite groups $G$ that admit an $SS$-quasinormal maximal subgroup series, i.e., all $G_i$ are $SS$-quasinormal in $G$. First, we prove that if $G$ possesses an $SS$-quasinormal maximal subgroup series, then $G$ is solvable. Furthermore, we show that $G$ is supersolvable if and only if $G$ possesses an $SS$-quasinormal maximal subgroup series which is subnormal in $G$.
Read the full abstract

Logic

A $wtt$-introimmune set in \texorpdfstring{$\Pi^0_1$}{Pi01} and introimmunity for several reducibilities

We prove that there exists a weak truth-table introimmune set in the class $\Pi^0_1$, settling the question left open in previous work of whether the known $\Delta^0_2$ existence result can be improved to $\Pi^0_1$. Since $\Sigma^0_1$ sets cannot be immune, this is best possible for weak truth-table introimmunity. We also study introimmunity for Jockusch's bounded-search reducibility $\le_{bs}$ and Andersen's Dartmouth reducibility $\le_D$, proving the existence of $\Delta^0_2$ sets that are $bs$-introimmune and $D$-introimmune; hence there also exists a $\Delta^0_2$ $D^+$-introimmune set. We next consider the classical reducibility $\le_Q$, which is not contained in $\le_T$ on all subsets of $\omega$. We show that no infinite $\Pi^0_1$ set is $Q$-introimmune, while a $\Delta^0_2$ $Q$-introimmune set does exist. Thus the existence of $\Delta^0_2$ $Q$-introimmune sets is best possible within the arithmetical hierarchy. Finally, for enumeration reducibility $\le_e$, we show that no infinite $\Pi^1_1$ set is $e$-introimmune, although $e$-introimmune sets do exist in the unrestricted sense. The proofs combine finite-injury priority arguments with dynamic spacing methods for $\le_{wtt}$, $\le_{bs}$, and $\le_D$, a bit-by-bit finite-extension construction for $\le_Q$, and an application of Soare's abstract existence theorem in the enumeration case.
Read the full abstract

Combinatorics

Covering Hypercube $mB^n$

The Alon–Füredi theorem determines the minimum number of hyperplanes needed to cover every nonzero vertex of the Boolean cube while avoiding the origin. We study hyperplane coverings with multiplicity for the generalized hypercube $mB^n=\{0,1,\ldots,m\}^n$. Our main result is a polynomial multiplicity theorem extending the theorem of Sauermann and Wigderson to $mB^n$, with sharp degree bounds for polynomials having prescribed high-order zeros. We apply this result to obtain lower and upper bounds for hyperplane coverings with multiplicity and determine the exact minimum number of hyperplanes for coverings with multiplicities $k=1,2$. In the special case of the Boolean cube, our constructions improve the upper bound of Clifton and Huang for certain ranges of the parameters.
Read the full abstract

Analysis of PDEs

Uniform boundedness for the two-dimensional Keller-Segel system with Gompertz growth

It is known that in two dimensions the classical Keller-Segel model can lead to cell aggregation. This behavior can be controlled by adding a logistic growth term with quadratic decay. Researchers have tried to find weaker damping mechanisms that can still stabilize the system. Previous work showed that, under suitable assumptions on the initial cell distribution, even weaker growth terms than the classical logistic one can prevent aggregation. In this paper, we study the effect of a Gompertz-type growth term in a minimal two-dimensional chemotaxis model. This term provides a weaker damping effect than those previously considered. We analyze how it influences the system and identify conditions that guarantee that solutions exist for all time and remain bounded.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Sampling Boltzmann distributions via normalizing flow approximation of transport maps

In a celebrated paper \cite{noe2019boltzmann}, Noé, Olsson, Köhler and Wu introduced an efficient method for sampling high-dimensional Boltzmann distributions arising in molecular dynamics via normalizing flow approximation of transport maps. Here, we place this approach on a firm mathematical foundation. We prove the existence of a normalizing flow between the reference measure and the true Boltzmann distribution up to an arbitrarily small error in the Wasserstein distance. This result covers general Boltzmann distributions from molecular dynamics, which have low regularity due to the presence of interatomic Coulomb and Lennard-Jones interactions. The proof is based on a rigorous construction of the Moser transport map for low-regularity endpoint densities and approximation theorems for neural networks in Sobolev spaces. Numerical simulations for a simple model system and for the alanine dipeptide molecule confirm that the true and generated distributions are close in the Wasserstein distance. Moreover we observe that the RealNVP architecture does not just successfully capture the equilibrium Boltzmann distribution but also the metastable dynamics.
Read the full abstract

Analysis of PDEs

Variational characterizations of weighted eigenvalue and basic reproduction ratio for nonlocal dispersal systems and application

The basic reproduction ratio is a crucial threshold parameter in infectious disease models. In nonlocal dispersal systems, its variational characterization is challenging due to the possible absence of a principal eigenvalue caused by non-compactness. In this paper, we aim to establish such a characterization even when the principal eigenvalue does not exist. To this end, we first study the spectral bound of a class of nonlocal dispersal operators, establishing a Collatz-Wielandt characterization as well as a Rayleigh-Ritz characterization when the operator is self-adjoint. Using this, we characterize the unique parameter value at which the spectral bound equals zero, covering both non-degenerate and partially degenerate cases, and subsequently obtain an explicit expression for the basic reproduction ratio. To demonstrate the utility of our theoretical framework, we apply it to a nonlocal dispersal SIS epidemic model with saturated incidence rate. The analysis shows that, in the degenerate case of the saturation coefficient, the limiting behavior of the basic reproduction ratio as the total population tends to zero is strikingly different from that in local diffusion case.
Read the full abstract

Analysis of PDEs

Lower and Upper Bounds for Sums of Eigenvalues of the Fractional-Logarithmic Laplacian

In this work, we establish lower and upper bounds for sums of the Dirichlet eigenvalues of the fractional-logarithmic Laplacian. A main challenge in such a study comes from the fact that this operator has a Fourier symbol that is not globally monotone in its radial variable due to its low-frequency behavior. The bounds have the correct leading-order asymptotic. To complement the theoretical analysis, we also present a one-dimensional finite element approximation of the fractional-logarithmic eigenvalue problem. We compare the computed eigenvalue sums with the explicit lower bound and the principal asymptotic term
Read the full abstract

Combinatorics

Towards the characterization of minimum weight codewords of Schubert codes

A formula for the minimum weight of Schubert codes was conjectured by Ghorpade and Lachaud in 2000. This was established by Xiang in 2008. In 2018, Ghorpade and Singh provided a new proof of this conjecture. Moreover, they also conjectured that the minimum weight codewords of the Schubert codes $C_\a (\ell, m)$ are given by the so-called Schubert decomposable codewords. We prove the validity of the conjecture for all Schubert varieties $\Omega_{\a}(\ell, V_m)$ for all but finitely many values of $q$.
Read the full abstract

Information Theory

Identification for ISI Gaussian Channels

We establish lower and upper bounds for the identification capacity of discrete-time Gaussian channels subject to inter-symbol interference (ISI), a canonical model in wireless communication. Our analysis accounts for deterministic encoders under peak power constraint. A principal finding is that, even when the number of ISI taps scales sub-linearly with the codeword length $n$ as $\sim n^{\kappa}$ with $\kappa \in [0,1/2),$ the number of messages that can be reliably identified grows super-exponentially in $n$ as $\sim 2^{(n \log n)R},$ where $R$ denotes the coding rate.
Read the full abstract

Analysis of PDEs

Absence of the Lavrentiev phenomenon for degenerate parabolic double phase problems

We establish the absence of the Lavrentiev phenomenon for degenerate parabolic double phase problems. Any finite-energy function in the natural parabolic class admits smooth approximations with convergence in the parabolic Sobolev space and convergence of the corresponding energy. We provide explicit gap bound conditions and derive improved bounds under additional assumptions such as boundedness or stronger time regularity.
Read the full abstract

Number Theory

Elliptic curves with rank one and nontrivial 2-part of Tate Shafarevich groups over the $\mathbb{Z}_2$-extension of $\mathbb{Q}$

Let $\mathbb{Q}_\infty$ be the cyclotomic $\mathbb{Z}_2$-extension over $\mathbb{Q}$. For each integer $n\geq1$, let $\mathbb{Q}_n$ denote the unique subfield in $\mathbb{Q}_\infty$ such that $[\mathbb{Q}_\infty:\mathbb{Q}]=2^n$. Denote by $\mathbb{Z}_2[{\rm Gal}(\mathbb{Q}_n/\mathbb{Q})]$ the group ring of ${\rm Gal}(\mathbb{Q}_\infty/\mathbb{Q})$. For any elliptic curve defined over $\mathbb{Q}$ with odd conductor, the Mazur-Tate modular element associated with the curve is an element of $\mathbb{Z}_2[{\rm Gal}(\mathbb{Q}_n/\mathbb{Q})]$. In this paper, for each $n$, we study the $2$-adic properties of Mazur-Tate modular elements associated with quadratic twists of elliptic curves, under specializations by finite order characters of ${\rm Gal}(\mathbb{Q}_n/\mathbb{Q})$. Using the congruence properties of Heegner points and an equivariant version of the Coates-Wiles theorem, we construct an elliptic curve $E/\mathbb{Q}$ and a family of quadratic twists $E^{(m)}$ of $E$ such that each $E^{(m)}$ has both analytic and algebraic rank one over $\mathbb{Q}_\infty$, and whose Tate-Shafarevich group is infinite over $\mathbb{Q}_\infty$.
Read the full abstract

Probability

Mobility Edge for the Anderson Model on Random Regular Graphs

We determine the phase diagram of the Anderson tight-binding model on random regular graphs with Gaussian disorder and sufficiently large degree. In particular, we prove that if the degree is fixed and the number of vertices goes to infinity, the spectrum asymptotically consists of a finite delocalized interval surrounded by two unbounded localized components. Our argument uses a recent description of the spectrum of the tight-binding model on the Bethe lattice (Aggarwal–Lopatto, 2025). By viewing the Bethe lattice as the local limit of a random regular graph, and establishing suitable concentration, eigenvalue-counting, and resolvent estimates, we transfer this characterization of the spectrum of the limiting model to the finite-volume setting.
Read the full abstract

Combinatorics

Bounds for smooth Fano polytopes

We characterize smooth Fano polytopes in terms of their delta-vector and f-vector. As an application we prove that the delta-vector of a smooth Fano polytope is unimodal and we give upper and lower bound on the volume of smooth Fano polytopes.

Numerical Analysis

A backward problem for the time-fractional pseudo-parabolic equation with a variable coefficient

This work addresses an inverse reconstruction task for a time-fractional pseudo-parabolic model with a temporally varying coefficient. By imposing Dirichlet boundary conditions, we aim to recover the unknown initial state from observations collected at the final time. From a theoretical perspective, we derive existence and uniqueness results by proving that, under suitable hypotheses, the problem admits a unique solution. Computationally, we introduce a finite-difference discretisation based on a time-stepping strategy and provide a detailed stability and convergence analysis. Leveraging the resulting forward solver, we then formulate an initial-data identification procedure using Tikhonov regularisation. The proposed approach is validated with numerical simulations, and its resilience is assessed via experiments that incorporate perturbations in the final-time measurements.
Read the full abstract

Numerical Analysis

Inference of interacting kernel in the mean-field regime

We study the problem of reconstructing interaction kernels in systems of interacting agents from macroscopic measurements when posed as an optimization problem. The reconstruction procedure depends on the formulation of the forward model, which may be given either by a finite-dimensional coupled ODE system tracking individual agent trajectories or by a mean-field PDE describing the evolution of the agent density. We investigate the similarities and differences between these two formulations in the mean-field regime. While the first variation derived from the particle system does not provide an unbiased estimator of the first variation associated with the limiting PDE, we prove that, under mild assumptions, the two are close in a weak sense with a convergence rate $\mathcal{O}(N^{-1/2})$. This rate is further confirmed by numerical evidences.
Read the full abstract

All authors Peiyi Chen, Qin Li, Li Wang, Yunan Yang

Dynamical Systems

Data-driven Experimental Modal Analysis by Dynamic Mode Decomposition

This paper discusses the application of Dynamic Mode Decomposition (DMD) to the extraction of modal properties of linear mechanical systems, i.e., experimental modal analysis (EMA). First, theoretical background of the DMD is briefly reviewed and its relevance to the Ibrahim time-domain method is discussed. Second, DMD is applied to a single DOF system and multi-DOF discrete system to discuss the applicability and interpretation of the DMD as a method of EMA. Furthermore, the effects of measurement errors on the results of DMD are discussed. It is shown that with relatively small measurement errors, DMD can capture modal parameters accurately. However, with relatively large measurement errors, DMD fails to capture modal parameters. Finally, DMD is applied to experimentally-obtained displacement field of a cantilevered beam, and its modal parameters are extracted. It is shown that the modal parameters extracted by DMD are as accurate as the ones obtained by the existing modal parameter extraction method.
Read the full abstract

Combinatorics

Linear recurrences for non-log-concave independence polynomials of trees

We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these polynomials. As a consequence, we prove that the set of non-isolated limit points of their zeros lies on the circle $|z+1/3|=1/3$ in the complex plane. Building on these recurrences, we also exhibit infinite families of trees whose independence polynomials break log-concavity at one, two, and three consecutive indices, as well as finite families that break log-concavity at four and five consecutive indices. Our approach suggests that arbitrarily many consecutive breaks may be achievable, offering further insight into a question posed by Galvin [D. Galvin, Trees with non log-concave independent set sequences, arXiv:2502.10654v1, 2025].
Read the full abstract

Information Theory

Shared Sky, Shared Spectrum: Coordinated Satellite-5G Networks for Low-Altitude Economy

Driven by both technological development and practical demands, the low-altitude economy relying on low-altitude aircrafts (LAAs) is booming. However, neither satellites nor terrestrial fifth-generation (5G) networks alone can effectively satisfy the communication requirements for ubiquitous lowaltitude coverage. While full integration of satellites and 5G networks offers theoretical benefits, the associated overhead and complexity pose significant challenges for rapid deployment. As a more economical and immediately viable alternative, this paper investigates partially-integrated networks where satellites and 5G systems operate with coarse synchronization yet achieve coordinated spectrum sharing, pooling their capabilities to jointly serve LAAs. Leveraging the inherent position-awareness of LAAs, we propose a framework for joint time-frequency spectrum sharing with an adaptive synchronization time scale, where only large-scale channel state information (CSI) is required. To avoid solving the NP-hard optimization problem directly, link-feature-aided clustering is employed following a divide-andconquer strategy. The proposed framework achieves substantial performance gains with low overhead and complexity, enabling swift advancement of low-altitude applications while paving the way for future integrated satellite-terrestrial network evolution.
Read the full abstract

All authors Yanmin Wang, Wei Feng, Yunfei Chen, Baoquan Ren, Qingqing Wu, Cheng-Xiang Wang

Analysis of PDEs

Inverse boundary value problems of determining nonlinear coefficients for the JMGT equation

We consider inverse boundary value problems for the Jordan-Moore-Gibson-Thompson (JMGT) equation in nonlinear acoustics with quadratic nonlinearities of Kuznetsov-type and Westervelt-type. We show that the associated boundary Dirichlet-to-Neumann map uniquely determines the nonlinear coefficients $\beta$ in the Westervelt-type model, and the pair $(\beta,\kappa)$ in the Kuznetsov-type model, provided that the observation time is greater than the maximal boundary-to-boundary geodesic travel time. The results are obtained in both the Euclidean setting and on compact Riemannian manifolds with proper geometric assumptions. The proof is based on the idea of second order linearization combined with the construction of geometric optics and Gaussian beam solutions, reducing the inverse problem of uniqueness to the injectivity of associated geodesic ray transforms.
Read the full abstract

All authors Dong Qiu, Xiang Xu, Yeqiong Ye, Ting Zhou

Numerical Analysis

A Robust Learning-Based Method for the Helmholtz Equation in Dissipative Media and Complex Domains

To mitigate pollution effects in high-frequency Helmholtz problems, Learning-based Numerical Methods (LbNM) reconstruct solution operators using complete systems of exact solutions. However, the previously used fundamental-solution (FS) basis suffers from instability in dissipative media and requires sensitive geometric tuning. In this paper, we propose a robust alternative using a Bessel basis (BB). From a learning theory perspective, the BB forms a complete hypothesis space of standing waves, ensuring immunity to dissipation-induced signal loss. We establish a convergence result that depends on intrinsic regularity. Numerical experiments demonstrate that the proposed method achieves machine-precision accuracy in dissipative regimes where FS fails, significantly outperforms the Finite Element Method (FEM) in efficiency, and demonstrates the framework's geometric extensibility via a multi-center strategy.
Read the full abstract

Information Theory · Cross-listed from cs.DS

Sublime: Sublinear Error & Space for Unbounded Skewed Streams

Modern stream processing systems often need to track the frequency of distinct keys in a data stream in real-time. Since maintaining exact counts can require a prohibitive amount of memory, many applications rely on compact, probabilistic data structures known as frequency estimation sketches to approximate them. However, mainstream frequency estimation sketches fall short in two critical aspects. First, they are memory-inefficient under skewed workloads because they use uniformly-sized counters to count the keys, thus wasting memory on storing the leading zeros of many small counts. Second, their estimation error deteriorates at least linearly with the length of the stream–which may grow indefinitely–because they rely on a fixed number of counters. We present Sublime, a framework that generalizes frequency estimation sketches to address these challenges. To reduce memory footprint under skew, Sublime begins with short counters and dynamically elongates them as they overflow, storing their extensions within the same cache line. It employs efficient bit manipulation routines to quickly locate and access a counter's extensions. To maintain accuracy as the stream grows, Sublime also expands its number of counters at a configurable rate, exposing a new spectrum of accuracy-memory tradeoffs that applications can tune to their needs. We apply Sublime to both Count-Min Sketch and Count Sketch. Through theoretical analysis and empirical evaluation, we show that Sublime significantly improves accuracy and memory over the state of the art while maintaining competitive or superior performance.
Read the full abstract

All authors Navid Eslami, Ioana O. Bercea, Rasmus Pagh, Niv Dayan

Number Theory

Separable integer partition classes and Slater's list – I

Slater's list of Rogers-Ramanujan type identities consists of 130 series-product identities whose analytic proofs rely primarily on Bailey pair techniques. Although these identities play an important role in the theory of $q$-series and partitions, combinatorial interpretations for many of them remain unknown, largely because the series sides are difficult to interpret naturally in terms of partitions. In this paper we apply Andrews' theory of separable integer partition (SIP) classes to several identities from Slater's list. By constructing suitable SIP classes, we obtain natural partition-theoretic interpretations and parameterized generalizations of their series sides. We then apply various $q$-hypergeometric transformations to these generalized series to derive alternative expressions, which in certain cases reduce to infinite products. These results illustrate how the SIP framework provides a systematic approach to understanding Rogers-Ramanujan type identities and offer new combinatorial insights into identities appearing in Slater's list.
Read the full abstract

Analysis of PDEs

A nonlocal transmission problem on a hybrid continuous-discrete domain

We study a quadratic nonlocal variational problem on a hybrid domain formed by a compact interval and finitely many discrete points. The associated energy splits into continuous, discrete, and interface contributions. Our main estimate shows that the interface term yields a coercive coupling between the two phases and provides an equivalent hybrid norm. As a consequence, we prove existence and uniqueness of a minimizer for the corresponding variational problem and characterize it as the unique weak solution of the associated hybrid Euler–Lagrange system. The latter combines a nonlocal integral equation on the continuous component with a finite nonlocal algebraic system on the discrete nodes.
Read the full abstract

2603.14178 · 15 Mar · The present version has been substantially revised and extended, with additional theoretical developments, spectral investigations, and numerical experiments, and includes G. Rahman and K. Shaib Mohamed as co-authors

Probability

Spatial covariance of KPZ from flat initial profile

We study the fixed-time spatial covariance of the KPZ equation with flat initial profile. Using Malliavin calculus and a Clark-Ocone representation, we show that as $|x|\to\infty$, $\mathrm{Cov}[h(t,x),h(t,0)]$ is governed by a boundary-layer regime near the initial time and satisfies $\mathrm{Cov}[h(t,x),h(t,0)] \sim \kappa(t) \int_0^t p_{2r}(x) dr = \frac{2\kappa(t)}{\sqrt{\pi}}t^{3/2}|x|^{-2}\exp\left(-\frac{x^2}{4t}\right),$ as $|x|\to\infty$, where $\kappa(t) = \big(\mathbb{E}[Z(t,0)^{-1}]\big)^2$, $Z$ is the flat stochastic heat equation solution, and $p_t$ is the one-dimensional heat kernel. In sharp contrast with the narrow-wedge regime, where Gu-Pu (2025, Theorem 1.1) proved that for each fixed $t>0$, $\mathrm{Cov}\left[h^{\mathrm{nw}}(t,x),h^{\mathrm{nw}}(t,0)\right]\sim \frac{t}{|x|},$ as $|x|\to\infty$, the flat initial profile exhibits Gaussian decay, yielding, to the best of our knowledge, the first exact spatial covariance asymptotic for the KPZ equation under flat initial data. We also establish an explicit closed-form formula for the second moment of the continuum directed random polymer partition function.
Read the full abstract

Algebraic Geometry

When is one pinhole camera image equal to some other pinhole camera image?

Generically, one expects the images of two different point sets, in two different (projective) cameras, to be different. However, it can happen that the images are the same up to a projective transformation which is an instance of ill-posedness in computer vision. We prove that the images can become projectively equivalent only for point pairs with at most seven elements. In each case, we give explicit descriptions of the Zariski closure of the locus of camera centers which we call the centers-variety. To do this we use classical invariant theory and the geometry of moduli spaces of ordered points in the projective plane. The most involved case is that of seven points which uses a natural parametrization of the Goepel variety.
Read the full abstract

Probability

Tail Bounds for Queues with Abandonment: Constant, Moderate, Large Deviations, and Efficient Concentration

We study a heavily overloaded single-server queue with abandonment and derive bounds on stationary tail probabilities of the queue length. As the abandonment rate $\gamma \downarrow 0$, the centered-scaled queue length $\tilde{q}$ is known to converge in distribution to a Gaussian. However, such asymptotic limits do not quantify the pre-limit tail $\mathbb{P}(\tilde{q}>a)$ for fixed $\gamma>0$. Our goal is to obtain pre-limit bounds that are efficient across different deviation regimes. For constant deviations, efficiency means Gaussian-type decay in $a$ together with a pre-limit error that vanishes as $\gamma\downarrow 0$, yielding the correct Gaussian tail in the limit. We establish such an efficient bound that is best-of-both-worlds. For larger deviations when $a$ is a function of $\gamma$, efficiency translates into exponentially tight, matching upper and lower bounds. For moderate deviation, we obtain sub-Gaussian tails, while in the large deviation regime the decay becomes sub-Poisson. Our bounds are obtained using a combination of Stein's method for Wasserstein-$p$ distance and the transform method. We then consider a load-balancing system of abandonment queues with heterogeneous servers, operating under the join-the-shortest-queue (JSQ) policy in the heavily overloaded regime. As in the case of single-server queue, we again obtain Wasserstein-$p$ bounds w.r.t.\ a Gaussian, and efficient concentration for constant and moderate deviations. For larger deviations, our JSQ upper bounds exhibit a transition from Gaussian-type decay to sub-Weibull decay. All these results are obtained using Stein's method. In addition, a key ingredient here is establishing a state space collapse (SSC) where all queues become equal. We establish a $p$-th moment bound on the orthogonal component of the queue length vector that is essential for our Wasserstein-$p$ bound.
Read the full abstract