On the additive complexity of GCD and LCM matrices

DOI10.1134/S0001434616070166zbMATH Open1371.11069MaRDI QIDQ509060FDOQ509060

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

Publication date: 8 February 2017

Published in: Mathematical Notes (Search for Journal in Brave)

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

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)

Cites Work

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

Cited In (2)

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

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)