Back to results

University of Illinois at Urbana-Champaign

Convex lattice polygons

Abstract

dc:description

This thesis deals with three main extremal problems on convex lattice polygons in the plane. A convex lattice polygon is the intersection of a compact convex set with the integer lattice (the set of all points with integer coordinates). Let P represent a convex lattice polygon.

Degree

thesis:*
Name thesis:degree_name
Ph.D.
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematics
Grantor
University of Illinois at Urbana-Champaign
Year dc:date
2011

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Alarcon, Eberth Guillermo, II
Contributors dc:contributor
  • Stolarsky, Kenneth B.

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • Copyright 1995 Alarcon, Eberth Guillermo, II
Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
AAI9543512
(UMI)AAI9543512
OAI identifier oai:identifier
oai:www.ideals.illinois.edu:2142/22612

Chain of custody

source
Harvested from
University of Illinois - Urbana-Champaign
Base URL
www.ideals.illinois.edu/oai-pmh
Last updated
2026-07-22
Source record
OAI-PMH GetRecord
citation

Alarcon, Eberth Guillermo, II. Convex lattice polygons. Dissertation thesis, University of Illinois at Urbana-Champaign, 2011. http://hdl.handle.net/2142/22612