Christer Kiselman: Characterizing digital straightness using the chord property, word combinatorics, Diophantine inequalities, and difference operators
Christer Kiselman, Uppsala universitet
Time: Wed 2009-12-09 10.15
Location: Room 3733, department of mathematics, KTH, Lindstedtsvägen 25, 7th floor
Contact:
Subject area: Combinatorics
The notion of digital straightness has been studied since Azriel Rosenfeld’s seminal paper of 1974 . In particular, characterizations using the chord property, word combinatorics, and double Diophantine inequalities have been investigated. To these I will add characterizations using difference operators and show how these four aspects relate to each other. If time permits, I will also discuss the related, more general notion of digital convexity — as is to be expected, convexity and concavity jointly is equivalent to straightness.
