Numerical Analysis
Error estimates for the patch bubble method for convection-dominated channel flow problem
Eberhard Bänsch, Pedro Morin and Itatí Zocola
We present error estimates for the BMZ (Bubble Mesh Zoom) residual-free bubble method applied to a convection-
diffusion equation in the convection-dominated regime. The method incorporates both element bubbles and residual-free bubbles supported on patches of two adjacent elements. We focus on the case of a parallel flow in a square domain and derive error estimates in an energy norm that remain valid as
diffusion becomes small. The theoretical findings are corroborated by numerical experiments, which also exhibit a competitive performance of the method.
Read the full abstract ▾
Numerical Analysis
Pressure-Robust $H(\mathrm{div})$-Conforming HDG Methods for the Steady Stokes Equations with an Application to Tangential Boundary Control
Gang Chen, Wenyi Liu and Yangwen Zhang
We develop a family of $H(\mathrm{div})$-conforming hybridizable discontinuous Galerkin methods for the steady Stokes equations based on BDM and RT velocity spaces with either discontinuous or continuous hybrid traces. In contrast to our earlier pressure-robust HDG method for tangential boundary control, the present analysis does not require the pressure to belong to $H^1$; instead, the consistency argument only assumes low pressure regularity. The discrete velocities are exactly divergence-free, which yields pressure robustness. For the BDM variants we derive optimal energy-norm estimates and optimal $L^2$-velocity convergence, while for the RT variants we obtain optimal velocity convergence and weaker pressure estimates. We also analyze the hybridized linear system and prove a uniform spectral equivalence for the pressure Schur complement relevant to iterative solvers. As an application, we revisit the Stokes tangential boundary control problem and derive error estimates for the control, state, and adjoint variables using the BDM discontinuous-trace scheme. Two- and three-dimensional numerical experiments confirm the predicted convergence rates, the exact divergence-free property, and the robustness of the method with respect to the viscosity parameter.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ME
Weighted Holm Procedures: Theory, Properties, and Recommendations
Beibei Li and Wenge Guo
In many statistical applications, particularly in clinical studies, hypotheses may carry different levels of importance, motivating the use of weighted multiple testing procedures (wMTPs) to control the familywise error rate (FWER). Among these approaches, two weighted Holm procedures are commonly used: the weighted Holm procedure (WHP), which is based on ordered weighted $p$-values, and the weighted alternative Holm procedure (WAP), which relies on ordered raw $p$-values. This paper provides a systematic comparison of these two procedures, along with practical recommendations for their use. We first examine their corresponding closed testing procedures (CTPs) and show that WHP is uniformly more powerful than WAP. We further investigate their structural properties, demonstrating that WAP, while consonant, lacks monotonicity. To facilitate communication with non-statisticians, we introduce graphical representations of both procedures using a common initial graph and distinct updating strategies. In addition, we derive adjusted $p$-values and adjusted weighted $p$-values for both methods. Finally, we establish an optimality result: WHP cannot be improved by enlarging any of its critical values without violating FWER control, whereas WAP is optimal only under specific conditions. Simulation studies support these theoretical findings and highlight the superior FWER control and average power of WHP.
Read the full abstract ▾
Number Theory
Explicit Prime Densities for Lucas Sequence Rank Divisibility
Joaquim Cera Da Conceição
Let $U$ be a Lucas sequence, $p$ be a
prime, and $\rho_U(p)$ be the rank of appearance of $p$ in $U$, that is, the least positive integer $n$ such that $p\mid U_n$, if it exists. We derive closed-form formulas for the Dirichlet density of
primes $p$ for which $d\mid \rho_U(p)$, where $d\geq 1$ is a fixed integer. Our results complete the work of Sanna ($2022$) by covering all $U$ and all $d\geq 1$.
Read the full abstract ▾
Combinatorics
A hierarchy of edge-weight symmetries in perfect matchings
Kristóf Bérczi, Viktor Csaplár and Yutaro Yamaguchi
Motivated by the exact weight perfect matching problem and recent parameterized
algorithms for finding an $\ell$-th smallest perfect matching, we study structural properties of edge-weight
symmetries in graphs. Recent work by El Maalouly et al. (ESA 2025) showed that excluding all perfect matchings whose weight is at most the $(\ell - 1)$-th smallest possible value in the graph requires fixing at most $2(\ell-1)$ edges in non-bipartite graphs and at most $\ell-1$ edges in bipartite graphs. A natural open question is whether fixing a single edge is always sufficient to shift the extreme (minimum or maximum) weight of a perfect matching when the global minimum and maximum weights differ. To address this, we define and analyze a hierarchy of progressively weaker edge-weight properties: node-induced weights, even walk and cycle
symmetries, perfect matching equality, and the edge min-max property. We derive a basic hierarchy among these conditions and show that they become equivalent in bipartite graphs. For general graphs, we provide tight structural characterizations, based on block and tight cut decompositions, under which even cycle
symmetry and perfect matching equality force node-induced weights. Finally, we resolve the motivating open question in the negative by constructing a matching-covered non-bipartite graph that satisfies the edge min-max property (every edge is contained in a minimum-weight perfect matching and a maximum-weight one) but violates perfect matching equality (all perfect matchings have the same weight). This counterexample shows that a single edge is not always sufficient to eliminate all minimum-weight or maximum-weight perfect matchings, thereby proving the tightness of the $2(\ell-1)$ bound for $\ell=2$. We also discuss extensions of this framework to $b$-factors and arborescences.
Read the full abstract ▾
Probability
Mixing times of Langevin dynamics for spiked matrix models
Reza Gheissari, Curtis Grant and Tianmin Yu
We investigate the Langevin dynamics for Wigner
matrices with a spherical spike, in the regime where the signal-to-noise ratio $\theta$ is large, but order one. For large, order-$1$, signal-to-noise, the (worst-case) mixing time undergoes a sharp transition around the critical inverse temperature $\beta_c(\theta) = \frac{1}{\theta}$. Namely, if $\beta = \alpha/\theta$, and $\alpha<1$ then at large $\theta$ the mixing time is $O(\log N)$, and if $\alpha>1$ it is exponential in $N$. We show that initialized from the uniform-at-random spherical prior, however, the mixing time in the low-temperature $\alpha>1$ regime circumvents the exponential bottleneck and the mixing time is $O(\log N)$. In fact, this fast mixing holds for any initialization that is symmetric with respect to the top eigenvector of the spiked
matrix. Using this, we are able to show a low-temperature metastability picture, pinning down the exact exponential rate of the (worst-case initialization) mixing time for low temperatures, showing it is given by the difference of the free energies of the spiked and null models.
Read the full abstract ▾
Algebraic Geometry
$F$-finite schemes have a dualizing complex
Bhargav Bhatt, Manuel Blickle, Karl Schwede et al. (+1 more)
In this paper we show that any Noetherian $F$-finite scheme has a dualizing complex $\omega^{\bullet}_{X}$ with the property that for all finite type maps $f \colon X \to Y$ between $F$-finite Noetherian schemes there is a canonical isomorphism $\omega^{\bullet}_{X} \xrightarrow{\cong} f^!\omega^{\bullet}_{Y}$ in $D^b_{coh}(X)$. This, in particular, applies to the Frobenius morphism $F \colon X \to X$ so that we obtain a canonical isomorphism $\omega^{\bullet}_{X} \xrightarrow{\cong} F^!\omega^{\bullet}_{X}$. To prove this, we rely on a result of Gabber that every Noetherian $F$-finite ring is a quotient of a regular ring, from which it follows that every $F$-finite Noetherian scheme has a (potentially non-canonical) dualizing complex. To make this canonical, we identify the dualizing complex of any $F$-finite Noetherian scheme as a unit of an alternate symmetric monoidal structure on $D^b_{coh}(X)$ we call the $!$-tensor product. We also sketch an alternate approach to finding this canonical dualizing complex following the more classical approach to Grothendieck duality.
Read the full abstract ▾
All authors Bhargav Bhatt, Manuel Blickle, Karl Schwede, Kevin Tucker
Algebraic Topology
A continuum of Künneth theorems for persistence modules
Nikola Milićević
We develop new aspects of the homological
algebra theory for persistence modules, in both the one-parameter and multi-parameter settings. For a poset $P$ and an order preserving map $\varphi:P\times P\to P$, we introduce a novel tensor product of persistence modules indexed by $P$, $\otimes_{\varphi}$. We prove that each $\otimes_{\varphi}$ has a right adjoint, $\mathbf{Hom}^{\varphi}$, the internal hom of persistence modules that also depends on $\varphi$. We prove that every $\otimes_{\varphi}$ yields a Künneth short exact sequence of chain complexes of persistence modules. Dually, the $\mathbf{Hom}^{\varphi}$ also has an associated Künneth short exact sequence in
cohomology. As special cases both of these short exact sequences yield Universal Coefficient
Theorems. We show how to apply these to chain complexes of persistence modules arising from filtered CW complexes. For the special case of $P=\mathbb{R}_+$, the $p$-quasinorms for each $p\in (0,\infty]$ yield a distinct $\otimes_{\ell^p_c}$ and its adjoint $\mathbf{Hom}^{\ell^p_c}$. We compute their derived functors, $\mathbf{Tor}^{\ell^p_c}$ and $\mathbf{Ext}_{\ell^p_c}$ explicitly for interval modules. We show that the Universal Coefficient
Theorem developed can be used to compute persistent Borel-Moore homology of a filtration of non-compact spaces. Finally, we show that for every $p\in [1,\infty]$ the associated Künneth short exact sequence can be used to significantly speed up and approximate persistent homology computations in a product metric space $(X\times Y,d^p)$ with the distance $d^p((x,y),(x',y'))=||d_X(x,x'),d_Y(y,y')||_p$.
Read the full abstract ▾
Optimization and Control
Covariance Steering of Discrete-Time Markov Jump Linear Systems with Multiplicative Noise
Fangji Wang, Siddhartha Ganguly and Panagiotis Tsiotras
We study a finite-horizon covariance steering problem for discrete-time Markov jump linear systems (MJLS) with both state- and control-dependent multiplicative noise. The objective is to minimize a quadratic running cost while steering the system from given mode-conditioned initial means and covariances to a prescribed terminal mean and covariance. We first show that, without loss of generality, feasible controls may be represented by mode-dependent linear feedback together with feedforward and independent random components, and we highlight that, in contrast to the case without multiplicative noise, a purely affine state-feedback law does not in general suffice. To this end, we introduce a lifted-state formulation that embeds the mean and covariance information into a unified second-moment description, and we prove that the resulting lifted problem is equivalent to the original covariance steering problem formulation. This leads to a lossless relaxation in moment variables and an SDP reformulation for the unconstrained case. We further study chance-constrained covariance steering with ball and half-space constraints on the state and control, derive tractable sufficient convex surrogates, and establish an iterative reference-update scheme to reduce conservatism. Numerical experiments on a finance application illustrate our results.
Read the full abstract ▾
Dynamical Systems
On the intersections of homogeneous self-similar sets with their translates in $\mathbb{R}^{n}$ and a formulation of multiplicative invariance in $\mathbb{Z}^{n}$
Neil MacVicar
This thesis generalizes the study of $C\cap(C + \alpha)$ where $C$ is the middle third Cantor set to self-affine sets in $\mathbb{R}^{n}$. We present sufficient and necessary conditions for when the translation $\alpha$ produces a self-affine intersection for a particular class of self-affine sets. In the case where the attractor is self-similar, we improve results concerning the function from $\alpha$ to the fractal dimension of the intersection. This lends itself to a case study of the complex number system $(-n + i, \{0, 1, . . . , n^{2}\})$, when $n$ is an integer greater than or equal to $2$. Lastly, we present a definition of multiplicative invariance for subsets of $\mathbb{Z}^{n}$ and establish a connection, known in the one-dimensional case, between them and invariant sets of the $n$-dimensional
torus.
Read the full abstract ▾
Information Theory · Cross-listed from eess.SP
Algebraic Diversity: Principles of a Group-Theoretic Approach to Signal Processing
Mitchell A. Thornton
We present principles of algebraic diversity (AD), a group-theoretic approach to signal processing exploiting signal
symmetry to extract more information per observation, complementing classical methods that use temporal and spatial diversity. The transformations under which a signal's statistics are invariant form a matched group; this group determines the natural transform for analysis, and averaging an
estimator over the group action reduces variance without requiring additional snapshots. The viewpoint is broadened in five directions beyond the single-observation measurement of a companion paper. Rank promotion admits AD on scalar data streams and identifies the law of large numbers as the trivial-group case of a $(G, L)$ continuum combining sample-count with group-orbit averaging. An eigentensor hierarchy handles signals with nested
symmetry. A blind group-matching methodology identifies the matched group from data via a
polynomial-time generalized
eigenvalue problem on the
unitary Lie
algebra, placing the DFT, DCT, and Karhunen–Loève transforms as distinguished points on a transform
manifold. A cost-
symmetry matching principle then extends AD from measurement to blind and adaptive signal processing generally; blind equalization is given as a detailed example, with the Constant Modulus
Algorithm's residual phase ambiguity predicted analytically and matched within two degrees on 3GPP TDL multipath channels, and other blind problems in signal processing are mapped into the framework. Four
theorems formalize a structural capacity $\kappa$, the Rényi-2 analog of Shannon and von Neumann's Rényi-1
entropies, quantifying how a signal's information is organized rather than how much information it contains. AD relationship to prior algebraic approaches including invariant estimation, minimax robust estimation, algebraic signal processing, and compressed sensing.
Read the full abstract ▾
Optimization and Control
Debiasing optimal transport: classical and entropic
Pierre-Cyril Aubin-Frankowski, Virginie Ehrlacher and Gabriele Todeschi
We study the notion of debiasability for cost functions arising in optimal transport. We call a symmetric cost function $c:\mathscr{X}\times\mathscr{X}\to R\cup\{+\infty\}$ debiasable if it satisfies $c(x,y)\ge \tfrac{1}{2}c(x,x)+\tfrac{1}{2}c(y,y)$ for all $x,y\in\mathscr{X}$. Building on an equivalent characterization by an inf-representation $c(x,y)=\inf_{z\in\mathscr Z}\psi(x,z)+\psi(y,z)$ for some set $\mathscr Z$ and some function $\psi:\mathscr X\times\mathscr Z\to R\cup\{+\infty\}$, interpreted as a generalization of the midpoint identity for squared geodesic distances, we investigate the debiasability of costs defined on spaces of probability measures. Our primary focus is the entropic regularization of optimal transport across the different regimes of the regularization parameter $\varepsilon\in[0,+\infty]$, encompassing classical optimal transport ($\varepsilon=0$), entropic optimal transport ($\varepsilon>0$), and the Maximum Mean Discrepancy ($\varepsilon=+\infty$). For $\varepsilon\in(0,+\infty)$ we obtain debiasability under negative definiteness of the ground cost, through an explicit Gaussian factorization, and, more generally, under positive semidefiniteness of the kernel $e^{-c/\varepsilon}$ alone, conditions also proved necessary. All our results extend naturally to unbalanced optimal transport settings. Extending our factorizations to include a time parameter $t\in(0,1)$, we construct an entropic interpolation curve given by an intermediate measure $\eta_t\in\mathscr P(\mathscr Z)$ based on a barycentric formulation, which coincides with the marginals of the Schrödinger bridge between $\mu$ and $\nu$. As a byproduct, we derive a new proof for the entropic Benamou-Brenier formula under very mild assumptions.
Read the full abstract ▾
Combinatorics
Tonnetz Theory, Classical Harmony, and the Combinatorial Geometry of Abstract Musical Resources
Jeffrey R. Boland and Lane P. Hughston
In a previous submission, we established a fundamental relation between tone networks and configurations. It was shown that the Eulerian tonnetz can be represented by a $\{12_3\}$ of Daublebsky von Sterneck type D222. We also constructed a tonnetz for Tristan-genus chords (dominant sevenths and half-diminished sevenths) and showed that this tonnetz can be represented by a $\{12_3\}$ of type D228. In both constructions the associated Levi graphs play an important role. Here we look at the tonnetze associated with some other musical systems, thereby offering concrete examples of an abstract view of music as combinatorial geometry. First, we look at the tonal harmonies of the classical period. In the case of diatonic triads, we show the existence of a bipartite graph of type $\{7_3\}$ and girth four that represents the relations between the seven diatonic degrees and their pitch classes. In the case of diatonic seventh chords, we obtain a Fano configuration $\{7_3\}$, which gives a characterization of the voice-leading relations that hold between such chords. Next, we construct a tonnetz for pentatonic music based on the Desargues configuration $\{10_3\}$ and we construct a tonnetz for the 12-tone system based on the Cremona-Richmond configuration $\{15_3\}$. Both can be used as resources for compositions. Finally, we show that the relation between the chromatic pitch class set and the major triad set is represented by a D222. The minor triads are in one-to-one correspondence with the members of a certain class of hexacycles in the Levi graph of this configuration. In this way, the characteristic duality between major and minor triads in the tonnetz can be broken.
Read the full abstract ▾
Functional Analysis
Linear completeness of trajectories in Sobolev spaces and the symmetrised polydisk
Lyonell Boulton and Connor Evans
We establish a framework to determine the linear completeness of families of non-linear trajectories in
Hilbert spaces, which relies on an infinite analytic block Toeplitz operator formulation. By means of this approach, we show the linear completeness in Sobolev spaces of two families of classical functions. One is the moving family of dilated Weierstrass functions. The other is the family of eigenfunctions of the Gross-Pitaevskii equation with trapping potential in an infinite square well. Our results provide a new insight on the formulation of general methods to examine this intriguing concept, bridging classical non-linear analysis and linear approximation theory.
Read the full abstract ▾
Analysis of PDEs
Sharp global and almost everywhere convergence rates for periodic homogenization of viscous quadratic Hamilton-Jacobi equations
Ziran Liu, Hung V. Tran and Yifeng Yu
We study the periodic homogenization of the viscous Hamilton–Jacobi equation \[ u_t^\varepsilon + \frac{1}{2}|Du^\varepsilon|^2 + V\!\left(\frac{x}{\varepsilon}\right) = \frac{\varepsilon}{2}\Delta u^\varepsilon \qquad \text{in } \mathbb{R}^n \times (0,\infty), \] with initial datum $g \in W^{1,\infty}(\mathbb{R}^n)$, where $V$ is Lipschitz continuous and $\mathbb{Z}^n$-periodic. We prove the sharp global estimate \[ |u^\varepsilon(x,t)-u(x,t)| \leq \varepsilon\!\left(C+\frac{n}{2}\log\!\left(\frac{\max\{t,\varepsilon\}}{\varepsilon}\right)\right) \qquad \text{for all } (x,t)\in \mathbb{R}^n \times [0,\infty), \] where $\varepsilon \in (0,1]$, $u$ solves the limiting (homogenized) equation and $C>0$ is a constant depending only on $\|Dg\|_{L^\infty(\mathbb{R}^n)}$, $\|DV\|_{L^\infty(\mathbb{R}^n)}$, and $n$. We further show that if $g$ is locally semiconcave, then \[|u^\varepsilon(x,t)-u(x,t)| \leq C_{x,t}\varepsilon \qquad \text{for a.e. } (x,t)\in \mathbb{R}^n \times (0,\infty),\] where $C_{x,t}$ depends on $(x,t)$, $\|Dg\|_{L^\infty(\mathbb{R}^n)}$, and $\|DV\|_{L^\infty(\mathbb{R}^n)}$. More precisely, the above improved rate holds at every point $(x,t)$ where $u(\cdot,t)$ is twice differentiable at $x$. In particular, this occurs for a.e. $x\in \mathbb{R}^n$, since $u(\cdot,t)$ is locally semiconcave. We conclude by raising the open problem of whether the same $O(\varepsilon |\log \varepsilon|)$ rate remains valid for general strictly convex
Hamiltonians or general periodic
diffusions.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.LO
SAT + NAUTY: Orderly Generation of Small Kochen-Specker Sets Containing the Smallest State-independent Contextuality Set
Zhengyu Li, Curtis Bright, Stefan Trandafir et al. (+2 more)
We present a search for small Kochen-Specker (KS) sets in dimension 3, specifically targeting extensions of the 13-ray Yu-Oh set, which has been proven to be the minimal witness to state-independent contextuality. To enable this search, we introduce a novel SAT-based orderly generation framework integrating recursive canonical labeling (RCL) with the graph isomorphism tool NAUTY. We demonstrate that previous SAT approaches relying on lexicographical canonicity suffer from exponential scaling on canonical graphs. This limitation renders them intractable on the large instances (25 to 33 vertices) encountered in our search, whereas our RCL check maintains consistent millisecond-level performance, effectively eliminating the bottleneck. Overcoming this bottleneck allows us to perform the first exhaustive enumeration of all KS sets with up to 33 rays containing the complete 25-ray state-independent contextuality (SI-C) set obtained by rigid extensions of the Yu-Oh set in 1,641 CPU hours. We found and verified that the 33-ray set discovered by Schütte is the smallest three-dimensional KS set containing the complete 25-ray SI-C set. All non-existence results are backed by independently verifiable proof certificates via an extension of the DRAT proof format.
Read the full abstract ▾
All authors Zhengyu Li, Curtis Bright, Stefan Trandafir, Adán Cabello, Vijay Ganesh
Spectral Theory
The Evans function as a lower bound on the spectral distance function
George Bayliss and Jared C. Bronski
The Evans function is an analytic function that encodes information about the intersection of certain subspaces in ODE boundary value problems. As such it is a useful tool for computing the spectrum of boundary value problems arising in the stability of coherent structures. In typical applications one is interested in the roots of the Evans function, but the overall normalization is somewhat arbitrary. We present a natural normalization of the Evans function on compact domains such that the magnitude of the Evans function provides a lower bound on the distance to the nearest point in the spectrum. In other words the magnitude of the Evans function at a point in the resolvent set implies that a ball about the point in question lies in the resolvent set. Thus, when appropriately normalized, not only does the Evans function $E(\lambda)$ vanish if and only if $\lambda$ lies in the spectrum of the operator in question, but a non-zero value for the Evans function guarantees that a disk of radius $|E(\lambda^*)|$ about the point $\lambda^*$ lies in the resolvent set. We present some calculations for some common sets of boundary conditions on a compact interval, and present some numerical experiments for 2nd and 4th order self-adjoint operators and for a linearized modified Korteweg-De Vries equation.
Read the full abstract ▾
Probability
Fluctuation theory for spectrally negative Lévy processes killed by additive functionals
Kei Noba and José-Luis Pérez
In this paper, we study fluctuation identities for spectrally negative Lévy processes killed by a general class of additive functionals. We consider positive co-natural additive functionals (PcNAFs), which include as special cases both absolutely continuous functionals and finite mixtures of local times. Our main result shows that the associated fluctuation identities, such as two-sided exit problems and resolvent measures, retain the same structure as in the classical case and can be expressed in terms of generalized scale functions. These scale functions are characterized as the unique solutions to Volterra-type integral equations driven by Radon measures, thereby extending the results of Li and Palmowski and Li and Zhou. Our approach is based on representing the additive functional as a mixture of local times with respect to its Revuz measure, combined with classical fluctuation identities and an approximation scheme for general Radon measures using Poisson random measures.
Read the full abstract ▾
Numerical Analysis
A Proximal Primal-Dual Approach to Generalized JKO Schemes for Doubly Nonlinear Parabolic Equations
Luis M. Briceño-Arias, José A. Carrillo, Dante Kalise et al. (+2 more)
Variational methods based on optimization strategies are proposed to numerically solve a large family of nonlinear partial differential equations. They are all particular instances of gradient flows with general costs, including the $p$-Laplace equation and flux-limited equations such as the relativistic heat equation. This is achieved by computing explicit formulas for proximal operators with general costs amenable to efficient numerical approximation. We showcase our numerical approach via validation of the results by recovering the qualitative behavior of particular known cases of this large family of steepest descent evolutions.
Read the full abstract ▾
All authors Luis M. Briceño-Arias, José A. Carrillo, Dante Kalise, Francisco J. Silva, Li Wang
Information Theory
Finite-Length Empirical Comparison of Polar, PAC, and Invertible-Extractor Secrecy Codes over the Wiretap BSC
Jaswanthi Mandalapu, Tyler Kann, Andrew Thangaraj et al. (+1 more)
We compare three secrecy-coding schemes for the degraded wiretap binary symmetric channel (BSC) in the finite-blocklength regime: (i) polar wiretap coset codes, (ii) PAC codes used as wiretap coset codes, and (iii) the invertible-extractor (IE) framework of Bellare–Tessaro. Our comparison is empirical and uses a common semantic-secrecy metric (distinguishing advantage). For polar coset codes, we compute Eve's polarized bit-channel capacities (via the Tal–Vardy construction) to obtain explicit finite-length upper bounds on mutual-information leakage, yielding strong secrecy bounds. For PAC coset codes, we prove that Eve's synthesized bit-channels are equivalent to those of polar codes (up to a permutation), so the same leakage bounds apply; we then convert these strong-secrecy bounds into semantic-secrecy guarantees for symmetric wiretap channels. For the IE scheme, we use the closed-form semantic-secrecy bounds already established. Finally, we report finite-length results that jointly characterize (a) semantic-secrecy guarantees against Eve and (b) frame-error-rate performance at Bob. Our simulations indicate that Polar and PAC codes exhibit comparable reliability performance under the considered finite-length settings, while PAC codes retain the same secrecy bounds as Polar codes. More broadly, our results highlight that non-universal designs of wiretap codes provide tighter secrecy guarantees than universal design based on invertible extractors.
Read the full abstract ▾
All authors Jaswanthi Mandalapu, Tyler Kann, Andrew Thangaraj, Matthieu R. Bloch
Information Theory · Cross-listed from eess.SP
Grassmannian-Coded Beamforming for mmWave Channel Sensing with Unknown Complex Path Gain
Parthasarathi Khirwadkar, Robin Rajamäki and Piya Pal
This paper introduces a subspace-coding perspective to millimeter-wave channel sensing with a single RF chain when the complex channel gain is unknown. We show that in this case, candidate directions-of-arrival (DoAs) map naturally to subspaces through their beamspace responses, revealing an intrinsic Grassmannian geometry. This motivates beamspace Grassmannian codes (BGCs), designed to reduce DoA error by maximizing the minimum subspace distance of the joint beamformer-array response. We identify two regimes: one in which existing Grassmannian packings are exactly realizable as BGCs when the angular grid matches the array size, and another in which realizability for finer grids is constrained by the array geometry. Our analysis establishes the joint roles of subspace distance and beamforming gain in sensing performance and motivates two complementary beamformer designs. Without prior DoA information, we develop spatially isotropic beamformers based on algebraic Grassmannian packings and modulation-based channel codes. With a known DoA region of interest, we design convolutional beamspaces that combine directional gain with favorable subspace distance. Numerical results demonstrate robust BGC performance for both on-grid and off-grid DoAs, supporting the effectiveness of the proposed Grassmannian framework for mmWave channel sensing.
Read the full abstract ▾
Numerical Analysis
A Space-time Approach to Entropy-Stable Discontinuous Galerkin and Flux Reconstruction
Carolyn M. V. Pethrick and Siva Nadarajah
We present a high-order space-time discretization equipped with fully-discrete
entropy stability properties for general choices of volume and surface quadrature rules. The formulation uses flux reconstruction (FR) in the spatial dimension paired with a discontinuous Galerkin (DG) method in the temporal dimension. The result is a fully-implicit system using
polynomial bases in space and time. An energy-stable discretization is applied to the linear advection equation, yielding optimal $p+1$ convergence for small FR correction parameters and $p$ convergence at the same filter strength as method-of-lines implementations. We can thus recover the space-time equivalent to schemes such as DG, Huynh's FR, or spectral difference through a single parameter $c$. We follow with a similar space-time nonlinearly-stable flux reconstruction (ST-NSFR) scheme, which uses skew-symmetric stiffness operators in both space and time. The ST-NSFR scheme is fully-discretely
entropy preserving using the $c_{DG}$ parameter or
entropy-stable for small $c$. Numerical experiments using the linear advection and Euler equations confirm convergence orders and stability properties. The advantage of FR in a space-time context is demonstrated by a reduction in computational cost up to about $70\%$ as $c$ is increased.
Read the full abstract ▾
Combinatorics
Analytical properties of $q$-metallic numbers
Emmanuel Pedon
For an integer $n\geq 1$, consider the $n$-th metallic number $\phi_n=\frac{n+\sqrt{n^2+4}}{2}$ (e.g. $\phi_1$ is the golden number) and denote by $[\phi_n]_q$ its $q$-deformation in the sense of S. Morier-Genoud and V. Ovsienko. This is an algebraic continued fraction which admits an expansion into a power series $[\phi_n]_q =\sum_{l=0}^{+\infty} \kappa_l(\phi_n) q^l$ around $q=0$, with integral coefficients. By using techniques from analytic combinatorics, we establish several properties of the sequence $( \kappa_l(\phi_n))_{l\geq 0}$ of Taylor coefficients: characterisation by recurrences or by differential equations, closed-form expressions when $n=1,2,3$, and asymptotics. We also present some remarkable identities induced by the action of the modular group $PSL(2,Z)$ and address, mainly through computer experimentations, the question of the logarithmic behaviour of the sequence $( \kappa_l(\phi_n))_{l\geq 0}$. A particular accent is put on the comparison between the $q$-deformation $[\phi_1]_q$ of the golden ratio and RNA secondary structures, the former being actually a signed version of the latter. By doing so, we would be pleased to bring the interest of combinatoricians to the newly discovered world of $q$-numbers.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.DM
Completely Independent Steiner Trees
Anil Maheshwari, Karthik Murali and Michiel Smid
Spanning trees are fundamental for efficient communication in networks. For fault-tolerant communication, it is desirable to have multiple spanning trees to ensure resilience against failures of nodes and edges. To this end, various notions of disjoint or independent spanning trees have been studied, including edge-disjoint, node/edge-independent, and completely independent spanning trees. Alongside these, several Steiner variants have also been investigated, where the trees are required to span a designated subset of vertices called terminals. For instance, the study of edge-disjoint spanning trees has been extended to edge-disjoint Steiner trees; a stronger variant is the problem of internally disjoint Steiner trees, where any two Steiner trees intersect exactly in the terminals. In this paper, we investigate the Steiner analogue of completely independent spanning trees, which we call completely independent Steiner trees. A set of Steiner trees is completely independent if, for every pair of terminals $u,v$, the $(u,v)$-paths in all the Steiner trees are internally vertex-disjoint and edge-disjoint. This notion generalizes both completely independent spanning trees and internally disjoint Steiner trees. We provide a systematic study of completely independent Steiner trees from structural, algorithmic, and complexity-theoretic perspectives. In particular, we present several characterisations, connectivity bounds,
algorithms, hardness results, and applications to special graph classes such as planar graphs and graphs of bounded treewidth. Along the way, we also introduce a directed variant of completely independent spanning trees via an equivalence with completely independent Steiner trees.
Read the full abstract ▾
Mathematical Physics · Cross-listed from hep-th
On non-relativistic integrable models and 4d SCFTs
Rotem Ben Zeev, Anirudh Deb, Hee-Cheol Kim et al. (+1 more)
We elaborate on the relation between the generalized Schur index of $N=2$ SCFTs in four dimensions and the non-relativistic limit of the
elliptic Ruijsenaars-Schneider model. In particular we discuss explicitly how to express generalized Schur indices of theories of class $S$ in terms of
elliptic Jack functions. For example, in the $A_1$ case the indices are given naturally in terms of eigenfunctions of the Lamé equation. We use the expression in terms of eigenfunctions to further check the recent observation that the generalized Schur indices of different theories in the Deligne-Cvitanović series can be mapped onto each other. This mapping implies non trivial identities on unrefined sums of eigenfunctions of non-relativistic
elliptic Calogero-Moser models associated to different root systems. We claim then that the non-relativistic limits of various integrable models give rise naturally to generalized Schur-like limits of classes of $N=1$ SCFTs. As an example we discuss the relation of the Inozemtsev model, the non relativistic limit of the van Diejen model, and compactifications of the rank $Q$ E-string theory. We argue that in general the “Schur index” of $N=1$ $4d$ SCFTs can be understood as being related to the free fermionic limit of a non-relativistic integrable model.
Read the full abstract ▾
All authors Rotem Ben Zeev, Anirudh Deb, Hee-Cheol Kim, Shlomo S. Razamat
Numerical Analysis
Stable Mesh-Free Variational Radial Basis Function Approximation for Elliptic PDEs and Obstacle Problems
Tan Phuong Dong Le, Giang Tran and Hans De Sterck
We present a comprehensive study of radial basis function (RBF) approximations for
elliptic and obstacle-type boundary value problems under a variational formulation. Our focus is on practical accuracy, robustness and efficiency. To address ill-conditioning in dense systems, we apply truncated singular value decomposition (TSVD) and investigate its effect on stability and accuracy trade-offs. Numerical experiments report
benchmarks on accuracy and show fast error decay. We investigate the trade-off between approximation and truncation errors for practical settings for the number of basis functions, the oversampling ratio and the truncation threshold. In comparison with other methods, RBF variational solvers deliver high accuracy at similar or lower cost for boundary value problems.
Read the full abstract ▾
Algebraic Geometry
Border subrank of higher order tensors and algebras
Chia-Yu Chang, Fulvio Gesmundo and Jeroen Zuiddam
We determine the border subrank of higher order structure tensors of several families of
algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold
matrix multiplication and $k$-fold upper triangular
matrix multiplication for all $k$. (2) We determine the border subrank of the higher order structure tensors of truncated
polynomial algebras, null
algebras, and apolar
algebras of a quadric. (3) We determine the border subrank of the higher order structure tensors of the Lie
algebra $\mathfrak{sl}_2$ for all orders. (4) We prove that degeneration of structure tensors of
algebras propagates from higher to lower order. Along the way, we investigate which upper bound methods (
geometric rank, $G$-stable rank, socle degree) are effective in which settings, and how they relate. Our work extends the results of Strassen (J.~Reine Angew.~Math., 1987, 1991), who determined the asymptotic subrank of these
algebras for tensors of order three, in two directions: we determine the border subrank itself rather than its asymptotic version, and we consider higher order structure tensors.
Read the full abstract ▾
Mathematical Physics · Cross-listed from hep-th
Excitability in quantum field theory
Jacqueline Caminiti, Federico Capeccia and Jonathan Sorce
In
quantum field theory, it is not always possible to excite one state out of another using only local operators. This paper establishes abstract algebraic criteria for (local) excitability in general
quantum theories, and computes these criteria explicitly for zero-mean Gaussian states in (generalized) free field theories. We find that in this context, due to the special nature of Gaussian states, one-way excitability always implies two-way excitability, and our results generalize the "quasiequivalence
theorems" of Powers, Stormer, van Daele, Araki, and Yamagami. A key role in our proof is played by the information-theoretic tool of canonical purification. In appendices, we provide a pedagogical introduction to the algebraic formulation of (generalized) free field theory.
Read the full abstract ▾
Combinatorics
The Sharp Even-Size Spectral Threshold for $H(4,3)$-Free Graphs
Shreyhaan Sarkar
We determine the sharp even-size threshold for the fixed-size spectral extremal problem forbidding $H(4,3)$, the graph obtained by identifying one vertex of a $4$-cycle with one vertex of a triangle. Specifically, if $G$ is an $H(4,3)$-free graph of even size $m \ge 18$ with no isolated vertices, then $\rho(G) \le \rho'(m)$, where $\rho'(m)$ is the largest real root of $x^4 - m x^2 - (m-2)x + m/2 - 1 = 0$. Equality holds if and only if $G \cong S^-_{(m+4)/2,2}$. The value $18$ is best possible: explicit $H(4,3)$-free obstruction graphs exceed the comparison value for $m = 10,12,14,16$. The proof refines the Perron-neighborhood method by proving a local interface independence principle in the $K_4$-core branch, reducing the remaining threshold cases to finite endpoint comparisons.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Quantum $f$-divergences via Nussbaum-Szkoła Distributions in Semifinite von Neumann Algebras
Theodoros Anastasiadis and George Androulakis
In this article, we prove that the
quantum $f$-divergence between two normal states on a semifinite von~Neumann
algebra is equal to the classical $f$-divergence between two corresponding classical states, which are called Nussbaum-Szkoła distributions. This result has been proved by the second named author and T.C.~John for normal states on the von~Neumann
algebra $\mathbb{B}(\mathscr{H})$ of all bounded operators on a
Hilbert space $\mathscr{H}$. We extend their result for normal states on any semifinite von~Neumann
algebra, not only $\mathbb{B}(\mathscr{H})$.
Read the full abstract ▾