Statistics Theory
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 23 February
To measure the degree of agreement between two observers that independently classify $n$ subjects within $K$ categories, it is common to use different kappa type coefficients, the most common of which is the $\kappa_C$ coefficient (Cohen's kappa). As $\kappa_C$ has some weaknesses -such as its poor performance with highly unbalanced marginal distributions-, the $\Delta$ coefficient is sometimes used, based on the $delta$ response model. This model allows us to obtain other parameters like: (a) the $\alpha_i$ contribution of each $i$ category to the value of the global agreement $\Delta=\sum \alpha_i$; and (b) the consistency $\mathcal{S}_i$ in the category $i$ (degree of agreement in the category $i$), a more appropriate parameter than the kappa value obtained by collapsing the data into the category $i$. It has recently been shown that the classic estimator $\hat{\kappa}_C$ underestimates $\kappa_C$, having obtained a new estimator $\hat{\kappa}_{CU}$ which is less biased. This article demonstrates that something similar happens to the known estimators $\hat{\Delta}$, $\hat{\alpha}_i$, and $\hat{\mathcal{S}}_i$ of $\Delta$, $\alpha_i$ and $\mathcal{S}_i$ (respectively), proposes new and less biased estimators $\hat{\Delta}_U$, $\hat{\alpha}_{iU}$, and $\hat{\mathcal{S}}_{iU}$, determines their variances, analyses the behaviour of all estimators, and concludes that the new estimators should be used when $n$ or $K$ are small (at least when $n\leq 50$ or $K\leq 3$). Additionally, the case where one of the raters is a gold standard is contemplated, in which situation two new parameters arise: the $conformity$ (the rater's capability to recognize a subject in the category $i$) and the $predictivity$ (the reliability of a response $i$ by the rater).
Quantum Algebra
Input/output coloring and Gröbner basis for dioperads
We introduce a functor $\Psi$ that associates to a dioperad $P$ acting on a vector space $V$ a two-colored operad $\Psi(P)$ acting on the pair $(V, V^*)$. The construction is based on a simple pictorial idea: by selecting one input or output and dualizing, if necessary, the remaining ones, any dioperadic tree can be “rerooted” as a colored operadic tree. This transformation allows one to apply the standard operadic machinery – such as Gröbner bases and Hilbert series – to the study of dioperads. We illustrate the method with several examples and applications. (1) We compute the dimensions of the spaces of operations for the dioperad of Lie bialgebras. (2) We describe a Gröbner basis and construct a minimal resolution for the dioperad of triangular Lie bialgebras. (3) We perform explicit computations for the dioperad of “algebraic string operations”. (4) We give a pictorial construction proving the existence of quadratic Gröbner bases and establishing the Koszul property for a broad class of dioperads arising from cyclic operads.
Read the full abstract
Number Theory
Quantitative results on the $k$-dimensional Duffin-Schaeffer conjecture
For all $k\geq 2$, we provide almost-sharp quantitative results for the $k$-dimensional Duffin-Schaeffer conjecture, analogous to recent developments in the 1-D case of Koukoulopoulos-Maynard-Yang. In particular, for $\psi:\mathbb{N}\to[0,1/2]$ such that $\sum_{q\in \mathbb{N}}(\psi(q)\varphi(q)/q)^k$ diverges, $Q\geq 1$ and $\alpha\in\mathbb{R}$, we denote by $S_k(\alpha, Q)$ the number of pairs $(a,q)\in\mathbb{Z}^k\times \mathbb{N}$ with $q\leq Q$, $\gcd(a_i,q)=1$ for each $i\in\{1,\dots,k\}$, satisfying $\|q\alpha-a\|_{\infty}<\psi(q)$. Defining $\Psi_k(Q)=\sum_{q\leq Q}(2\psi(q)\varphi(q)/q)^k$, we show that for all $\varepsilon>0$ and almost all $\alpha$ one has $S_k(\alpha,Q)=\Psi_k(Q)+O_{\varepsilon,k}(\Psi(Q)^{1/2+\varepsilon})$.
Read the full abstract
Information Theory · Cross-listed from eess.SP
Joint Communication and Sensing Security in MIMO-OFDM ISAC Systems via Artificial Noise and Ghosts
Integrated sensing and communication (ISAC) enables efficient sharing of wireless resources to support emerging applications, but it also introduces new sensing-based security vulnerabilities. Here, potential communication security threats include confidential messages intended for legitimate users being intercepted, and unauthorized receivers (Eves) passively exploiting target echoes to infer sensing parameters without users being aware. Despite these risks, the joint protection of sensing and communication security in ISAC systems remains unexplored. To address this challenge, this paper proposes a dual-secure ISAC framework that simultaneously protects sensing and communication against passive sensing Eves and communication Eves, without requiring their channel state information (CSI). Specifically, transmit beamformers are jointly designed to inject artificial noise (AN) to introduce interference to communication Eves, while deliberately distorting the reference signal available to sensing Eves to impair their sensing capability. Furthermore, the proposed design generates artificial ghosts (AGs) with fake angle-delay-Doppler profiles. The legitimate sensing receiver can suppress these AGs using its prior knowledge of the true target directions, whereas sensing Eves cannot, thereby significantly reducing their probability of correctly detecting the true targets. Numerical results demonstrate that the proposed framework effectively enhances both communication and sensing security, while preserving the performance of communication users and legitimate sensing receivers.
Read the full abstract
Probability
Coalescing random walks via the coalescence determinant
When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact distributions for the survivors have been obtained only in specific settings and by ad hoc methods. Building on the coalescence determinant introduced in a companion paper, we study the wall-particle system: when every site is initially occupied, this is the joint system of survivors and the boundaries between their basins of attraction. Its finite-dimensional distributions are determinants of block matrices built from transition probabilities and their cumulative sums; a finite block matrix suffices even when the initial configuration is infinite. As applications, we recover the Rayleigh spacing density and the joint distribution of consecutive gaps - which are negatively correlated - by new methods, and give a new derivation of the determinantal formula for the joint CDF of finitely many coalescing particles starting from fixed positions. All formulas hold for arbitrary nearest-neighbor random walks and their Brownian scaling limits, with no specific transition kernels required.
Read the full abstract
Logic
Discernment is all you need
We explore the expressive power of HOL, a system of higher-order logic, and its relationship to the simply-typed lambda calculus and Church's simple theory of types, arguing for the potential of HOL as a unifying logical framework, capable of encoding a broad range of logical systems, including modal and non-classical logics. Along the way, we emphasize the essential role of discernment, the ability to tell things apart, as a language primitive; highlighting how it endows HOL with practical expressivity superpowers while elegantly enriching its theoretical properties.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
The asymptotic charges of Curtright dual graviton and Curtright extensions of BMS algebra
This paper studies the asymptotic gauge charges of the Curtright mixed-symmetry rank-3 field $\phi_{[\rho\sigma]\nu}$ in Minkowski spacetime, interpreted in $ D = 5 $ as the dual graviton. In Bondi coordinates at future null infinity, we impose radiation fall-offs and fix a de Donder-like gauge together with an on-shell traceless condition, similarly to what happens in linearized gravity. Surface charges associated with the residual gauge transformations are constructed as boundary integrals via Nöther's 2-form. In $ D = 5 $, exploiting Hodge/Hodge-like decompositions on $ S^{3} $, the charge splits into a scalar sector $ Q_{\Phi} $, a vector sector $ Q_{V} $ and a TT sector $Q_{y^{\text{TT}}}$. $ Q_{\Phi} $ is parametrized by a single arbitrary scalar function $ \Phi $ (interpreted as the supertranslation-like parameter), $ Q_{V} $ is parametrized by a vector field $ V^{i} \in \mathfrak{Diff}(S^{3}) $ and the TT sector $Q_{y^{\text{TT}}}$ is parametrized by a trasverse-traceless rank-2 tensor $y_{ij}^{\text{TT}} \in \mathfrak{TT}(S^3)$. The corresponding charge algebra closes only if $V_i \in \mathfrak{o}(4)$ as semidirect sum generating an abelian extension of a $\mathfrak{BMS}$-like algebra featuring a higher-spin-like supertranslation sector.
Read the full abstract
Number Theory
A unified parametric approach to the Erdős–Straus conjecture with explicit solutions for a set of integers of natural density one
We develop a parametric approach to study the Diophantine equation $\frac{k}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$, underlying the Erdős–Straus ($k=4$), Sierpiński ($k=5$), and related generalizations. We introduce and analyze the properties of the fundamental function $F_{x,t}^{(k)}(n) = t^2(kx-n)^2 - 2nxt$, whose being a perfect square is equivalent to yielding a solution of these conjectures. In the classical Erdős–Straus case ($k=4$), for the residue classes $n \equiv 0,2,3 \pmod{4}$, we provide explicit symmetric solutions $y=z$, covering already 75% of all integers. For the historically most resistant class $n \equiv 1 \pmod{4}$, we construct explicit symmetric solutions based on the existence of a divisor $b \equiv 3 \pmod{4}$, and we further show that this condition is satisfied for almost all such integers: the set of exceptions has natural density zero. Consequently, the Erdős–Straus conjecture is verified for a proportion of integers tending to $1$ in this class. These results yield infinitely many new families of explicit solutions not covered by previous constructions, highlight the structural behavior of $F$.
Read the full abstract
Functional Analysis
No-dimensional results of combinatorial convexity. Dimension strikes back
We discuss no-dimensional (approximate) versions of Carathéodory's and Helly's theorems. Our goal is to draw attention to open problems and potential applications related to these results. We survey recent progress and pose several questions. We also point out a simple way to “bring the dimension back into the picture”: by combining no-dimensional statements with dimension-dependent norm comparisons, one can transfer problems in $\ell_1^d$, $\ell_\infty^d$, and Schatten classes $S_1, S_\infty$ to nearby $\ell_p^d$ or $S_p$ spaces with better geometry. As elementary applications, we obtain a weak additive analogue of the Johnson–Lindenstrauss flattening lemma, local-to-global estimates for Chebyshev regression over the $\ell_1$ ball, and a local-to-global guarantee for quantum feasibility from locally consistent linear measurements.
Read the full abstract
Operator Algebras
Quantum metrics from length functions on étale groupoids
We show how to construct a compact quantum metric space from a proper continuous length function on an étale groupoid with compact unit space, where the unit space additionally has the structure of a compact metric space. Using compactly supported Fourier multipliers on the reduced groupoid $C^*$-algebra we provide a sufficient condition for verifying when we obtain a compact quantum metric space in this manner. The condition is sometimes also necessary, and is new even in the case of length functions on discrete groups. Lastly, we show that any AF groupoid with compact unit space can be equipped with a length function from which we obtain a compact quantum metric space, thereby providing a groupoid approach to understanding the quantum metric geometry of unital AF algebras.
Read the full abstract
Algebraic Geometry
On the birational isotriviality of the Albanese morphism of a log Calabi-Yau pair with a torus action
Let $(X,\Delta)$ be a projective, log canonical, $K$-trivial pair over the complex numbers. Let $Z$ be a minimal log canonical center of $(X,\Delta)$ and suppose that there exists a torus $\mathbb{T}\subseteq\operatorname{Aut}(X)$ preserving $\Delta$ and such that $\dim\mathbb{T}=\operatorname{codim}_X Z$. Then we show that two general fibers of the Albanese morphism $\operatorname{alb}_X$ are birationally equivalent. In particular, the pathological example of a projective, log canonical, $K$-trivial variety whose Albanese morphism is not generically birationally isotrivial, recently constructed by Bernasconi, Filipazzi, Patakfalvi and Tsakanikas, can be avoided under the additional hypothesis that there exists a torus of large enough dimension in the automorphism group of the given pair.
Read the full abstract
Analysis of PDEs
Existence of weak solutions for incompressible fluid-Koiter shell interactions with Navier slip boundary condition
We study a three-dimensional fluid-structure interaction problem describing the motion of an incompressible, viscous fluid coupled with a deformable elastic shell of Koiter type that forms part of the fluid boundary. The fluid motion is governed by the incompressible Navier–Stokes equations posed on a time-dependent domain, while the shell evolution is described by a nonlinear elastic model. At the fluid-structure interface, we impose Navier slip boundary conditions, allowing for tangential slip penalized by friction. Our main result establishes the global-in-time existence of weak solutions up to the first possible self-intersection of the shell, for arbitrarily large initial data with finite energy. The analysis is carried out in a fully three-dimensional setting and addresses the major mathematical challenges arising from the moving domain, the geometric nonlinearity of the shell, and the reduced regularization induced by the slip boundary condition. The proof relies on a careful construction of suitable approximation schemes, novel compactness arguments adapted to the slip framework, and a new extension operator for divergence-free test functions compatible with the fluid-shell coupling. As a further contribution, we provide a direct approach to the strong convergence of second-order spatial derivatives of the shell displacement, which allows us to treat nonlinear Koiter shell models within the same framework.
Read the full abstract
Statistics Theory
Order-Induced Variance in the Moving-Range Sigma Estimator: A Total-Variance Decomposition
I–MR charts commonly estimate the process standard deviation $\sigma$ via the span-2 average moving range divided by the unbiasing constant $d_2$; unlike the unbiased sample standard deviation ($S/c_4$), this estimator depends on ordering through adjacency, so permuting a fixed sample changes it. We formalize this by introducing an independent uniformly random permutation and applying the law of total variance, yielding an exact decomposition into a values component (variance of the permutation mean) and an adjacency component (expected conditional variance over permutations). The permutation mean is order-invariant and equals $\GMD/d_2$, where $\GMD$ is the sample Gini mean difference. Under i.i.d.\ Normal sampling, both components admit closed forms; the adjacency fraction converges to $0.3813$, and the familiar asymptotic efficiency loss relative to $S/c_4$ is almost entirely an adjacency effect.
Read the full abstract
Mathematical Physics
Haag Duality in the Thermal Sector
We prove that the net of localised von Neumann algebras associated with a real scalar field propagating on Minkowski spacetime, in the KMS representation, satisfies a generalised version of Haag duality. Our proof combines ideas from existing arguments for the ground-state representation with purification techniques.
Read the full abstract
Analysis of PDEs
Global and local properties of solutions of elliptic equations with a nonlinear term involving the product of the function and its gradient
We study the global and local properties of positive solutions to the quasi-linear elliptic equation: \d u+|\nabla u|^q u^p=0,\quad x\in Ø\subset \mathbb{R}^n,\nonumber where $q\ge 0$ and $p\in\mathbb{R}$. Our contributions are twofold: 1. Based on an optimal and new identity for the modulus squared of the logarithmic gradient, we establish optimal and improved Liouville theorems for global positive solutions, and generalize these findings to the framework of Riemannian manifolds. 2. Based on a newly discovered mutual control relationship of two nonlinear iterms, for all index pairs \( (p, q) \) where the Liouville theorem holds, we derive several optimal gradient estimates for local positive solutions. As a direct corollary, we obtain the corresponding Harnack inequality. These results strengthen the related conclusions in Bidaut-Véron–García-Huidobro–Véron \cite {BGV} from both global and local perspectives.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
GAP Measures and Wave Function Collapse
GAP measures (also known as Scrooge measures) are a natural class of probability distributions on the unit sphere of a Hilbert space that come up in quantum statistical mechanics; for each density matrix $\rho$ there is a unique measure GAP$_\rho$. We describe and prove a property of these measures that was not recognized so far: If a wave function $\Psi$ is GAP$_\rho$ distributed and a collapse occurs, then the collapsed wave function $\Psi'$ is again GAP distributed (relative to the appropriate $\rho'$). This fact applies to collapses due to a quantum measurement carried out by an observer, as well as to spontaneous collapse theories such as CSL or GRW. More precisely, it is the conditional distribution of $\Psi'$, given the measurement outcome (respectively, the noise in CSL or the collapse history in GRW), that is GAP$_{\rho'}$.
Read the full abstract
Combinatorics
New bounds for (weak) sequenceability in $\mathbb{Z}_k$
A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and Sauermann in [16], it remains open for general abelian groups, even in the cyclic case $\mathbb{Z}_k$. For cyclic groups, the best known result is due to Bedert and Kravitz in [4], who proved - using a rectification and a two-step probabilistic approach - that the conjecture holds for any subset $A \subseteq \mathbb{Z}_k \setminus \{0\}$ such that $$ |A| \le \exp\!\big(c(\log p)^{1/4}\big), $$ for some constant $c>0$, where $p$ denotes the least prime divisor of $k$. In this paper, we improve their bound using a rectification argument again, followed by a one-shot probabilistic approach, showing that the conjecture holds whenever $$|A| \le \exp\!\big(c(\log p)^{1/3}\big), $$ thus improving the exponent $1/4$ from [4]. Moreover, the same one-shot approach adapts to the $t$-weak setting: by imposing all local constraints at once and applying the Lovász Local Lemma, we obtain the existence of a $t$-weak sequencing whenever $$ t \le \exp\!\big(c(\log p)^{1/4}\big). $$
Read the full abstract
Numerical Analysis · Cross-listed from cs.LG
A Computationally Efficient Multidimensional Vision Transformer
Vision Transformers have achieved state-of-the-art performance in a wide range of computer vision tasks, but their practical deployment is limited by high computational and memory costs. In this paper, we introduce a novel tensor-based framework for Vision Transformers built upon the Tensor Cosine Product (Cproduct). By exploiting multilinear structures inherent in image data and the orthogonality of cosine transforms, the proposed approach enables efficient attention mechanisms and structured feature representations. We develop the theoretical foundations of the tensor cosine product, analyze its algebraic properties, and integrate it into a new Cproduct-based Vision Transformer architecture (TCP-ViT). Numerical experiments on standard classification and segmentation benchmarks demonstrate that the proposed method achieves a uniform 1/C parameter reduction (where C is the number of channels) while maintaining competitive accuracy.
Read the full abstract
Analysis of PDEs
1D Scattering through time dependent media with memory
We construct a scattering matrix with operator valued entries describing solutions to the 1+1 wave equation where permittivities has memory and depends on time and space. It is the analogue of the scattering matrix for spatially localised perturbations where the entries are functions of frequency and appear as Fourier multipliers in solutions of the wave equation. This provides a mathematical explanation of the numerical construction in the recent paper by Horsley et al. The appendix by Zhen Huang and Maciej Zworski presents a numerical scheme for solving the wave equation considered in this article.
Read the full abstract
Commutative Algebra
Betti numbers of ideals generated by $n+1$ powers of general linear forms
We study ideals generated by $n+1$ powers of general linear forms in $R= k[x_1,\dots,x_n]$. By generalizing the ideas in a recent paper of Diethorn et al., we determine the Betti numbers of such ideals when at least one generator is a square. It follows that all such ideals are level. As a consequence, we show that a generic ideal in $R$ generated by $n+1$ forms, with at least one quadric generator, is level. We also determine the Betti numbers of the Artinian Gorenstein algebras linked to these almost complete intersections. By describing the dual generators of these algebras, we obtain a family of forms, including the elementary symmetric polynomials, whose annihilator ideals have the strong Lefschetz property. Finally, we give explicit generators for the annihilator ideal of any elementary symmetric polynomial.
Read the full abstract
Analysis of PDEs
Discretization and regularization for the reconstruction of inhomogeneities by scattering measurements
We consider the inverse problem of reconstructing inhomogeneities by performing a finite number of scattering measurements of acoustic type in the time-harmonic setting. We set up the reconstruction as a fully discrete variational problem with regularization. Such a problem depends on a variety of parameters, that is, the number of measurements, the regularization parameter and the discretization parameter, namely the size of the mesh on which we discretize the unknown coefficients of the Helmholtz type equation modelling our physical system. We show, through a convergence analysis, that one can carefully choose these parameters in such a way that the solution to this discrete regularized minimum problem is a good approximation of the looked-for solution to the inverse problem.
Read the full abstract
Probability · Cross-listed from cs.LG
On the Equivalence of Random Network Distillation, Deep Ensembles, and Bayesian Inference
Uncertainty quantification is central to safe and efficient deployments of deep learning models, yet many computationally practical methods lack lacking rigorous theoretical motivation. Random network distillation (RND) is a lightweight technique that measures novelty via prediction errors against a fixed random target. While empirically effective, it has remained unclear what uncertainties RND measures and how its estimates relate to other approaches, e.g. Bayesian inference or deep ensembles. This paper establishes these missing theoretical connections by analyzing RND within the neural tangent kernel framework in the limit of infinite network width. Our analysis reveals two central findings in this limit: (1) The uncertainty signal from RND – its squared self-predictive error – is equivalent to the predictive variance of a deep ensemble. (2) By constructing a specific RND target function, we show that the RND error distribution can be made to mirror the centered posterior predictive distribution of Bayesian inference with wide neural networks. Based on this equivalence, we moreover devise a posterior sampling algorithm that generates i.i.d. samples from an exact Bayesian posterior predictive distribution using this modified Bayesian RND model. Collectively, our findings provide a unified theoretical perspective that places RND within the principled frameworks of deep ensembles and Bayesian inference, and offer new avenues for efficient yet theoretically grounded uncertainty quantification methods.
Read the full abstract
Numerical Analysis
On the Spectral Properties of Van Leer and AUSM Flux-Vector Splitting Schemes
The flux-vector splitting scheme of Van Leer is a cornerstone of computational fluid dynamics, yet its original proof of the eigenvalue sign condition was presented in a condensed form. In this work, we provide a detailed and rigorous analysis of the eigenvalues of the Jacobian matrices associated with the Van Leer splitting for the one-dimensional Euler equations. By constructing the Sturm sequence of the discriminant, we prove that for the admissible parameter range $1 \le \gamma \le 3$, $|M|<1$, and $a>0$, the Jacobian $\partial F^+/\partial U$ has one zero eigenvalue and two positive real eigenvalues, confirming Van Leer's original claim. Furthermore, we extend our analysis to two variants of the original AUSM scheme (Advection Upstream Splitting Method) proposed by Liou and Steffen, considering both linear and second-order pressure splittings. For the linear pressure splitting we show that the eigenvalues are not all of the same sign, while for the second-order pressure splitting we prove that all coefficients of the characteristic equation are positive. Numerical experiments reported in the appendix confirm the non-negativity of the discriminant for the AUSM with the second-order pressure splitting, implying that its eigenvalues are real and positive.
Read the full abstract
Logic
Rigid many-one degrees contain infinite antichains of $1$-degrees
Odifreddi asked whether every non-irreducible many-one degree must contain an infinite antichain of one-one degrees. Positive answers are known for computably enumerable many-one degrees (Degtev) and, more recently, for many-one degrees admitting a $\Delta^0_2$ representative (Batyrshin). In this note we isolate a rigidity principle behind these phenomena. Call a set $A\subseteq\omega$ \emph{$m$-rigid} if every total computable $m$-autoreduction of $A$ is eventually the identity. We prove that if $A$ is $m$-rigid, then its many-one degree $\deg_m(A)$ contains an infinite antichain of $1$-degrees. The proof uses a uniform duplication construction: for each computable parameter $S$ we define $B_S\equiv_m A$ so that any injective reduction $B_S\le_1 B_T$ induces an $m$-autoreduction of $A$ and therefore forces $S\subseteq^{*}T$. Choosing an almost-inclusion infinite antichain of computable sets yields the desired infinite $1$-antichain inside $\deg_m(A)$. As applications, Jockusch's rigidity theorem implies that every $1$-generic set is $m$-rigid, giving a comeager family of positive instances. Moreover, $m$-rigidity holds with Lebesgue measure $1$ (indeed, every Martin-Löf random real is $m$-rigid). Consequently, Odifreddi's Question~5 has a positive answer \emph{with probability $1$} for a fair-coin random $A\in 2^\omega$; any counterexample (if it exists) is confined to a null set (and, by genericity, also to a meager set).
Read the full abstract
Combinatorics · Cross-listed from econ.TH
Identification in Stochastic Choice
We characterize the identified sets of a wide range of stochastic choice models, including random utility, various models of boundedly-rational behavior, and dynamic discrete choice. In each of these settings, we show two distributions over choice rules are observationally equivalent if and only if they can be obtained from one another via a finite sequence of simple swapping transforms. We leverage this to obtain complete descriptions of both the defining inequalities and extreme points of these identified sets. In cases where choice frequencies vary smoothly with some parameters, we provide a novel global-inverse result for practically testing identification.
Read the full abstract
Analysis of PDEs
On compressible magnetic relaxation in planar symmetry
We consider the compressible Magnetic Relaxation Equations on the three-dimensional torus $\mathbb{T}^{3}$. The system is derived from compressible magnetohydrodynamics (MHD) by replacing the acceleration term with a Darcy-type friction. Under planar symmetry, we establish three main results: (1) local well-posedness for smooth initial data, (2) magnetic relaxation for smooth perturbations of constant steady states, and (3) the absence of vacuum states or implosions prior to and at the time of a potential singularity.
Read the full abstract
Information Theory
Secure Communications, Sensing, and Computing Towards Next-Generation Networks
Next-generation wireless networks are progressing beyond conventional connectivity to incorporate emerging sensing and computing capabilities. This convergence gives rise to integrated systems that enable not only uninterrupted communication, but also environmental awareness, intelligent decision-making, and novel applications that take advantage of these combined features. At the same time, this integration brings substantial security challenges. As computing, sensing, and communication become more tightly intertwined, the overall complexity of the system increases, creating new vulnerabilities and expanding the attack surface. The widespread deployment of data-heavy artificial intelligence applications further amplifies concerns regarding data security and privacy. This paper presents a comprehensive survey of security and privacy threats, along with potential countermeasures, in integrated wireless systems. We first review physical-layer security techniques for communication networks, and then investigate the security and privacy implications of semantic and pragmatic communications and their associated cross-layer design methodologies. For sensing functionalities, we pinpoint security and privacy risks at the levels of signal sources, propagation channels, and sensing targets, and summarize state-of-the-art defense strategies for each. The growing computational requirements of these applications drive the need for distributed computing over the network, which introduces additional risks such as data leakage, weak authentication, and multiple points of failure. We subsequently discuss secure coded computing approaches that can help overcome several of these challenges. Finally, we introduce unified security frameworks tailored to integrated communication-sensing-computing architectures, offering an end-to-end perspective on protecting future wireless systems.
Read the full abstract
Logic · Cross-listed from cs.CC
Parallelism and Adaptivity in Student-Teacher Witnessing
Student-Teacher Games are a model of computation in which a computationally restricted Student attempts to produce a string satisfying a refutable property, while an all-powerful Teacher refutes incorrect candidates by providing counterexamples. By the classical result of Krajíček, Pudlák, and Takeuti [KPT90], such games capture the witnessing of $\forall\exists\forall$-formulas in bounded arithmetic. In this paper, we introduce subclasses of total search problems in the polynomial hierarchy, classified by the number of rounds and candidate answers per round required for a Student at the corresponding level to solve them. Assuming the polynomial hierarchy does not collapse, we separate these classes for different number of rounds and queries. As applications we obtain the following results: (a) We study theories of bounded arithmetic axiomatized by fine-grained variants of length induction and bounded collection. We prove a general witnessing theorem connecting their $\forall\exists\forall$-consequences to the appropriate classes of Student-Teacher Games. Under the non-collapse of the polynomial hierarchy, we separate these theories. (b) These conditional separations resolve two open problems in bounded arithmetic: one by Buss and Ressayre [Bus85, CK93] on the strength of bounded collection, and one by Pollett [Pol97] on the difference between strict and non-strict double length induction. (c) Finally, we extend the unprovability of circuit upper bounds due to Krajíček and Oliveira [KO17] to the theory $PV_1+BB(\Sigma^b_1)$, and the unprovability of strong co-nondeterministic circuit lower bounds due to Pich and Santhanam [PS21] to the theory $PV_1+LLIND(s\Sigma^b_1)$. By the preceding separations, both theories strictly extend $PV_1$ assuming $NP\nsubseteq P/poly$.
Read the full abstract
Information Theory · Cross-listed from cs.NI
BeamVLM for Low-altitude Economy: Generative Beam Prediction via Vision-language Models
For low-altitude economy (LAE), fast and accurate beam prediction between high-mobility unmanned aerial vehicles (UAVs) and ground base stations is of paramount importance, which ensures seamless coverage and reliable communications. However, existing deep learning-based beam prediction methods lack high-level semantic understanding of dynamic environments, resulting in poor generalization. On the other hand, the emerging large language model (LLM) based approaches show promise in enhancing generalization, but they typically lack rich environmental perception, thereby failing to capture fine-grained spatial semantics essential for precise beam alignment. To tackle these limitations, we propose in this correspondence a novel end-to-end generative framework for beam prediction, called BeamVLM, which treats beam prediction as a vision question answering task capitalizing on powerful existing vision-language models (VLMs). By projecting raw visual patches directly into the language domain and judiciously designing an instructional prompt, the proposed BeamVLM enables the VLM to jointly reason over UAV trajectories and environmental context. Last, experimental results on real-world datasets demonstrate that the proposed BeamVLM outperforms state-of-the-art methods in prediction accuracy and also exhibits superior generalization for other scenarios such as vehicle-to-infrastructure (V2I) beam prediction.
Read the full abstract
Differential Geometry
Recovery problem of parametrizations from Legendre data
The problem of recovery of parametrizations from Legendre data is a very important inverse problem. In this paper, we provide a systematic and widely-applicable method to recover parametrizations $f: U_n \to \mathbb{R}^{n+1}$ from Legendre data where $U_n$ is an open subset of $\mathbb R^n$. Namely, for a dense subset of the space of real-analytic parametrizations from $U_n$ into $\mathbb{R}^{n+1}$, we show how to recover the parametrization from the Gauss mapping and the height function. Moreover, in order to assist readers to apply results of this paper, many concrete examples are given.