Satins, lattices, and extended Euclid's algorithm

DOI10.1007/S13160-021-00477-9MaRDI QIDQ2070141zbMATH OpenOpenAlexFDO

Authors Josep M. Brunat, Joan-C. Lario

Publication date 21 January 2022

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s13160-021-00477-9

zbMATH Keywords

optimal basisshortest vectorextended Euclid's algorithmLagrange-Gauss lattice basis reductionsatinssquare satinssymmetric satins

Mathematics Subject Classification ID

Mathematics and visual arts (00A66) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Lattices and convex bodies (number-theoretic aspects) (11H06) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Miscellaneous applications of number theory (11Z05)

Recommendations

• Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
• scientific article; zbMATH DE number 1254272
• Computing a lattice basis revisited
• Analysis and geometry of a GCD-algorithm
• Gauss' algorithm revisited

Cites work

• A computational introduction to number theory and algebra
• An Introduction to Mathematical Cryptography
• An extension to the catalogue of isonemal fabrics
• Satins and Twills: An Introduction to the Geometry of Fabrics

Cited in

(1)

• The mathematics of satins

This page was built for publication: Satins, lattices, and extended Euclid's algorithm

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