Human-Computer Interaction
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
All of arXiv
Wednesday 9 September
Longitudinal relational agents rely on memory for continuity, but remembering can lead to intrusion, clinical overconfidence, emotional manipulation, and opacity. We present Relic, a governance architecture for diegetic relational agents, and Gumi, a subject-specific companion agent initialized and governed through Relic. The architecture separates what the system can observe, what researchers can review, what Gumi can remember, and what Gumi can say. We describe three mechanisms. Relic represents sensitive safety signals as researcher-facing governance objects rather than user-facing explanations or agent memories. Shared Continuity Memory organizes relational markers around subject-confirmed wording, corrections, explicit follow-up permissions, and recall limits. We specify a runtime mediation layer for delivery, proactivity, session identity, output transformation, and platform allowlists; adoption across live paths remains partial. These mechanisms aim to preserve relational continuity without turning Gumi into a clinical assistant, mood tracker, general-purpose assistant, or opaque profiling system. We contribute the architecture, object model, researcher workbench design, and a proposed evaluation framework for governed relational memory. An exploratory pilot involved the author as P1 and one external participant as P2. Weekly self-reports from P1 and researcher-led interviews with P2 provide descriptive observations of early use and perceived naturalness. The pilot does not support claims about clinical efficacy, diagnosis, therapeutic outcomes, general usability, or deployment safety. Relic provides research infrastructure intended to make relational memory, safety constraints, and agent behavior inspectable and testable.
Rings and Algebras
Non-Existence of Abelian KS-Algebras in $M_n(\mathbb{C})$ for $n \geq 3$
We prove that $M_n(\mathbb{C})$ contains no abelian Kadison–Singer algebra for any $n \geq 3$.
Robotics
Context-Aware Adaptive Pesticide Spraying for Agricultural Robots under Changing Weather and Terrain Using Vision-Language Models
Precision pesticide spraying is essential for optimizing application efficiency and ensuring uniform chemical distribution. Spraying performance is influenced by multiple factors, including environmental conditions such as temperature and wind speed, pesticide type, and the robot's capability to accurately perceive crops and target spray locations. Existing approaches predominantly emphasize crop detection and rely on predefined spraying parameters, whereas human operators dynamically adjust their spraying strategies by considering environmental conditions, region-specific crop characteristics, and the type of pesticide being applied. In this study, we propose a context-aware adaptive spraying framework based on Vision-Language Models (VLMs), which enables robots to leverage spatial reasoning and integrate information from multiple sources, including crop type, pesticide type, and weather data, to make adaptive and optimized spraying decisions. Subsequently, a trajectory-tracking controller based on Model Predictive Path Integral (MPPI) control is employed to ensure precise navigation and accurate spraying at crop locations. The comparative results demonstrate that the proposed method improves accuracy by at least 30% in detecting crop rows. In addition, the experimental evaluations conducted in two environments further demonstrate the robot's ability to flexibly adjust spraying volume and travel speed, while reducing pesticide drift.
Read the full abstract
Fluid Dynamics
Statistical Turbulence and High-Fidelity Disturbance Fields for Quadrotor Flight Control
Reinforcement-learning quadrotor controllers are usually trained under simplified wind models, yet the impact of wind-field fidelity, as opposed to magnitude, on policy robustness remains unquantified. This paper compares five disturbance-fidelity levels, from wind-free flight and discrete 1-cosine gusts through statistical turbulence and synthetic coherent structures to large-eddy-simulation fields of the atmospheric boundary layer, in a full cross-fidelity train test evaluation of proximal policy optimization (PPO) agents, with cascaded PID and geometric SE(3) controllers as training-free references, over a 0-12 m/s wind sweep. Before any controller comparison is made, all disturbance data are validated: every synthetic generator is checked quantitatively against its analytical or certification-standard reference, and the large-eddy-simulation fields against the imposed log law. On a racing-class quadrotor in hover, the train test matrix is remarkably flat, and the cheapest structured training wind, which is discrete-gust domain randomization, ranks first in every test column, a ranking replicated on a wind-sensitive 27 g platform; a once-tuned geometric controller brackets the learned PPO policies at zero crash rate. Mechanism diagnostics show that control authority, not wind realism, bounds robustness, so wind-fidelity investment should scale with platform wind sensitivity.
Read the full abstract
Statistical Mechanics
Uniform meandric systems as percolation on planar maps: conjectures and a numerical study
We perform a numerical study of uniform meandric systems via their encoding by pairs of simple random walks and their interpretation as a model of critical percolation on random planar maps. We investigate certain natural box-crossing events and provide numerical evidence for a strong negative association between opposite open crossings and formulate conjectures on their asymptotic behavior. Our second contribution is a simple law-preserving dynamics on meandric systems, by local peak/valley flips in the walk encoding. Our simulations suggest that the percolation structure decorrelates much faster than the underlying random planar map.
Read the full abstract
Neurons and Cognition
Existence of an infinite family of substrates satisfying all the postulates of integrated information theory, exclusion included, with arbitrarily large integrated information
For infinitely many sizes we exhibit a cycle of binary units, each taking the exclusive-or of itself and its two clockwise neighbours, that is a complex in every state, no proper subsystem being more integrated, and whose integrated information grows as two raised to a power quadratic in the number of units.
Read the full abstract
Combinatorics
Fuglede's Conjecture for Cyclic Groups of Square-free Order
We prove Fuglede's conjecture for finite cyclic groups of square-free order. Specifically, if \(N\) is square-free and \(A\subseteq \mathbb Z_N\) is nonempty with \(|A|=m\), then \(A\) is spectral if and only if it tiles \(\mathbb Z_N\); moreover, these conditions hold precisely when \(m\mid N\) and \(A\) is a complete set of representatives modulo \(m\). This gives a complete structural description of spectral and tiling sets in \(\mathbb Z_N\). The key new ingredient is a prime-coordinate elimination theorem: if \(P\nmid nm\) is an odd prime, then every \(m\)-point spectral pair in \(\mathbb Z_n\times\mathbb Z_P\) projects injectively to a spectral pair in \(\mathbb Z_n\). Its proof combines character-matrix orthogonality, cyclotomic coefficient comparison, and a \(P\)-adic divisibility argument for associated Gram matrices. Iterating this reduction yields the result for arbitrary square-free \(N\), with no restriction on the number or relative sizes of its prime factors.
Read the full abstract
Computational Engineering
RINS: Residual-Image Neural Subspace Solvers for Large Sparse Linear Systems
Neural subspace solvers offer a promising way to accelerate the large sparse linear systems arising from PDE discretizations, but their value depends on generating effective correction directions at low computational overheads. We study this problem from a residual-image viewpoint: a correction subspace is useful when its image under the system operator captures the current residual. Guided by this view, we propose Gate-RINS, which generates multiple correction directions from shared polynomial residual probes and modulates them with a lightweight residual- and coordinate-dependent pointwise gate. We also introduce a hybrid schedule that uses GRANS-style graph controllers for the first correction block and Gate-RINS thereafter, combining an expressive graph based initial step with a lower-cost corrector as the solve progress. Theoretical analysis establishes a unified residual-image and dynamic approximate-inverse perspective for Gate-RINS and G-RANS, showing that a single neural-generated direction can emulate the residual quality of fixed-step GMRES. Numerical experiments on six PDE benchmarks demonstrate that Gate-RINS reaches a relative residual of $10^{-5}$ with 1.6-2.3$\times$ and 2.2-3.0$\times$ less wall-clock time than G-RANS and GMRES respectively. For Helmholtz systems with meshsize up to $10^5$, Gate-RINS also achieves the lowest residual and outperforms a GPU-accelerated parallel GMRES, while GRANS fails to reach relative residual of $10^{-4}$ in the same time budget.
Read the full abstract
Combinatorics
Exact diameter compression for four-point sumset cardinalities
The least interval diameter needed to realize every attainable cardinality of an $h$-fold sumset of a four-element integer set is $\binom{h+2}{2}+(h\bmod2)$ for $2\le h\le10$ and $d_h=(h-3)(h-1)$ for $h\ge11$. We prove the formula uniformly for $h\ge17$ and use complete finite searches, with a relation-rank coverage argument, for the remaining orders. For the lower bound, we show that every integer four-set with $\binom{h+3}{3}-17$ distinct $h$-fold sums has normalized diameter in $\{d_h,d_h+1,d_h+2\}$ when $h\ge9$, and we construct sets attaining $d_h$. For the upper bound, a relation-lattice index argument restricts larger minimum-diameter representatives to two or three active directions. Two general constructions and four special defects then provide short sets realizing every remaining cardinality.
Read the full abstract
Probability
Markov chains arising in the study of random matrices over pro-finite rings
Recent work of the author investigates certain random processes, valued in abelian p-groups, that naturally arise in the study of Haar random matrices over $\mathbb{Z}_p$. It was found, somewhat surprisingly, that these processes are reversible Markov chains. In this short note, we give a simple alternative derivation of this fact. The new derivation also proves that this phenomenon is not specific to $\mathbb{Z}_p$, but generalizes to Haar random matrices over any profinite local ring.
Read the full abstract
Quantum Physics
Stellar rank under the contraction of SU(1,1) to the Heisenberg-Weyl group
Under the contraction of $SU(1,1)$ to the Heisenberg-Weyl group, the zeros of the Husimi function of a state redistribute according to a single scale, and we determine which of them survive. The stellar rank of a single-mode bosonic pure state, the number of these zeros, characterises the Gaussian states on the plane through the vanishing of the rank. On the Poincaré disk, where the same construction applies to the discrete series of $SU(1,1)$, it does not, because the zero set leaves a zero-free factor undetermined. We therefore ask how the zero structure behaves in the contraction limit rather than how it should be classified at fixed Bargmann index. The entire difference between the two Hilbert spaces reduces to one weight sequence $w_k(m)=(2k)^m/(2k)_m$, whose monotonicity in $k$ drives every estimate below. The rescaled states form a normal family, every nonzero limit point lies in the Segal-Bargmann space, and those with finitely many zeros are exactly the finite-rank Fock states. The rank is upper semicontinuous, with equality precisely when all zeros scale as $O(1/\sqrt{2k})$, the scale of the coherent-state labels. A two-sided Harnack estimate pins the profile on compact sets. Separately, a family of rank $r$ degenerates if and only if the amplitudes on the lowest $r+1$ weight vectors tend to zero. Mass escapes at the edge of the rescaled disk instead, by a first-order transition of the semiclassical Husimi potential at an explicit critical coupling. Finally, the contraction limit retains exactly the lowest $2r+3$ amplitudes, and this number cannot be lowered.
Read the full abstract
Cryptography and Security
The Cognitive Continuity Test: Verifying Governed State Transitions in Persistent AI Agents
Persistent AI agents revise beliefs, consolidate memory, and replace execution substrates. Similar successor states can accompany differently authorized transition claims, while legitimate development can change state substantially. We introduce the Cognitive Continuity Test (CCT), a policy-relative contract for verifying submitted transitions using scoped authority, provenance, deterministic application, semantic predicates, and candidate-persistence receipts. CCT distinguishes verified admissibility, affirmative violation, and unresolved required evidence. Separation results concern transition claims rather than live runtime identity; soundness is conditional on the specified checker and evaluator assumptions. IdentityLineageBench provides 24 generated transition families. The reference post-resolution verifier matches all 576 canonical held-out labels; lexical state similarity and a lineage-only diagnostic baseline admit 60.0% and 80.0% of invalid fixtures. These comparisons establish synthetic conformance, not superiority to a policy-aware deployed system. Signed adversarial regressions cover fabricated interaction counts, unsupported belief changes, and mixed missing/contradictory evidence. SIT behavior and actual model migration remain unmeasured. An 18,000-execution valid-path study measures a 6.21 ms default median on resident inputs. We specify the additional activation and recovery obligations needed for deployment.
Read the full abstract
General Relativity and Quantum Cosmology
Symmetric Thin-Shell Wormholes from a Regularized String-Cloud Black Hole: Energy Conditions, Multi-Fluid Stability, and Optical Signatures
We construct a symmetric thin-shell wormhole from two copies of the positive-lapse exterior of a rationally regularized Letelier–Alencar string-cloud black hole with a finite-curvature anti–de Sitter core and string-cloud asymptotics. Using the Darmois–Israel formalism, we derive the surface stresses, energy-condition combinations, conservation law, and effective potential. Every admissible static throat has negative surface energy density, so the weak and dominant energy conditions are violated, whereas the null condition restricted to directions tangent to the shell, and consequently the intrinsic strong condition, holds only in the inner sampled exterior. The radial-vacuum relation of the bulk source removes the external momentum flux. We derive a general local-stability criterion for density- and radius-dependent equations of state and apply it to five surface-fluid models, calibrating one parameter at each static throat. Across the sampled families, barotropic shells remain unstable, whereas the other closures can admit parameter-dependent stable branches. An exact unregularized control shows that the energy-condition structure and the radial-stability signs of the first three closures persist without the rational regulator, whereas the cosmic-Chaplygin stability sign can change while the selected calibration branch remains real and simple. Backward ray tracing shows that throat location primarily reorganizes higher-order and through-throat images, while string-cloud strength and inclination control annular structure and Doppler asymmetry. Comparisons of one- and two-sided source configurations isolate genuine far-side images and show that the central dark region depends on the source distribution.
Read the full abstract
Algebraic Geometry
Categorical Torelli theorem for (weighted) hypersurfaces via singularity category
We prove categorical Torelli theorems for ordinary and weighted hypersurfaces using the singularity category of the completed affine cone. For Fano hypersurfaces we use the Kuznetsov component, whereas for hypersurfaces of general type we use the full category of graded matrix factorizations. When the degree is coprime to the sum of the weights, the internal grading shift can be expressed in terms of the Serre functor and the cohomological shift. Its dg orbit is therefore intrinsic and, after taking the perfect hull, agrees with the dg singularity category of the completed cone. The formal singularity is then recovered by the categorical Mather–Yau theorem. For ordinary homogeneous equations, the resulting formal equivalence induces a projective linear equivalence; in the weighted setting the dual torus action determines the grading of the Tjurina algebra and hence the weighted homogeneous equation. The argument gives a uniform proof for Fano hypersurfaces under the stated numerical assumptions and proves new categorical Torelli theorems for hypersurfaces of general type.
Read the full abstract
Quantum Physics
Global and nonlocal magic of quantum many-body scars
Nonergodic features of chaotic quantum many-body systems are commonly characterized through local observables, fidelity, and entanglement entropy. Here, using global and nonlocal measures of nonstabilizerness (magic), we study quantum many-body scars near infinite temperature in $(1+1)$-dimensional Abelian $\mathbb{Z}_2$ and U$(1)$ lattice gauge theories, both analytically and numerically. We derive an exact closed-form expression for the nonlocal trace distance magic solely from the Schmidt spectrum, reducing the optimization over local unitaries to a finite maximization over stabilizer-compatible Schmidt ranks. We find that scar eigenstates can exhibit extensive global magic despite their anomalously low entanglement, while retaining anomalously large nonlocal magic compared with ergodic states. We further show that constrained Hilbert spaces can generate irreducible nonlocal magic through stabilizer-incompatible Schmidt ranks, even for a flat entanglement spectrum.
Read the full abstract
Chemical Physics
Utilizing a Perturbative Inverse of the Hamiltonian to Improve Lanczos Diagonalization
The use of the shifted inverse Hamiltonian in the Lanczos algorithm is examined. We present a perturbative inverse and demonstrate that the Krylov subspace formed from it is better suited to approximating the ground state wavefunction compared with the Hamiltonian itself. We further demonstrate that the perturbative inverse provides an adequately accurate approximation to the inverse Hamiltonian at second order. Naturally, the quality of the results depend on the quality of the initial guess, here we use the Hartree-Fock, CISD, MP-PT1, and EN-PT1 wavefunctions. Lastly, we examine the scaling of the method where we find that accurate results can be found for similar cost as PT5.
Read the full abstract
Probability
Parisi measure of the Sherrington-Kirkpatrick model with external field
We prove that the Parisi measure of the Sherrington-Kirkpatrick model has connected support at every positive temperature and every positive external field. When the model breaks replica symmetry, its support is an interval contained in $(0,1)$, its restriction to the interior has a smooth density that remains strictly positive up to both endpoints, and both endpoints carry atoms. The proof rests on a strict inequality for moments of spatial derivatives of the Parisi PDE, which both excludes gaps in the support and forces positivity of the density. The same estimates recover the zero-field support description and give a lower bound for the mass of its upper atom.
Read the full abstract
Cryptography and Security
A Verifier Can Leak the Answer: Diagnosability Before Optimization in Closed-Loop Agent Debugging
Agent developers increasingly compare prompts, tools, policies, and diagnosis algorithms through simulator-grounded verifiers. A verifier can nevertheless make a solver comparison vacuous: if its probes or predicates encode the target identity, an exact optimizer may appear effective without resolving any genuine ambiguity. We report such a failure in an aggregate-trace debugger for a closed-loop decision agent. Exact minimum hitting set (MHS) and a propagation-aware greedy method returned identical supports in 12/12 development cases and the same planted-fault recovery in 9/12. A subsequent audit found that exact-anchor predicates produced the planted pair in 9/9 cases. After removing those anchors, overall planted-pair recovery was 8/9; hard-probe singleton pairs nevertheless matched the planted pair in 9/9, and no case retained a nonempty residual conflict family after propagation (0/9). The optimizer was correct, but the verifier had already disclosed the answer. We replace solver-first evaluation with a support-gated verification contract. A clean reference map must first show repeated component exposure; a matched reference/current gate must then establish comparable runtime evidence; only afterward may an independently calibrated signal rule return a detection. In a preregistered heldout comprising 1,440 cases and 21,600 partition rows, 55/72 regime-component units passed the reference gate, 54/55 passed the runtime gate, and stable false admission was 0/20 represented components with a one-sided exact 95% upper bound of 0.1391. Within admitted units, affected clean traffic predicted detection better than nominal fault-cell fraction. The main lesson is structural: verify evidence eligibility and non-revelation before optimizing the component selector. Otherwise a stronger solver can merely certify a stronger verifier artifact.
Read the full abstract
Cryptography and Security
A Comprehensive Review of One-Pixel Attack: Research Status, Taxonomy, Applications, Regulation Policy and Future Directions
One-Pixel Attacks (OPAs) represent one of the most extreme demonstrations of adversarial fragility in deep learning, where modifying a single pixel can reliably induce high-confidence misclassification across domains such as medical diagnosis, autonomous driving, biometrics, and quantum communication. Despite their conceptual simplicity, OPAs remain underexamined in existing adversarial-attack surveys, which provide only fragmented or cursory coverage. This PRISMA-guided review synthesizes high-quality studies from 2017 to 2026 and delivers a unified, multi-axis taxonomy of OPA research spanning algorithmic foundations, black-box evolutionary optimization, emerging hybrid and program-synthesis attacks, defence mechanisms, interpretability tools, and domain-specific vulnerabilities. Our analysis reveals the dominance of Differential Evolution-based strategies, the rise of efficiency-optimized and saliency-guided methods, and persistent gaps in dataset diversity, transferability, and standardized evaluation. We summarized and assess defence paradigms including pixel restoration, anomaly detection, input-space transformations, and robust training highlighting their trade-offs in robustness, imperceptibility, and computational overhead. Building on these insights, we outline future research priorities involving selective pixel recovery, transformer-specific vulnerability analysis, saliency-driven optimization, and real-world domain-adaptive defences. We further propose a regulatory framework emphasizing robustness testing, incident disclosure, and AI security governance. This review establishes a comprehensive foundation for understanding, evaluating, and mitigating ultra-sparse adversarial threats in contemporary AI systems.
Read the full abstract
Soft Condensed Matter
Loading history and window geometry bound compact-state slip ranking during granular shear startup
Granular slip forecasting can conflate material state, loading progress, and the geometry of event-centered sampling. We separated these contributions in slowly sheared two-dimensional frictional disks using a compact neural score of stress, pressure, coordination, non-affine motion, and force-network observables. The model was developed on 36 trajectories and frozen efore testing on 18 new trajectories under two nested stress-drop definitions. Inspection of held-out results revealed post-event sampling asymmetry; recovery-aware analyses are therefore descriptive. With trajectories weighted equally, the compact score ranked near-slip windows above both prevalence and within-trajectory circular-phase controls under both definitions (representative average precision 0.310 versus prevalence 0.173; phase-null upper bound 0.257). Loading-history coordinates ranked more strongly, reaching 0.534 for causal elapsed strain. The recovery-aware rule retained 78.4% of activity-gated events and preferentially selected longer preceding intervals; ranking by time since the previous catalogued event remained compatible with a count-conditioned geometry null. Compact observables thus contain temporally aligned slip information, but stronger loading-history baselines and window-geometry sensitivity bound that evidence. These startup data do not isolate a state-specific short-horizon precursor beyond loading history or support a renewal interpretation of elapsed-strain ranking.
Read the full abstract
Chemical Physics
Strictly Localized Molecular Orbitals: Non-Orthogonal Local Orbitals Built with Chemical Intuition
We propose the use of an a priori localization method based on separating the molecule into fragments to generate a wavefunction suitable for post Hartree-Fock methods. A quasi-Newton approach utilizing Thouless rotation is developed to optimize the strictly localized molecular orbitals(sLMO). We discuss the properties of the sLMO-HF wavefunction and compare it to the tail deleted a posteriori localization methods that are usually done in preparation of post Hartree-Fock methods. We then discuss the effects of choosing different fragmentation patterns and basis sets.
Read the full abstract
Game Theory
When Maximum Nash Welfare Becomes Strongly Fair: Bi-valued Goods
For the fair allocation of indivisible goods, the milestone work of Caragiannis et al. (2019) revolutionized the understanding of Maximum Nash Welfare (MNW) allocations by revealing their "unreasonable" ability to balance fairness (EF1) and efficiency (PO) for general additive functions. Subsequent work established that MNW allocations simultaneously satisfy EFX and GMMS (and consequently MMS and PMMS) for binary instances (Amanatidis et al. 2021 and Barman et al. 2018), and satisfy EFX for bi-valued instances (Amanatidis et al. 2021). In this paper, we revisit the (personalized) bi-valued instances and provide a tight characterization of the approximation guarantees of MNW allocations with respect to EFX, PMMS, and GMMS, showing that these guarantees are significantly stronger than what is known for general valuations. Furthermore, we demonstrate that even for the slightly more general setting of tri-valued instances, the fairness guarantees of MNW deteriorate significantly, which establishes a sharp boundary on the instances for which MNW allocations are strongly fair.
Read the full abstract
Formal Languages and Automata
Label Cuts in Layered Automata: Short Explanations for the Regular Constraint
Lazy clause generation solvers learn from propagation explanations; the form of a Regular explanation therefore determines which clauses reach the learning engine. Standard decompositions introduce variables for automaton states and derive reasons from local table constraints. BDD and MDD propagators instead select individual diagram edges. We study the direct LCG explanation language for Regular: disequality literals of the form $X_i\neq v$. Here, one literal removes every automaton transition with the same position/value label, so an explanation is not an ordinary edge cut. We prove that explanations for value deletions are exactly label $s$–$t$ cuts in the layered DFA unfolding. This characterization establishes NP-completeness for minimum-weight explanations, gives a polynomial algorithm for inclusion-minimal explanations, and leads to an exact $O((U+n)4^{|Q|})$ dynamic program for small automata. A C++ benchmark compares label-cut explanations with Table-LCG and MDD-edge baselines on 250 generated instances. On average, minimal label cuts reduce projected explanation size from 22.2 to 5.5 literals and run in tens of microseconds. Minimal label cuts are therefore the practical default; the exact algorithm provides an oracle for small automata.
Read the full abstract
Machine Learning
Generalized Biomedicine Discovery
In real-world clinical practice, medical images face open-world shifts: (i) long-tailed rare diseases, (ii) subtle lesions dominated by normal anatomy, and (iii) hierarchical taxonomies. Yet most open-world paradigms assume flat, balanced label spaces, leaving these biomedical demands unresolved. We introduce Generalized Biomedicine Discovery (GBD) and a unified benchmark spanning long-tail, anomaly, and taxonomy-aware discovery. Our key insight is that dominant known patterns form a visual manifold that masks subtle novelty. Inspired by expert diagnosis, we propose SCAN (Surprise-evoked Complementary AccommodatioN), which follows a cognition-inspired perceptual progression: it applies predictive suppression to filter expected norms, triggers surprise-evoked salience to highlight unexpected deviations, and performs complementary accommodation to integrate these shifts into global representations. Extensive experiments show that SCAN improves novel concept discovery while generally preserving established clinical knowledge, and it plugs into existing architectures to better navigate the known-unknown trade-off in medical imaging. Code is available at https://github.com/lytang63/generalized-biomedicine-discovery.
Read the full abstract
Number Theory
Some Methods to Solve the Diophantine Equation ay^2=b(x^k-c^k)
The solution of the Diophantine equation ay^2=b(x^k-c^k) is studied in different cases of k. Methods are proposed for different cases of k, which are convenient for computer algorithm implementation. The original equation is reduced to lower-degree equations, which can improve the efficiency in searching possible integer solutions. A sufficient condition of the unsolvability of ay^2=b(x^2n-c^2n) is presented.
Read the full abstract
Machine Learning
The Hidden Costs of 99% Accuracy: A Trustworthiness Audit of the Telco Customer Churn Benchmark
Customer churn prediction on the IBM Telco Customer Churn benchmark (n = 7,043) routinely reports test accuracies above 95%, with the most cited published study reporting 99.01%. We audit this benchmark for four trustworthiness failures invisible to the accuracy- and F1-centred reporting that dominates the literature. First, pre-split SMOTE inflates churn-class F1 by 13.1 percentage points across ten classifiers and fifteen seeds (Wilcoxon p < 10^-4 per classifier); the same leaky pipeline ordering paired with class weighting yields no inflation, isolating the effect to SMOTE's geometric construction. We measure the mechanism directly: approximately 36% of synthetic training points are nearest-neighbour interpolations of test-set instances. Second, the TotalCharges field is approximately determined by tenure multiplied by MonthlyCharges (R2 = 0.999); removing it changes accuracy by less than 0.2 percentage points, yet TreeSHAP ranks it ninth in mean absolute attribution - a pattern that materially corrupts SHAP-based interpretation. We propose an R2 > 0.95 pre-modelling diagnostic. Third, in a 15-seed calibration audit, isotonic regression is the strongest default; temperature scaling fails on class-weighted tree ensembles whose predicted-probability distribution is bimodal. Fourth, the cost-optimal decision threshold (under a 50 USD retention offer and 24-month CLV proxy) is approximately 5-10 times lower than the F1-optimal threshold, saving approximately 77,000 USD per 1,000 customers. We replicate F1 and F2 on Iranian Telecom Churn (within domain) and Bank Customer Churn (across domain): F1 generalises; F2 generalises only within telecom. We synthesise these findings into a four-component reporting checklist - pipeline disclosure, redundancy diagnostic, calibration audit, and cost-sensitive thresholds - and release a reproducible implementation.
Read the full abstract
Quantum Physics
Exact Posterior Prediction from Product Haar Measurements and a Randomized-Mesh Maximum-Likelihood Bridge
We study prediction of one unmeasured copy of an unknown finite-dimensional pure quantum state after independently measuring the observed copies with the one-copy Haar POVM. For the resulting fixed separable observation, the Bayes predictive state under quantum relative-entropy loss is the full-rank posterior mean. We evaluate it exactly through permanents of minors of the outcome Gram matrix, prove positivity and normalization of the permanent representation, and establish minimaxity among decision rules based on these fixed outcomes. Using Hilbert–Schmidt projection of the posterior mean and an exactly analyzed linear-inversion competitor, we prove a finite-sample posterior-purity bound and an explicit relative-entropy guarantee with sample count $O((d^2/\epsilon)\log(d/\epsilon))$. Using the exact collective benchmarks proved in a companion paper, we also obtain entropy and posterior-purity comparisons. To connect the fine product data to a regular ray-valued experiment without assuming deterministic finite-sample uniqueness, we draw one random orientation for a finite projective mesh, retain it for the entire sample, and apply a selected finite-alphabet MLE in the resulting reference experiment. A nested recovering mesh uniformly recovers the fine Fisher information. Consequently every sufficiently fine fixed mesh gives a regular finite-alphabet model. Its selected MLE has Haar-averaged inverse-Fisher coefficient $\overline a_k$, and refining the mesh after the fixed-mesh large-sample limit makes $\overline a_k$ approach $d-1$. This yields epsilon-optimal leading relative-entropy and posterior-overlap bounds for the fine posterior and the sharper fixed-dimensional asymptotic scale $(d/\epsilon)\log(d/\epsilon)$. The latter is not asserted as a uniform finite-sample guarantee. No deterministic finite-sample MLE uniqueness or triangular mesh schedule is used.
Read the full abstract
Commutative Algebra
A Reduced Non-McCoy Ring with the Annihilator Condition and $(A_2)$
It has been asked whether a reduced non-McCoy ring can satisfy both the annihilator condition and $(A_n)$ for some $n \geq 2$. In this work, we prove that such rings exist exactly when $n=2$, by constructing a countable example and showing that the annihilator condition together with $(A_3)$ forces a ring to be McCoy.
Read the full abstract
Commutative Algebra
On the Krull dimensions of rings of integer-valued polynomials and polynomial rings
It was conjectured that every integral domain $D$ satisfies $\dim\operatorname{Int}(D) \leq \dim D[X]$. We disprove this conjecture and, more strongly, classify all pairs for which both dimensions are finite. Writing $m=\dim D[X]$ and $n=\dim\operatorname{Int}(D)$, the pairs that occur are precisely $\{(1,1),(2,2)\}\ \cup\ \{(m,n)\in\mathbb Z_{>0}^{2}:m\geq3,\ n\geq m-1\}$.
Read the full abstract
Operator Algebras
Minimal Wittstock Envelopes of Hermitian Completely Bounded Maps
A Hermitian completely bounded map $\Phi:\mathscr{A}\to B(\mathcal{H})$ need not have a canonical completely positive analogue of an absolute value. We study this problem through the ordered set $\mathsf{E}(\Phi)$ of completely positive symmetric majorants of $\Phi$, which we call Wittstock envelopes. We show that every Wittstock envelope canonically determines a minimal Wittstock envelope below it. However, minimal envelopes need not be unique. We therefore study the stronger question of when a least completely positive majorant exists. We obtain a criterion, in terms of central supports of spectral projections, for the existence of least majorants below a fixed envelope. In finite dimensions, the Choi representation gives a simple characterization: a least completely positive majorant exists if and only if \(\Phi\) or \(-\Phi\) is completely positive. Finally, we use the envelope-relative modulus to define envelope-relative perspectives for Hermitian completely bounded maps. These constructions extend Okayasu's completely positive map perspectives, reduce to the usual perspective in the completely positive case, and remain dependent in general on the chosen Wittstock envelopes.