On Farey table and its compression for space optimization with guaranteed error bounds

DOI10.13164/MA.2016.09zbMATH Open1375.94093OpenAlexW2574256530MaRDI QIDQ5273296FDOQ5273296

Authors: Biswajit Paria, Sanjoy Pratihar, Partha Bhowmick 

Publication date: 5 July 2017

Published in: Mathematics for Application (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.13164/ma.2016.09

Recommendations

• Algorithmic Number Theory
• On the Farey sequence and its augmentation for applications to image analysis
• Order Statistics in the Farey Sequences in Sublinear Time
• A motif of mathematics. History and application of the mediant and the Farey sequence
• Two algorithms for Farey tree

zbMATH Keywords

digital geometrydigital image processingFarey sequencefraction errorFarey tablefraction rankrank problem

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Well-distributed sequences and other variations (11K36)

Cited In (6)

• A motif of mathematics. History and application of the mediant and the Farey sequence
• Combinatorial properties of Farey graphs
• Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons
• On the Version Space Compression Set Size and Its Applications
• On the Farey sequence and its augmentation for applications to image analysis
• Order Statistics in the Farey Sequences in Sublinear Time

This page was built for publication: On Farey table and its compression for space optimization with guaranteed error bounds

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