Power GCDQ and LCMQ matrices defined on GCD-closed sets over Euclidean domains

MaRDI QIDQ6613027

Ragheb Mghames, Author name not available (Why is that?), Haissam Chehade

Publication date: 1 October 2024

Published in: Palestine Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Euclidean domains\(q\)-orderingprime residue systemgcd-closed setspower LCMQ matrixpower GCDQ matrix

Mathematics Subject Classification ID

Factorization of matrices (15A23) Theory of matrix inversion and generalized inverses (15A09) Determinants, permanents, traces, other special matrix functions (15A15) Commutative rings defined by factorization properties (e.g., atomic, factorial, half-factorial) (13F15) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Matrices, determinants in number theory (11C20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The determinants of GCD matrices
• Greatest common divisor matrices
• On GCD and LCM matrices
• On LCM matrices on GCD-closed sets
• On Smith's determinant
• On the value of a certain arithmetical determinant.
• Bounds for determinants of matrices associated with classes of arithmetical functions
• On some analogues of the Bourque-Ligh conjecture on LCM matrices
• Power GCD Matrices for a UFD
• Reciprocal power GCDQ matrices and power LCMQ matrices defined on factor closed sets over Euclidean domains

This page was built for publication: Power GCDQ and LCMQ matrices defined on GCD-closed sets over Euclidean domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613027)