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

The divided cell algorithm was introduced by Delone in 1947 to calculate theinhomogeneous minima of binary quadratic forms and developed further by E. S.Barnes and H. P. F. Swinnerton-Dyer in the 1950s. We show how advances of thepast fifty years in both symbolic computation and our understanding ofhomogeneous spectra can be combined to make divided cells more useful fororganizing information about inhomogeneous approximation problems. A crucialpart of our analysis relies on work of Jane Pitman, who related the dividedcell algorithm to the regular continued fraction algorithm. In particular, therelation to continued fractions allows two divided cells for the same problemto be compared without stepping through the chain of divided cells connectingthem.

The divided cell algorithm and the inhomogeneous Lagrange and Markoff spectra