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

Mathematical Physics · Cross-listed from hep-th

Flux Quantization on M-Strings

The electric Gauss law in 11D SuGra is famously non-linear, whence its flux quantization must be in nonabelian cohomology. We have previously shown that the minimal admissible choice is 4-Cohomotopy, which in the presence of magnetized M5-probes takes its relative twistorial form. Here we discuss how this situation is further refined in the presence of M-string probes on the M5-worldvolume. Based on the superspace formulation of 11D SuGra, we find the nested Bianchi identities by iterating the superembedding construction for super p-branes. The resulting probe brane hierarchy (M1 on magnetized M5 in 11D bulk) turns out to admit flux quantization in a doubly-relative form of twisted Cohomotopy, classified by the factorization of the quaternionic Hopf fibration through the twistor fibration. The further equivariant refinement of this cohomology theory reduces on A-type singularities to a form of relative 2-Cohomotopy which geometrically engineers Chern-insulator phases on $\mathrm{M5}\cap \mathrm{A}_n$, with the M-string playing the role of gapped nodal lines.
Read the full abstract

Combinatorics

On Borodin-Kostochka conjecture for correspondence coloring

Borodin and Kostochka in 1977 conjectured that if a graph $G$ has maximum degree $\Delta(G)\ge 9$ and its clique number satisfies $\omega(G)\le \Delta(G)-1$, then its chromatic number satisfies $\chi(G) \le \Delta(G)-1$. We prove this statement with respect to a stronger graph coloring parameter, the correspondence chromatic number $\chi_{DP}$, provided the maximum degree is sufficiently large. More precisely, we prove that for every integer $\Delta\ge 3\cdot 10^9$, a graph $G$ of maximum degree at most $\Delta$ satisfies $\chi_{DP}(G) \le \max(\omega(G),\Delta-1)$. This strengthens earlier results of Reed (1999) for usual chromatic number and of Choi, Kierstead and Rabern (2023) for list chromatic number.
Read the full abstract

Mathematical Physics · Cross-listed from cond-mat.stat-mech

Nonholonomic constraints at finite temperature

We investigate the behavior of dynamical systems with nonholonomic constraints when coupled to a thermal bath, focusing on the paradigmatic case of the Chaplygin sleigh. A straightforward Langevin-type approach obtained by naively adding stochastic and dissipative terms to the equations of motion predicts a regime in which useful work can be extracted, violating the second law of thermodynamics. To resolve this paradox, we resort to a physically motivated implementation of the nonholonomic constraint as the limiting case of a viscous interaction. However, at finite temperature, fluctuation-dissipation relations imply that the viscous force has to be complemented with stochastic forces acting at the contact. We show that their incorporation restores compliance with the second law. Therefore, our results place fundamental limits on the physical realizability of idealized nonholonomic constraints.
Read the full abstract

Statistics Theory

Tighter Confidence Intervals under Without Replacement Sampling via Empirical Rate Functions

We consider the problem of constructing confidence intervals (CIs) for the population mean of $N$ values $\{x_1, \ldots, x_N\} \subset \Sigma^N$ based on a random sample of size $n$, denoted by $X^n \equiv (X_1, \ldots, X_n)$, drawn uniformly without replacement (WoR). We begin by focusing on the finite alphabet ($|\Sigma| = k <\infty$) and moderate accuracy ($\log(1/\alpha_N) \gg (k+1)\log N$) regime, and derive a fundamental lower bound on the width of any level-$(1-\alpha_N)$ CI in terms of the inverse of the WoR rate functions from the theory of large deviations. Guided by this lower bound, we propose a new level-$(1-\alpha_N)$ CI using an empirical inverse rate function, and show that in certain asymptotic regimes the width of this CI matches the lower bound up to constants. We also derive a dual formulation of the inverse rate function that enables efficient computation of our proposed CI. We then move beyond the finite alphabet case and use a Bernoulli coupling idea to construct an almost sure CI for $\Sigma = [0,1]$, and a conceptually simple nonasymptotic CI for the case of $\Sigma$ being a $(2,D)$ smooth Banach space. For both finite and general alphabets, our results employ classical large deviation techniques in novel ways, thus establishing new connections between estimation under WoR sampling and the theory of large deviations.
Read the full abstract

Numerical Analysis

High-precision quadrature via local Fourier extension: analytic integration, uniform sampling, and correction for piecewise smooth integrands

We propose a high-precision numerical quadrature framework based on local Fourier extension (LFE) approximations. The method constructs, on each subinterval, a truncated-SVD stabilized local Fourier continuation of the integrand on an extended periodic domain, and then evaluates the integral analytically from the resulting Fourier coefficients. Under uniform sampling, the discrete LFE matrix and its TSVD factors are precomputed once and reused across all windows, yielding an efficient offline/online implementation that remains compatible with classical composite rules. We provide an error bound that reduces the quadrature error to the LFE approximation error and derive algebraic convergence rates for Sobolev-regular integrands. Numerical experiments demonstrate that, on smooth functions, the proposed quadrature reaches near machine precision with substantially fewer nodes than the composite Simpson rule. The advantage persists for oscillatory and variable-frequency integrands and becomes more pronounced for nonuniform phase structures. For continuous piecewise smooth integrands, we develop a correction strategy driven by coefficient-energy outliers to identify singularity-containing windows, followed by a localized procedure that brackets the singular point within one grid cell and corrects only the affected window contribution. The corrected quadrature restores near-spectral accuracy in the reported tests, including cases where the singularity is not aligned with the window endpoints.
Read the full abstract

Differential Geometry

Rigidity of Nilpotent Lie Foliations: Cohomological Obstructions and Classification

In this article, we develop a systematic cohomological framework for the study of the rigidity of nilpotent Lie foliations with respect to solvable deformations. We introduce the deformation complex associated to a pair of Lie algebras $(\mathfrak{g}, \mathfrak{h})$ and show that the main obstruction to deforming a nilpotent Lie foliation into a non-nilpotent solvable foliation lies in the cohomology group $H^2(\mathfrak{g},\mathfrak{g}/[\mathfrak{g},\mathfrak{g}])$. We establish a necessary and sufficient algebraic criterion for rigidity within the family of foliations modelled on the generalized Heisenberg groups $H_{2k+1}$. This result unifies and generalizes the construction of Dathe–Ndiaye (2012) as well as its subsequent extensions. We complete the article with a full classification of nilpotent Lie foliations of codimension at most six according to their deformation behaviour.
Read the full abstract

General Topology

The Set-Self-Tietze Property

We introduce the set-self-Tietze property, an analogue of the self-Tietze property for upper semi-continuous set-valued functions. A topological space $X$ is self-Tietze, if for every closed $A \subseteq X$ and continuous function $f \colon A \to X$, there is a continuous extension $F \colon X \to X$ of $f$. A topological space $X$ is set-self-Tietze, if for every closed $A \subseteq X$ and upper semi-continuous set-valued function $f \colon A \to 2^X$, there exists an upper semi-continuous set-valued function $F \colon X \to 2^X$ such that $\left. F \right|_A = f$. We show every compact metric space is set-self-Tietze, and that the torus is not self-Tietze.
Read the full abstract

Probability

Elephant Random Walk on the Triangular Lattice

In this report, we introduce the elephant random walk on the triangular lattice over $R^2$ incorporating directions by extending the model developed in \cite{baur2016elephant}. We study the behavior of the walk by finding the appropriate scaling limits. This model was studied as a part of my Master of Statistics, 2018 final year dissertation at Indian Statistical Institute, Kolkata.
Read the full abstract

Combinatorics

On $(1^2,2^2)$-packing edge-coloring of sparse subcubic graphs

For positive integers $\ell$ and $k$, a $(1^\ell, 2^k)$-packing edge-coloring of a graph $G$ is a partition of $E(G)$ into $\ell$ matchings and $k$ induced matchings. A graph is $d$-irregular if it has no adjacent vertices of degree $d$. Yang and Wu proved that every $3$-irregular subcubic graph admits a $(1,2^4)$-packing edge-coloring, which answered an open question of Hocquad, Lajou, and Lu\v zar in the affirmative. In this paper, we prove an analogue result that every $3$-irregular subcubic multigraph is $(1^2,2^2)$-packing edge-colorable. Our result is sharp since there are $3$-irregular subcubic graphs that are not $(1,2^3)$-packing edge-colorable and $(1^2,2)$-packing edge-colorable, respectively. Hocquad, Lajou, and Lu\v zar conjectured that every subcubic planar graph is $(1^2,2^3)$-packing edge-colorable. Furthermore, they found a subcubic planar graph with girth $3$ that is not $(1^2,2^2)$-packing edge-colorable. For every fixed integer $k \ge 3$, we found graphs with girth $k$ that are not $(1^2,2)$- and not $(1,2^3)$-packing edge-colorable. It is natural to consider the question "what is the minimum positive integer $g$ such that every subcubic planar graph with girth at least $g$ is $(1^2,2^2)$-packing edge-colorable?". We prove $g$ is finite and in fact $g \le 20$. We also provide an example showing $g \ge 6$.
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

Data-Enabled Policy and Value Iteration for Continuous-Time Linear Quadratic Output Feedback Control

This paper proposes efficient policy iteration and value iteration algorithms for the continuous-time linear quadratic regulator problem with unmeasurable states and unknown system dynamics, from the perspective of direct data-driven control. Specifically, by re-examining the data characteristics of input-output filtered vectors and introducing QR decomposition, an improved substitute state construction method is presented that further eliminates redundant information, ensures a full row rank data matrix, and enables a complete parameterized representation of the feedback controller. Furthermore, the original problem is transformed into an equivalent linear quadratic regulator problem defined on the substitute state with a known input matrix, verifying the stabilizability and detectability of the transformed system. Consequently, model-free policy iteration and value iteration algorithms are designed that fully exploit the full row rank substitute state data matrix. The proposed algorithms offer distinct advantages: they avoid the need for prior knowledge of the system order or the calculation of signal derivatives and integrals; the iterative equations can be solved directly without relying on the traditional least-squares paradigm, guaranteeing feasibility in both single-output and multi-output settings; and they demonstrate superior numerical stability, reduced data demand, and higher computational efficiency. Moreover, the heuristic results regarding trajectory generation for continuous-time systems are discussed, circumventing potential failure modes associated with existing approaches.
Read the full abstract

All authors Jun Xie, Yuan-Hua Ni, Yiqin Yang, Bo Xu

Dynamical Systems · Cross-listed from eess.SP

Geometric Mode-Selection Scores for Delay-Coordinates Dynamic Mode Decomposition

Delay-coordinates dynamic mode decomposition (DC-DMD) is widely used to extract coherent spatiotemporal modes from high-dimensional time series. A central challenge is distinguishing dynamically meaningful modes from spurious modes induced by noise and order overestimation. We frame this as a mode-selection scoring problem: each mode receives a score that ranks it as true or spurious; any hard selection (threshold or clustering) is a downstream choice. We show that mode selection in DC-DMD is fundamentally a problem of subspace geometry. True modes are characterized by concentration within a low-dimensional signal subspace, whereas spurious modes tend to retain non-negligible components outside any moderate overestimate of that subspace. This geometric distinction defines true and spurious modes and motivates fully data-driven robust scoring criteria. The framework yields two complementary scores. The first uses a data-driven proxy of the signal subspace to compute a residual. The second comes from a new operator-theoretic analysis of delay embedding: using a block-companion formulation, we show that all modes exhibit a Kronecker-Vandermonde (KV) structure, with true modes distinguished by the degree of conformity to it. This deviation is governed by the geometric residual. Our analysis further explains the empirical behavior of magnitude- and norm-based heuristics and clarifies when and why they fail under delay coordinates. Numerical experiments, evaluated by precision-recall AUC of true-vs-spurious ranking, show that the proposed scores outperform the tested baselines across most of the small-spatial-dimension regime.
Read the full abstract

Combinatorics

Group and algebra hyperdeterminant

In 1896, Dedekind posed the problem of factoring the group determinant in the non-abelian case to Frobenius, whose solution sparked the birth of finite-group representation theory. Several decades earlier, Cayley introduced the notion of the combinatorial hyperdeterminant of a $d$-way tensor, which is the most natural generalization of an ordinary determinant. In this note, we solve the problem of factoring the group hyperdeterminant. We reduce the computation of the group hyperdeterminant to the computation of the hyperdeterminant at the matrix multiplication tensor and derive a nice closed formula. Further, we extend this notion to associative algebra tensors and show that this polynomial is nonzero if and only if the algebra is semisimple.
Read the full abstract

Combinatorics

Maximal green sequences for quantum and Poisson CGL extensions

We prove that the quantum and classical cluster algebras for all members of the axiomatically defined classes of symmetric quantum and Poisson Cauchon-Goodearl-Letzter extensions possess maximal green sequences in the sense of Keller. Previously, maximal green sequences were constructed for explicit families of cluster algebras; many of those can be recovered from the general result for CGL extensions.
Read the full abstract

Combinatorics

The homotopy type of the clique complex of the partition graph

For each positive integer $n$, let $G_n$ be the graph whose vertices are the partitions of $n$, with edges corresponding to elementary transfers of one cell between two parts, followed by reordering. Let $K_n := \mathrm{Cl}(G_n)$ be the clique complex of $G_n$. We prove that $K_n$ is homotopy equivalent to a wedge of $2$-spheres. More precisely, $K_n$ is homotopy equivalent to a wedge of $b_n$ copies of $S^2$, where $b_n = \chi(K_n) - 1$. Thus the homotopy type of $K_n$ is completely determined by its Euler characteristic. The proof has three main ingredients. First, we classify all cliques in $G_n$ via two canonical families of simplices, called star-simplices and top-simplices, and use them to build a canonical cover of $K_n$. Second, we pass to the corresponding nerve, construct a second natural cover, and show via the intersection poset of that cover that $K_n$ has the homotopy type of a CW-complex of dimension at most $2$. Third, using an explicit height function on partitions, we prove that $K_n$ is connected and simply connected. It follows that the reduced homology of $K_n$ is concentrated in degree $2$, where its rank is $\chi(K_n) - 1$, and therefore $K_n$ has the homotopy type claimed above. We conclude with remarks on Euler characteristics, small examples, and the integer sequences arising from these complexes.
Read the full abstract

Mathematical Physics · Cross-listed from gr-qc

Isomorphism between the local Poincare generalized translations group and the group of spacetime transformations (x LB1)4

We will prove that there is a direct relationship between the Poincare subgroup of translations, and the group of tetrad transformations LB1 introduced in a previous manuscript. LB1 is the group composed by SO(1; 1) plus two kinds of discrete transformations. Translations have been extensively studied under the scope of gauge theories. By using the geometric structures built to prove this elementary result we will generalize it to the case of what we might call local translations. A special case of the latter is the Bondi-Metzner-Sachs subgroup of supertranslations. In order to accomplish this goal and since the group of translations is four-dimensional we will prove first that it is isomorphic to (x LB1)4. In order to prove this claim we will introduce a system of differential equations involving several kinds of fields. Abelian, non-Abelian, spinor, gravitational. These fields will constitute the structure needed to build local tetrads of a new kind that allow for the proof to be carried out with simplicity. Results already obtained involving similar but not equal tetrads will be useful in our constructions and demonstrations. Translations and generalized translations isomorphic to tensor products of LB1 groups are not trivial results. Because the LB1 group is composed by SO(1; 1) and two discrete transformations.
Read the full abstract

Algebraic Geometry

Transcendental b-divisors II – Monotonicity theorem

In this paper, we develop the general intersection theory of nef b-divisors, extending the movable intersection theory. We define a notion of restricted volume of b-divisors and prove a quantitative version of the monotonicity of the intersection product. As a consequence, we prove a number of new volume inequalities of currents and cohomology classes.
Read the full abstract

Operator Algebras

Strongly 1-bounded inner amenable groups

It is shown that finitely presented icc inner amenable groups yield strongly 1-bounded II_1 factors.

Information Theory

A Unified Pulse-Shaped OFDM Framework for Chirp-Domain Waveforms: Continuous-Time Modeling and Practical I/O Analysis

A unified framework for chirp-domain waveforms, including orthogonal chirp division multiplexing (OCDM) and affine frequency division multiplexing (AFDM), is developed. Their continuous-time representations are shown to fall within the conventional Weyl-Heisenberg (WH) framework for multicarrier waveforms, with the root chirp as the prototype pulse. Since the root chirp has constant envelope and is transparent to subcarrier orthogonality, these waveforms can be further interpreted as pulse-shaped (PS) orthogonal frequency division multiplexing (OFDM) signals, whose power spectral density is derived analytically. The derived spectrum reveals that implementations based on the discrete affine Fourier transform rely on sub-Nyquist samples and exhibit frequency aliasing. We prove that the corresponding aliased chirps are only conditionally orthogonal, whereas sample-wise root-Nyquist pulse shaping of the discrete-time AFDM (DT-AFDM) sequence produces mutually orthogonal pulse-shaped chirps, resulting in the pulse-shaped AFDM (PS-AFDM) waveform. We then derive an exact waveform-level input-output (I/O) relation for PS-AFDM over delay-Doppler (DD) channels, showing that the effective channel at a practical receiver is generally not a superposition of pure path-wise DD components. Waveform simulations verify the derived relation to machine precision, while the conventional sequence-level I/O relation for DT-AFDM exhibits a substantial mismatch with waveform behavior for practical channels with continuous-valued delays.
Read the full abstract

All authors Yating Jiang, Hai Lin, Yi-Han Chiang, Jun Tong

Algebraic Geometry

Transcendental b-divisors I – Correspondence with currents

We study transcendental b-divisors over compact Kähler manifolds. We establish the correspondence between closed positive currents and nef b-divisors. As an application, we establish the intersection theory of nef b-divisors, answering a question of Dang–Favre.

Differential Geometry

Yamabe problems for formally self-adjoint, conformally covariant, polydifferential operators

Formally self-adjoint, conformally covariant, polydifferential operators provide a general framework for studying variational problems, such as prescribing the scalar, $Q$-, or $\sigma_2$-curvatures, within a conformal class. We describe recent progress on Yamabe problems for such operators, including uniqueness results on the sphere and nonuniqueness results in general. We also highlight a number of open questions related to these operators, some of which constitute a possible blueprint for the general solution of the Yamabe problem for polydifferential operators.
Read the full abstract

Geometric Topology

Fixed point theorem for cluster modular groups

We prove that any finite subgroup $G \subset \Gamma_{{\boldsymbol{s}}}$ of the cluster modular group has fixed points in the cluster manifolds $\mathcal{A}_{\boldsymbol{s}}(\mathbb{R}_{>0})$ and $\mathcal{X}_{\boldsymbol{s}}(\mathbb{R}_{>0})$ under a certain condition. This generalizes Kerckhoff's Nielsen realization theorem [Ker83] for the mapping class group action on the Teichmüller space. The condition holds whenever $\Gamma_{\boldsymbol{s}}$ admits a cluster DT transformation, and it can be also verified for all finite mutation types except for $X_7$. Our proof closely follows Kerckhoff's argument, based on the convexity of log-cluster variables.
Read the full abstract

Combinatorics · Cross-listed from cs.DS

Better approximation guarantee for Asymmetric TSP

We improve the approximation ratio for the Asymmetric TSP to less than 15. We also obtain improved ratios for the special case of unweighted digraphs and the generalization where we ask for a minimum-cost tour with given (distinct) endpoints. Moreover, we prove better upper bounds on the integrality ratios of the natural LP relaxations.
Read the full abstract

Information Theory

Fundamental Limits of CSI Compression in FDD Massive MIMO

Channel state information (CSI) feedback in frequency-division duplex (FDD) massive multiple-input multiple-output (MIMO) systems is fundamentally limited by the high dimensionality of wideband channels. In this paper, we model the stacked wideband CSI vector as a Gaussian-mixture source with a latent geometry state that represents different propagation environments. Each component corresponds to a locally stationary regime characterized by a correlated proper complex Gaussian distribution with its own covariance matrix. This representation captures the multimodal nature of practical CSI datasets while preserving the analytical tractability of Gaussian models. Motivated by this structure, we propose Gaussian-mixture transform coding (GMTC), a practical CSI feedback architecture that combines state inference with state-adaptive TC. The mixture parameters are learned offline from channel samples and stored as a shared statistical dictionary at both the user equipment (UE) and the base station. For each CSI realization, the UE identifies the most likely geometry state, encodes the corresponding label using a lossless source code, and compresses the CSI using the Karhunen-Loeve transform matched to that state. We further characterize the fundamental limits of CSI compression under this model by deriving analytical converse and achievability bounds on the rate-distortion (RD) function. A key structural result is that the optimal bit allocation across all mixture components is governed by a single global reverse-waterfilling level. Simulations on the COST2100 dataset show that GMTC significantly improves the RD tradeoff relative to neural transform coding approaches while requiring substantially smaller model memory and lower inference complexity. These results indicate that near-optimal CSI compression can be achieved through state-adaptive TC without relying on large neural encoders.
Read the full abstract

All authors Bumsu Park, Youngmok Park, Chanho Park, Namyoon Lee

Optimization and Control · Cross-listed from cs.LG

Enhancing LLM Training via Spectral Clipping

While spectral-based optimizers like Muon operate directly on the spectrum of updates, standard adaptive methods such as AdamW do not account for the spectral structure of weights and gradients, leaving them vulnerable to two empirical issues in large language model (LLM) training: (i) the optimizer updates can have large spectral norms, potentially destabilizing training and degrading generalization; (ii) stochastic gradient noise can exhibit sparse spectral spikes, with a few dominant singular values much larger than the rest. We propose SPECTRA, a general framework addressing these by (i) post-spectral clipping of updates to enforce spectral-norm constraints (ii) optional pre-spectral clipping of gradients to suppress spectral noise spikes. We prove that post-clipping constitutes a Composite Frank-Wolfe method with spectral-norm constraints and weight regularization. We further analyze how pre-clipping mitigates sparse spectral spikes. We propose efficient soft spectral clipping via Newton-Schulz iterations, avoiding expensive SVD. Experiments on LLM pretraining show SPECTRA uniformly improves validation loss for various optimizers, including AdamW, Signum, Mars, and AdEMAMix, with the best-performing variants achieving state-of-the-art results. Models trained with SPECTRA exhibit smaller weight norms, confirming the link between spectral clipping and regularization.
Read the full abstract

Optimization and Control

A Convergence-Guaranteed Algorithm for Stochastic Optimal Control Problems

Stochastic Optimal Control Problems (SOCPs) plays a major role in the sequential decision-making challenges. There exist various iterative algorithms, under framework of stochastic maximum principle, that sequentially find the optimal control decision. However, they are based on the adjoint sensitivity analysis that necessitates simulation of an adjoint process, typically a backward stochastic differential equation (SDE) that must simultaneously be adapted to a forward filtration and satisfy a terminal condition, which substantially increases complexity and exacerbates the curse of dimensionality. We instead develop a stochastic maximum principle based on the Malliavin calculus, which enables us to devise an iterative algorithm without need of an adjoint process. Our algorithm however needs the Malliavin derivative that can be efficiently computed based on a forward simulator. Empirical comparisons against standard iterative algorithms demonstrate that our approach alleviates the dimensionality bottleneck while delivering competitive performance on the considered SOCPs.
Read the full abstract

Probability

On Partition Functions for Time-Inhomogeneous Branching Random Walks

We establish the phase transition and universality for the partition function of time inhomogeneous branching random walks (BRWs) with decreasing variance increment,a model related to two dimensional directed polymers. By modifying Berestycki's GMC framework (removing martingale property dependency) and adapting it to discrete BRWs, we prove that the critical value of time inhomogeneous BRWs coincides with that of time homogeneous ones, and the partition functions converge in L1 in the subcritical regime. We also extend the universality at the critical parameter, showing the same decay rate of partition functions. Our approach reveals the potential for such framework in GMC, which provides a new technical path for martingale free processes and random fields beyond log correlated. Finally, we raise some open problems related to GMC beyond log correlations, branching Brownian motions and directed polymers.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Windowed Fourier Propagator: A Frequency-Local Neural Operator for Wave Equations in Inhomogeneous Media

Wave equations are fundamental to describing a vast array of physical phenomena, yet their simulation in inhomogeneous media poses a computational challenge due to the highly oscillatory nature of the solutions. To overcome the high costs of traditional solvers, we propose the Windowed Fourier Propagator (WFP), a novel neural operator that efficiently learns the solution operator. The WFP's design is rooted in the physical principle of frequency locality, where wave energy scatters primarily to adjacent frequencies. By learning a set of compact, localized propagators, each mapping an input frequency to a small window of outputs, our method avoids the complexity of dense interaction models and achieves computational efficiency. Another key feature is the explicit preservation of superposition, which enables remarkable generalization from simple training data (e.g., plane waves) to arbitrary, complex wave states. We demonstrate that the WFP provides an explainable, efficient and accurate framework for data-driven wave modeling in complex media.
Read the full abstract

All authors Yiyang Cai, Zixuan Qiu, Yunlu Shu, Jiamao Wu, Yingzhou Li, Tianyu Wang, Xi Chen

Analysis of PDEs

On the Limiting Behavior of $L^2$-Critical Pseudo-Relativistic Fermi Systems

We consider ground states of a pseudo-relativistic Fermi system in the $L^2$-critical case. We prove that the system admits ground states, if and only if the attractive strength $a$ satisfies $0<a<D_{4/3,2}$, where $D_{4/3,2}\in(0, \infty)$ is the optimal constant of a dual fractional Lieb–Thirring inequality. The limiting behavior of ground states for the system is further analyzed as $a\nearrow D_{4/3,2}$. As a byproduct, the qualitative properties of optimizers for the dual fractional Lieb-Thirring inequality are also investigated.
Read the full abstract

All authors Bin Chen, Yinbin Deng, Yujin Guo, Chenyang Wang

History and Overview of Mathematics

An interview with Bernard Teissier

This text is a reworked version of a recorded interview with Bernard Teissier conducted in his house in Paris, on 28 and 29 September 2024.