Operator Algebras
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 13 March
A C*-algebra (or a group) is called MF (matricial field) if it admits finite dimensional approximate unitary representations which are approximately injective, where approximately is meant with respect to the operator norm. It is proved that for any MF C*-algebra $A$ and its C*-subalgebra $C$, $A\ast_C A$ is MF. For general amalgamated free products, $A\ast_C B$, a necessary and sufficient condition for being MF is given. It is shown that the following groups – amalgamated free products of amenable groups, semidirect products of amenable groups by free groups, and $\mathbb Z^2\rtimes SL_2(\mathbb Z)$ – all have MF full group C*-algebra. It is shown that the class of MF C*-algebras is closed under maximal tensor products with $C^*(\mathbb F_n)$.
Information Theory · Cross-listed from stat.ML
Holographic Invariant Storage: Design-Time Safety Contracts via Vector Symbolic Architectures
We introduce Holographic Invariant Storage (HIS), a protocol that assembles known properties of bipolar Vector Symbolic Architectures into a design-time safety contract for LLM context-drift mitigation. The contract provides three closed-form guarantees evaluable before deployment: single-signal recovery fidelity converging to $1/\sqrt{2} \approx 0.707$ (regardless of noise depth or content), continuous-noise robustness $2\Phi(1/\sigma) - 1$, and multi-signal capacity degradation $\approx\sqrt{1/(K+1)}$. These bounds, validated by Monte Carlo simulation ($n = 1{,}000$), enable a systems engineer to budget recovery fidelity and codebook capacity at design time – a property no timer or embedding-distance metric provides. A pilot behavioral experiment (four LLMs, 2B–7B, 720 trials) confirms that safety re-injection improves adherence at the 2B scale; full results are in an appendix.
Read the full abstract
Combinatorics
Matching Rules as Cocycle Conditions: Discrete Potentials on Penrose and Canonical Projection Tilings
Aperiodic tilings support two classically studied but hitherto separately presented structures: matching rules, which enforce global order via local constraints, and height functions, which encode global geometry through integer-valued potentials. Their precise relationship has remained implicit in the literature. This paper bridges them via a cochain-first framework, establishing a four-way equivalence – between matching rules, Ammann bar continuity, cycle closure of the associated $1$-cochains, and height-function existence – proved for candidate tilings without presupposing any of the four conditions. The proof proceeds via a half-edge/gluing construction: for each Ammann bar family, we assign to every directed edge a signed bar-crossing count, yielding an antisymmetric $1$-cochain. A tile-side crossing function and a global cochain are built in two stages; the global cochain exists precisely when adjacent tiles agree on shared edges. Gluing implies cycle closure; the discrete Poincaré lemma then produces a scalar potential coinciding with the classical Ammann height function. The framework extends uniformly to canonical projection tilings (CPTs) from $\mathbb{Z}^N$: lattice-coordinate cochains reconstruct vertex positions via $v = \sum_{k=1}^N x_k(v)\,\mathbf{e}_k^*$, and (for CPTs with generic window) form a $\mathbb{Z}$-basis for $\check{H}^1 \cong \mathbb{Z}^N$ (Forrest–Hunton–Kellendonk), yielding a conservation-forced structure with recognition gap $\mathcal{R}(\mathcal{T}) \cong \mathbb{Z}^N$. The framework is verified for the Fibonacci chain, Penrose P2, Ammann–Beenker, and the icosahedral Ammann tiling; whether conservation forcing characterises exactly the Pisot substitution CPTs is left as an open conjecture.
Read the full abstract
Combinatorics
A cyclic flat embedding theorem for transversal $q$-matroids
Cyclic flats form a common structural invariant of both matroids and $q$-matroids, determining these objects through their weighted lattices of cyclic flats. In this paper we exploit this perspective to establish a correspondence between matroids and a subclass of $q$-matroids that we call coordinate $q$-matroids. Our main result is a cyclic flat embedding theorem showing that the cyclic flat structure of a transversal matroid is preserved under this correspondence. This provides a mechanism for transferring structural properties from matroid theory to the $q$-matroid setting. As an application, we show that nested $q$-matroids are transversal and therefore representable. Finally, we illustrate the usefulness of this perspective by analysing transversal $q$-matroids under binary operations. We prove that the class of transversal $q$-matroids is closed under the free product and propose a natural presentation for the direct sum motivated by the corresponding construction for matroids.
Read the full abstract
Combinatorics · Cross-listed from stat.CO
From Proxy to Certificate: Two-Sided Ollivier-Ricci Bounds from Balanced Forman Curvature
Balanced Forman (BF) curvature is used in graph learning as a cheap stand-in for Ollivier-Ricci (OR) curvature, yet it does not lower-bound OR curvature. We show that the BF value of an edge certifies a two-sided interval for its lazy OR curvature without solving any optimal transport problem, that BF coincides with a quadrangle-augmented Jost-Liu (JL) bound with its positive parts removed, and that when the 2-hop neighborhood is available, the interval can be sharpened at a cost of $\mathcal O(d_{\max}^{2.5})$ per edge. On 23 benchmark graphs, our quadrangle-augmented bound is tighter than the bounds of JL and Tian-Lubberts-Weber (TLW) on 13.8-100% of the edges and reduces their mean gap to the exact curvature by a median of 31.2%; intersected with the bounds of TLW, the intervals settle the curvature sign of more than half of the edges on 21 of the 23 graphs. On 15 real networks with up to 1,049,866 edges, a certify-then-solve procedure answers sign queries exactly while solving a median of 5.9 times fewer transport problems, for median speedups of 2$\times$ over exact evaluation, measured against a min-cut solver that is itself about two orders of magnitude faster than the widely used $\mathtt{GraphRicciCurvature}$. The main results are machine-checked in Lean 4.
Read the full abstract
Analysis of PDEs
Nonlinear parabolic problem with time fractional derivative
Time fractional parabolic problem for p-Laplacian with double singular Hardy-type potential is considered. Comparison principle and appriory estimates for the weak solutions are proved. Existence of global weak solutions and finite-time blow-up are investigated depending on the optimal Hardy constant.
Read the full abstract
Numerical Analysis
Efficient Sketching-Based Summation of Tucker Tensors
We present efficient, sketching-based methods for the summation of tensors in Tucker format. Leveraging the algebraic structure of Khatri-Rao and Kronecker products, our approach enables compressed arithmetic on Tucker tensors while controlling rank growth and computational cost. The proposed sketching framework avoids the explicit formation of large intermediate tensors, instead operating directly on the factor matrices and core tensors to produce accurate low-rank approximations of tensor sums. Furthermore, we analyze the computational complexity and the theoretical approximation properties of the proposed methodology. Numerical experiments demonstrate the effectiveness of our approach on four problems: two synthetic test cases, a parameter-dependent elliptic equation (commonly referred to as the cookie problem) solved via GMRES, and a one-dimensional linear transport problem discretized via high-order discontinuous Galerkin methods, where repeated tensor summation arises as a core computational bottleneck. Across these examples, the sketching-based summation achieves substantial computational savings while preserving high accuracy relative to direct summation and re-compression.
Read the full abstract
Functional Analysis
Boundedness of Positive Integral Operators on Lorentz-Gamma Spaces
We characterize the boundedness of a positive integral operator $T_K$, with kernel $K\in M_+(\R^{2n})$, between Lorentz-Gamma spaces $\Gamma_{p,\phi_2}(\R^n)$ and $\Gamma_{q,\phi_1}(\R^n)$, $1<p\le q<\infty$. The key step reduces the $n$-dimensional problem to a one-dimensional weighted norm inequality for the composed operator $T_LS$, where $L=(K^{*_2})^{*_1}$ is the iterated rearrangement of $K$ introduced by Blozinski~\cite{B} and $S$ is the Stieltjes transform. Explicit Muckenhoupt-type conditions are obtained for the case $L(t,s)=(t+s)^{-1}$, corresponding to the iterated Stieltjes operator $S^2$.
Read the full abstract
Optimization and Control
Hybrid topology control: a dynamic leader-based distributed edge-addition and deletion mechanism
Coordinated operations of multi-robot systems (MRS) require agents to maintain communication connections to accomplish team objectives. However, maintaining the connections imposes costs in terms of restricted robot mobility, resulting in suboptimal team performance. In this work, we consider a realistic MRS framework in which agents are subject to unknown dynamical disturbances and experience communication delays. Most existing works on connectivity maintenance use consensus-based frameworks for graph reconfiguration, where decision-making time scales with the number of nodes and requires multiple rounds of communication, making them ineffective under communication delays. To address this, we propose a novel leader-based decision-making algorithm that uses a central node for efficient real-time reconfiguration, reducing decision-making time to depend on the graph diameter rather than the number of nodes and requiring only one round of information transfer through the network. We propose a novel method for estimating robot locations within the MRS that actively accounts for unknown disturbances and the communication delays. Using these position estimates, the central node selects a set of edges to delete while allowing the formation of new edges, aiming to keep the diameter of the new graph within a threshold. We provide numerous simulation results to showcase the efficacy of the proposed method.
Read the full abstract
Information Theory
Correlation Bounds and Markov Analysis for Ring-Oscillator TRNGs: A Joint Validation Framework
True Random Number Generators (TRNGs) based on ring oscillators require rigorous statistical validation to ensure cryptographic quality. While the Mauduit-Sárközy $k$-th order correlation measure $C_k$ provides theoretical bounds on pseudorandomness, and Maurer's Universal Statistical Test offers empirical entropy assessment, no prior work has correlated these metrics. This paper presents the first joint validation framework linking Maurer's Z-score to off-peak 2nd-order correlation $C_2$. We also derive the mathematical relationship between the previous two measures and high-order Markov chain transition probabilities in counter-based TRNGs over oscillator sampling architectures. Our results are validated computationally using OpenTRNG implementations, and demonstrate that practical implementations achieve Schmidt's improved bound. The initial results suggest a strong positive correlation between Maurer Z-score and $C_2$. Therefore, the results suggest a unified metric for TRNG quality-assessment can be achieve as a combination of these metrics, simplifying the study of new designs.
Read the full abstract
Number Theory
Bogomolov property for modular Galois representations with nontrivial nebentypus
A field in which the (logarithmic) Weil height is bounded from below by a strictly positive constant is said to have the Bogomolov property (property (B)). Given a normalized eigenform $f\in S_k(\Gamma_0(N))$ Amoroso and Terracini proved (B) for the field "cut out" by the adelic representation associated to $f$ under some assumptions on $f$, generalizing the earlier work of Habegger on elliptic curves. In this paper we extend this result to the case of normalized eigenforms with nontrivial nebentypus character. We also introduce the notion of ADZ field, inspired by earlier work of Amoroso, David and Zannier, exhibiting a class of fields in which property (B) is preserved under (arbitrary) composition.
Read the full abstract
Combinatorics
On the Domatic Game
The domatic game with pallete size $k$ is a $2$-player game played on a graph $G$ recently introduced by Hartnell and Rall. Players Alice and Bob take turns choosing an uncolored vertex from $G$, and coloring it a color from $\{1,2,\dots,k\}$. The game ends once all vertices in $G$ have been assigned a color. Alice wins if all $k$ colors induce a dominating set of $G$, and otherwise Bob wins. The domatic game number, $\operatorname{dom_g}(G,X)$ is the the largest pallete size $k$ such that Alice wins the domatic game when player $X$ goes first (where $X$ is either Alice or Bob). We prove for any graph $G$ of order $n$, \[ \operatorname{dom_g}(G,X)=\Omega\left(\frac{\delta(G)}{\log n}\right). \] In addition, we show that for any $k$ there exists a graph $G$ with minimum degree $\delta(G)=k$ and $\operatorname{dom_g}(G,X)=1$, and there exists a graph $G'$ with $\operatorname{dom_g}(G',X)=1$ while having (non-game) domatic number $\operatorname{dom}(G')=k$. We explore how the domatic game number changes when changing who goes first, and when considering subgraphs of $G$. We also introduce a score variant of the domatic game, and use this to get bounds on the original domatic game.
Read the full abstract
Optimization and Control
Machine Learning-Enabled Large-Scale Capacity Expansion Planning under Uncertainty
Capacity expansion planning under uncertainty requires selecting a scenario count and representative operational horizon to estimate average production costs. Small choices risk unreliable plans, while large choices become intractable. We propose AutoSCEP, an automated, statistically grounded procedure that, for a fixed plan, selects the minimum sufficient scenario count and horizon length to estimate production costs to a given precision. Using these estimates, we train linear and neural surrogates to approximate expected production costs for arbitrary plans, and embed the surrogates within the planning model. On the continental-scale EMPIRE system, AutoSCEP attains 2% optimality gap on a reduced model and 8% gap on a large model, outperforming parallel progressive hedging under equal wall-clock budgets that include data generation, training, and solve times. Where the reduced model's optimum is available, investment patterns broadly align with the benchmark. Our approach enables high-resolution uncertainty modeling at realistic system scales.
Read the full abstract
Numerical Analysis
A Discrete Radon Transform Based on the Area of Cube-Plane Intersection
The Radon transform is a fundamental tool for analyzing data in tomographic imaging, optimal transport, crystallography, and geometric analysis. Numerical computations require an accurate discretization. To deal with voxelized images and objects, we derive a closed-form, piecewise polynomial expression for the Radon transform of an axis-aligned cube in arbitrary dimension $d$. Building on this formula, we propose a discrete Radon transform in $\mathbb{R}^d$ that is both analytically exact for voxelized data and computationally efficient. For improved numerical stability, we introduce a regularized variant replacing the Radon transform of a cube, i.e.\ the $(d-1)$-dimensional area of the intersection between that cube and a hyperplane, by the $d$-dimensional volume of the intersection between the cube and a thin slab around the hyperplane. Numerical experiments demonstrate the effectiveness of the proposed approach in several applications including 3D shape matching, classification, and sliced Wasserstein barycenters. The computational efficiency in higher dimensions is verified by a comparison with Monte Carlo integration.
Read the full abstract
Statistics Theory
An Empirical Bayes Perspective on Heteroskedastic Mean Estimation
Towards understanding the fundamental limits of estimation from data of varied quality, we study the problem of estimating a mean parameter from heteroskedastic Gaussian observations where the variances are unknown and may vary arbitrarily across observations. While a simple linear estimator with known variances attains the smallest mean squared error, estimation without this knowledge is challenging due to the large number of nuisance parameters. We propose a simple and principled approach based on empirical Bayes: model the observations as if they were i.i.d. from a normal scale mixture and compute the profile maximum likelihood estimator (MLE) for the mean, treating the nonparametric mixing distribution as nuisance. Our result shows that this estimator achieves near-optimal error bounds across various heteroskedastic models in the literature. In particular, for the subset-of-signals problem where an unknown subset of observations has small variance, our estimator adaptively achieves the minimax rate for all signal sizes, including the sharp phase transition, without any tuning parameters. One of our key technical steps is a sharper metric entropy bound for normal scale mixtures, obtained via Chebyshev approximations on a transformed polynomial basis. This approach yields an improved polylogarithmic, rather than polynomial, dependence on the variance ratio, which could be of independent interest.
Read the full abstract
Optimization and Control
Beyond First-Order Methods for $\ell_p$-Structured Non-Monotone Variational Inequalities
We propose novel high-order algorithms for a class of $\ell_p$-structured non-monotone variational inequalities. In particular, work by Diakonikolas et al. (2021), which introduced the weak Minty variational inequality (weak-MVI) setting, showed how to find an approximate first-order Euclidean stationary point for a strictly positive range of the weak-MVI parameter $\rho$. However, for the $\ell_p$-norm stationary point setting ($p \neq 2$), their guarantees are limited to $\rho=0$, which recovers the standard MVI setting. In this work, we address this gap by presenting a suite of high-order methods that converge to $\ell_p$-norm stationary points for a suitable range of $\rho > 0$, thereby circumventing previous fundamental challenges in $\ell_p$ settings. We further show convergence for high-order smooth monotone operators, generalizing Adil et al. (2022) to the case where $p \geq 2$, and we extend our Euclidean techniques to continuous-time settings.
Read the full abstract
Representation Theory
On Jiang's wavefront sets conjecture for representations in local Arthur packets
This paper serves as an attempt towards the Jiang conjecture on the upper bound nilpotent orbits in the wavefront sets of representations in local Arthur packets of quasi-split classical groups, which is a natural generalization of the well-known Shahidi conjecture, reflecting the relation between the structure of wavefront sets and the local Arthur parameters. Applying the character identities of local Arthur packets and a matching method, we reduce the study of the upper bound to certain properties of the wavefront sets of the corresponding bi-torsor representations of general linear groups, which is implied by a recent result of Atobe and Ciubotaru for split classical groups when the residue characteristic is large.
Read the full abstract
Information Theory · Cross-listed from cs.LG
Improving Channel Estimation via Multimodal Diffusion Models with Flow Matching
Deep generative models offer a powerful alternative to conventional channel estimation by learning complex channel distributions. By integrating the rich environmental information available in modern sensing-aided networks, this paper proposes MultiCE-Flow, a multimodal channel estimation framework based on flow matching and diffusion transformer (DiT). We design a specialized multimodal perception module that fuses LiDAR, camera, and location data into a semantic condition, while treating sparse pilots as a structural condition. These conditions guide a DiT backbone to reconstruct high-fidelity channels. Unlike standard diffusion models, we employ flow matching to learn a linear trajectory from noise to data, enabling efficient one-step sampling. By leveraging environmental semantics, our method mitigates the ill-posed nature of estimation with sparse pilots. Extensive experiments demonstrate that MultiCE-Flow consistently outperforms traditional baselines and existing generative models. Notably, it exhibits superior robustness to out-of-distribution scenarios and varying pilot densities, making it suitable for environment-aware communication systems.
Read the full abstract
Number Theory
Sizes of Pre-Images of the Minimal Euclidean Function on the Gaussian Integers
In 2023, the author presented the first computable minimal Euclidean function for a non-trivial number field. Along with a formula for $\phi_{\mathbb{Z}[i]}$, the minimal Euclidean function on the Gaussian inteers, the same paper introduced a geometric description for $\phi_{\mathbb{Z}[i]}^{-1}([0,n])$. This paper uses that construction to prove formulas for the size of the function's pre-images, or $|\phi_{\mathbb{Z}[i]}^{-1}([0,n])|$.
Read the full abstract
Complex Variables
Divergent diagrams of folds associated with reflections
We analyse divergent diagrams of \(k\)-fold map-germs on \((\mathbb{C}^n,0)\), for $k, n \geq 2$, associated with reflections, adapting to the complex setting the theory of folds associated with involutions on \((\mathbb{R}^n,0)\). In the complex case, a \(k\)-fold is naturally related to a cyclic group generated by a reflection, which guides the analytic classification of singularities. Under the conditions of transversality and linearity of the associated reflections, certain conditions related to the nontrivial eigenvalues appear as invariants by simultaneous conjugacy. We also provide a complete classification of pairs of transversal linear reflections and the corresponding divergent diagrams.
Read the full abstract
Optimization and Control
Investigating mixed-integer programming approaches for the $p$-$\alpha$-closest-center problem
In this work, we introduce and study the $p$-$\alpha$-closest-center problem ($p\alpha$CCP), which generalizes the $p$-second-center problem, a recently emerged variant of the classical $p$-center problem. In the $p\alpha$CCP, we are given sets of customers and potential facility locations, distances between each customer and potential facility location as well as two integers $p$ and $\alpha$. The goal is to open facilities at $p$ of the potential facility locations, such that the maximum $\alpha$-distance between each customer and the open facilities is minimized. The $\alpha$-distance of a customer is defined as the sum of distances from the customer to its $\alpha$ closest open facilities. If $\alpha$ is one, the $p\alpha$CCP is the $p$-center problem, and for $\alpha$ being two, the $p$-second-center problem is obtained, for which the only existing algorithm in literature is a variable neighborhood search (VNS). We present four mixed-integer programming (MIP) formulations for the $p\alpha$CCP, strengthen them by adding valid and optimality-preserving inequalities and conduct a polyhedral study to prove relationships between their linear programming relaxations. Moreover, we present iterative procedures for lifting some valid inequalities to improve initial lower bounds on the optimal objective function value of the $p\alpha$CCP and characterize the best lower bounds obtainable by this iterative lifting approach. Based on our theoretical findings, we develop a branch-and-cut algorithm (B&C) to solve the $p\alpha$CCP exactly. We improve its performance by a starting and a primal heuristic, variable fixings and separating inequalities. In our computational study, we investigate the effect of the various ingredients of our B&C on benchmark instances from related literature. Our B&C is able to prove optimality for 17 of the 40 instances from the work on the VNS heuristic.
Read the full abstract
Mathematical Physics
Robust symmetry breaking in gapless quantum magnets
We prove the existence of spontaneous symmetry breaking in suitably low-energy eigenstates of certain gapless and frustrated many-body quantum systems, namely symmetric quantum perturbations to classical models which exhibit spontaneous symmetry breaking of a finite group at some positive temperature. Additionally, the classical model need not be local in space, as long as it satisfies a quantum analogue of the Peierls condition. As an example of our technique, we establish robust ferromagnetism in random-bond Ising models in $d= 2$ dimensions with sufficiently biased random couplings, with weak transverse field. Our mathematical technique is based on establishing quantum bottlenecks, similar to a "many-body WKB" method for evaluating tunneling rates. Using these same methods, we provide new proofs of metastability and the slow decay of the false vacuum, applicable to gapless metastable states. Our work represents a first step towards a rigorous classification of stable gapless quantum phases.
Read the full abstract
Statistics Theory
Estimating the Missing Mass, Partition Function or Evidence for a Case of Sampling from a Discrete Set
We consider the problem of estimating the missing mass, partition function or evidence and its probability distribution in the case that for each sample point in the discrete sample space its (unnormalized) probability mass is revealed. Estimating the missing mass or partition function (evidence) is a well-studied problem for which, in different contexts, the harmonic mean estimator and the Good-Turing (and related) estimators are available. For sampling on a discrete set with revealed probability masses these estimators can be Rao-Blackwellized, leading to self-consistent estimators not involving an auxiliary distribution with known total mass. For the case of sampling from a mixture distribution this offers the perspective of anchoring the estimator at both ends: at the diffuse end (high temperature in statistical physics) via an explicit expression for the total probability mass and at the peaked end (low temperature) via the feature of repeated entries in the sample. Estimation is model-free, but to provide a probability distribution for the missing mass or partition function a model is needed for the distribution of mass. We present one such model, identify sufficient reduced statistics, and analyze the model in various ways – Bayesian, profile likelihood, maximum likelihood and moment matching – with the objective of eliminating the mathematical (nuisance) parameters for a final expression in terms of the observed data. The most satisfactory (explicit and transparent) result is obtained by a mixed method that combines Bayesian marginalization or profile likelihood optimization for all but one of the parameters with plain maximum likelihood optimization of the final parameter.
Read the full abstract
Probability
Anisotropic Inviscid Limit for the Navier-Stokes Equations with Transport Noise Between Two Plates
We investigate an anisotropic vanishing viscosity limit of the 3D stochastic Navier-Stokes equations posed between two horizontal plates, with Dirichlet no-slip boundary condition. The turbulent viscosity is split into horizontal and vertical directions, each of which approaches zero at a different rate. The underlying Cylindrical Brownian Motion driving our transport-stretching noise is decomposed into horizontal and vertical components, which are scaled by the square root of the respective directional viscosities. We prove that if the ratio of the vertical to horizontal viscosities approaches zero, then there exists a sequence of weak martingale solutions convergent to the strong solution of the deterministic Euler equation on its lifetime of existence. A particular challenge is that the anisotropic scaling ruins the divergence-free property for the spatial correlation functions of the noise.
Read the full abstract
Number Theory
Jacobian graphs
We introduce jacobian graphs, which are explicit families of regular graphs that are spectrally indistinguishable from random graphs, but whose local structure is very different from that of random graphs. The construction relies on the geometric properties of generalized jacobians of curves and on general equidistribution theorems for character sums over finite fields.
Read the full abstract
Numerical Analysis
Mode veering and symmetry-protected crossings in conservative elastic waveguides: unified perturbation-theoretic interpretation and adaptive tracking
Accurate mode tracking is essential for elastic waveguide dispersion analysis in ultrasonic nondestructive evaluation and structural health monitoring. Its reliability, however, deteriorates near mode veering and closely spaced eigenvalues, where rapid eigenvector exchange causes mode misidentification. Although widely observed, the quantitative relationship between veering, eigenvector evolution, and tracking robustness has not been systematically established. By specializing classical perturbation theory to the single-parametric Hermitian SAFE eigenproblem–exemplified by conservative elastic waveguides–we obtain explicit expressions for eigenvector derivatives and modal coupling strength. This yields a unified, quantitative interpretation of mode veering, symmetry-protected crossings, and degeneracies, and clarifies their distinct tracking implications: eigenvector sensitivity scales inversely with the eigengap, explaining modal repulsion and the degradation of correlation-based tracking near avoided crossings, whereas symmetry-protected crossings remain benign because symmetry-induced decoupling preserves smooth eigenvector evolution, and symmetry-protected degeneracies require rotation-invariant subspace tracking. A numerical consistency condition and an existence result for a critical step size are then derived, motivating a two-level adaptive strategy with an a posteriori error indicator that separates numerical tracking consistency from symmetry-based physical correctness. Numerical examples validate the theoretical predictions and demonstrate improved robustness in regions of strong modal interaction, providing practical guidance for reliable dispersion calculations and ultrasonic inspection.
Read the full abstract
Combinatorics
Cops and Robbers: A $\times$-homotopy Invariant Variant
Cops and Robbers is a pursuit-evasion game played on graphs, of which many variants have been developed and studied. We introduce a variant of this game, "Sneaky-Active Cops and Robbers", where all cops and robber must move on their turn, and where the robber is allowed to move onto a cop position without being captured. We show that for reflexive graphs, this game is equivalent to the classical cops and robbers and that the cop number for a graph is invariant under $\times$-homotopy equivalence. We then develop further properties of this game, computing cop numbers for a number of graph families and developing results about the behavior of categorical and box products of graphs.
Read the full abstract
Optimization and Control
Approximating k-Center via Farthest-First on $\delta$-Covers
The farthest-first traversal of Gonzalez is a classical $2$-approximation algorithm for solving the $k$-center problem, but its sequential nature makes it difficult to scale to very large datasets. In this work we study the effect of running farthest-first on a $\delta$-cover of the dataset rather than on the full set of points. A $\delta$-cover provides a compact summary of the data in which every point lies within distance $\delta$ of some selected center. We prove that if farthest-first is applied to a $\delta$-cover, the resulting $k$-center radius is at most twice the optimal radius plus $\delta$. In our experiments on large high-dimensional datasets, we show that restricting the input to a $\delta$-cover dramatically reduces the running time of the farthest-first traversal while only modestly increasing the $k$-center radius.
Read the full abstract
Analysis of PDEs
Stabilization for the wave equation with fully subciritical logarithmic nonlinearity
In this paper, we consider a wave equation with strong damping and logarithmic nonlinearity. This paper aims to study the local and global existence, uniqueness and the uniform energy decay rate of a weak solution under some sufficient conditions on the initial data. Unlike previous literature restricted to the lower subcritical range $2 < \gamma < \frac{2(n-1)}{n-2}$, we successfully extend the validity of the well-posedness and stabilization results to the upper subcritical range $\frac{2(n-1)}{n-2} \leq \gamma < \frac{2n}{n-2}$.
Read the full abstract
Combinatorics
Locally Irregular Total Colorings of Graphs
A total graph is an ordered triple $(V_0, V_1, E)$, where $V_0, V_1$ are the sets of empty and full vertices, respectively, $V_0 \cap V_1 = \emptyset$, and the set of edges $E$ is a subset of \(\binom{V_0 \cup V_1}{2}\) $(E\cap(V_0 \cup V_1)=\emptyset)$. A simple graph is a total graph in which all vertices are full. We say that a total graph $G$ is locally irregular if every two adjacent vertices have different total degrees, where by the total degree of a vertex $v$ in $G$ we mean the number of edges in $G$ that contain $v$ plus 1 if $v$ is full, or plus 0 if $v$ is empty. A total coloring of a graph $G$ whose colors induce locally irregular total subgraphs is called locally irregular total coloring, and the minimum number of colors required in such a coloring of $G$ is denoted by ${\rm tlir}(G)$. In 2015, Baudon, Bensmail, Przybyło, and Woźniak conjectured that ${\rm tlir}(G)\leq 2$ for every graph $G$. In this paper, we prove this conjecture for cacti, subcubic graphs, and split graphs. We also provide a general upper bound for ${\rm tlir}(G)$ depending on the chromatic number of $G$, and a constant upper bound if $G$ is planar or outerplanar. In our proofs, we utilize special decompositions of graphs and the connection between acyclic vertex coloring and locally irregular total coloring.