Erratum to “A further study for the upper bound of the cardinality of Farey vertices and applications in discrete geometry” [J. Algebra Comb. Discrete Appl. 2(3) (2015) 169-190]

Journal of Algebra Combinatorics Discrete Structures and Applications

article

Daniel Khoshnoudirad

关键词: Combinatorial number theory;    Farey diagrams;    Theoretical computer sciences;    Discrete planes;    Diophantineequations;    Arithmetical geometry;    Combinatorial geometry;    Discrete geometry;    Graph theory in computersciences;   

DOI  :  10.13069/jacodesmath.00924

学科分类：社会科学、人文和艺术（综合）

来源: Yildiz Technical University

【 摘 要 】

The equation (4) on the page 178 of the paper previously published has to be corrected. We had only handled the case of the Farey vertices for which min (［2m sr0 ］ , j n s 0r k) ∈ N * . In fact we had to distinguish two cases: min ([2m sr0 ] , j n s 0r k) ∈ N ∗ and min ([2m sr0 ] , j n s 0r k) = 0. However, we highlight the correct results of the original paper and its applications. We underline that in this work, we still brought several contributions. These contributions are: applying the fundamental formulas of Graph Theory to the Farey diagram of order (m, n), finding a good upper bound for the degree of a Farey vertex and the relations between the Farey diagrams and the linear diophantine equations.

【 授权许可】

CC BY