Optimization and Control
Convergence of Singular Dynamics Driven by Mixed Logarithmic Heat Gradients
Kang Liu and Enrique Zuazua
We study the terminal behavior of singular deterministic and
stochastic dynamics driven by convex or extrapolative combinations of logarithmic heat gradients. These equations arise in exact-score guided
diffusion sampling, including classifier-free guidance. The rescaled potentials converge to weighted sums of squared support distances, but extrapolative mixing can produce limiting directions that depend on probability masses and lie outside the Clarke subdifferential of the limiting potential. A componentwise chain rule gives dissipation for the limiting differential inclusion. Posterior relative
entropy yields finite deterministic kinetic action in logarithmic time, while a conditional free-energy estimate bounds expected energy increments uniformly in the restart time. For compactly supported laws, these estimates give energy convergence and
equilibrium localization, almost surely for each fixed
stochastic initialization; extrapolation requires a lower small-ball mass bound on the reference law. For finite atomic measures, we prove that the
equilibrium set is finite for arbitrary site configurations. Every deterministic trajectory therefore converges to an
equilibrium, and
stochastic convergence holds almost surely for each fixed initialization, including endpoints at projection interfaces. At empirical endpoints with a unique nearest atom in each active support, deterministic trajectories admit a square-root heat-time expansion with an exponentially small remainder. The exponent 1/2 is sharp when the leading coefficient is nonzero. These results provide a
geometric and dynamical framework for understanding terminal convergence in guided
diffusion models.
Read the full abstract ▾
Optimization and Control
Convergence Analysis of Hessian-Damped Tikhonov Regularized Dynamics with Oscillation Control for Convex-Concave Bilinear Saddle Point Problems
Bohan Zhang and Xiaojun Zhang
In this paper, we propose a class of general second-order primal-dual dynamical systems with Tikhonov regularization and Hessian-driven damping for solving convex-concave bilinear saddle point problems. The proposed dynamical system incorporates five general time-varying terms: viscous damping, time scaling, extrapolation, Tikhonov regularization, and Hessian-driven damping parameters. Under suitable parametric conditions, we analyze the asymptotic convergence properties of the dynamical system by constructing appropriate Lyapunov functions. Specifically, we obtain the convergence rate of the primal-dual gap and the boundedness of trajectories in the proposed dynamical system, and provide some integral estimates. Furthermore, we theoretically prove that the trajectories generated by the dynamical system converge strongly to the minimum-norm solution of the saddle point problem, and fully demonstrate that Hessian-driven damping can effectively alleviate oscillations. Finally, numerical experiments are conducted to verify the validity of the above theoretical results.
Read the full abstract ▾
Operator Algebras
Regular irreducible inclusions of simple $C^*$-algebras and crossed product structure
Keshab Chandra Bakshi, Silambarasan C and Biplab Pal
We study regular irreducible inclusions $B\subset A$ of simple unital $C^*$-
algebras admitting a conditional expectation. We introduce a generalized notion of quasi-basis extending Watatani's framework and show that such inclusions admit a
unitary orthonormal generalized quasi-basis. As a consequence, we prove that every regular irreducible inclusion in this setting is canonically isomorphic to a reduced twisted crossed product of $B$ by its Weyl group. This extends earlier crossed product characterizations beyond the finite-index setting.
Read the full abstract ▾
Algebraic Geometry
Representations of Reeb spaces via simplified graphs and examples
Naoki Kitazawa
Reeb spaces of continuous real-valued functions on topological spaces are fundamental and strong tools in investigating the spaces. The Reeb space is the natural quotient space of the space of the domain represented by connected components of its level sets. They have appeared in theory of Morse functions in the last century and as important topological objects, they are shown to be graphs for tame functions on (compact)
manifolds such as Morse(-Bott) functions and naturally generalized ones. Related general theory develops actively, recently, mainly by Gelbukh and Saeki. For nice Haudorff spaces and continuous functions there, they are "$1$-dimensional". We concentrate on Reeb spaces which are not CW complexes and study their representations by graphs and nice examples. Reconstructing nice smooth functions with given Reeb graphs is of related studies and pioneered by Sharko and followed by Masumoto, Michalak, Saeki, and so on. The author has also contributed to it.
Read the full abstract ▾
Information Theory
Angle Between Two Vectors over Finite Fields and an Application to Projective Unique Decoding
Kamil Otal
We introduce a Hamming-type angular function $$\mathrm{angle}_H(u,v):= \min_{c \in \mathbb{F}_q^n} d_H(u, cv)$$ on pairs of nonzero vectors in $\mathbb{F}_q^n$ and show that it satisfies all three metric axioms up to scalar multiplication. The function $\mathrm{angle}_H$ is invariant under nonzero scalar multiplication in either argument and therefore descends to a genuine integer-valued metric on the projective space $\mathbb{P}(\mathbb{F}_q^n)$. As a concrete application, we prove an angular (or projective) version of the unique-decoding
theorem for linear codes: if $\mathrm{angle}_H(u, C\setminus\{0\}) < d/2$, where $d$ is the minimum distance of the linear code $C$, then the closest direction in $C$ to $u$ is unique up to nonzero scalar multiplication. We then discuss how this angular viewpoint relates to the proximity-gap programme for Reed–Solomon codes. To the best of our knowledge, this is the first attempt to define an angle notion for vectors over finite fields and interpret it from several perspectives, including geometry, coding theory, and cryptography.
Read the full abstract ▾
Combinatorics
A Tighter Upper Bound for the Number of Distinct Squares in Circular Words
Shuo Li and Yuan Song
A square is a word of the form $uu$, where $u$ is a nonempty finite word. Given a finite word $w$ of length $n$, let $[w]$ denote the corresponding circular word, i.e., the set of all cyclic rotations of $w$. We study the number of distinct square factors of the elements of $[w]$. Amit and Gawrychowski first showed that this number is upper bounded by $3.14n$. In a recent article, Charalampopoulos et al. improved this upper bound to $1.8n$ and conjectured that the sharp upper bound is $1.5n$. In this note, we improve this upper bound to $\frac{5}{3}n$.
Read the full abstract ▾
Optimization and Control
Quaternionic Sums of Squares, Moments, and Quaternionic Polynomial Optimization
Yanqing Liu and Jie Wang
We develop a moment-quaternionic-sum-of-squares (Moment–QSOS) framework for global
polynomial optimization over the standard Hamilton quaternions. The main difficulty is the hybrid algebraic structure of scalar quaternionic variables: multiplication is noncommutative, while scalar evaluations satisfy additional
polynomial identities inherited from the four commuting real coordinates of each quaternion. To capture this structure, we introduce quaternionic sums of squares together with real and quaternionic scalar-identity ideals. We establish Archimedean Positivstellensätze for real-coefficient quaternionic
polynomials and for objectives with quaternionic middle coefficients and real-coefficient constraints; a counterexample shows that the latter constraint hypothesis cannot, in general, be removed for the proposed pure-word certificate cone. On the dual side, we solve the corresponding full real-valued and quaternion-valued moment problems through Riesz–Haviland-type characterizations, and we prove a flat-extension
theorem for truncated quaternion-valued moments under an explicit scalar-consistency condition. These results yield convergent Moment–QSOS hierarchies and finite-exactness criteria based on flatness. For quaternionic quadratically constrained quadratic programs (QCQPs), we further prove that the first-order quaternionic moment relaxation has the same optimal value as the first-order relaxation of the equivalent real QCQP. Numerical experiments on quadratic, quartic, and sparse problems, together with applications to quaternion-based maximum margin feature extraction and rotation synchronization, show that the quaternionic formulation attains the same relaxation values as the tested real SOS formulations while requiring substantially shorter computation times in the reported instances.
Read the full abstract ▾
Information Theory
Secure (Multiple) Key-Cast over Networks: Multiple Eavesdropping Nodes
Reza Sayyari and Michael Langberg
We study the secure multiple key-cast problem over noiseless networks under node-based eavesdroppers, where one or more source nodes participate in the generation of distinct secret keys to be shared among designated terminal subsets, while an eavesdropper observing up to $\ell$ nodes, including possibly source nodes, obtains no information about the keys. For the single-source setting, we first consider networks in which every node is $d$-vertex connected from the source. We show that a secure key rate of $d-\ell$ is achievable for all such networks. We further show that this rate is optimal by exhibiting $d$-vertex-connected networks whose secure key-cast capacity is at most $d-\ell$. We next study networks in which only the terminal nodes are $d$-vertex connected from the source, while other network nodes may not satisfy this connectivity condition and may be partially-connected. We show that secure multiple key-cast remains achievable in the presence of such partially-connected nodes, and derive coding schemes whose rate depends on the minimum network vertex-connectivity from the source and certain additional network properties. Finally, we generalize these results, for both $d$-vertex-connected networks and networks containing partially-connected nodes, to the multi-source setting; showing that secure multiple key-cast remains achievable even when the eavesdropper may observe all but one of the source nodes.
Read the full abstract ▾
Numerical Analysis
Cavity shape reconstruction with a homogeneous Robin condition via a constrained coupled complex boundary method with ADMM
Mustapha Essahraoui, El Mehdi Cherrat, Lekbir Afraites et al. (+1 more)
We revisit the problem of identifying an unknown portion of a boundary subject to a Robin condition based on a pair of Cauchy data on the accessible part of the boundary. It is known that a single measurement may correspond to infinitely many admissible domains. Nonetheless, numerical strategies based on shape optimization have been shown to yield reasonable reconstructions of the unknown boundary. In this study, we propose a new application of the coupled complex boundary method to address this class of inverse boundary identification problems. The overdetermined problem is reformulated as a complex boundary value problem with a complex Robin condition that couples the Cauchy data on the accessible boundary. The reconstruction is achieved by minimizing a cost functional constructed from the imaginary part of the complex-valued solution. To improve stability with respect to noisy data and initialization, we augment the formulation with inequality constraints through prior admissible bounds on the state, leading to a constrained shape optimization problem. The shape derivative of the complex state and the corresponding shape gradient of the cost functional are derived, and the resulting problem is solved using an alternating direction method of multipliers (ADMM) framework. The proposed approach is implemented using the finite element method and validated through various numerical experiments.
Read the full abstract ▾
All authors Mustapha Essahraoui, El Mehdi Cherrat, Lekbir Afraites, Julius Fergy Tiongson Rabago
Probability · Cross-listed from cs.GT
Sure-almost-sure and Sure-limit-sure Window Mean Payoff in Markov Decision Processes
Pranshu Gaba and Shibashis Guha
Given rationals $\alpha$ and $\beta$, the sure-almost-sure problem for a threshold Boolean objective $\varphi$ in a Markov decision process (MDP) asks if one can simultaneously ensure that all outcomes of the MDP have $\varphi$-value at least $\alpha$ (i.e. sure $\alpha$ satisfaction) and with probability $1$ the outcome has $\varphi$-value at least $\beta$ (i.e. almost-sure $\beta$ satisfaction). The sure-limit-sure problem asks if for all $\varepsilon > 0$ one can simultaneously ensure that all outcomes have $\varphi$-value at least $\alpha$ and with probability at least $1 - \varepsilon$ the outcome has $\varphi$-value at least $\beta$. Moreover, if simultaneous satisfaction of objectives is possible, then one would also like to construct a strategy (for sure-almost-sure) or a family of strategies (for sure-limit-sure) that achieves this. In this paper, we solve the sure-almost-sure and sure-limit-sure problems for window mean-payoff objectives. The window mean-payoff objective strengthens the standard mean-payoff objective by requiring that eventually, from every point in the infinite run, the average payoff becomes greater than a given threshold within a finite window length. We study two variants of window mean payoff: in the fixed variant, the window length $\ell$ is given, while in the bounded variant, the length is not given but is required to be bounded throughout the run. We show that the sure-almost-sure problem and the sure-limit-sure problem are both in P for the fixed variant (if $\ell$ is given in unary) and are both in NP $\cap$ coNP for the bounded variant, matching the computational complexity of sure satisfaction and almost-sure satisfaction when considered separately for these objectives. We also give bounds for the
memory requirement of winning strategies for all considered problems.
Read the full abstract ▾
Mathematical Physics
Local Topological Quantum Order and Spectral Gap Stability for the AKLT Models on the Hexagonal and Lieb Lattices
Thomas Jackson, Bruno Nachtergaele and Amanda Young
We prove that the ground state of the AKLT models on the hexagonal
lattice and the Lieb
lattice satisfy the local topological
quantum order (LTQO) condition. This will be a consequence of proving that the finite volume ground states are indistinguishable from a unique infinite volume ground state. Concretely, we identify a sequence of increasing and absorbing finite volumes for which any finite volume ground state expectation is well approximated by the infinite volume state with error decaying at a uniform exponential rate in the distance between the support of the observable and boundary of the finite volume. As a corollary to the LTQO property, we obtain that the spectral gap above the ground state in these models is stable under general small perturbations of sufficient decay. We prove these results by a detailed analysis of the
polymer representation of the ground states state derived by Kennedy, Lieb and Tasaki (1988) with the necessary modifications required for proving the strong form of ground state indistinguishability needed for LTQO.
Read the full abstract ▾
Information Theory
A Deep Learning-based Receiver for Asynchronous Grant-Free Random Access in Control-to-Control Networks
Massimo Battaglioni, Edoardo Carnevali, Dania De Crescenzo et al. (+3 more)
In this paper, we study grant-free, asynchronous control-to-control (C2C) communications in an indoor scenario with a shared wireless channel. Each communication node transmits command units, each consisting of a variable-length low-density parity-check (LDPC)–coded payload preceded by a start sequence and followed by a tail sequence. Due to the asynchronous nature of the access, transmissions from different nodes are not aligned over time. As a result, each receiving controller observes the superposition of multiple command units transmitted by different nodes over a receiver-defined superframe interval. Each node transmits one or more replicas of the same command unit. We propose a receiver architecture in which the detection of command unit boundaries (start/tail sequences) is carried out by a single convolutional neural network (CNN) operating directly on the received signal. We show that, while start-sequence detection must rely only on the received waveform, tail-sequence detection can additionally exploit the soft information produced by the LDPC decoder, together with channel estimates. Finally, once commands units are successfully decoded, successive interference cancellation (SIC) can be applied. Simulation results demonstrate that the receiver we propose achieves reliable packet-boundary identification and a low end-to-end packet loss rate, even under uncoordinated and high-traffic operating conditions.
Read the full abstract ▾
All authors Massimo Battaglioni, Edoardo Carnevali, Dania De Crescenzo, Enrico Testi, Marco Baldi, Enrico Paolini
Probability
Hypocoercive Langevin dynamics on the Lie group $\mathrm{SE}(2)$
Martin Grothaus and Andrea V. Hurtado-Quiceno
We consider a Langevin-type
diffusion on the planar motion group $\mathrm{SE}(2)$, describing the coupled
evolution of position and orientation with degenerate noise acting only in the rotational direction. Although hypocoercivity for related models on $\mathbb{R}^2 \times \mathbb{S}^1$ is well understood, our purpose is to present an intrinsic formulation on the Lie group $\mathrm{SE}(2)$, and to highlight the underlying
geometric mechanism. By expressing the generator in terms of invariant vector fields and using the natural projection onto the kernel of the symmetric part, we show how an effective macroscopic
diffusion on $\mathbb{R}^2$ emerges through averaging over the compact rotation subgroup.
Read the full abstract ▾
Probability · Cross-listed from cs.LG
Expected Batch Optimal Transport Plans and Consequences for Flow Matching
Samuel Boïté, Julie Delon and Kimia Nadjahi
Solving optimal transport (OT) on random minibatches is a common surrogate for exact OT in large-scale learning. In flow matching (FM), this surrogate is used to obtain OT-like couplings that can straighten probability paths and reduce numerical integration cost. Yet, the population-level coupling induced by repeated minibatch OT remains only partially understood. We formalize this coupling as the expected batch OT plan $\overline{\pi}_{k}$, obtained by averaging empirical OT plans over independent minibatches of size $k$. We then establish its large-batch consistency and, in the semidiscrete case relevant to generative modeling, derive rates for both the transport-cost bias and the convergence of $\overline{\pi}_{k}$ to the OT plan. For FM, this yields a population coupling whose induced velocity field is regular enough to define a unique flow from the source to the discrete target. We finally quantify how OT batch size interacts with numerical integration in a tractable two-atom model and in synthetic and image experiments.
Read the full abstract ▾
Mathematical Physics · Cross-listed from gr-qc
Chaos and epoch structure in the deformed Mixmaster universe
Babak Vakili
We study the dynamics of the Bianchi~IX (Mixmaster) universe under classical polymerization and generalized uncertainty principle (GUP) deformation of the Poisson brackets. Starting from the Misner
Hamiltonian, we derive the effective equations of motion with both modifications and analyze the duration of Kasner epochs as a probe of dynamical behavior. Our results show that GUP corrections typically shorten the epochs, leading to more frequent wall collisions, whereas
polymer corrections prolong them and suppress successive bounces. At leading order, the combined deformation produces an additive shift that interpolates between these two trends. While the billiard picture remains robust, the strength of Mixmaster chaos becomes sensitive to the deformation parameters. These results illustrate how Planck-scale corrections may either enhance or suppress cosmological chaos, offering a controlled framework for exploring early-universe dynamics.
Read the full abstract ▾
Metric Geometry · Cross-listed from cs.LG
Fused Gromov-Wasserstein Distance with Feature Selection
Harlin Lee, Ying Yu, Mingxin Li et al. (+1 more)
Fused Gromov-Wasserstein (FGW) distances provide a principled framework for comparing objects by jointly aligning structure and node features. However, existing FGW formulations treat all features uniformly, which limits interpretability and robustness in high-dimensional settings where many features may be irrelevant or noisy. We introduce FGW distances with feature selection, which incorporate adaptive feature suppression weights into the FGW objective to selectively downweight or suppress differentiating features during
alignment. We propose two approaches: (1) regularized FGW with Lasso and Ridge penalties, and (2) FGW with simplex-constrained weights, including groupwise extensions. We analyze the resulting models and establish their key theoretical properties, including bounds relative to classical FGW and Gromov-Wasserstein distances, and metric behavior. An efficient alternating minimization
algorithm is developed. Experiments illustrate how feature suppression enhances interpretability and reveals task-relevant structure, with a special application to computational redistricting.
Read the full abstract ▾
All authors Harlin Lee, Ying Yu, Mingxin Li, Ranthony Clark
Dynamical Systems
On solution of Diffusion Equation using Conformable Laplace Transform
Somnath Sarate, Anil Khairnar and Krishnat Masalkar
The inversion
theorem and convolution
theorem of the conformable fractional Laplace transforms are developed. All the elementary properties of the classical Laplace transform are extended to the conformable fractional transform, and using these properties, we found analytical solutions to the initial-boundary value problems of the
diffusion equation.
Read the full abstract ▾
Combinatorics
Closed Expressions for the Weight Distributions of Codes Associated with Perfect Codes
Tuvi Etzion, Denis Krotov, Minjia Shi et al. (+1 more)
Perfect codes are arguably the most fascinating structures in combinatorial coding theory, and their classification and weight distribution are of considerable interest. This classification also involves the analysis of some related structures. This paper considers five closely related structures, but all of them have never been tied together before. These structures are 1-perfect codes, extended 1-perfect codes, nearly perfect 1-covering codes, extended nearly perfect 1-covering codes, and one family of completely regular codes (to be called diamond codes). The current work concentrates on the weight distributions of these five families of codes. In the past, some of these weight distributions were not computed, some required heavy tools, and for some only the weight enumerator was presented. We provide complete weight distributions for all five families using some methods that do not require any heavy tools.
Read the full abstract ▾
All authors Tuvi Etzion, Denis Krotov, Minjia Shi, Wenhao Song
Information Theory
Capacity Scalability of LEO Constellations With Dynamic Link Failures
Wei Li and Min Sheng
Dynamic link failures disrupt the connectivity and
geometric symmetry of the constellation structure, thereby increasing protocol overhead and degrading the effective capacity for traffic transport. The fundamental relationship between constellation size and effective capacity under protocol overhead constraints remains unclear. To this end, we define capacity scalability as the ratio of constellation capacity under non-failure conditions to protocol overhead. Specifically, if ISL states follow a two-state discrete Markov chain and the maintenance period is $k \geq 1$, the upper bound of capacity scalability under the uniform traffic pattern is $O(1/n)$, where $n$ is the number of satellites. With perfect information about the constellation
topology, the upper bound can be achieved via shortest-path routing. For any given protocol, there exists an optimal constellation deployment scale in terms of capacity scalability. When the constellation size is below this optimum scale, capacity scalability increases with constellation size, thereby improving effective capacity. Increasing the maintenance period $k$ can improve capacity scalability, but it does not change the fact that the capacity scalability converges to zero when the constellation size exceeds the optimal scale.
Read the full abstract ▾
Probability
Nonlinear filtering with stochastic discontinuities
Thorsten Schmidt and Félix B. Tambe-Ndonfack
Filtering problems with jumps in both the signal and the observation have been extensively studied, typically under the assumption that jump times are totally inaccessible. In many applications, however, jump times are known in advance (i.e., predictable), such as scheduled clinical visits, dividend payment dates, or inspection times in engineering systems. Taking predictable jump times as a starting point, we investigate a filtering problem in which both the signal and the observations can exhibit jumps at predictable times. We derive the corresponding Kushner-Stratonovich and Zakai equations, thereby extending classical nonlinear filtering results to a setting with predictable discontinuities. We illustrate the framework on a Kalman filtering model with predictable jumps and on applications to longitudinal clinical studies, such as spinal muscular atrophy (SMA), as well as to machine learning models (neural jump ODEs) and credit risk.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.SI
NPAP: Network Partitioning and Aggregation Package for Python
Marco Anarmo, Benjamin Stöckl, Yannick Werner et al. (+1 more)
NPAP (Network Partitioning and Aggregation Package) is an open-source Python library for reducing the spatial complexity of network graphs. Built on NetworkX, it provides an accessible standalone package designed to be readily integrated with other software and frameworks. Instead of treating the spatial reduction process as a single action, NPAP explicitly splits it into two distinct steps: partitioning, which assigns vertices (nodes) to groups (clusters), and aggregation, which reduces the network based on a given assignment. NPAP's strategy pattern architecture allows users to employ and register custom partitioning and aggregation strategies seamlessly without modifying the core code. Currently, NPAP provides 13 different partitioning strategies and two pre-defined aggregation profiles. Although initially developed with a focus on power systems, its architecture is general-purpose and applicable to any network graph.
Read the full abstract ▾
All authors Marco Anarmo, Benjamin Stöckl, Yannick Werner, Sonja Wogrin
Information Theory
A framework for constructing non-GRS MDS-NMDS codes from deep holes and its application
Yang Li, Zhenliang Lu, San Ling et al. (+1 more)
Maximum distance separable (MDS) codes and near MDS (NMDS) codes are of particular interest in coding theory due to their optimal error-correcting capabilities and wide applications in communication, cryptography, and storage systems. A family of linear codes is called a family of non-GRS MDS-NMDS codes if for each $[n,k]_q$ code in the family, it is either an $[n,k,n-k+1]_q$ MDS code that is not monomially equivalent to any GRS code or extended GRS code, or an $[n,k,n-k]_q$ NMDS code. This paper develops a unified framework for constructing new families of non-GRS MDS-NMDS codes via deep holes. We show that, starting from a family of $[n,k]_q$ non-GRS MDS-NMDS codes with covering radius $n-k$, one can systematically obtain more $[n+1,k+1]_q$ non-GRS MDS-NMDS codes. The proposed framework is further reformulated in terms of the second kind of extended codes. This reformulation recovers a main result of Wu, Ding, and Chen (IEEE Trans. Inf. Theory, 71(1): 263-272, 2025), provides a provable reduction in the computational complexity compared with the approach of Ma, Kai, and Zhu (Finite Fields Appl., 114, 102844, 2026), and reveals additional structural properties of the resulting codes. As an application, we determine the covering radius and characterize two classes of deep holes of extended subcodes of GRS codes. By applying our framework, we obtain three new families of non-GRS MDS-NMDS codes and investigate the monomial equivalence between the resulting codes and Roth-Lempel codes.
Read the full abstract ▾
All authors Yang Li, Zhenliang Lu, San Ling, Kwok-Yan Lam
Functional Analysis
Implications of structured continuous maximal regularity
Philip Preußler and Felix L. Schwenninger
We study how maximal regularity estimates with respect to the continuous functions improve automatically in cases where the spatial norm is fundamentally different from the supremum norm. More precisely, we invoke properties such as weak compactness of convolution-type operators related to the mild solutions of the underlying linear
evolution equations to sharpen the a priori estimates. These results have several applications: such as a new proof of Guerre-Delabriere's result on $\mathrm{L}^1$-maximal regularity and an extension of Baillon's
theorem; a simplification for well-known perturbation
theorems for generation of $\mathrm{C}_0$-
semigroups; and we resolve an open problem on input-to-state stability from control theory for a general abstract class of systems.
Read the full abstract ▾
Functional Analysis
Norm attainment for multilinear operators and polynomials on Banach Spaces and Banach lattices
Luis A. Garcia, José Lucas P. Luiz and Vinícius C. C. Miranda
We study norm attainment for multilinear operators and homogeneous
polynomials between
Banach spaces, as well as for positive multilinear operators between
Banach lattices. We establish multilinear and
polynomial versions of [23,
Theorem B] and [35,
Theorem 2.12]. More precisely, we provide sufficient conditions on
Banach spaces $X_1, \dots, X_n$ and $Y$ ensuring that every $A \in \mathcal{L}(X_1, \dots, X_n; Y)$ (respectively, $P \in \mathcal{P}(^n X_1; Y)$) is weakly sequentially continuous if and only if it attains its norm. We also obtain analogous results for positive $n$-linear operators and positive $n$-homogeneous
polynomials in the setting of
Banach lattices.
Read the full abstract ▾
Quantum Algebra
Quantum cluster algebra realization for stated ${\rm SL}_n$-skein algebras and rotation-invariant bases for polygons
Peigen Cao, Min Huang and Zhihao Wang
We construct a
quantum cluster structure on the skew-field of fractions ${\rm Frac}({\mathscr S}_\omega(\mathfrak{S}))$ of the stated ${\rm SL}_n$-skein
algebra ${\mathscr S}_\omega(\mathfrak{S})$, where $\mathfrak{S}$ is a triangulable pb surface without interior punctures. This work complements the construction for the projected stated skein
algebra $\widetilde{\mathscr S}_\omega(\mathfrak{S})$ given by the last two authors. Let ${\mathscr S}_\omega^{\rm fr}(\mathfrak{S})$ denote the localization of ${\mathscr S}_\omega(\mathfrak{S})$ at the multiplicative set generated by all frozen variables. Let ${\mathscr A}_\omega^{\rm fr}(\mathfrak{S})$ and ${\mathscr U}_\omega^{\rm fr}(\mathfrak{S})$ (respectively $\overline{\mathscr A}_\omega(\mathfrak{S})$ and $\overline{\mathscr U}_\omega(\mathfrak{S})$) denote the
quantum cluster
algebra and
quantum upper cluster
algebra associated to ${\rm Frac}({\mathscr S}_\omega(\mathfrak{S}))$ (respectively ${\rm Frac}(\widetilde{\mathscr S}_\omega(\mathfrak{S}))$). We prove that \[ \widetilde{\mathscr S}_\omega(\mathfrak{S}) = \overline{\mathscr A}_\omega(\mathfrak{S}) = \overline{\mathscr U}_\omega(\mathfrak{S}) \quad \text{and} \quad {\mathscr S}_\omega^{\rm fr}(\mathfrak{S}) = {\mathscr A}_\omega^{\rm fr}(\mathfrak{S}) = {\mathscr U}_\omega^{\rm fr}(\mathfrak{S}) \] whenever $\mathfrak{S}$ is a polygon. As a consequence, when $\mathfrak{S}$ is a polygon, we show that the theta basis of $\overline{\mathscr U}_\omega(\mathfrak{S})$ (respectively ${\mathscr U}_\omega^{\rm fr}(\mathfrak{S})$) yields a rotation-invariant basis of $\overline{\mathscr S}_\omega(\mathfrak{S})$ (respectively ${\mathscr S}_\omega^{\rm fr}(\mathfrak{S})$) with several desirable properties, including positivity and a natural parametrization.
Read the full abstract ▾
Information Theory
On the Hamming Distance and LCD Properties of Binary Polycyclic Codes and Their Duals
Sujata Bansal and Pramod Kumar Kewat
Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of irreducible
polynomials. We first determine their complete algebraic structure and then develop general results on their minimum Hamming distance, including several exact values and bounds. We also examine the Euclidean duals of these codes and derive corresponding results on the Hamming distance of the dual codes. Furthermore, we study the LCD (linear complementary dual) properties of binary polycyclic codes, establish necessary and sufficient conditions for such codes to be LCD codes, and construct several families of binary LCD codes. Our constructions also yield many optimal and LCD optimal binary linear codes, including codes of larger lengths. We then focus on binary polycyclic codes associated with powers of the self-reciprocal irreducible trinomials $x^{2\cdot3^v}+x^{3^v}+1$, where $v\geq0$. For this class, we determine the exact Hamming distance of all such codes and show that these codes are reversible. Moreover, we show that these codes are LCD codes in certain cases. In addition, we propose a
conjecture asserting that all binary polycyclic codes associated with $\big(x^{2\cdot3^v}+x^{3^v}+1\big)^{2^\mathcal{T}}$, where $v\geq 0$ and $\mathcal{T}\geq1$, are LCD codes. These results demonstrate that binary polycyclic codes form a rich source of structured codes with strong distance, duality, reversibility, and LCD properties.
Read the full abstract ▾
Analysis of PDEs
Leak localisation with a measure source convection-diffusion model
Thi Tam Dang and Tuomo Valkonen
Taking a variational approach, study the inverse problem of locating gas leaks from line-of-sight concentration measurements using a convection–
diffusion model with the source term a Radon measure. By imposing sparsity-promoting regularisation on this measure, we recover point sources—identifying both their locations and intensities—rather than diffuse approximations. We jointly estimate the underlying physical convection (wind) and
diffusion parameters. Our main theoretical contribution is the analysis of Lipschitz dependence of the forward solution of the convection–
diffusion equation with respect to its parameters: the measure, and the convection and
diffusion fields. Numerically, we employ a semi-grid-free optimisation approach for reconstructing the source measure. Our experiments demonstrate accurate localisation, highlighting the potential of the method for practical gas emission detection.
Read the full abstract ▾
Information Theory · Cross-listed from eess.SP
Low-Complexity Blind SNR Estimator for mmWave Multi-Antenna Communications
Hanyoung Park, Homin Jang and Ji-Woong Choi
In this paper, we propose a low-complexity blind
estimator for the average noise power, average signal power, and signal-to-noise ratio (SNR) in millimeter-wave (mmWave) massive multi-
antenna uplink systems. In particular, the proposed method is designed to operate using only a single received signal sample, without relying on pilot signals, iterative optimization, or multiple observations, and without requiring prior knowledge of the transmitted signal. By exploiting the inherent sparsity of mmWave channels in the beamspace domain, the
estimator identifies noise-dominant components through a sorting-based procedure combined with a finite-difference criterion. This separation is further supported by the order statistics of noise power under Gaussian assumptions, enabling statistically grounded discrimination between signal and noise elements. The average noise power is estimated from the identified noise-only components, and the signal power and SNR are subsequently obtained through simple arithmetic operations. The proposed
algorithm achieves low computational complexity and is well-suited for real-time implementation. To demonstrate its practical feasibility, a hardware-efficient very large-scale integration (VLSI) architecture is developed and implemented on a AMD-Xilinx Kintex UltraScale+ KCU116 Evaluation Kit, with corresponding field-programmable gate array (FPGA) results provided. The implementation exhibits low latency and sublinear scaling of hardware resource utilization with respect to the number of
antennas, and enables parameter estimation within a duration shorter than a single symbol of conventional wireless systems. Simulation results verify that the proposed
estimator achieves high estimation accuracy compared to existing single-sample-based methods.
Read the full abstract ▾
Numerical Analysis
A Line–Search–Based Stochastic Gradient Method for 3D Computed Tomography
Tatiana A. Bubba, Elena Morotti, Federica Porta et al. (+2 more)
We introduce FB-LISA, a forward-backward (FB) generalization of a recently proposed line-search-based
stochastic gradient
algorithm to address the imaging problem of volumetric reconstruction in Computed
Tomography, a substantially high demanding problem, which involves orders of magnitude of data, a high computational burden for forward and backprojection, and
memory requirements that push current GPU architectures to their limits. Our formulation employs
stochastic mini-batches composed of full 2D projections, preserving the physical structure of the acquisition process while enabling significant speed-ups during early iterations. The resulting method demonstrates how concepts traditionally associated with deep learning can be repurposed to accelerate large-scale inverse problems, without relying on training data or learned priors.
Read the full abstract ▾
All authors Tatiana A. Bubba, Elena Morotti, Federica Porta, Valeria Ruggiero, Ilaria Trombini
Information Theory · Cross-listed from cs.RO
Learning What Matters: Adaptive Information-Theoretic Objectives for Robot Exploration
Youwei Yu, Jionghao Wang, Zhengming Yu et al. (+2 more)
Designing learnable information-theoretic objectives for
robot exploration remains challenging. Such objectives aim to guide exploration toward data that reduces uncertainty in model parameters, yet it is often unclear what information the collected data can actually reveal. Although reinforcement learning (RL) can optimize a given objective, constructing objectives that reflect parametric learnability is difficult in high-dimensional robotic systems. Many parameter directions are weakly observable or unidentifiable, and even when identifiable directions are selected, omitted directions can still influence exploration and distort information measures. To address this challenge, we propose Quasi-Optimal Experimental Design (Q{\footnotesize OED}), an adaptive information objective grounded in optimal experimental design. Q{\footnotesize OED} (i) performs eigenspace analysis of the Fisher information
matrix to identify an observable subspace and select identifiable parameter directions, and (ii) modifies the exploration objective to emphasize these directions while suppressing nuisance effects from non-critical parameters. Under bounded nuisance influence and limited coupling between critical and nuisance directions, Q{\footnotesize OED} provides a constant-factor approximation to the ideal information objective that explores all parameters. We evaluate Q{\footnotesize OED} on simulated and real-world
navigation and manipulation tasks, where identifiable-direction selection and nuisance suppression yield performance improvements of \SI{35.23}{\percent} and \SI{21.98}{\percent}, respectively. When integrated as an exploration objective in model-based policy optimization, Q{\footnotesize OED} further improves policy performance over established RL baselines.
Read the full abstract ▾
All authors Youwei Yu, Jionghao Wang, Zhengming Yu, Wenping Wang, Lantao Liu