A fast algorithm to find reduced hyperplane unit cells and solve \(N\)-dimensional Bézout's identities (Q6565495)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast algorithm to find reduced hyperplane unit cells and solve N-dimensional Bézout's identities |
scientific article; zbMATH DE number 7874536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm to find reduced hyperplane unit cells and solve \(N\)-dimensional Bézout's identities |
scientific article; zbMATH DE number 7874536 |
Statements
A fast algorithm to find reduced hyperplane unit cells and solve \(N\)-dimensional Bézout's identities (English)
0 references
2 July 2024
0 references
\(N\)-dimensional Bézout's identity
0 references
hyperplane unit cell
0 references
integer relation
0 references
twinning
0 references
0.690493106842041
0 references
0.6671896576881409
0 references
0.6505605578422546
0 references
0.6496279835700989
0 references
0.6482230424880981
0 references
