General Mathematics
Extended Central Factorial Numbers and the Flickering Operator
Andrii Husiev
This paper introduces a class of extended central factorial numbers generated by a parity-dependent recurrence relation, termed the "flickering operator". We demonstrate that the resulting triangular structure, now indexed as OEIS A395021, provides a unified recursive framework for alternating bit sequences (A000975) and normalized tangent-secant coefficients (A036969). This study provides an alternative integer-based expansion for power sums. While similar to the central factorial methods explored by Knuth (1993), our flickering basis offers an integrated computational scheme that avoids fractional Bernoulli numbers by construction. We provide explicit closed-form expressions, discuss its
geometric derivation from finite difference tables, and present a full Python implementation. Structural Synthesis. A key contribution of this work is the unification of previously disparate combinatorial sequences into a single coherent framework. While certain columns of the flickering triangle T(n, k) (such as A008957) could be partially retrieved from the diagonals of existing central factorial arrays, our structure provides a complete representation including previously unindexed even-positioned terms. Furthermore, the row-wise analysis reveals that the flickering operator generates full integer sequences where previously only the odd-indexed elements (e.g., A002451) were identified. This synthesis bridges the gap between these sequences, positioning A395021 as the underlying master structure.
Read the full abstract ▾
Probability · Cross-listed from q-fin.CP
American Options Pricing under Heston Model via Curriculum Learning in Coupled PINNs
Rohan, Siddanth Shetty and Amit N. Kumar
In American options, the early exercise feature allows the option to be exercised at any time prior to expiration. However, this flexibility introduces a challenge: the pricing model must value the option while simultaneously determining an unknown, time-varying exercise boundary. The Heston model is one of the most popular ways to model real
market behavior because it allows
volatility to change over time. However, unlike European options, there is no closed-form solution for American options under the Heston model, so we have to use numerical methods. In this paper, we propose a novel approach to solving the
stochastic Heston partial differential equation for American options, using coupled physics-informed neural networks (PINNs) to predict both the option price and the free boundary, while employing curriculum learning and adaptive resampling to stabilize model training. Our work builds on recent deep learning methods but introduces a more effective training strategy to address the limitations of these approaches. The numerical results demonstrate the effectiveness of the proposed learning framework, providing a robust and efficient alternative to pricing American options, enabling rapid inference and accurate estimation under
stochastic volatility.
Read the full abstract ▾
Quantum Algebra
Bosonic Ghost Correlators: A Case Study
Xueting Li, Damodar Rajbhandari and David Ridout
There has been a lot of recent work addressing the representation theory that underlies logarithmic conformal field theories. A full understanding of these models will however also need analytic data, in particular the correlation functions. Here, we explore the correlators of one of the most fundamental of all logarithmic models: the bosonic ghost system. In this first part, we use differential equations to show that certain correlation functions may be expressed using hypergeometric functions. Our main result is the consequent verification that there are four-point functions with logarithmic singularities. In a sequel, we will employ Coulomb gas and bootstrap methods to further refine the results presented here.
Read the full abstract ▾
Dynamical Systems · Cross-listed from eess.SY
Distributed Attraction-Repulsion Potential for Multi-Agent Formation Control
Hemanta Ban, Seddik M. Djouadi and Kevin Tomsovic
In this paper, a distributed multi-
agent formation control driven by the gradient of the Lennard-Jones potential is analyzed. For collision-free initial data, we prove global well-posedness together with a uniform lower bound on all inter-
agent distances, thereby excluding hard collisions. Taking the total energy as a Lyapunov function, LaSalle's invariance principle shows that every positive limit point is an
equilibrium. Since trajectories remain uniformly away from collisions, the energy is analytic along the flow and an argument yields convergence to a single
equilibrium modulo translations. Illustrative numerical examples are presented.
Read the full abstract ▾
Number Theory
Sets of integers satisfying Bateman-Horn statistics
William Banks and Kevin Ford
In 1962, Bateman and Horn conjectured precise asymptotics for the count of positive integers n \le x for which f_1(n), ..., f_k(n) are all
prime, where (f_1, ..., f_k) is an admissible k-tuple of
polynomials in one variable. We prove that certain random sets of integers almost surely satisfy the Bateman-Horn asymptotics in full generality and with a strong error term, where we have replaced "f_1(n), ..., f_k(n) are all
prime" with "f_1(n), ..., f_k(n) all lie in the random set." In particular, sets of integers satisfying Bateman-Horn are plentiful.
Read the full abstract ▾
Information Theory · Cross-listed from quant-ph
ADaPT: Adaptive-window Decoding for Practical fault-Tolerance
Tina Oberoi, Joshua Viszlai and Frederic T. Chong
Window decoding, first proposed to reduce decoding complexity for real-time decoding, is an essential component to realize scalable, universal-fault tolerant computation. Prior work has focused on improving throughput through parallelization and reducing reaction time via speculation on window boundaries. However, these methods use a fixed window size d, paying a fixed decoding time overhead for each window. In practice, we find this overhead of a fixed window size unnecessary in many cases due to the sparsity of average-case errors in QEC. Leveraging this insight, in this paper we propose an adaptive window decoding technique based on decoder confidence. This technique reduces the overhead in decoding time thus reducing reaction time without compromising on logical error rates. We
benchmark adaptive window decoding across different codes and hardware inspired noise models. Our results show that this adaptive technique reaches the target error rate while maintaining a low decoding time overhead across different codes, and under different noise models.
Read the full abstract ▾
Spectral Theory · Cross-listed from cs.LG
Spectral Graph Sparsification Preserves Representation Geometry in Graph Neural Networks
Sanjukta Krishnagopal
Spectral graph sparsification is a classical tool for reducing graph complexity while preserving
Laplacian quadratic forms. In graph neural networks (GNNs), sparsification is often used to accelerate computation while maintaining predictive performance. In this work, we study a complementary representation-level question: does sparsification preserve the geometry of learned
embeddings? For
polynomial-filter GNNs, we prove that any $\epsilon$-spectral sparsifier induces $O(\epsilon)$ perturbations in
polynomial graph filters, multilayer hidden representations, and their Gram
matrices. These guarantees imply stability of squared pairwise distances, class means, and covariance structure in
embedding space. We further establish finite-time training stability: under smoothness and boundedness assumptions, gradient descent on dense and sparsified graphs produces weight trajectories whose separation grows at most proportionally to the sparsification distortion. Empirically, effective-resistance sparsification validates the predicted perturbation chain on synthetic graphs and preserves hidden representation geometry on real
datasets. In our experiments, the gram
matrix and training dynamics show low divergence even under substantial sparsification, consistent with the predicted stability under spectral sparsification. Hidden Gram preservation strongly predicts neighborhood preservation and class-centroid stability across FashionMNIST, Cora, and Paul15. Together, these results show that spectral sparsification preserves not only graph operators, but also the representation geometry that supports downstream use of GNN
embeddings for interpretability.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.AI
New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search
Jay Bhan, Nicole Nobili and Patrick Langer
The Zarankiewicz number $\textbf{Z}(m, n, s, t)$ is the maximum number of edges in a bipartite graph $G_{m, n}$ such that there is no complete $K_{s, t}$ bipartite subgraph. We determine for the first time the exact values of three Zarankiewicz numbers: $\textbf{Z}(11, 21, 3, 3)=116$, $\textbf{Z}(11, 22, 3, 3)=121$, and $\textbf{Z}(12, 22, 3, 3)=132$. We further establish lower bounds for 41 more Zarankiewicz numbers, including several that are within one edge of the best known upper bound, and we match the established value in four more closed cases. Our results are obtained using OpenEvolve, an open-source evolutionary
algorithm based on Large
Language Models (LLMs) that iteratively improves
algorithms for generating mathematical constructions by optimizing a reward signal which we tailored for this specific problem. These findings provide new extremal graph constructions and demonstrate the potential of LLM-guided evolutionary search to contribute to mathematical research. In addition to presenting the resulting constructions, we report the generation
algorithms produced, describe the relevant implementation details, and provide our computational costs. Our costs are remarkably low, at less than \$30 for each Zarankiewicz parameter combination, showing that LLM-guided evolutionary search can be an inexpensive, reproducible, and accessible tool for discovering new combinatorial constructions.
Read the full abstract ▾
Algebraic Topology · Cross-listed from cs.LG
Topological Neural Tangent Kernel
Sanjukta Krishnagopal
Graph neural tangent kernels give a principled infinite-width theory for graph neural networks, but inherit a basic limitation of graph models: they see only pairwise structure. Many relational systems contain higher-order interactions that are more naturally represented by simplicial complexes. We introduce the Topological Neural Tangent Kernel (TopoNTK), an infinite-width kernel for simplicial message passing on edge features. TopoNTK combines lower Hodge interactions, capturing graph-like coupling through shared vertices, with upper Hodge interactions, capturing coupling through filled simplices. This makes the kernel sensitive to
topology invisible to graph kernels, allowing complexes with the same graph but different filled simplices to induce different kernels. Beyond expressivity, the Hodge structure gives the kernel an interpretable learning geometry. Edge signals decompose into gradient-like, harmonic, and local circulation components, and the spectrum of the TopoNTK determines how quickly each component is learned. This yields a topological form of spectral bias: components aligned with large-
eigenvalue modes are learned quickly, while global harmonic modes, retained through the residual channel, often lie at smaller
eigenvalues and are learned more slowly. We prove expressivity, Hodge-
alignment, spectral learning, and stability properties, and validate them on synthetic simplicial tasks and DBLP higher-order link prediction. The results show that
topology is not merely extra structure; it can provide coordinates that make relational learning more faithful, interpretable, and effective.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
On Quantum Indeterminacy and the Uncertainty Principle
Maurice de Gosson
We propose a
geometric formulation of
quantum indeterminacy based on polar duality between convex bodies representing position and momentum data. A pair (X,P) of centrally symmetric convex bodies is said to satisfy the indeterminacy condition when the h-polar of X is included in P. We show that this condition naturally arises from the geometry of
quantum blobs and is closely related to Hardy's uncertainty principle and the Donoho–Stark inequalities. Using
symplectic capacities and John ellipsoids, we associate a canonical covariance ellipsoid with every
quantum polar pair and prove that it satisfies the
quantum condition. The Robertson–Schrödinger inequalities follow as a consequence. This provides a non-statistical formulation of
quantum indeterminacy from which the usual uncertainty relations emerge. which the usual uncertainty relations emerge.
Read the full abstract ▾
Probability
Some Results on the Central Limit Theorem for Subsequences in Banach Spaces
Deli Li and Han-Ying Liang
Let $\{X, X_{n}; n \geq 1 \}$ be a sequence of i.i.d. $\mathbf{B}$-valued random variables and set $S_{n} = \sum_{i=1}^{n}X_{i},~n \geq 1$. This note is devoted to study the classical central limitr
theorem for subsequences of sums of i.i.d. $\mathbf{B}$-valued random variables. We show that, under the assumption that $\mathbf{B}$ is of cotype $2$ space, $\left(\frac{S_{n}}{\sqrt{n}} \right)_{n \geq 1}$ converges weakly if and only if $\left(\frac{S_{m_{n}}}{\sqrt{{m_{n}}}} \right)_{n \geq 1}$ converges weakly for a subsequence $\{m_{n}; ~n \geq 1\}$ of positive integers. We
conjecture that this result is false if $\mathbf{B}$ is not of cotype $2$ space. In addition, we show that, if $\left(\frac{S_{m_{n}}}{\sqrt{{m_{n}}}} \right)_{n \geq 1}$ converges weakly for a subsequence $\{m_{n}; ~n \geq 1\}$ of positive integers. and $\left(\frac{S_{n}}{\sqrt{n}} \right)_{n \geq 1}$ does not converge weakly, then $\displaystyle \left(S_{n}/a_{n} \right)_{n \geq 1}$ does not converge weakly to a non-degenerate probability measure for any sequence $\{a_{n}; n \geq 1 \}$ of positive real numbers.
Read the full abstract ▾
Functional Analysis
Fractional type operators on Hardy spaces associated with ball quasi-Banach function spaces
Pablo Rocha
For $0 \leq \alpha < n$ and $m \in \mathbb{N} \cap \left(1 - \frac{\alpha}{n}, +\infty \right)$, we consider certain fractional type operators $T_{\alpha, m}$ generated by $m$-orthogonal
matrices and prove that, for $0 < \alpha < n$, $T_{\alpha, m}$ can be extended to a bounded operator $H_X \to Y$ and, for $\alpha = 0$, $T_{0, m}$ can be extended to a bounded operator $H_X \to X$, where $X$ and $Y$ are certain ball quasi-
Banach spaces related to each other and $H_X$ is the Hardy space associated with $X$. In particular, our results apply to weighted Lebesgue spaces, variable Lebesgue spaces, Lorentz spaces and Orlicz spaces, the last two are new. Our proofs rely on the ssumption that $X$ is $\mathcal{O}(n)$-invariant, the theory of weighted Hardy spaces, the Rubio de Francia iteration
algorithm and the finite atomic decomposition of $H_X$.
Read the full abstract ▾
Probability · Cross-listed from cs.LG
Learning Discriminators for Resampling in the Ensemble Gaussian Mixture Filter through a Normalizing Flow Approach
Zain Jabbar and Andrey A. Popov
The ensemble Gaussian mixture filter (EnGMF) is a powerful, convergent particle filter capable of medium-to-high dimensional non-linear filtering. The EnGMF relies on a resampling step that can generate physically unrealistic posterior samples, that would subsequently produce physically meaningless forecasts. This work introduces the discriminator-informed resampling procedure, that augments the posterior resampling step with a discriminator that accepts or rejects candidate particles based on their physical plausibility. In this work these discriminators are learned through a normalizing flow approach. Numerical experiments on both the Ikeda map and the Lorenz '63 system show that discriminator informed resampling procedure consistently reduces error relative to the standard EnGMF in low-ensemble regimes.
Read the full abstract ▾
Numerical Analysis · Cross-listed from q-bio.TO
Modelling the electrophysiological interactions between human pluripotent cell-derived cardiomyocite grafts and host ventricular tissue
Suran Galappaththige, Vadim N Biktashev, Faisal J Alibhai et al. (+1 more)
Human pluripotent stem
cell-derived cardiomyocytes (hPSC-CMs) are a promising therapy for regenerating myocardium after infarction, but their use is limited by graft-related arrhythmias that frequently occur shortly after transplantation. Experimental studies indicate that these arrhythmias can originate within the graft, which may act as an ectopic pacemaker, yet the mechanisms governing successful excitation of host tissue remain poorly understood. In particular, the role of electrical coupling at the graft-host interface is important, but difficult to measure directly or control. Computer modelling can help here. Here, we present a computational framework that enables systematic investigation of graft-host electrical interactions using a physiologically interpretable parameterisation. We model the graft-host interface as an internal boundary with a defined specific conductance, allowing direct control over coupling strength in units that correspond to measurable tissue properties. We formulate the governing equations and implement the computations using both finite-difference and finite-element discretisations in established cardiac modelling platforms. Using representative anatomical and physiological configurations, we demonstrate how variations in interface conductance influence the ability of spontaneous graft activity to initiate propagating excitation in host tissue. This framework provides a reproducible, mechanistically transparent tool for studying graft-related arrhythmogenesis and lays a foundation for evaluating strategies to mitigate arrhythmic risk in cardiac
cell therapy.
Read the full abstract ▾
All authors Suran Galappaththige, Vadim N Biktashev, Faisal J Alibhai, Michael Laflamme
Optimization and Control · Cross-listed from econ.TH
Principal-agent problems with adverse selection: A stochastic target problem formulation
Guillermo Alonso Alvarez, Ibrahim Ekren and Liwei Huang
We study a principal-
agent problem with adverse selection, where the principal does not know the
agent's true cost but must design a contract to optimize a specific criterion. Unlike standard screening frameworks that allow for self-selection, we assume the principal can only offer a unique contract. We show that the
agent's optimization problem can be reformulated as a
stochastic target problem. After characterizing the credible domain of this target problem, we show that the principal's objective can be solved as a
stochastic optimal control problem with partial information and state constraints. The description of the credible domain also allows us to obtain the value of screening contracts.
Read the full abstract ▾
Analysis of PDEs
Convolution-to-sum identities for Mittag-Leffler type functions
William Cvetko and Elena Cherkaev
Product-to-sum identities for trigonometric functions play a fundamental role in function theory and numerous applications. In this spirit, we present convolution-to-sum identities for Mittag-Leffler type functions. Using a Laplace domain analysis of fractional operators, we identify a family of Mittag-Leffler type functions that encapsulates the eigenfunctions of Riemann-Liouville and Caputo fractional derivatives. We work with two closely-related parameterizations of this class, $R_{\alpha,v}$ and $P_{\alpha,w}$. The convolution of two such functions can be expressed as a series of them. Moreover, if the functions share the same order $\alpha$, the convolution can be reduced to a sum of two $P/R$ functions through a partial-fraction decomposition in the Laplace domain. Furthermore, $R$ and $P$ functions satisfy a generalization of Euler's identity, which expands the scope of the previous result to convolutions of $P/R$ functions whose orders $\alpha_1,\alpha_2$ are related by a rational factor. For $\frac{\alpha_1}{\alpha_2} = \frac{n}{m}$, the resulting sum has $n+m$ terms. The foundational results and methods developed here are illustrated by their application to forced subdiffusion and to a fractionally attenuated wave equation (the Caputo-Wismer-Kelvin, or the fractional Kelvin-Voigt model).
Read the full abstract ▾
Combinatorics
A differential characterization of volume polynomials of permutohedra
Tristram Bogart, Federico Castillo, Damián de la Fuente et al. (+1 more)
We study a graded vector space of
polynomials associated to a square
matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is finite-dimensional precisely when all principal minors are nonzero. In that case, its dimension in each degree equals a binomial coefficient, giving total dimension a power of two. For Cartan
matrices of irreducible root systems, we construct an explicit basis of volume
polynomials of faces of the associated permutohedra, yielding an elementary criterion, which we call geometricity, for expressing a
polynomial as a linear combination of these volume
polynomials.
Read the full abstract ▾
All authors Tristram Bogart, Federico Castillo, Damián de la Fuente, David Plaza
Analysis of PDEs
Stability of p-area minimizing surfaces in the Heisenberg group
Amir Moradifam and Gerardo Orozco-Fernandez
We study the stability of minimizers of weighted $p$-area functionals associated with prescribed $p$-mean
curvature surfaces in the Heisenberg group. While existence and uniqueness results are well established, quantitative stability with respect to perturbations of the mean
curvature $H$ remains largely unexplored in the nonzero-$H$ regime. Using a Rockafellar–Fenchel duality framework, we identify a unique underlying vector field associated with each minimizer and prove its stability under perturbations of $H$. This yields quantitative control of the direction field of the horizontal gradient. Building on this structure, we establish $L^1$ stability of admissible minimizers under natural
geometric assumptions on level sets. In dimensions two and three, we also derive $W^{1,1}$ stability estimates under additional regularity and structural hypotheses, with explicit rates in terms of $\|H-\tilde H\|_{L^\infty}$. Our results provide the first quantitative stability theory for $p$-area minimizing graphs with prescribed nonzero $p$-mean
curvature, even in the unweighted case. Numerical simulations are included to illustrate the robustness of the theoretical results.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ME
Single Change-Point Detection via Energy Distance with Application to Genomic Data
Suthakaran Ratnasingam
In this paper, we develop and analyze a nonparametric procedure for detecting a single change point in sequences of independent observations using energy distance. The asymptotic properties of the test statistic are derived under both null and alternative hypotheses. Under the null hypothesis, for any fixed candidate split point, the standardized statistic $\mathcal{Z}_{n,k}$ converges to a standard normal limit. For global detection, we use the scan statistic $T_n=\max_{k\in K_\eta}|\mathcal{Z}_{n,k}|$ and calibrate critical values using a permutation test, which yields valid type I error control under exchangeability. The simulation study shows that the proposed method demonstrates much better robustness across various error distributions. To handle multiple change points in practical applications, the method is combined with a binary
segmentation approach. The breast cancer
cell line (MDA157) from cDNA microarray CGH data is used to illustrate the detection and estimation capabilities of the proposed method for genomic sequences.
Read the full abstract ▾
Functional Analysis
Existence of Positive Mild Eigenfunctions for Caputo Fractional Semilinear Evolution Equations with Nonlocal Initial Conditions
Sajid Ullah and Assia Guezane-Lakoud
We study the existence of positive eigenpairs for a class of Caputo fractional autonomous
evolution equations with nonlocal initial condition within the framework of
Banach lattices. The autonomous linear operator generates a compact strongly continuous
semigroup of contractions, while the nonlinearity is a Caratheodory map. The mild eigenfunction is represented via the compact Mittag–Leffler operator families, we work within a positive cone of continuous functions and establish a uniform lower bound for the solution operator on the boundary. We apply the Birkhoff–Kellogg type
theorem in cone for the existence of eigenpair. Our approach requires neither Lipschitz continuity of the nonlinearity nor the compactness of nonlocal initial operator, allowing for broad applicability to periodic, multi-point, and integral-type initial conditions. The theoretical results are applied to a
parabolic fractional partial differential equation.
Read the full abstract ▾
Dynamical Systems · Cross-listed from q-bio.MN
Numerical Reliability of Logistic Gene Regulatory Network Models: Preventing Expression Shutdown and Robust Integration of Boolean-Derived ODE Systems
Ismail Belgacem
Gene regulatory networks are routinely translated from Boolean update rules into large continuous ODE systems integrated numerically for attractor identification, sensitivity analysis, and control design. The reliability of that integration depends critically on the sigmoidal kernel representing regulation. This simulation study shows that the Hill function – the near-universal choice – is a generically unreliable kernel, while the logistic function is a robust replacement. Two failure modes are demonstrated. First, because the Hill function vanishes at zero input, bistable
circuits acquire an absorbing off-state: with experimentally grounded E. coli galactose-operon autoregulation parameters, a Hill model stays trapped below the unstable separatrix, whereas the logistic model – whose basal rate is strictly positive by construction – escapes in about $44$~minutes through basal production alone, matching an analytical estimate of ${\approx}58$~min. A saddle-node analysis characterises the bistable window via an explicit transcendental equation and identifies the threshold $\lambda\theta=2$ separating monostable from bistable regimes. Second, when the Hill exponent is non-integer – as in dose-response fits – the power law $x^n=e^{n\ln x}$ turns complex-valued whenever a solver overshoots into negative concentrations. On an $80$-gene Boolean-derived
benchmark with $n\approx3.509$, the Hill solver is silently contaminated by complex values from $t\approx52.64$, yielding smooth but spurious trajectories, whereas the logistic formulation completes $t\in[0,200]$ without a single warning. Because the logistic vector field is globally Lipschitz with explicit constant, we further prove an a priori global-error bound of classical order – a guarantee structurally unavailable to the Hill formulation.
Read the full abstract ▾
Operator Algebras
Strict comparison holds in the uniform Roe algebra of a discrete amenable group
George A. Elliott, Chun Guang Li, Zhuang Niu et al. (+1 more)
Let $\Gamma$ be a countable discrete amenable group, and let $A=l^\infty(\Gamma) \rtimes \Gamma$. It is shown that if $a, b \in A \otimes \mathcal K$ are positive elements such that $$\mathrm{d}_\tau(a) < \mathrm{d}_\tau(b),\quad \tau \in \mathrm{T}(A),$$ then $a$ is Cuntz subequivalent to $b$. Moreover, consider the universal minimal set $(M, \Gamma)$. The simple C*-
algebra $\mathrm{C}(M)\rtimes\Gamma$ is shown to be AH in the strong sense that there is an increasing net of unital sub-C*-
algebras $A_\lambda \subseteq A$, $\lambda \in \Lambda$, such that each $A_\lambda$ is a simple (separable) $\mathcal Z$-absorbing approximately homogeneous C*-
algebra with real rank zero and $A = \bigcup_{\lambda \in \Lambda} A_\lambda$. In particular, $\mathrm{C}(M)\rtimes\Gamma$ is approximately divisible.
Read the full abstract ▾
All authors George A. Elliott, Chun Guang Li, Zhuang Niu, Jianguo Zhang
Statistics Theory · Cross-listed from quant-ph
Entropic Reciprocity in Time-Reversed Young Interferometry
Jianming Wen
We show that time-reversed Young interferometry reorganizes, rather than reverses, optical
entropy. A fixed detector conditions the reciprocal source–detector Green function and produces a source-label probability distribution. Marginal
entropies in the standard and time-reversed geometries are generally unequal; the reciprocal invariant is instead the mutual information between source and detector coordinates. Near a destructive response, the conditioned source-label
entropy can decrease while Fisher information for small phase, tilt, or defocus perturbations increases. The result identifies time-reversed Young interferometry as a source-space information processor with no analogue in ordinary detector-plane fringe readout.
Read the full abstract ▾