Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 28 April

Group Theory

Mild Pro-$p$ Groups and Ordered Monoids

We prove a criterion for the mildness of a finitely presented pro-$p$ group $G$. It implies as a special case a cohomological mildness criterion via Massey products, generalizing results due to Schmidt and Gärtner. It subsumes Labute's non-singular circuit criterion. We further show connections with the triangle condition for the mildness of pro-$p$ right-angled Artin groups, due to Quadrelli, Snopce and Vannacci.
Read the full abstract

Mathematical Physics

Level Crossing in Random Matrices. III. Analogs of Girko's circular and Wigner's semicircle laws

We study the asymptotic distribution of level crossings for random matrix pencils A_n+\lambda B_n in several ensembles, including complex and real i.i.d. matrices and Gaussian/Hermitian settings. We derive a representation of the normalized log-discriminant in terms of pairwise eigenvalue interactions and formulate conditions under which its limit is governed by a deterministic potential. Under assumptions combining a uniform circular law, logarithmic tail control, and small-spacing (repulsion) estimates, we prove convergence of the empirical measure of level crossings to an explicit deterministic limit. In the complex Gaussian case these assumptions are verified (modulo a uniformity step), while in the general i.i.d. setting the results are conditional and motivated by universality theory. We further analyze the real case, showing that any limiting measure does not concentrate on the real projective line under suitable hypotheses, and discuss analogous phenomena for elliptic/Hermitian ensembles. Our results highlight the role of logarithmic energy and universality in governing spectral degeneracies of random matrix pencils.
Read the full abstract

Logic

Finite Kripke models and provability interpretations in quantified modal logic

In this paper, we investigate arithmetical completeness with respect to finite Kripke models of quantified modal logic. We adapt the finite-model embedding techniques of Artemov and Japaridze to two settings involving finite Kripke models. First, for conversely well-founded finite Kripke models of quantified modal logic, we construct a $\Sigma_2$ Fefermanian provability predicate together with an arithmetical interpretation that embeds the model into arithmetic. Second, for finite constant domain Kripke models of quantified modal logic, we construct a $\Sigma_1$ provability predicate satisfying $\mathbf{D2^G}$ and an arithmetical interpretation yielding such an embedding.
Read the full abstract

Dynamical Systems

Symmetric Limit Cycles in 3D Piecewise Linear Systems with Visible-visible Two-Fold Singularity

We analyze a three-dimensional discontinuous piecewise linear system \(Z=(X,Y)\) whose switching manifold \(\Sigma\) contains visible-visible two-fold intersection lines. Assuming that the matrices \(DX\) and \(DY\) each have one nonzero real eigenvalue and one pair of complex conjugate eigenvalues, we reduce the system to a canonical form. Under a resonant condition, we use Darboux integrability theory to obtain a first integral common to \(X\) and \(Y\). Its restriction to \(\Sigma\) defines a hyperbola \(\Gamma\), which parametrizes the crossing points of symmetric periodic orbits. On this curve we construct the half-return maps, derive analytic expansions for the corresponding return times near infinity, and introduce a time-matching function given by their difference. By means of the Weierstrass Preparation Theorem, we prove the existence of a large-amplitude symmetric limit cycle for a suitable subfamily of systems. We then study stability through a saltation-corrected monodromy matrix and reduce the problem to Schur–Cohn inequalities for the two transverse Floquet multipliers.
Read the full abstract

Probability

The conformal dimension of the Brownian tree is one

The Brownian tree, also known as the continuum random tree, is a canonical random compact, geodesic $\mathbf R$-tree that arises as the universal scaling limit for numerous models of discrete random trees. A key quasisymmetric invariant of a metric space is its conformal dimension, defined as the infimum of the Hausdorff dimensions over all quasisymmetrically equivalent spaces. This value is always bounded below by the space's topological dimension and above by its Hausdorff dimension. In the present paper, we prove that the conformal dimension of the Brownian tree is $1$, matching its topological dimension.
Read the full abstract

Optimization and Control

Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching

Many large-scale optimization problems decompose into a master problem and scenario subproblems, a structure that can be exploited by Benders decomposition. In Benders decomposition, each iteration may generate many cuts from scenario subproblems, and adding all of them as constraints then causes the master problem to grow rapidly. These are constraints that may need to be added to the master problem to guarantee optimality and feasibility of solutions, but we can avoid adding those constraints that are never violated. Adding fewer cuts per iteration can reduce the number of cuts added in total, but increase the number of iterations. In contrast, the cuts filtered for regular cut selection in mixed-integer programming solvers are optional and added exclusively to improve runtime behavior. We study Benders cut filtering: given the Benders cuts produced in an iteration, which subset should be added to the master problem? To our knowledge, few prior works have studied this question. We propose violation-based filtering (retaining the most-violated cuts), diversity-based filtering via k-medoids clustering on pairwise cosine distances (adding an original cut closest to the cluster centroid), and a hybrid that selects a most-violated cut per cluster. Each strategy can be augmented with an aggregated cut that retains discarded information. Computational experiments on 149 instances of an affine potential-based flow problem with topology switching and robustness scenarios – solved via Benders decomposition – show that all informed filtering strategies solve at least 125 instances (vs. 91 for the unfiltered baseline), reducing shifted geometric mean solve time by 55-57%. The hybrid strategy attains the best geometric mean (271.89 s vs. 629.34 s, a 57% reduction, p < 0.001).
Read the full abstract

Differential Geometry

Formulas for Hadamard coefficients in terms of Green's operators

We describe various ways of obtaining the Hadamard coefficients associated to a normally hyperbolic operator from the corresponding Green's operators. As the Hadamard expansion on its own is not enough for this, we include additional information either by considering something like a resolvent or powers of Green's operators or by looking at a product of the original manifold with the real line.
Read the full abstract

Complex Variables

Study of solutions of certain type of non-linear differential-difference equations

In this paper, we analyze the solutions of the following non-linear differential-difference equations f^n(z) +\omega f^(n-1)f'(z) +p(z)f(z+c) = p_1e^{\alpha}_1z +p_2e^{\alpha}_2z and f^n(z)f'(z) +q(z)e^Q(z)f(z+c) = p_1e^{\alpha}_1z +p_2e^{\alpha}_2z, where n is a positive integer,\omega, p1, p2,{\alpha}1 & {\alpha}2 are non-zero constants satisfying {\alpha}1 not equal to {\alpha}2, {\alpha}1/{\alpha}2 not equal to (n)^+-1, q(z) is a non-vanishing polynomial and Q(z) is a non-constant polynomial.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Graphical Functions by Examples

Graphical functions have emerged as a powerful framework for evaluating multi-loop Feynman integrals in perturbative quantum field theory. Defined as massless three-point position-space integrals, they reveal rich analytic structures and have enabled major advances, including the highest-loop results currently known in several quantum field theories. Their role extends to conformal field theory, and recent algorithmic developments now allow many graphical functions to be computed automatically. This review, based on graduate-level lectures held by O.S. in 2025/26 at the University of Hamburg, introduces the central ideas behind graphical functions, covering periods, Feynman residues, and the treatment of regular and singular cases in both integer and non-integer dimensions. It also discusses connections to momentum space and self-duality, and provides guidance for further study, offering a coherent entry point into a topic not addressed in standard textbooks.
Read the full abstract

All authors Mrigankamauli Chakraborty, Marco Klann, Sven-Olaf Moch, Pooja Mukherjee, Tobias Porsche, Oliver Schnetz, Leonid A. Shumilov

Combinatorics

Enumerating Multi-Operator Monomials in Commutative and Noncommutative Settings

We study enumeration problems for multi-operator monomials generated from one indeterminate by an associative multiplication together with finitely many unary operators. We consider four regimes, according to whether multiplication is commutative and whether the unary operators commute. In the case where the unary operators do not commute, we obtain explicit multigraded generating functions and coefficient formulas, including a multinomial refinement of the Narayana numbers, together with interpretations in terms of rooted trees, restricted lattice paths, and binary trees. When the unary operators commute, we derive canonical representatives and effective recurrences, with corresponding monotonicity conditions in the combinatorial models. When multiplication is commutative, the sequence decomposition is replaced by a multiset decomposition, leading to exp–log generating functions and Euler-transform recurrences. In special cases, the resulting sequences recover classical families including the Catalan numbers, the small Schröder numbers, and rooted-tree numbers.
Read the full abstract

Mathematical Physics

Derivations on the triplet $W$-algebras with $\mathfrak{sl}_2$-symmetry

We construct derivations on the triplet $W$-algebras $\mathcal{W}_{p_+,p_-}$ by refining the Frobenius homomorphisms of Tsuchiya-Wood and show that the property of the Adamović-Milas derivation for $\mathcal{W}_{2,p}$ extends to our derivations. As an application, we show that the $\mathfrak{sl}_2$-symmetry of $\mathcal{W}_{p_+,p_-}$ arises naturally from our construction. We further show that our method applies to the triplet $W$-superalgebra $\mathcal{SW}(m)$ and that the full automorphism group ${\rm Aut}(\mathcal{SW}(m))$ is $PSL_2(\mathbb{C})\times \mathbb{Z}_2$.
Read the full abstract

Probability

What is The Probability That A Random Graph With A Given Degree Sequence is Connected?

An $n$-tuple $D=(d(1),\dots,d(n))$ is a feasible degree sequence if there is a graph on $\{1,\dots,n\}$ such that $i$ has degree $d(i)$. Any such graph will have $m=\sum_{i=1}^n d(i)/2$ edges. Letting $G(D)$ be a graph chosen uniformly from those with the given degree sequence, we upper-bound the probability that $G(D)$ is disconnected based on the number of vertices of degree $d$ for small $d$, and develop a powerful tool for proving such bounds. If there are any vertices of degree zero the probability $G$ is disconnected is $1$, so we assume there are no such vertices. Our results then imply that if there are $o(\sqrt{m})$ vertices of degree $1$ and $o(m)$ vertices of degree 2 then with high probability $G$ is connected, while if there are no vertices of degree 1 or 2 then the probability $G$ is disconnected is $O(\frac{n^4}{m^6})$.
Read the full abstract

Analysis of PDEs

On nonnegative solutions of the parabolic differential inequality with $(p,q)$-Laplace on Riemannian manifolds

In this paper, we establish Liouville-type theorems for parabolic differential inequalities with $(p,q)-$Laplacian operator on Riemannian manifolds. By a test function argument, we establish nonexistence results under suitable weighted volume growth assumptions involving potential. In particular, we can obtain nonexistence results for a wider class of parabolic inequalities.
Read the full abstract

Numerical Analysis

Computational homogenization of unsteady flows in a periodic porous medium

The work is devoted to the development and computational implementation of the homogenization method for modeling unsteady flows of a viscous incompressible fluid in periodic porous media taking into account memory effects. At the macrolevel, the flow is described by an integro-differential Darcy law with a tensor memory kernel determined by solving unsteady problems on the periodicity cell. The developed approach to computational homogenization is based on finding the steady-state and unsteady components of the conductivity tensor from solving auxiliary boundary value and spectral problems on the periodicity cell. The nonlocal macroscopic problem is transformed into a local system of differential equations by approximating the memory kernel as a sum of exponentials. Issues of spatial finite element approximation are discussed, and stable two-level schemes in time are constructed. The results of applying the developed computational homogenization technology for unsteady filtration problems in porous media to a two-dimensional test problem are presented.
Read the full abstract

Numerical Analysis

Splitting AVF method for generalized Langevin equations: probability density function and geometric ergodicity

The generalized Langevin equation (GLE) constitutes a fundamental model for describing nonequilibrium dynamics with memory effects. To overcome the numerical challenges arising from superquadratically growing potentials and degenerate noise, we propose and analyze a structure-preserving splitting averaged vector field (AVF) method for a quasi-Markovian GLE. The core advantage of this method lies in its ability to simultaneously preserve the exponential integrability, Malliavin differentiability, and ergodicity of the underlying continuous system. Notably, by leveraging exponential integrability, Malliavin differentiability, and uniform non-degeneracy of the numerical solution, we obtain the existence and smoothness of its probability density function, which converges to that of the exact solution with first-order accuracy. Furthermore, by validating the Lyapunov condition and the minorization condition using a localized technique, we establish the geometric ergodicity of the numerical solution. Finally, numerical experiments are conducted to confirm the theoretical results.
Read the full abstract

All authors Xinjie Dai, Xingyu Liu, Diancong Jin, Liying Sun

Geometric Topology

CR-invariant energy of Legendrian knots in the Heisenberg group

We introduce an energy functional for Legendrian knots in the 3-dimensional Heisenberg group $\mathcal{H}$, which serves as a sub-Riemannian analog of the Möbius invariant knot energy in Euclidean 3-space introduced by the second author. The energy is obtained by regularizing a divergent integral of the potential of order -2 with respect to the Korányi distance on $\mathcal{H}$; this choice of distance is essential for the energy to be invariant under the action of PU(2,1). We characterize $\mathbb{R}$-circles in $\mathcal{H}$ as the minimizers of the energy, and establish a Heisenberg analog of the Doyle–Schramm cosine formula. We also show that the energy integrand admits an expression in terms of a complex-valued 2-form on the complement of the diagonal in $\mathcal{H}\times\mathcal{H}$, providing a partial analog of the infinitesimal cross ratio interpretation known from the classical setting.
Read the full abstract

Algebraic Geometry

Certain degenerations of surfaces in fake weighted projective $3$-space

We study degenerations (along an edge) of surfaces in (fake) weighted projective $3$-space. We introduce the Hodge theoretic data and show that the Hodge loci of vanishing cycles both might be proper or not. This illustrates results of Green and Voisin.

Mathematical Physics

Long-time asymptotics of the Newell equation on the line

In 1978, A. C. Newell [SIAM J. Appl. Math. 35(4) (1978) 650-664] proposed an exactly solvable model called Newell equation, which simulates the investigation of significant interaction mechanism between long and short waves. Nearly fifty years have passed, yet the long-time asymptotics of the Newell equation remains an open problem to date, with no results reported. In this work, the long-time asymptotic behaviors of the solutions to this model under Schwartz class initial conditions are studied by using the Riemann-Hilbert formulation. Through direct and inverse scattering analysis, the corresponding Riemann-Hilbert problem is formulated, and its relationship with the solution to the initial-value problem of the Newell equation is established. The existence and uniqueness of the solution to the Riemann-Hilbert problem is proved by vanishing lemma. Subsequently, the asymptotic expressions of the solution to the initial-value problem in the dispersive wave region are obtained by using the Deift-Zhou nonlinear steepest descent method. This work extends Newell's original results, providing a rigorous proof for the findings presented in Section 4 of his paper, along with explicit expressions. Furthermore, the comparison between direct numerical simulations and the theoretical results obtained in this paper demonstrates the reliability of the asymptotic expressions.
Read the full abstract

Mathematical Physics

Griffiths inequalities and Gibbs-Bogoliubov inequality for general gauge glasses with Gaussian disorder on Nishimori line

We consider a class of gauge glass models with Gaussian disorder on the Nishimori line, including the Ising spin glass, the $XY$ gauge glass, the $Z_q$ gauge glass, and the gauge-invariant Potts model. We prove that the first and second Griffiths inequalities hold for these models on arbitrary lattice structures. As a consequence, both the pressure and the correlation functions are monotonically increasing with respect to the inverse temperature along the Nishimori line. Furthermore, we establish an analogue of the Gibbs–Bogoliubov inequality for this class of models. This result implies that, on the Nishimori line, the approximate quenched free energy obtained via the replica method with a replica-symmetric mean-field approximation is always greater than the true quenched free energy. Our results provide a broad generalization of previous results established for the Ising spin glass with Gaussian disorder on the Nishimori line.
Read the full abstract

Optimization and Control

Holistic Decision-Making in Stopping Problems: Emphasizing Psychological Aspects

Our research is closely related to ontological studies in mathematics. It provides crucial insights into the nature of decisions and strategies characterized by Markov moments. In a stopping game, a holistic decision-maker would evaluate comprehensive information by assessing the probabilities of various outcomes and their associated payoffs. This involves understanding the current state, historical data, and potential future scenarios. Such a decision-maker must also consider strategic interactions by anticipating and accounting for the strategies of other players. They must be flexible in adapting their strategy as the game evolves and able to integrate uncertainty by incorporating risk preferences and tolerances. They would perform scenario analysis to evaluate the impact of different stopping times under varying conditions. The goal of this modeling and its implementation in psychological practice is to introduce a novel method for assessing the state of players, leveraging deviations from rational strategies as diagnostic indicators of their psychological and decision-making profiles. The details of other models will be subject to contributed papers. The article presents the theoretical basis for combining various factors when modeling decision-making processes. The original title is "Rationality, Deviation, and Diagnosis: A Holistic Approach to Stopping Games" and will be used when it is possible to describe and interpret the results of the experiments we write about in the last section of the paper.
Read the full abstract

Classical Analysis and ODEs

Two-point completion of zero interlacing and Wronskian-type bounds, with applications to Jacobi and other orthogonal polynomials

We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using suitable mixed recurrence relations, we identify two additional points, called the completion points, required to obtain completed interlacing and establish general results for polynomials with real zeros. We also show that completed interlacing yields Wronskian-type bounds for the original polynomial pairs. The completed-interlacing results are applied to Jacobi, Meixner-Pollaczek, and Pseudo-Jacobi polynomials. In the Jacobi case, we improve earlier results by determining two explicit additional points that complete the interlacing of $P_n^{(\alpha,\beta)}$ and $P_{n+1}^{(\alpha+1,\beta+1)}$. We also analyze the locations of these points and show that the common-zero cases are non-generic in the Jacobi parameter domain. For this doubly-shifted Jacobi pair, the Wronskian-type bounds yield cross-family Turán-type inequalities and lead to an associated Stieltjes representation and complete-monotonicity consequences. For Meixner-Pollaczek polynomials, we address an open question concerning consecutive degrees with the parameter increased by one, and we obtain analogous completed interlacing results for Pseudo-Jacobi polynomials.
Read the full abstract

Functional Analysis

Some results on Krylov solvability in Banach space and connections to spectral theory

This article contains the first steps in a general analysis of the problem of Krylov solvability of the inverse linear problem in a Banach space. In contrast to the well-studied Hilbert space setting, the Banach space setting presents particular difficulties in creating the connection between Krylov solvability and structural properties of the Krylov subspace itself. At the centre of this is the fact that the closed Krylov subspace may not always have a topological complement. We also develop spectral tools in order to attack the problem using the resolvent operator and exploiting its holomorphic properties on the resolvent set.
Read the full abstract

Mathematical Physics

Co-rotating Vortices on Surfaces of Variable Negative Curvature: Hamiltonian Structure and Curvature-Induced Drift

Vortices in fluids and superfluids are fundamental to phenomena ranging from Bose-Einstein condensates and superfluid films to neutron stars and hydrodynamic micro-rotors, where background geometry often plays an important role. Curvature can induce vortex motion distinct from planar domains. We study Hamiltonian vortex motion on a catenoid, a minimal surface of variable negative curvature, and derive explicit equations of motion and conserved quantities for co-rotating vortex pairs. For two identical vortices we find an exact analytic solution in which the pair rotates rigidly at fixed latitude, with angular velocity $\Omega=(\Gamma/16\pi)\,K'(V)/\sqrt{-K(V)}$, where $K(V)$ is the Gaussian curvature. Thus the motion is governed by the curvature gradient rather than the curvature itself. This state is linearly unstable, with growth rate $\lambda=\sqrt{3}|\Omega|$, in agreement with numerical simulations. For generic co-rotating pairs, conservation of the Hamiltonian and rotational momentum reduces the nonlinear dynamics to a single quadrature, yielding bounded relative oscillations together with a secular azimuthal drift. Simulations of the full equations confirm this and reveal the same curvature-induced azimuthal drift in a localized many-vortex cluster, motivating a broader theory of collective vortex drift on curved surfaces.
Read the full abstract

Numerical Analysis

A bound-preserving oscillation-eliminating discontinuous Galerkin method with operator splitting for solving Kapila's five-equation model

This paper proposes a robust operator-splitting discontinuous Galerkin (DG) framework to overcome the severe stiffness-induced instabilities in simulating compressible two-phase flows governed by Kapila's five-equation model with the Tammann equation of state. Specifically, the system is decoupled into a five-equation transport model and a stiff $\kappa$-source term. The former is discretized via a quasi-conservative DG method \cite{cheng2020quasi}, while the latter is resolved by the local DG method combined with a novel adaptive implicit strategy that hybridizes the backward Euler and second-order singly diagonally implicit Runge-Kutta schemes. This implicit strategy possesses the unconditionally bound-preserving property, and thus effectively circumvents the severe stability constraints and time-step penalties inherent in traditional explicit schemes. Furthermore, to enhance computational robustness, we integrate an oscillation-eliminating DG (OEDG) procedure to suppresses spurious oscillations without characteristic decomposition, complemented by a bound-preserving limiter to maintain physically admissible numerical solutions. We also prove that the proposed operator-splitting DG framework, integrated with the oscillation-eliminating limiter, and the bound-preserving limiter, strictly satisfies the Abgrall condition. Finally, extensive numerical experiments are conducted to demonstrate the superior robustness and efficiency of the method.
Read the full abstract

All authors Jia-Jun Zou, Yu-Chang Liu, Fan Zhang, Qi Kong, Yun-Long Liu, A-Man Zhang

Combinatorics

Arithmetical Structures on Ladder Graphs

In this paper, we investigate arithmetical structures on Cartesian product graphs, particularly, ladder graph of the form P2\square Pm and grid graph of the form Pn \square Pm. An arithmetical structure on a finite and connected graph G is a pair (d, r) of positive integer vectors such that r is primitive (the gcd of its entries is 1) and (diag(d) - A)r = 0, where A is the adjacency matrix of G. Arithmetical structures have been widely studied for basic graph families such as paths and cycles. Extending these ideas to graph products, we first analyze the ladder graph P2 \square Pm, deriving structural properties and identifying patterns in the corresponding arithmetical configurations. We then generalize these results to the grid graph Pn \square Pm, where increased complexity arises due to higher-dimensional interactions. Our work provides new insights into the behavior, characterization, and enumeration of arithmetical structures on grid-like graphs, contributing to the broader understanding of Laplacian based invariants and their combinatorial properties.
Read the full abstract

Analysis of PDEs

Boundary epsilon regularity for incompressible Navier–Stokes equations via weak-strong uniqueness

We show that finite-energy weak solutions to the incompressible Navier–Stokes equations on a three-dimensional bounded smooth domain are regular up to the boundary, provided that the $L^4_tL^4_x$-norm of the solution is smaller than a constant depending only on the domain. This answers a problem raised in [D. Albritton, T. Barker, and C. Prange, J. Math. Fluid Mech. 25 (2023), Paper No. 49]. Our proof relies on a new slicing construction near the boundary of the domain.
Read the full abstract

Statistics Theory

Sharp adaptive nonparametric testing for constant volatility

Based on discrete observations, we develop a test to infer if the volatility function $\sigma(\cdot)$ within the nonparametric Gaussian white noise model $dY_t = \sigma(t)dW_t$ is constant. The testing procedure is shown to be minimax-optimal and adaptive for infill asymptotics and these results entail that a deviation from the null hypothesis of constancy is best measured in terms of the ratio of $\sigma(t)$ and its $L^2$-average. The derivation of optimal constants requires the construction of hypotheses with height $h(b)$, where the parameter $b$ solves $F_n(b)=0$ for given functions $F_n$. Proving this equation to be solvable for each $n\in\mathbb{N}$ and establishing quantitative bounds of the solutions is built upon the implicit function theorem.
Read the full abstract

Optimization and Control · Cross-listed from stat.ML

Deflation-Free Optimal Scoring

Sparse Optimal Scoring (SOS) reformulates linear discriminant analysis to enable feature selection through elastic net regularization, making it well-suited for high-dimensional settings where the number of features exceeds observations. Most existing SOS methods use deflation-based strategies that compute discriminant vectors sequentially, which can propagate errors and produce suboptimal solutions. We propose a novel approach that estimates all discriminant vectors simultaneously under an explicit global orthogonality constraint, which we call Deflation-Free Sparse Optimal Scoring (DFSOS). DFSOS combines Bregman iteration with orthogonality-constrained optimization, decomposing the problem into tractable subproblems for scoring vectors, discriminant vectors, and orthogonality enforcement. We establish convergence to stationary points of the augmented Lagrangian under mild conditions. Extensive experiments using synthetic data and real-world time series data demonstrate that DFSOS achieves classification accuracy comparable to or better than existing deflation-based methods. These results indicate that deflation-free approaches offer a robust and effective framework for sparse discriminant analysis in high-dimensional problems.
Read the full abstract

Mathematical Physics

On phase retrieval for continuous and discrete Fourier transforms

We continue studies on phase retrieval for continuous and discrete Fourier transforms in multidimensions. Using finite difference operators, we give a large class of unexpected examples of non-uniqueness for this problem, including examples with the sparsity condition. A prototype of this construction in the continuous case is given in the work Novikov, Xu (JFAA, 2026), using linear differential operators. The construction of the present work also yields a large class of non-trivial Pauli partners, i.e., different functions with the same intensities in both configuration and Fourier domains. Besides, our construction yields examples that solve an old open question in phase retrieval with background information arising in many areas including Fourier holography.
Read the full abstract