A proof of Coleman's conjecture

DOI10.1016/j.disc.2006.09.033zbMath1120.52006OpenAlexW2162387519WikidataQ123292308 ScholiaQ123292308MaRDI QIDQ882109

Krzysztof Kołodziejczyk, Daria Olszewska

Publication date: 23 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.033

zbMATH Keywords

lattice pointconvex lattice polygonColeman's conjecturelattice point enumerator

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Related Items

A disproof of the conjecture about boundary \(H\)-points of \(H\)-triangles, Realizable quadruples for hex-polygons. Combinatorics of honeycombs, The minimum number of interior \(H\)-points of convex \(H\)-dodecagons, Moving out the edges of a lattice polygon, Counting clean triangles, \(H\)-triangles with \(k\) interior \(H\)-points, Blichfeldt-type inequalities and central symmetry, A note on area of lattice polygons in an Archimedean tiling, On the first unknown value of the function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primitive and mensurable hex-triangles
• Über konvexe Gitterpolygone
• The Fascination of the Elementary
• Minimal requirements for Minkowski's theorem in the plane I
• On convex lattice polygons
• Geoboard Triangles with One Interior Point
• Stretch: A Geoboard Game
• A Fast Pick-Type Approximation for Areas of H-Polygons