On a Problem Posed by Maurice Nivat

Details On a Problem Posed by Maurice Nivat On a Problem Posed by Maurice Nivat

2006-09-08

arxiv.org/abs/math/0609230v1

Mathematics

Combinatorics

8 pages

Scientific paper

Consider a $m \times n$ matrix $A$, whose elements are arbitrary integers. Consider, for each square window of size $2 \times 2$, the sum of the corresponding elements of $A$. These sums form a $(m - 1) \times (n-1)$ matrix $S$. Can we efficiently (in polynomial time) restore the original matrix $A$ given $S$? This problem was originally posed by Maurice Nivat for the case when the elements of matrix $A$ are zeros and ones. We prove that this problem is solvable in polynomial time. Moreover, the problem still can be efficiently solved if the elements of $A$ are integers from given intervals. On the other hand, for $2 \times 3$ windows the similar problem turns out to be NP-complete.

Affiliated with

Also associated with

No associations

Rating

On a Problem Posed by Maurice Nivat does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On a Problem Posed by Maurice Nivat, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a Problem Posed by Maurice Nivat will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-112691