Erratum to: ``A further study for the upper bound of the cardinality of Farey vertices and applications in discrete geometry
zbMATH Open1425.05010MaRDI QIDQ5241118FDOQ5241118
Authors: Daniel Khoshnoudirad 
Publication date: 30 October 2019
Recommendations
- A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry
- Farey lines defining Farey diagrams and application to some discrete structures
- Correction to: ``Distance between vertices of lattice polytopes
- Erratum to: ``On a classical theorem on the diameter and minimum degree of a graph
- scientific article; zbMATH DE number 1181632
discrete geometrycombinatorial geometryDiophantine equationsdiscrete planesarithmetical geometrycombinatorial number theoryFarey diagramsgraph theory in computer sciencestheoretical computer sciences
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Exact enumeration problems, generating functions (05A15) General topics of discrete mathematics in relation to computer science (68R01) Asymptotic enumeration (05A16) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On digital plane preimage structure
- Digital Planar Surface Segmentation Using Local Geometric Patterns
- Extremal problems in discrete geometry
- On the number of linear partitions of the \((m,n)\)-grid
- Asymptotics of the number of threshold functions on a two-dimensional rectangular grid
- Variants for the Hough transform for line detection
- Relative blocking in posets
- Title not available (Why is that?)
- A Note on Boolean Lattices and Farey Sequences II
- Title not available (Why is that?)
- Farey lines defining Farey diagrams and application to some discrete structures
- An introduction to the theory of numbers. Transl. from the English by François Sauvageot, introduction by Catherine Goldstein
- Duality and Geometry Straightness, Characterization and Envelope
- Combinatorial Image Analysis
- Enumeration formula for \((2,n)\)-cubes in discrete planes
- On the number of digital straight line segments
- About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators
This page was built for publication: Erratum to: ``A further study for the upper bound of the cardinality of Farey vertices and applications in discrete geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241118)
