arXiv preprints from January 1, 2026 through September 23, 2026 — 07:00:32 EST
This paper proposes a novel integrated sensing, communication, and computing (ISCC) framework over a cloud-edge-device collaborative architecture, where passive sensing is enabled by reusing uplink offloading signals to extract sensing information directly at the edge without incurring additional transmission overhead. Nevertheless,...
In active noise control (ANC) systems, adaptive approaches may suffer from instability or divergence, limiting their practical deployment. Consequently, fixed-parameter controllers are widely adopted, but their performance degrades under varying noise characteristics and acoustic path conditions. This paper proposes a feedback-guided...
We present a demonstration showcasing the Autonomy Testbed for Multi-purpose Orbiting Systems (ATMOS), a planar spacecraft-analog robot designed for hardware-in-the-loop evaluation of guidance and control strategies in microgravity-like conditions. Using ATMOS as the physical test platform, we investigate the design, analysis, and...
Perceptual loss functions in Deep Neural Network (DNN) deblurring architectures improve the overall quality of restored images. However, few focus on explicitly targeting sharpness in the restorations. We conduct a subjective study of models trained with and without losses which explicitly target sharpness using a four-protocol...
Neuromorphic computing enables event-driven, low-power inference and is therefore an attractive technology for jointly carrying out communication, sensing, and processing at resource-constrained wireless devices. Impulse radio ultra-wideband (IR-UWB) signaling, which is standardized in the IEEE 802.15.4 family and widely deployed for...
Current real-time AI improvisation systems lack the communication awareness human musicians rely on: rather than treating communication as a foundational algorithm design concern, most systems layer interaction strategies post-hoc onto generative algorithms through explicit controls and predefined modes. This gap persists in part...
In 1985, Odoni initiated the study of arboreal representations and the fixed-point proportion, motivated by prime density problems in arithmetic dynamics. Since then, many questions regarding the connection between the dynamics of rational functions and the Galois groups associated to their dynamics (iterated Galois groups) have been...
After a historical introduction, the most important classical and quantum entropies are introduced as constructions in classical and quantum probability theory. Classical entropies are studied from large deviation theory, including theorems of Sanov, Cramér, Gärtner-Ellis, and Varadhan, and are illustrated in some applications to both...
This Comment concerns arXiv:2106.08363v3 [math.NA] by E. Abreu, A. Espirito Santo, W. Lambert and J. Perez, published in Numer. Methods Partial Differential Equations 39 (2023) 2400-2443. That article builds its scheme on space-time control volumes whose lateral boundaries, called "no-flow curves", solve dsigma/dt = H(u)/u and are...
A graph is perfectly divisible if every induced subgraph with at least one edge admits a partition into a perfect induced subgraph and an induced subgraph with smaller clique number. Every perfectly divisible graph $G$ satisfies $χ(H)\leq\binom{ω(H)+1}{2}$ for every induced subgraph $H$ of $G$. We show that the converse fails: for...
For a graph $G$, let $L(G)=\max\{ω(G),\lceil (|V(G)|+1)/(α_{\min}(G)+1)\rceil\}$, where $ω(G)$ is the clique number and $α_{\min}(G)$ is the minimum, over all vertices $v$, of the largest size of an independent set containing $v$. Dybizbański, Furmańczyk, and Mkrtchyan (Discrete Appl. Math. 354 (2024), 15--28) conjectured that every...
Let $Γ$ be a finite group of order $k\ge2$, and label the edges of a simple loopless $d$-regular digraph $D$ by elements of $Γ$. A directed cycle is zero-sum if the ordered product of its labels is the identity of $Γ$. We prove that a zero-sum cycle exists whenever $d\ge e^3(k-1)$. We also prove that every labelled $d$-regular digraph...
We construct an exact solution-generating correspondence between restricted ansatz sectors of quartic biadjoint scalar theory, complexified $SU(2)$ Yang--Mills theory and four-dimensional general relativity with conformally flat metrics and traceless energy-momentum. A factorised biadjoint field, a Corrigan--Fairlie--'t Hooft--Wilczek...
In this article, the cyclotomic Galois action on topological K-theory adjoined with a primitive $n$th root of unity and the famous $GL_1(\mathbf{Z}/n)$- and $GL_2(\mathbf{Z}/n)$-Galois actions on topological modular forms with $Γ_1(n)$- and $Γ(n)$-level structures are unified and generalised. This is done by defining a quotient stack...
Let $n,m$ be integers such that $n\geq 2$ and $0\leq m\leq n-2$. Let $(M^n,g)$ be a complete Riemannian manifold, and let $C_{m+1}$ be the $(m+1)$-intermediate curvature introduced by Brendle--Hirsch--Johne. We prove \[ \mathrm{Ric}\geq0,\qquad C_{m+1}\geq 1 \quad\Longrightarrow\quad \mathrm{Vol} B_R(p)\leq C(n,m)R^m, \] for...
Structure-preserving discontinuous Galerkin (DG) methods typically improve the robustness of high order simulations of real fluids. In addition to conservation, key structures include the preservation of pressure equilibrium and satisfaction of at least one entropy inequality. In this work, we investigate conservative discretizations...
By work of Enomoto, Jackson, Katerinis, and Saito from 1985, every $2$-tough graph has a $2$-factor, and this toughness bound is best possible: for every $\varepsilon>0$, there exist $(2-\varepsilon)$-tough graphs with no $2$-factor. It is natural to ask whether the latter statement remains true for triangle-free graphs. Bauer, van...
Hybrid dealiasing is an FFT-based method for computing linear convolutions of complex-valued data that reduces the cost of dealiasing by performing zero padding implicitly. We develop two new algorithms that extend hybrid dealiasing to real-valued convolutions. The first algorithm exploits conjugate symmetries in the transformed...
The Shimura curve of discriminant $D$ for $D=14, 15$ is uniformized by a subgroup of an arithmetic quadrilateral Fuchsian group $(2, 2, 2, q)$, where $q=4, 6$. We relate the generator of the ring of quaternionic modular forms on this Shimura curve to explicit Heun functions for the quadrilateral group. We also discuss how the...
For a real $f\in \mathbb{N}^\mathbb{N}$, it is in general not the case that every set which is both $Σ^1_1(f)$ and $Π^1_1(f)$ is the $f$-section of a $Δ^1_1$ set. However, there are reals $f$ for which this, in fact, does happen; we say that such a real strongly relativizes $Δ^1_1$. In this paper, we will prove that the reals which...
Let $M$ be a $\mathrm{II}_1$ factor, $N$ a tracial von Neumann algebra, and $Φ: M \rightarrow N$ a subtracial completely positive map. For an irreducible $\mathrm{II}_1$ subfactor $P \subseteq M$, we characterize when $Φ$ exhibits a flattening property under conjugation by unitaries in $P$. To be specific, we show that the failure of...
The tournament isomorphism problem is one of the two fundamental bottlenecks to designing better algorithms for the graph isomorphism problem. Though the problem has been investigated for more than five decades, compared to graphs, there are only very few results on the isomorphism problem of tournaments. For most classes of...
Let $G$ be an isotropic reductive group and $X$ be a projective $G$-homogeneous variety. Using results from Bialynicki-Birula, Hesselink and Iversen, Brosnan showed that if $G$ is of inner type, the motive of $X$ can be expressed as a direct sum of Tate twists of motives of projective homogeneous varieties for the anisotropic kernel...
We develop an arbitrary-degree geometry-conforming finite element (GC-FE) framework for two-dimensional elliptic boundary value and interface problems on curved domains. Using the Frenet--Serret transformation, curved-boundary and interface-fitted segments are represented exactly, while polynomials in Frenet coordinates generate...
We show that an inductive AH-system with diagonal connecting maps describes an action of the canonical AF-groupoid on the spectrum of the canonical C$^*$-diagonal, and that the canonical groupoid model is given by the transformation groupoid associated to this action. This divides the groupoid structure into two distinct aspects: the...