Geometric Topology
The Unsolvability of the Homeomorphism Problem
Stefan Friedl, Tobias Hirsch and Marc Kegel
In this short expository note, we give a detailed proof of Markov's
theorem on the unsolvability of the homeomorphism problem and of the existence of unrecognizable
manifolds in all dimensions larger than 3.
Analysis of PDEs
Intrinsic Hardy inequality for fractional Kolmogorov operator
Damir Kinzebulatov
We obtain Hardy inequality for non-local
diffusion operator with singular drift, in the case when the strength of attraction to the origin by the drift takes the critical value.
Numerical Analysis
Absolute values and tensor powers of irreducible characters
Alexander Kushkuley
Let $ \chi $ be a character of a complex irreducible representation of a finite group $G$. We present a simple formula for the expectation of the random variable $(|\chi|/\chi(1))^{t} $ in terms of character ratios $ (|\chi(g)|/\chi(1))^{t}, \; g \in G, \; t \geq 0 $. As a follow up we briefly discuss asymptotic properties of the formula and its relation to the subject of growth of dimensions of isotypic components in (virtual) tensor powers of irreducible representations. Similar type of
reasoning can be applied to some questions related to commuting probability. In particular, we obtain an analogue of Frobenis formula for the probability of an "event" $ |\chi( [x,y]^{-1}g)| = r $
Read the full abstract ▾
Information Theory
Reverse Reconciliation with Soft Information for Discrete-Modulation CV-QKD at Long Range
Marco Origlia, Erdem Eray Cil, Laurent Schmalen et al. (+1 more)
We recently introduced a reverse reconciliation scheme with soft information. In this paper, we assess its performance at ultra-low SNR, thus proving that such scheme is a versatile solution to the reverse reconciliation problem.
Read the full abstract ▾
All authors Marco Origlia, Erdem Eray Cil, Laurent Schmalen, Marco Secondini
Functional Analysis
On matrix valued (asymmetric) truncated Toeplitz operators
Nihat Gokhan Gogus and Rewayat Khan
Matrix valued (asymmetric) truncated Toeplitz operators are generally not complex symmetric. In this paper, we define a new conjugation with unique properties and study its relation to
matrix valued asymmetric truncated Toeplitz operators. We also explore the connections between
matrix valued asymmetric truncated Toeplitz operators and Hankel operators with
matrix symbols.
Read the full abstract ▾
Dynamical Systems
No weakly factor-universal cellular automaton
Maja Gwozdz
Hochman asked whether there exists a cellular automaton $F$ such that every cellular automaton is a factor of $F$ in the dynamical sense. In particular, we do not require the factor map to commute with the spatial shifts. We show that no such cellular automaton exists. More generally, if $F$ weakly factors onto the radius-zero $q$-clock automaton $C_q^{(k)}$, then every periodic point of $F$ has period divisible by $q$. For a cellular automaton $F:A^{\mathbb Z^d}\to A^{\mathbb Z^d}$, define $\varphi_F:A\to A$ by $F(\underline a)=\underline{\varphi_F(a)}$, and let $g_F$ be the greatest common divisor of the cycle lengths of $\varphi_F$. We prove that if $C_q^{(k)}$ is a weak factor of $F$, then $q\mid g_F$ holds. It follows that the action of $F$ on constant configurations yields an explicit divisibility obstruction to clock weak factors.
Read the full abstract ▾
Probability · Cross-listed from physics.data-an
Beyond the Central Limit: Universality of the Gamma Distribution from Padé-Enhanced Large Deviations
Mario Castro and José A. Cuesta
The central limit
theorem provides the theoretical foundation for the universality of the normal distribution: under broad conditions, the asymptotic distribution of a sum of independent random variables approaches a Gaussian. Yet, physical systems described by positive random variable – from earthquakes to microbial growth to epidemic spreading – consistently exhibit gamma rather than Gaussian statistics – what leads to field-specific mechanistic explanations that are non robust to small changes in the model details. We show that gamma distributions emerge naturally from large deviation theory when Padé approximants replace
polynomial expansions of the derivative of the scaled cumulant generating function, respecting positivity constraints that the central limit
theorem violates. Gamma universality thus emerges as the constrained analog of Gaussian universality, providing a mechanism-free explanation for its pervasive appearance across different disciplines.
Read the full abstract ▾
Information Theory
The No-Clash Teaching Dimension is Bounded by VC Dimension
Jiahua Liu and Benchong Li
In the realm of machine learning theory, to prevent unnatural coding schemes between teacher and learner, No-Clash Teaching Dimension was introduced as provably optimal complexity measure for collusion-free teaching. However, whether No-Clash Teaching Dimension is upper-bounded by Vapnik-Chervonenkis dimension remains unknown. In this paper, for any finite concept class, we construct fragments of size equals to its Vapnik-Chervonenkis dimension which identify concepts through an ordered compression scheme. Naturally, these fragments are used as teaching sets, one can easily see that they satisfy the non-clashing condition, i.e., this open question is resolved for finite concept classes.
Read the full abstract ▾
Algebraic Geometry · Cross-listed from cs.DS
Computing the Skyscraper Invariant
Marc Fersztand and Jan Jendrysiak
We develop the first
algorithms for computing the Skyscraper Invariant [FJNT24]. This is a filtration of the classical rank invariant for multiparameter persistence modules defined by the Harder-Narasimhan filtrations along every central charge supported at a single parameter value. Cheng's
algorithm [Cheng24] can be used to compute HN filtrations of arbitrary acyclic quiver representations in
polynomial time in the total dimension, but in practice, the large dimension of persistence modules makes this direct approach infeasible. We show that by exploiting the additivity of the HN filtration and the special central charges, one can get away with a brute-force approach. For $d$-parameter modules, this produces an FPT $\varepsilon$-approximate
algorithm with runtime dominated by $O( 1/\varepsilon^d \cdot T_{\mathsc{dec}})$, where $T_{\mathsc{dec}}$ is the time for decomposition, which we compute with aida [DJK25]. We show that the wall-and-chamber structure of the module can be computed via lower envelopes of degree $d - 1$
polynomials. This allows for an exact computation of the Skyscraper Invariant whose runtime is roughly $O(n^d \cdot T_{\mathsc{dec}})$ for $n$ the size of the presentation of the modules and enables a faster hybrid
algorithm to compute an approximation. For 2-parameter modules, we have implemented not only our
algorithms but also, for the first time, Cheng's
algorithm. We compare all
algorithms and, as a proof of concept for data analysis, compute a filtered version of the Multiparameter Landscape for biomedical data.
Read the full abstract ▾
Optimization and Control
Universal and Parameter-free Gradient Sliding for Composite Optimization
Yan Wu, Yuyuan Ouyang, Zhe Zhang et al. (+1 more)
We propose a Parameter-Free Universal Gradient Sliding (PFUGS)
algorithm for computing an approximate solution to the convex composite optimization $\min_{x\in X} \{f(x) + g(x)\}$, where $f$ has $(M_\nu,\nu)$-Hölder continuous subgradient and $g$ has $L$-Lipschitz continuous gradient. PFUGS computes an $\varepsilon$-approximate solution with $\mathcal{O}((M_\nu/\varepsilon)^{{2}/{(1+3\nu)}})$ evaluations of (sub)gradients of $f$ and $\mathcal{O}((L/\varepsilon)^{1/2})$ evaluations of gradients of $g$, without prior knowledge of problem constants. To the best of our knowledge, PFUGS is the first gradient sliding
algorithm for problems involving two functions whose distinct problem constants are both unknown a priori.
Read the full abstract ▾
All authors Yan Wu, Yuyuan Ouyang, Zhe Zhang, Qi Luo
Analysis of PDEs · Cross-listed from gr-qc
Solutions of the constraints with controlled decay to Kerr, including Schwartz decay
Andrea Nützi
We show that to every small and decaying solution of the linearized constraint equations about Minkowski spacetime, one can add a quadratically small correction to obtain a solution of the full constraint equations. Near spacelike infinity, the correction is given by Kerr black hole initial data, up to a term that decays faster than the linearized solution, and that has Schwartz decay if the linearized solution has Schwartz decay. Using a recent result, we obtain that the solutions of the Einstein equations with these initial data admit a regular conformal compactification along null and timelike infinity. The construction is based on a right inverse (up to necessary integrability conditions) for the linearized constraint operator about Minkowski initial data obtained previously, that has optimal mapping properties relative to weighted b-Sobolev spaces, where the weights measure decay towards infinity. On an algebraic level, we show that the constraint equations can be derived using the homotopy transfer
theorem, rather than using the
geometric Gauss and Codazzi equations.
Read the full abstract ▾
Information Theory
Index-Based Scheduling for a Resource-Constrained Quantum Switch
Subhankar Banerjee, Stavros Mitrolaris and Sennur Ulukus
We consider a
quantum switch with a finite number of
quantum memory registers that aims to serve multipartite
entanglement requests among $N$ users. We propose scheduling policies that aim to optimize the average number of requests served per unit time by efficiently utilizing the switch's available
memory. To measure the performance of the scheduling policies, we employ the newly introduced metric of age of
entanglement establishment (AoEE). We formulate the scheduling problem in a restless multi-armed bandit (RMAB) framework. We show that the scheduling of
entanglement requests is indexable. Subsequently, we find a closed-form expression of the Whittle index for all possible request-age pairs. By modeling the Whittle index of each request as its reward and its cardinality as its cost, we formulate the
memory-constrained scheduling problem as a $0$-$1$ knapsack problem and solve it via dynamic programming. Furthermore, we consider two low-complexity sequential greedy policies that leverage two different modified Whittle indices.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions
Rustem Islamov, Grigory Malinovsky, Alexander Gaponov et al. (+3 more)
Federated Learning (FL) enables heterogeneous clients to collaboratively train a shared model without centralizing their raw data, offering an inherent level of
privacy. However, gradients and model updates can still leak sensitive information, while malicious servers may mount
adversarial attacks such as Byzantine manipulation. These vulnerabilities highlight the need to address differential
privacy (DP) and Byzantine robustness within a unified framework. Existing approaches, however, often rely on unrealistic assumptions such as bounded gradients, require auxiliary server-side
datasets, or fail to provide convergence guarantees. We address these limitations by proposing Byz-Clip21-SGD2M, a new
algorithm that integrates robust aggregation with double momentum and carefully designed clipping. We prove high-probability convergence guarantees under standard $L$-smoothness and $\sigma$-sub-Gaussian gradient noise assumptions, thereby relaxing conditions that dominate prior work. Our analysis recovers state-of-the-art convergence rates in the absence of adversaries and improves utility guarantees under Byzantine and DP settings. Empirical evaluations on CNN and MLP models trained on MNIST further validate the effectiveness of our approach.
Read the full abstract ▾
All authors Rustem Islamov, Grigory Malinovsky, Alexander Gaponov, Aurelien Lucchi, Peter Richtárik, Eduard Gorbunov
Algebraic Geometry
Non-abelian Hodge theory for non-proper varieties and the linear Shafarevich conjecture
Benjamin Bakker
We survey recent advances in non-abelian Hodge theory in the "mixed" setting of non-proper algebraic varieties. We then describe how these tools are used to construct algebraic Shafarevich morphisms and prove a version of the linear Shafarevich
conjecture for any algebraic variety.
Read the full abstract ▾
Logic
A new proof of Funayama's theorem
Guram Bezhanishvili and Wesley H. Holliday
Funayama proved that a
lattice embeds into a complete Boolean
algebra in such a way that all existing joins and meets are preserved if and only if the
lattice satisfies the join-infinite and meet-infinite distributive laws. There are several proofs of this classic result in the literature. In this note, we provide a new and purely order-theoretic proof of Funayama's
theorem, as well as of generalizations of the
theorem.
Read the full abstract ▾
Algebraic Topology
Function-Rips complexes in persistent homotopy theory: Stability and persistent Latschev theorems
Steve Oudot and Lukas Waas
Classical results of Hausmann and Latschev show that Vietoris-Rips complexes can recover the homotopy type of a
manifold, even from finite metric spaces that are nearby in Gromov-Hausdorff distance. We prove persistent homotopical versions of these
theorems for metric spaces equipped with filtration functions. The central object of study is the so-called persistent homotopy type of the function-Rips complex, a filtered simplicial complex that combines a fixed Rips scale with the filtration data on the underlying space. Using techniques from CAT($\kappa$)-geometry and persistent simplicial homotopy theory, we generalize Latschev's and Hausmann's
theorems to the setting of spaces with filtration functions and homotopical interleavings. A fundamental ingredient is a new homotopical stability
theorem. The fixed-scale function-Rips construction is known not to be globally stable with respect to function Gromov-Hausdorff distance and homotopical interleaving distance. Here, we show that it is nevertheless stable for appropriate choices of the Rips parameter at such pairs $(M,f)$ for which $M$ is a complete metric space of
curvature bounded above, and $f$ is a Lipschitz continuous multivariate function.
Read the full abstract ▾
Number Theory
Mahler series with multiplicative coefficient sequences
Jason Bell and Daniel Smertnig
We prove that every Mahler series, over a field of characteristic $0$, with multiplicative coefficients is regular in the sense of Allouche and Shallit. We also obtain an explicit characterization of such series. This yields a joint extension of the characterization of rational series with multiplicative coefficients (by Bézivin and Bell–Bruin–Coons) and of multiplicative automatic sequences (by Konieczny–Lemańczyk–Müllner). Both of these results are used in our characterization, so we do not obtain new proofs of these special cases.
Read the full abstract ▾
Representation Theory
Perturbations of Dirac Operators
Steffen Schmidt
We study perturbations of relative cubic Dirac operators for basic classical Lie superalgebras within the uniform formalism of the colour
quantum Weil
algebra. This perspective leads to three complementary classes of perturbations and resulting invariants. First, we define semisimple perturbations that assign to each finite-dimensional simple supermodule a finite collection of semisimple orbits, together with canonically defined vector spaces measuring the degree of atypicality. Second, we introduce nilpotent perturbations parametrized by the self-commuting variety of a quadratic Lie subsuperalgebra; the resulting family of
cohomology theories combines Dirac
cohomology and Duflo–Serganova
cohomology. Third, we deform the cubic Dirac operator by a Weil-covariant differential built from the universal $1$-form in the colour
quantum Weil
algebra and the Weil differential, producing a Chern-type invariant that assigns to each finite-dimensional module a natural class in the
cohomology of the Weil complex.
Read the full abstract ▾
Mathematical Physics · Cross-listed from physics.chem-ph
A unified variational framework for the inverse Kohn-Sham problem
Nan Sheng
The inverse Kohn-Sham (KS) problem seeks a local effective potential whose noninteracting ground state reproduces a prescribed electron density. Although many inversion formulations and schemes have been developed, they are often formulated in disparate
languages, including reduced variational optimization, penalty regularization, response-based iteration, and PDE-constrained optimization. In this work, we develop a unified framework for inverse KS theory in two steps. First, we identify the fixed-density noninteracting constrained search and its density-potential duality as the natural variational anchor of the inverse KS problem. In this setting, the KS potential appears as the variational dual object associated with density reproduction, reducing to the familiar multiplier picture in regular regimes. Second, building on this anchor, we classify major inversion formulations according to how the KS state equations and density-reproduction condition are treated within the optimization architecture, with orbital orthonormality retained as an additional structural constraint. Within this framework, the Wu-Yang formulation appears as a potential-space reduced multiplier formulation, the Zhao-Morrison-Parr construction as a quadratic-penalty relaxation, and PDE-constrained approaches as explicit state-constraint formulations at the orbital level. Rather than comparing inversion formulations primarily at the level of implemented
algorithms, the present work develops an optimization-theoretic formulation map. This viewpoint identifies where additive-constant ambiguity, asymptotic normalization, nonsmooth variational structure, metric choice, and weak-gap instability enter different inversion architectures, and it makes explicit how major inversion approaches are connected and where algorithmic design choices arise.
Read the full abstract ▾
Algebraic Geometry
Smoothness results for the schemes of special divisors on general k-gonal curves
Marc Coppens
For a general $k$-gonal curve $C$ with a morphism $f: C \rightarrow \mathbb{P}^1$ of degree $k$, we consider the refinement of the Brill-Noether schemes $W^r_d(C)$ by means of the Brill-Noether degeneracy schemes $\overline{\Sigma}_{\overrightarrow {e}}(C,f)$. The schemes $\overline{\Sigma}_{\overrightarrow {e}}(C,f)$ as sets are closures of subsets $\Sigma_{\overrightarrow {e}}(C,f)$ of $\Pic (C)$ and as a scheme $\Sigma_{\overrightarrow {e}}(C,f)$ is a smooth open subscheme of $\overline{\Sigma}_{\overrightarrow {e}}(C,f)$. In this paper we describe naturally defined open subsets of $\overline{\Sigma}_{\overrightarrow {e}}(C,f)$ in general strictly containing $\Sigma_{\overrightarrow {e}}(C,f)$ such that $\overline{\Sigma}_{\overrightarrow {e}}(C,f)$ is smooth along them. As an application we describe all invertible sheaves $L$ on $C$ having an injective Petri map. Some of those sets $\overline{\Sigma}_{\overrightarrow {e}}(C,f)$ are the irreducible components of $W^r_d(C)$. In those cases we prove $W^r_d(C)$ is smooth at a point $L$ of those larger open subsets of $\overline{\Sigma}_{\overrightarrow {e}}(C,f)$ unless $L$ belongs to at least two irreducible components of $W^r_d(C)$ (such points exist). On the other hand in general the singular locus of the schemes $W^r_d(C)$ is not equal to the complement of the union of $W^{r+1}_d(C)$ and the intersections of two different components of $W^r_d(C)$.
Read the full abstract ▾
Statistics Theory
Asymptotics of Nonparametric Estimation under general non-monotone MAR missingness: A Bayesian Approach
Badr-Eddine Chérief-Abdellatif and Jeffrey Näf
Missing values are ubiquitous in statistical practice, with potentially detrimental consequences for any statistical analysis. As such, a wealth of methods and theoretical results have been developed in the last decades. However, many questions remain open, in particular in the case of general non-monotone missing at random (MAR), where nonparametric results are still lacking. In this paper, we extend nonparametric
Bayesian theory to this MAR setting. We introduce a general
theorem of posterior contraction under MAR and an additional positivity condition and apply this result to density estimation as well as regression problems. In particular, we show that, despite the missing values, the complete-data density can be estimated with the minimax posterior contraction rate up to logarithmic factors. To the best of our knowledge, this is the first nonparametric result showing that the complete-data distribution can be consistently estimated under Rubin's MAR definition. As a consequence, we obtain an
algorithm that takes incomplete data and returns a sample from a consistent estimate of the complete-data distribution.
Read the full abstract ▾
Quantum Algebra
Graded spherical skein 2+1-G-HQFT and modified Turaev-Viro invariants
Francesco Costantino, Nathan Geer, Benjamin Haïoun et al. (+1 more)
For G a group, we present a G-graded version of chromatic maps and skein modules and use them to define a 2+1-G-HQFT out of a G-chromatic category. The construction applies to the representations of unrestricted
quantum groups at root of unity and recovers the modified Turaev-Viro 3-dimensional invariants.
Read the full abstract ▾
All authors Francesco Costantino, Nathan Geer, Benjamin Haïoun, Bertrand Patureau-Mirand
Analysis of PDEs
Energy-Morawetz estimates for Teukolsky equations in perturbations of Kerr
Siyuan Ma and Jérémie Szeftel
In this paper, we prove energy and Morawetz estimates for solutions to Teukolsky equations in spacetimes with metrics that are perturbations, compatible with nonlinear applications, of Kerr metrics in the full subextremal range. The Teukolsky equations are written in tensorial form using the non-integrable formalism in \cite{GKS22}, and we follow the approach in \cite{Ma} of relying on a Teukolsky wave/transport system. The estimates are proved by extending the ideas from our earlier result \cite{MaSz24} on the corresponding problem for the scalar wave, notably the use of $r$-foliation-adapted microlocal multipliers for the wave part, and by incorporating techniques from \cite{Ma} to control the linear coupling terms between the components of the Teukolsky wave/transport system. Additionally, in order to adapt the methodology of \cite{MaSz24} to tensorial waves, we introduce a well-suited regular scalarization procedure which is of independent interest. This result, alongside our companion paper \cite{MaSz24}, is an essential step towards extending the current proof of Kerr stability in \cite{GCM1} \cite{GCM2} \cite{KS:Kerr} \cite{GKS22} \cite{Shen}, valid in the slowly rotating case, to a complete resolution of the Kerr stability
conjecture, i.e., the statement that the Kerr family of spacetimes is nonlinearly stable for all subextremal angular momenta.
Read the full abstract ▾
Algebraic Geometry
Exponential motives on the affine Grassmannian
Robert Cass, Thibaud van den Hove and Jakob Scholbach
We develop a notion of exponential motives on general prestacks equipped with a $\mathbf{G}_a$-action, and compare them with Whittaker motives via Gaitsgory's Kirillov model. We then establish foundational results for exponential motives on affine flag varieties concerning Tate motives and t-structures. We use this to prove a motivic Casselman-Shalika equivalence, relating exponential Tate motives on the affine Grassmannian to ind-coherent sheaves on the classifying stack of the Langlands dual group. The decategorification of this equivalence provides a new construction of the Whittaker module for the spherical Hecke
algebra which works for arbitrary coefficients, including a generic version.
Read the full abstract ▾
Combinatorics
Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable
Xinmin Hou, Xujun Liu and Xiangyang Wang
For a non-decreasing sequence $S = (s_1, s_2, \ldots, s_k)$ of positive integers, a packing $S$-coloring of a graph $G$ is a partition of $V(G)$ into $V_1, V_2, \ldots, V_k$ such that each $V_i$ has pairwise distance at least $s_i+1$. The packing chromatic number (PCN) of a graph $G$ is the minimum $k$ such that $G$ has a packing $(1,2, \ldots, k)$-coloring. The $1$-subdivision of $G$ is obtained by replacing each edge of $G$ with a path of two edges. In 2016, Gastineau and Togni asked an open question whether the $1$-subdivision of every subcubic graph has PCN at most $5$, and later Bre\v sar, Klav\v zar, Rall, and Wash conjectured it is true. Balogh, Kostochka, and Liu proved the first upper bound of $8$, and it was later improved to $6$ by Liu, Zhang, and Zhang. In this paper, we prove that every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable. Our result implies a solution to the
conjecture of Bre\v sar, Klav\v zar, Rall, and Wash, and answers the question of Gastineau and Togni in the affirmative. Furthermore, our result answers an open question of Kostochka and Liu and solves a
conjecture of Liu, Zhang, and Zhang.
Read the full abstract ▾
Combinatorics
On the number of families avoiding a subposet
Tao Jiang, Sean Longbrake and Liana Yepremyan
In this paper we show that for any poset $P$ that is not an antichain, the number of induced $P$-free families in the Boolean
lattice $2^{[n]}$ is at most $ 2^{O(\mathrm{La}^*(n,P))}$, where $\mathrm{La}^*(n,P)$ denotes the the largest size of an induced $P$-free subfamily of $2^{[n]}$. We also obtain related supersaturation results.
Read the full abstract ▾
Combinatorics
Theta functions in acyclic affine type
Nathan Reading and Salvatore Stella
We characterize the theta functions for vectors in the imaginary wall in a cluster
algebra of acyclic affine type and compute some of their structure constants. One of the structure constant computations can be interpreted as new "imaginary" exchange relations among cluster variables. We show that theta functions in the imaginary wall span a subalgebra of the cluster
algebra that we call the imaginary subalgebra, which decomposes as a tensor product of tube subalgebras that are generalized cluster
algebras of type C. Our proofs exploit mutation-
symmetries of the exchange
matrix, an earlier characterization of dominance regions in affine type, and combinatorial models for cluster scattering diagrams of acyclic affine type.
Read the full abstract ▾
Mathematical Physics
Spectral Structure of the Mixed Hessian of the Dispersionless Toda $\tau$-Function
Oleg Alekseev
We study the mixed Hessian of the dispersionless Toda $\tau$-function for the one-harmonic $s$-fold symmetric conformal map $f(w)=rw+aw^{1-s}$. This Hessian is the susceptibility
matrix generated by the inverse conformal map. Our spectral statements are formulated for its weighted
symmetry-block realizations on a fixed
Hilbert space. In that realization, the first spectral transition occurs at the analytic threshold $\zeta_c=(s-1)^{s-1}/s^s$, where the dominant square-root singularity of the inverse map reaches the normalization circle, rather than at the
geometric threshold $\zeta_{\mathrm{univ}}=1/(s-1)$, where univalence fails. After
symmetry decomposition and weighted realization, each block develops exactly one logarithmically diverging
eigenvalue as $\zeta\uparrow\zeta_c$, while the remaining spectrum stays bounded and converges to a compact limit. The instability is therefore rank one in every
symmetry sector of the weighted block theory. We then continue the scalar Gram generating functions beyond $\zeta_c$. They are generalized hypergeometric functions on the slit plane $\mathbb{C}\setminus[\zeta_c^2,\infty)$, their branch-point expansion contains the logarithmic term responsible for the divergence, and in the range $1\le p\le s$ they admit Cauchy–Stieltjes and Jacobi-
matrix realizations. In particular, the continued scalar quantities remain regular at $\zeta_{\mathrm{univ}}$, so the analytic spectral transition strictly precedes the
geometric breakdown of univalence.
Read the full abstract ▾
Numerical Analysis · Cross-listed from physics.med-ph
Exact analytical PGSE signal for diffusion confined to a cylindrical surface using a spectral Laplacian formalism
Erick J Canales-Rodríguez, Chantal M.W. Tax, Juan Manuel Górriz et al. (+3 more)
Objective. To derive an exact analytical expression for the
diffusion MRI signal arising from
diffusion confined to a cylindrical surface under finite rectangular pulsed-gradient
spin-echo (PGSE) gradients, and to develop computationally efficient strategies for repeated model evaluations. Approach. The Bloch-Torrey equation was solved using a spectral
matrix formalism of the Laplace operator in the eigenbasis of the cylindrical surface. The resulting signal is expressed as a product of non-commuting
matrix exponentials and is valid for arbitrary rectangular gradient durations and separations, without approximations to the
diffusion propagator or
spin phase distribution. A reduced real spectral basis was introduced to decrease the dimensionality of the problem. Accelerated implementations based on Strang splitting and Gauss-Legendre quadrature were developed for repeated signal evaluations and computation of the spherical mean. The analytical signal was validated against Monte Carlo
diffusion simulations. Main results. The exact formulation showed excellent agreement with Monte Carlo simulations over a wide range of cylinder radii and acquisition parameters. The spectral expansion converged rapidly with mode order, and the reduced basis substantially decreased computational cost without loss of accuracy. The accelerated implementations provided large additional speed-ups while retaining controllable errors relative to the exact solution. Significance. The proposed framework extends exact finite-pulse solutions of the Bloch-Torrey equation to
diffusion confined to cylindrical surfaces and provides practical implementations for directional and orientationally averaged
diffusion MRI signals. It therefore offers an approximation-free reference for assessing faster signal approximations and for applications requiring large numbers of model evaluations.
Read the full abstract ▾
All authors Erick J Canales-Rodríguez, Chantal M.W. Tax, Juan Manuel Górriz, Derek K. Jones, Jean-Philippe Thiran, Jonathan Rafael-Patiño
Information Theory · Cross-listed from quant-ph
Single-letter one-way distillable entanglement for non-degradable states
Rabsan Galib Ahmed, Graeme Smith and Peixue Wu
The one-way distillable
entanglement is a central operational measure of bipartite
entanglement, quantifying the optimal rate at which maximally entangled pairs can be extracted by one-way LOCC. Despite its importance, it is notoriously hard to compute, since it is defined by a regularized optimization over many copies and adaptive one-way protocols. At present, single-letter formulas are only known for (conjugate) degradable and PPT states. More generally, it has remained unclear when one-way distillable
entanglement can still be additive beyond degradability and PPT settings, and how such additivity relates to additivity questions of
quantum capacity of channels. In this paper, we address this gap by identifying three explicit families of non-degradable and non-PPT states whose one-way distillable
entanglement is nevertheless single-letter. First, we introduce two weakened degradability-type conditions–regularized less-noisy and informationally degradable–and prove that each guarantees additivity and hence a single-letter formula. Second, we show a stability result for orthogonally flagged mixtures: when one component has orthogonal support on Alice's system and zero one-way distillable
entanglement, the mixture remains single-letter, even though degradability is typically lost under such mixing. Finally, we propose a generalized
spin-
alignment principle for
entropy minimization in tensor-product settings, which we establish in several key cases, including a complete Rényi-2 result. As an application, we obtain additivity results for generalized direct-sum channels and their corresponding Choi states.
Read the full abstract ▾