English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Although newly developed indexing software is frequently reported incrystallography, it is not widely recognized that the use of error-stableBravais lattice determinations can simplify indexing algorithms and increasetheir success rates. In indexing, a code for error-stable unit-cellidentification is also required to exclude duplicate solutions. One of ourgoals is to collect information on the lattice-basis reduction theory and itsapplication to these analyses.  The main result is an error-stable Bravais lattice determination algorithmfor 2D lattices, along with a mathematical proof that it works even forparameters containing large observational errors. As in our algorithm for 3Dlattices, it uses two lattice-basis reduction methods that seem to be optimalfor different symmetries.  As another application of lattice-basis reduction theory to the unit-cellidentification, we introduce several methods to measure the difference of unitcells known in crystallography and mathematics.

Ideas of lattice-basis reduction theory for error-stable Bravais lattice determination and ab-initio indexing