On the additive complexity of GCD and LCM matrices

DOI10.1134/S0001434616070166MaRDI QIDQ509060zbMATH OpenFDO

Authors S. B. Gashkov, I. S. Sergeev

Publication date 8 February 2017

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

greatest common divisorleast common multipleSmith determinantadditive complexity of a matrix

Mathematics Subject Classification ID

Matrices, determinants in number theory (11C20) Matrices of integers (15B36)

Recommendations

• On LCM matrices on GCD-closed sets
• An analysis of GCD and LCM matrices via the LDL^T-factorization
• On G.C.D. and L.C.M. matrices
• On the factorization of LCM matrices on gcd-closed sets
• scientific article; zbMATH DE number 2059701

Cites work

• scientific article; zbMATH DE number 2133276 (Why is no real title available?)
• scientific article; zbMATH DE number 913229 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Approximate formulas for some functions of prime numbers
• Arithmetic complexity of certain linear transformations
• Arithmetic complexity of the Stirling transforms
• Complexity of Linear Boolean Operators
• Handbook of Number Theory I
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
• On GCD and LCM matrices
• On Smith's determinant
• On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them
• On the complexity of calculation of differentials and gradients
• Problems and theorems in analysis. I. Series, integral calculus, theory of functions. Transl. from the German by Dorothee Aeppli

Cited in

(2)

• On the fraction of matrices with maximal additive complexity
• Lower bounds on the graver complexity of \(M\)-fold matrices

This page was built for publication: On the additive complexity of GCD and LCM matrices

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