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 22 March

Number Theory

Large values of logarithmic derivatives of quadratic Dirichlet $L$-functions

In this article, we apply the resonance method to derive conditional Omega results for logarithmic derivatives of quadratic Dirichlet $L$-functions. We improve a previous result of Mortada and Murty \cite{MM13}, as well as generalize some results of Yang \cite{yang2023omegatheoremslogarithmicderivatives}.
Read the full abstract

Mathematical Physics

Limit shapes and harmonic tricks

This article has two main goals. First, it provides a self-contained exposition of the tangent plane method for the dimer model - a technique for analyzing arctic curves and limit shapes introduced by R. Kenyon and I. Prause (2020). Second, it extends this method to multiply connected domains through a nontrivial computation of the frozen boundary for the Aztec diamond with a hole. This computation yields the first explicit parametrization in terms of elliptic functions of a family of arctic curves of a multiply-connected region indexed by the height change (hole height). We also derive and visualize the corresponding limit height functions.
Read the full abstract

Numerical Analysis

GasNiTROM: Model Reduction via Non-Intrusive Optimization of Oblique Projection Operators and Guaranteed-Stable Latent-Space Dynamics

Non-intrusive reduced-order modeling techniques are necessary for systems that are simulated using black-box solvers or known only from data. For systems exhibiting large transients and operating far away from equilibria, current non-intrusive models often exhibit poor forecasting accuracy and can even be unstable in infinite or finite time. Recent developments have addressed the stability issue by seeking structure-preserving latent-space architectures when reducing Hamiltonian or Lagrangian full-order dynamics, or by enforcing global stability via Lyapunov-informed parameterizations in the latent space. However, such developments do not necessarily improve the forecasting accuracy of the resulting models, since these formulations achieve dimensionality reduction using orthogonal projections that accidentally truncate dynamically-important states. In this paper, we address both issues by introducing a non-intrusive framework designed to simultaneously identify globally-asymptotically-stable latent-space dynamics, and oblique projection operators capable of capturing the sensitivity mechanisms of the system. In particular, given a Lyapunov-based parameterization of the latent-space tensors, and a matrix-manifold parameterization of the oblique projection operators, we fit a model against high-fidelity training trajectories. Furthermore, we show that the gradient of the objective function can be written in closed form using adjoint-based backpropagation in the latent space, eliminating the need for automatic differentiation. We compare our formulation with state-of-the-art methods on a three-dimensional system of ordinary differential equations, and a two-dimensional lid-driven cavity flow at Reynolds number Re=8300. We demonstrate that our models are not only globally asymptotically stable (as expected by construction), but they are also significantly more accurate.
Read the full abstract

Commutative Algebra

Asymptotic behaviour of bigraded components of local cohomology modules

Let $C$ be a commutative Noetherian ring containing a field $K$ of characteristic zero. Let $R=C[X_1, \ldots, X_n, Y_1, \ldots, Y_m]$ be a polynomial ring over $C$ with $\mathrm{bideg}~ c=(0,0)$ for all $c \in C$, $\mathrm{bideg}~ X_i=(1,0)$ and $\mathrm{bideg}~ Y_j=(0,1)$ for $i=1, \ldots, n$ and $j=1, \ldots, m$. Let $I$ be a bihomogeneous ideal in $R$. In this article, we study asymptotic behaviour of bigraded pieces of the local cohomology module $H^i_I(R)$. Moreover, under the extra assumption that $C$ is regular, we investigate the asymptotic stability of invariants associated to its bigraded components. Consequently, we obtain certain properties of components of the bigraded local cohomology module $H^i_I(R)$, where $C=K$ is a field and $I$ is a binomial edge ideal.
Read the full abstract

All authors Rajsekhar Bhattacharyya, Tony J. Puthenpurakal, Sudeshna Roy, Jyoti Singh

Classical Analysis and ODEs

A sharp logarithmic condition for the Hardy operator on $L^{1}(0,\infty)$ and $\ell^1$

The Hardy operator is not bounded on the space of integrable functions on the positive half-line and its discrete counterpart on summable sequences. we introduce a modified Hardy operator obtained by subtracting a natural corrective term, and characterize the largest subspace of integrable functions on which this modified operator maps into integrable functions. The sharp condition is a logarithmic integrability (summability) requirement whose weight reflects obstructions on both small and large scales.
Read the full abstract

Differential Geometry · Cross-listed from stat.ML

Accelerate Vector Diffusion Maps by Landmarks

We propose a landmark-constrained algorithm, LA-VDM (Landmark Accelerated Vector Diffusion Maps), to accelerate the Vector Diffusion Maps (VDM) framework built upon the Graph Connection Laplacian (GCL), which captures pairwise connection relationships within complex datasets. LA-VDM introduces a novel two-stage normalization that effectively address nonuniform sampling densities in both the data and the landmark sets. Under a manifold model with the frame bundle structure, we show that we can accurately recover the parallel transport with landmark-constrained diffusion from a point cloud, and hence asymptotically LA-VDM converges to the connection Laplacian. The performance and accuracy of LA-VDM are demonstrated through experiments on simulated datasets and an application to nonlocal image denoising.
Read the full abstract

All authors Sing-Yuan Yeh, Yi-An Wu, Hau-Tieng Wu, Mao-Pei Tsui

Differential Geometry

SDP Feasibility Problems and sos Representation Ranks for OT-FKM Type Isoparametric Polynomials

Semidefinite programming (SDP) provides a fundamental framework for studying properties of sum-of-squares (sos) representations of nonnegative polynomials. In this paper we study the quartic forms GF = (|x|^4 + F(x))/2 associated with isoparametric polynomials F of OT-FKM type with g = 4. We characterize the sos property of GF in terms of the feasibility of an explicit SDP determined by the underlying Clifford system, and in the sos cases we obtain quantitative rank bounds for sos representations, with rigidity when m >= 3.
Read the full abstract

Spectral Theory

An Approximate Inverse Spectral Theorem for Manifolds of Constant Negative Curvature

A classical theorem of Colin de Verdière shows that on a closed manifold of fixed topology one can prescribe an arbitrary finite portion of the Laplace-Beltrami spectrum (including multiplicities, subject to the usual topological constraints) by choosing a sufficiently heterogeneous smooth metric. In this paper, we study the same inverse problem under the rigid geometric constraint of constant negative sectional curvature. Allowing the topological complexity to vary, we prove that any finite strictly increasing target list can be approximated to arbitrary precision by a closed manifold of constant negative curvature in any dimension $d\ge2$. In $d=2$ the construction uses hyperbolic collar degeneration and the discrete spectral limit theorems of Burger, building on the collar estimates of Buser; in $d\ge3$ we build macroscopically heterogeneous hyperbolic covering manifolds assembled from “heavy” vertex clusters and “long” corridor chains whose low-energy limit is a prescribed discrete graph Laplacian. We also record the universal obstructions at curvature normalization $\kappa\equiv -1$: Yang-Yau in $d=2$ and Kazhdan-Margulis combined with Bishop–Gromov volume comparison in $d\ge3$. In particular, $\lambda_1$ is universally bounded at $\kappa=-1$, so target lists whose first positive eigenvalue exceeds this bound cannot be approximated within the class $\kappa\equiv -1$, and accommodating arbitrarily large prescribed $\lambda_1^*$ forces $|\kappa|\to\infty$. A corollary on the arbitrarily precise prescription of scale-invariant eigenvalue ratios at $\kappa\equiv -1$ and an explicit worked example are included.
Read the full abstract

Combinatorics

On $U$-unitary Cayley graphs over finite rings

Graphs defined over a finite ring are well-studied in the literature. Due to their nature, these types of graphs connect several branches of mathematics, including algebra, number theory, matrix theory, and representation theory. In recent work, we studied $U$-unitary Cayley graphs over a finite commutative ring, which unifies several constructions of graphs with arithmetic origins. Among various structural graph-theoretic results on these graphs–such as their connectedness, primeness, and bipartiteness–we show that their spectra can be described via a certain supercharacter theory. Utilizing this spectral description, we are able to find some classes of gcd-graphs that possess perfect state transfer. In this article, we generalize this study to finite non-commutative rings, with a special focus on the case of the matrix rings with coefficients in a finite field. We show, in particular, that gcd-graphs over these matrix rings have no perfect state transfer.
Read the full abstract

Optimization and Control

A Modular Approach to Stochastic Optimisation for Inverse Problems Using the Core Imaging Library

The Core Imaging Library (CIL) is an open-source versatile Python framework for solving inverse problems with special emphasis on imaging applications such as computed tomography (CT), using a plug-in architecture for data and operators, interfacing to toolboxes such as ASTRA, TIGRE and SIRF. A key component of CIL is its optimisation module enabling users to flexibly combine mathematical operators and functionals to form smooth and non-smooth optimisation problems and solve these with a range of first-order algorithms. The present work introduces an expansion of CIL with a new modular framework for stochastic optimisation, allowing researchers to easily use a variety of existing stochastic optimisation algorithms as well form new ones by combining modular building blocks. Users can flexibly configure algorithmic components, adapt to diverse problem structures, and experiment with various sampling and step size strategies. Rather than individual black-box implementations of each fixed algorithm with significant redundancies, our design is modular providing building blocks that can be flexibly combined to realise a wealth of algorithm instances. The framework is particularly well-suited for large-scale applications, where stochastic methods offer notable computational advantages over deterministic approaches. To demonstrate its versatility and practical utility, we present experiments on real-world datasets from imaging inverse problems, such as X-Ray CT and Positron Emission Tomography (PET) reconstruction. In summary, the presented software expansion aims to support the research community with a robust, extensible optimisation suite for developing, testing, and benchmarking stochastic methods for inverse problems.
Read the full abstract

All authors Evangelos Papoutsellis, Margaret A. G. Duff, Jakob S. Jørgensen, Sam Porter, Claire Delplancke, Gemma Fardell, Edoardo Pasca, Kris Thielemans

Optimization and Control

Two-stage robust bilevel optimization model for facility location considering operational service level under disruption risk

The bilevel facility location problem (BO-FLP) is one of the core optimization problems behind the design of many decentralized industrial systems, e.g., supply chain systems where a supplier constructs some critical facilities and then uses them to serve retailers in a cost-effective fashion, while retailers directly handle customers aiming to minimize the total unmet demand in a rather independent fashion. When uncertainty is considered, scenario-based stochastic approaches are commonly used, but they often become impractical due to insufficient data or an exponential number of scenarios. To address this issue, this paper adopts robust optimization and proposes a novel two-stage robust bilevel facility location model. Several structural properties are derived to improve both theoretical understanding and solution efficiency. Based on this, an enhanced column-and-constraint generation algorithm is developed for robust bilevel optimization with decision-dependent uncertainty, significantly improving exact solution capability over the standard method. Numerical results show that, compared to the centralized two-stage RO model, our model pays more attention to demand fulfillment, typically resulting in higher service efficiency and better utilization of supply capacity. Under a small-scale disruption, this new model delivers better service performance. However, under a large-scale disruption, the centralized model performs more effectively.
Read the full abstract

All authors Haitao Hu, Jing Li, Jiafu Tang, Bo Zeng

General Mathematics

The Partition Graph as a Growing Discrete Geometric Object

For each positive integer $n$, let $G_n$ be the graph of integer partitions of $n$, where two partitions are adjacent if one is obtained from the other by an elementary transfer of a cell in the Ferrers diagram, followed by reordering. Previous work has studied the global homotopy type of the clique complex $Cl(G_n)$ and the local combinatorics of $G_n$ at a fixed vertex. This paper initiates the study of $G_n$ itself as a growing discrete geometric object. It introduces a structural language for the large-scale morphology of partition graphs, centered on the antenna vertices, main chain, boundary framework, self-conjugate axis, simplex layers, degree landscape, central region, and spine. Using local invariants from the companion local theory, it also defines canonical vertex layerings of $G_n$. A small computational atlas for $1 \le n \le 12$ is included to illustrate how these structures emerge and interact. The paper is intended as a foundational and exploratory contribution, providing a vocabulary, a first structural picture, and a set of open directions for future quantitative and asymptotic work.
Read the full abstract

Analysis of PDEs · Cross-listed from gr-qc

A new approach towards the construction of initial data in general relativity with positive Yamabe invariant and arbitrary mean curvature

This paper revisits the classical construction of initial data using the conformal method, as originally proposed by Holst, Nagy, and Tsogtgerel and later refined by Maxwell. We demonstrate that the existence of the solution can be proven using the Banach fixed point theorem, whereas the original proof relied on the Schauder fixed point theorem. This new approach has two main advantages: it guarantees the uniqueness of the solution to the equations of the conformal method as soon as one imposes a bound on the physical volume of it and it provides an explicit construction of the solution.
Read the full abstract

Optimization and Control

Mean field control with stopping

We study a high-dimensional stochastic optimization problem which features both control and stopping. In particular, a central planner steers a large population of particles, and can also remove particles at any time by paying a penalty. In the limit, we obtain a mean field control problem with discontinuous dynamics, in the sense that the controlled Fokker-Planck equation can have jumps. The value of the N-particle problem is characterized by a hierarchy of non-linear obstacle problems. The value of the limiting problem, meanwhile, solves an infinite-dimensional quasi-variational inequality (QVI). We introduce a notion of viscosity solution for this QVI, and obtain a comparison principle. Together with various regularity estimates, this comparison principle allows us to characterize the mean field value function as the unique viscosity solution of the QVI, and to establish the convergence of the N-particle value functions to the mean field value function.
Read the full abstract

Mathematical Physics

The non-uniform electron gas

The non-uniform (or inhomogeneous) electron gas has received much attention in many-body quantum mechanics and quantum chemistry in the early days of density functional theory, mainly as a theoretical device to construct gradient approximations via linear response theory. In this article, motivated by the recent works of Lewin, Lieb and Seiringer, we propose a definition of the quantum (resp. classical) non-uniform electron gas through the use of the grand-canonical Levy-Lieb functional (resp. the grand-canonical strictly correlated electrons functional), establish these systems as rigorous thermodynamic limits and analyze their basic properties. The non-uniformity of the gas comes from an arbitrary lattice-periodic background density.
Read the full abstract

Geometric Topology

Decomposing Centrally Symmetric Convex Polyhedral Surfaces into Parallelograms

Let $\mathcal{M}_{2N}(\delta_1, \delta_2,\dots, \delta_N)$ be the moduli space of centrally symmetric convex polyhedral surfaces with $2N$ labeled vertices and prescribed cone-deficits $\delta_1$, $\delta_2$, $\dots$, $\delta_N$. We show that $\mathcal{M}_{2N}(\delta_1, \delta_2,\dots, \delta_N)$ has the structure of a real hyperbolic manifold of dimension $2N-3$. When $N=4$ and $5$, we show that every surface in $\mathcal{M}_{2N}(\delta_1, \delta_2,\dots, \delta_N)$ can be decomposed into at most $2\binom{2N-2}{2}$ parallelograms, and the decomposition is invariant under the antipodal map. Using the edge-lengths of these parallelograms as coordinates, we show that the moduli space of centrally symmetric polyhedral surfaces with $8$ unlabeled vertices and cone-deficits $\frac{\pi}{2}$ is isometric to the quotient of a real hyperbolic regular ideal $5$-simplex by the dihedral group $D_6$.
Read the full abstract

Algebraic Geometry

A canonicity criterion for toric varieties and the classification of canonical 4-simplices

Based on the Reid-Shepherd-Barron-Tai criterion for canonical and terminal quotient singularities, we characterize canonicity and terminality of a toric variety in terms of its local class group actions. Specializing it to the Picard number one setting, we arrive at a classification algorithm for canonical and terminal fake weighted projective spaces in any dimension. In dimension four it gives, up to isomorphism, 710450 canonical fake weighted projective spaces. We take a look at the corresponding Calabi-Yau hypersurfaces, compute the Fine interior of the associated canonical simplices, and discuss the results.
Read the full abstract

Information Theory

The Critical Renyi Order for Sharp Minimax Channel Design

We study categorical channel design under a bound on the maximum directed pairwise Renyi divergence. We determine exactly which orders make randomized response optimal in every dimension and at every finite budget: the orders strictly above one and at most two. In that range we identify the full information-trace frontier and its unique optimal anchored law. The channel is visibly thinned randomized response below a uniquely defined threshold and ordinary randomized response above it. A fixed-second-moment inequality and a second-order variational argument reduce arbitrary channel columns to singleton templates. Above order two, an explicit subset-selection channel beats every mixture of singleton templates in a finite dimension. The trace frontier also gives the exact finite-sample minimax risk among all unbiased real-valued vector estimators, and the asymptotic minimax risk among all estimators for every budget sequence with diverging total information. Appendices compare pure local privacy and distinguish homogeneous shuffle contamination from arbitrary neighboring datasets.
Read the full abstract

Analysis of PDEs

Global regularity and free boundary geometry in the planar Choné-Rochet model

In this paper, we study minimizers of the Choné–Rochet variational problem in dimension two. We first establish global $C^1$ regularity on arbitrary bounded convex domains, and then prove global $C^{1,1}$ regularity on bounded strictly convex domains or, more generally, whenever the zero set of $u$ has positive measure. Next, we construct smooth bounded convex domains with a flat boundary segment for which no prescribed modulus of continuity controls the gradient; this shows that, without additional geometric assumptions, global $C^1$ regularity is optimal. Finally, we prove that the tamed free boundary (that is, the interface between the strictly convex and non-strictly convex regions of the solution) is locally a $C^1$ embedded curve, significantly strengthening previously known regularity results.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

On the Role of Batch Size in Stochastic Conditional Gradient Methods

We study the role of batch size in stochastic conditional gradient methods under a $\mu$-Kurdyka-Łojasiewicz ($\mu$-KL) condition. Focusing on momentum-based stochastic conditional gradient algorithms (e.g., Scion), we derive a new analysis that explicitly captures the interaction between stepsize, batch size, and stochastic noise. Our study reveals a regime-dependent behavior: increasing the batch size initially improves optimization accuracy but, beyond a critical threshold, the benefits saturate and can eventually degrade performance under a fixed token budget. Notably, the theory predicts the magnitude of the optimal stepsize and aligns well with empirical practices observed in large-scale training. Leveraging these insights, we derive principled guidelines for selecting the batch size and stepsize, and propose an adaptive strategy that increases batch size and sequence length during training while preserving convergence guarantees. Experiments on NanoGPT are consistent with the theoretical predictions and illustrate the emergence of the predicted scaling regimes. Overall, our results provide a theoretical framework for understanding batch size scaling in stochastic conditional gradient methods and offer guidance for designing efficient training schedules in large-scale optimization.
Read the full abstract

All authors Rustem Islamov, Roman Machacek, Aurelien Lucchi, Antonio Silveti-Falls, Eduard Gorbunov, Volkan Cevher

Metric Geometry

Triangulating surfaces quasi-isometrically

We prove that if a complete Riemannian surface $(\Sigma,d_\Sigma)$ is quasi-isometric to some bounded degree graph $G$, then $\Sigma$ admits a triangulation whose 1-skeleton is quasi-isometric to it when equipped with the simplicial metric. We study several variants of the problem, and identify the right condition making it an if and only if statement.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Causal Structure of Spacetime Singularities and Their Observable Signatures

We analyze the causal structure of horizonless compact objects via the light-cone geometry and conformal compactification of the Joshi-Malafarina-Narayan (JMN-1) and Janis-Newman-Winicour (JNW) spacetimes. Penrose diagrams reveal that JMN-1 undergoes a transition from timelike $(0<M_0<2/3)$ to null $(2/3<M_0<4/5)$ singularities, while JNW remains timelike throughout, in contrast to the spacelike singularity of the Schwarzschild spacetime. We show that photon spheres exist in Schwarzschild and JNW, but arise in JMN-1 only in the null singularity phase, establishing a direct link between causal character and null geodesic trapping. We further demonstrate that radial timelike geodesics develop turning points for certain parameter regimes in both JMN-1 and JNW spacetimes, indicating the emergence of effective repulsive behavior in the strong field region. These features lead to distinct strong field lensing and shadow signatures, potentially testable by very long baseline interferometric observations such as those of the Event Horizon Telescope.
Read the full abstract

All authors Bina Patel, Jahnvi Mistry, Ayush Bidlan, Parth Bambhaniya

Numerical Analysis

A globally convergent Carleman-Picard method for an inverse initial-value problem for a nonlinear diffusive coagulation-fragmentation equation coagulation-fragmentation equation

We study an inverse initial-density problem for a nonlinear diffusive coagulation–fragmentation equation with known coagulation and fragmentation kernels. The objective is to recover the unknown initial particle-size distribution on a finite interval from time-dependent boundary observations of the solution and its size derivative. To solve this inverse problem, we develop a globally convergent numerical method based on a Legendre–exponential time reduction and a Carleman–Picard iteration. The time reduction transforms the original problem into a nonlinear coupled system for the spatial mode coefficients, while the Carleman weight and the corresponding Carleman estimate guaranty the global convergence of the Picard iteration without requiring a good initial guess. We prove the convergence of the proposed method and obtain a complete reconstruction procedure for the initial density. Numerical experiments with noisy boundary data demonstrate that the method yields accurate and stable reconstructions for several representative test profiles.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Symmetry evolution for the imperfect fluid under perturbations

Ever since a new symmetry was found for the imperfect fluid with vorticity the question of the effect of perturbations on the symmetry itself has been raised. This new symmetry arose when realizing that local four-velocity gauge-like transformations would render the left hand side of the Einstein equations invariant. Because the metric tensor would be invariant under this new kind of local transformations. Then the point was raised about the invariance of such a kind of transformations of the stress-energy tensor on the right hand side of the Einstein equations in curved four-dimensional Lorentz spacetimes. It was verified that these invariances do not work with plain perfect fluids but they do work for imperfect fluids. The imperfect fluid stress-energy tensor will be invariant under local four-velocity gauge-like transformations when additional transformations are introduced for several variables included in the stress-energy tensor itself. This local invariance was also the criteria introduced in order to present a new stress-energy tensor for vorticity as well. New tetrads are at the core of the realization of the existence of this new symmetry because it is through these new tetrads that this new symmetry is realized. In this manuscript we will introduce local perturbations by external agents to the relevant objects in the imperfect fluid geometry. We will demonstrate a theorem that proves that the symmetries under four-velocity gauge-like transformations will be instantaneously broken but at the same time transformed into new symmetries. Because the local orthogonal planes determined by these new tetrads, which happen to be the local planes of symmetry will tilt under local perturbations. There will be a symmetry evolution under perturbations.
Read the full abstract

Combinatorics

A sharp upper bound on the third adjacency eigenvalue of a graph

For a graph $G$ of order $n$, let $$ \lambda_1(G)\ge \cdots \ge \lambda_n(G) $$ be the eigenvalues of its adjacency matrix. We prove that every graph $G$ on $n\ge 3$ vertices satisfies $$ \lambda_3(G)\le \frac{n}{3}-1, $$ thereby solving a problem of Nikiforov. The bound is best possible whenever $3\mid n$. Our proof is derived from a more general matrix result: if $A=(a_{ij})$ is a real symmetric matrix of order $n$ with $0\le a_{ij}\le 1$ for all off-diagonal entries and $a_{ii}\ge 0$ for all $i$, then $$ \lambda_{n-1}(A)+\lambda_n(A)\ge -\frac{2n}{3}. $$ This in particular confirms a conjecture of Leonida and Li.
Read the full abstract

Dynamical Systems

Rigidity of Lyapunov exponents for polynomials

Let $f,g\in\overline{\mathbb{Q}}[z]$ be polynomials of degree $d\geq2$ with disconnected Julia sets. We prove that they have the same Lyapunov exponent $\mathcal{L}_f=\mathcal{L}_g$ if and only if either $f$ and $g$ are intertwined, or $f$ and $\overline{g}$ are intertwined. The analogous result for critical heights is also obtained. As an application, we provide a new proof of the theorem stating that the multiplier spectrum morphism on the moduli space of polynomials is generically injective.
Read the full abstract

Analysis of PDEs

Multiplicity of Solutions to the Brezis-Nirenberg Problem on Hyperbolic Spaces

This article investigates the multiplicity of solutions to the Brezis-Nirenberg problem on smooth bounded domains in the hyperbolic space $\mathbb{B}^N$ for $N \ge 4$. Specifically, we study the critical semilinear equation $-\Delta_{\mathbb{B}^N} u = \lambda u + |u|^{2^*-2}u$ under Dirichlet boundary conditions for $\lambda > \frac{N(N-2)}{4}$. Overcoming the analytic challenges induced by the hyperbolic geometry and the intricate concentration profiles of Palais-Smale sequences, we establish the existence of multiple pairs of nontrivial solutions. Using the equivariant Ljusternik-Schnirelmann category, we obtain lower bounds on the number of solutions depending on the position of the parameter $\lambda$ relative to the Dirichlet spectrum of the Laplace-Beltrami operator.
Read the full abstract

Combinatorics

Growth of infinite frieze patterns of affine type

We analyse the growth coefficients of infinite frieze patterns arising from cluster algebras using cluster modular groups and cluster categories. For a fixed cluster category of affine type, we prove that the collection of infinite frieze patterns given by both the homogeneous and non-homogeneous stable tubes all have the same growth coefficients. We also derive and verify an explicit formula for the $k$-th growth coefficient, expressed directly in terms of data from homogeneous tubes, or, alternatively, from appropriate elements of the corresponding cluster algebra.
Read the full abstract

All authors Karin Baur, Anna Felikson, Deepanshu Prasad, Pavel Tumarkin, Emine Y{\i}ld{\i}r{\i}m

Functional Analysis

Spectral cuts and unconventional functional calculi

In this work, we prove that linear bounded operators $T$ on a Banach space $X$ allowing spectral cuts along rectifiable Jordan curves meeting their spectrum are related to classes of operators admitting an unconventional functional calculus. We identify several such classes and address the consequences regarding the existence of non-trivial closed invariant subspaces, extending previous results of Chalendar. Furthermore, we establish that every operator belonging to a broad subclass of compact perturbations of diagonalizable normal operators on separable Hilbert spaces, namely, trace-class perturbations, possesses an unconventional functional calculus and is super-decomposable, thereby extending earlier results obtained by the authors.
Read the full abstract

Metric Geometry · Cross-listed from cs.DS

Fast Nearest Neighbor Search for $\ell_p$ Metrics

The Nearest Neighbor Search (NNS) problem asks to design a data structure that preprocesses an $n$-point dataset $X$ lying in a metric space $\mathcal{M}$, so that given a query point $q \in \mathcal{M}$, one can quickly return a point of $X$ minimizing the distance to $q$. The efficiency of such a data structure is evaluated primarily by the amount of space it uses and the time required to answer a query. We focus on the fast query-time regime, which is crucial for modern large-scale applications, where datasets are massive and queries must be processed online, and is often modeled by query time $\text{poly}(d \log n)$. Our main result is such a randomized data structure for NNS in $\ell_p$ spaces, $p>2$, that achieves $p^{O(1) + \log\log p}$ approximation with fast query time and $\text{poly}(dn)$ space. Our data structure improves, or is incomparable to, the state-of-the-art for the fast query-time regime from [Bartal and Gottlieb, TCS 2019] and [Krauthgamer, Petruschka and Sapir, FOCS 2025].
Read the full abstract