arXiv preprints from January 1, 2026 through September 26, 2026 — 22:24:24 EST
Maritime port inspection plays a critical role in ensuring safety, regulatory compliance, and operational efficiency in complex maritime environments. However, existing inspection methods often rely on manual operations and conventional computer vision techniques that lack scalability and contextual understanding. This study...
A 3-dimensional polytope is called k-equiprojective if every planar projection along a direction non-parallel to any facet is a k-gon. In this article, we generalise equiprojectivity to higher dimensions and give a lower bound on the number of combinatorial types of equiprojective polytopes. We also establish the pathwise...
AI models for medical diagnosis often exhibit uneven performance across patient populations due to heterogeneity in disease prevalence, imaging appearance, and clinical risk profiles. Existing algorithmic fairness approaches typically seek to reduce such disparities by suppressing sensitive attributes. However, in medical settings...
Alan and al. defined and studied quasi-maximal ideals. We add a comprehensive characterization of these ideals, introducing submaximal ideals. The conductor of a finite minimal extension $R\subset S$ is quasi-maximal in $S$. This allows us to give a new characterization of these extensions. We also examine the links between...
We investigate a class of groups acting on possibly exotic affine buildings $X$ and possessing good proximal properties. Such groups are termed of general type, and their dynamics is analyzed through their flag limit sets in the space of chambers at infinity of $X$. For a group $G$ of general type, we prove C*-simplicity by showing...
Uranium tellurides span magnetic and superconducting ground states, yet systematic electronic-structure information across the U-Te series remains scarce. In this study, we perform photoemission measurements on freshly prepared UxTey thin films covering the range of bulk stoichiometries under ultra-high vacuum (10^-9 Pa), enabling...
This paper examines a competition game whose key variables are the R&D efforts (e.g. R&D expenditures) and accumulated knowledge of firms located in a specific region. The most significant element of accumulated knowledge is knowledge spillovers. These are considered intra-industry as it is assumed that the firms operate within the...
We introduce a novel model for time-varying, asymmetric, tail-dependent copulas in high dimensions that incorporates both spectral dynamics and regularization. The dynamics of the dependence matrix' eigenvalues are modeled in a score-driven way, while biases in the unconditional eigenvalue spectrum are resolved by non-linear...
We show that if the curvature of a Cartan-Hadamard $n$-manifold is constant near a convex hypersurface $Γ$, then the total Gauss-Kronecker curvature $\mathcal{G}(Γ)$ is not less than that of any convex hypersurface nested inside $Γ$. This extends Borbély's monotonicity theorem in hyperbolic space. It follows that $\mathcal{G}(Γ)$ is...
In this thesis we explore natural procedures through which topological structure can be constructed from specific semigroups. We will do this in two ways: 1) we equip the semigroup object itself with a topological structure, and 2) we find a topological space for the semigroup to act on continuously. We discuss various...
Two of the most iconic systems of quantum physics are the particle in a box and the Coulomb potential (the third is, of course, the harmonic oscillator). In this expository paper, we consider the quantum solution to the problem of an electron confined between the grounded planes of an infinite capacitor. The potential arises from the...
We study model-agnostic post-hoc calibration methods intended to improve probabilistic predictions in supervised binary classification on real i.i.d. tabular data, with particular emphasis on conformal and Venn-based approaches that provide distribution-free validity guarantees under exchangeability. We benchmark 21 widely used...
In this expository article, we prove a birational classification of smooth projective models of surfaces with negative Kodaira dimension over $\mathbb{Z}$ and over more general rings of integers $\mathcal{O}_K$, depending on their arithmetic and cohomological invariants. Along the way we collect some results on smooth projective...
The microlensing event OGLE-2011-BLG-0950 exhibits the well-known ``Planet/Binary'' degeneracy, in which distinct lens configurations produce similar light curves but imply substantially different mass ratios between the lens components. A previous study suggested that high-resolution imaging could break this degeneracy through...
Quantum noise is conventionally viewed as a fundamental obstacle in near-term quantum computing, motivating extensive error correction and mitigation strategies. We present numerical evidence that challenges this consensus. Through experiments on quantum graph neural networks for molecular property prediction, we discover that quantum...
Addition theorems have been indispensable tools for the reduction of quantum transition amplitudes. They are normally utilized at the start of the process to move the angular dependence within plane waves and Coulomb potentials, and the like, into a sum over Spherical Harmonics that allows the angular integration to be carried out....
Despite extensive progress in characterizing the emergent behavior of active matter, the microscopic origins of self-diffusion in interacting active systems remain poorly understood. Here, we develop a framework that quantitatively links self-diffusion to collisional forces and their temporal correlations in active fluids. We show...
We provide a complete motion-planning mechanism that ensures target tracking and obstacle avoidance in a cluttered environment. For a given polyhedral decomposition of the feasible space, we adopt a novel procedure that constrains the agent to move only through a prescribed sequence of cells via a suitable control policy. For each...
We develop a multilevel Monte Carlo (MLMC) framework for uncertainty quantification with Monte Carlo dropout. Treating dropout masks as a source of epistemic randomness, we define a fidelity hierarchy by the number of stochastic forward passes used to estimate predictive moments. We construct coupled coarse--fine estimators by reusing...
Semi-Private Function Evaluation (SPFE) enables joint computation while protecting both input data and the function itself. A practical instantiation is gate-hiding garbled circuits, which conceal gate functionalities while revealing circuit topology. Existing security definitions intentionally exclude leakage through topology,...
Bayesian networks are a canonical formalism for representing probabilistic dependencies, yet their integration within logic programming frameworks remains a nontrivial challenge, mainly due to the complex structure of these networks. In this paper, we propose probLO (probabilistic Linear Objects) an extension of Andreoli and...
Quantum walks (QWs) represent pillars of quantum dynamics and information processing. They provide a powerful framework for simulating quantum transport, designing search algorithms, and enabling universal quantum computation. Several physical platforms have been employed for their implementation, such as trapped atoms and ions,...
Large Language Models (LLMs) are increasingly applied in healthcare, yet ensuring their ethical integrity and safety compliance remains a major barrier to clinical deployment. This work introduces a multi-agent refinement framework designed to enhance the safety and reliability of medical LLMs through structured, iterative alignment....
We investigate the impact of magnetic-field-induced feedback on the dynamics of a Hindmarsh-Rose neuron model exhibiting a blue-sky catastrophe. By introducing a magnetic flux variable that couples nonlinearly to the membrane potential, we demonstrate that electromagnetic effects profoundly reshape neuronal firing patterns and...
We analyze the query complexity of finding a local minimum in $t$ rounds on general graphs. More precisely, given a graph $G = (V,E)$ and oracle access to an unknown function $f : V \to \mathbb{R}$, the goal is to find a local minimum--a vertex $v$ such that $f(v) \leq f(u)$ for all $(u,v) \in E$--using at most $t$ rounds of...