By Topic

There Are No Further Counterexamples to S. Piccard's Theorem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bekir, A. ; Pratt & Whitney Rocketdyne, Los Angeles ; Golomb, S.W.

In 1977, G. S. Bloom, in the J. Combinatorial Theory, showed that Sophie Piccard's ldquotheoremrdquo had counterexamples for six-mark rulers. Subsequent research into finding additional counterexamples has focused on a variety of computer algorithms, such as searching the space of rulers with relatively few marks in an attempt to find another counterexample. Recent analytic effort has made use of Golomb's ldquopolynomial method,rdquo which made strides in eliminating specific types of rulers which cannot contain counterexamples. The question as to whether other larger length ruler counterexamples exist, however, was left unanswered. In this correspondence, a geometric manipulation of the ldquopolynomial methodrdquo is used to demonstrate that no additional counterexamples are possible.

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 8 )