Abstract
Given a finite set , a convexity , is a collection of subsets of that contains both the empty set and the set and is closed under intersections. The elements of are called convex sets. The digital convexity, originally proposed as a tool for processing digital images, is defined as follows: a subset is digitally convex if, for every , we have implies . The number of cyclic binary strings with blocks of length at least is expressed as a linear recurrence relation for . A bijection is established between these cyclic binary strings and the digitally convex sets of the power of a cycle. A closed formula for the number of digitally convex sets of the Cartesian product of two complete graphs is derived. A bijection is established between the digitally convex sets of the Cartesian product of two paths, , and certain types of binary arrays.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.