Results 51 to 60 of about 1,137 (186)
On maps sending rank-κ idempotents to idempotents
Operators and Matrices, 2019 Summary: We characterize bijective linear maps on complex-valued \(n\times n\) matrices such that rank-\( \kappa\) idempotents are mapped to idempotents, where \(2 \leqslant \kappa < n - 1\).
openaire +2 more sources
NeuDiff Agent: a governed AI workflow for single‐crystal neutron crystallography
Journal of Applied Crystallography, Volume 59, Issue 4, Page 1102-1111, August 2026.NeuDiff Agent accelerates the TOPAZ single‐crystal neutron diffraction workflow at the Spallation Neutron Source from measured data to a structure suitable for publication through governed tool execution, auditable provenance and checkCIF assessment.Large‐scale facilities increasingly face analysis and reporting latency as a limiting step in scientific
Zhongcan Xiao +3 more
wiley +1 more source
The Moore–Penrose Inverse and Product Decomposition of Idempotent Operators on Hilbert C*-Modules
AxiomsWe study the Moore–Penrose inverse of idempotent operators on Hilbert C*-modules. First, we extend the computation of the Moore–Penrose inverse of an idempotent operator and its difference from the range projection to this setting.
Wei Luo
doaj +1 more source
Left Zeroid and Right Zeroid Elements of Γ-Semirings
Discussiones Mathematicae - General Algebra and Applications, 2017 In this paper we introduce the notion of a left zeroid and a right zeroid of Γ -semirings. We prove that, a left zeroid of a simple Γ-semiring M is regular if and only if M is a regular Γ -semiring.
Rao M. Murali Krishna, Kumar K.R.
doaj +1 more source
Ideals of Projections According to σ-Algebras and Unbounded Measurements
Axioms, 2023 A theory of unbounded measures is constructed based on the quantum logics of orthogonal projections. As an analogue of the ring of sets, the projector ideal is proposed. Finite and maximal measures regarding the projector ideals are described.
Marjan Matvejchuk
doaj +1 more source
Local Polynomial Regression and Filtering for a Versatile Mesh‐Free PDE Solver
International Journal for Numerical Methods in Fluids, Volume 98, Issue 7, Page 804-839, July 2026.A high‐order, mesh‐free finite difference method for solving differential equations is presented. Both derivative approximation and scheme stabilisation is carried out by parametric or non‐parametric local polynomial regression, making the resulting numerical method accurate, simple and versatile. Numerous numerical benchmark tests are investigated for
Alberto M. Gambaruto
wiley +1 more source
HLA, Volume 108, Issue 1, July 2026.ABSTRACT Luminex bead‐based immunoassays are central to HLA antibody testing in histocompatibility laboratories, yet QC monitoring remains largely manual. Although ISO 15189, EFI and ASHI standards require statistical trend analysis, laboratories typically rely on spreadsheet tracking or periodic visual inspection; these approaches can detect gross run
Mian Chen +5 more
wiley +1 more source
Threads without idempotents [PDF]
Proceedings of the American Mathematical Society, 1961 If a thread S has no idempotents and if S2 = S, then S is iseomorphic with the real interval (0, 1) under ordinary multiplication [2, Corollary 5.6]. Although the result is not nearly as pleasing as the special case just quoted, we shall give here a description of any thread without idempotents.
openaire +1 more source
On the Auslander–Reiten theory for extended hearts of proper connective dg algebras
Bulletin of the London Mathematical Society, Volume 58, Issue 7, July 2026.Abstract We prove that, for a proper connective dg algebra A$A$ with cohomology concentrated in degrees between 1−d$1-d$ and 0, the extended heart Dfd(A)(−d,0]⊆Dfd(A)$\mathcal {D}^{\mathrm{fd}}(A)^{(-d,0]}\subseteq \mathcal {D}^{\mathrm{fd}}(A)$ is an extriangulated category with almost‐split conflations.
Nao Mochizuki, Marvin Plogmann
wiley +1 more source
THE TRIPLE IDEMPOTENT GRAPH OF THE RING Z_n
BarekengLet be a commutative ring, and denote the set of all idempotent elements of . The triple idempotent graph of , denoted by , is defined as an undirected simple graph whose vertex set .
Vika Yugi Kurniawan +2 more
doaj +1 more source