We study the the polytopes of binary n-strings that encode
(positive) integers that are not divisible by a particular positive integer
p --- the ``indivisibility polytopes'', as
well as the more general ``clipped cubes''.
Also, we discuss a potential application to factoring.
Finally, we present some results concerning divisibility polytopes.
By: Don Coppersmith and Jon Lee
Published in: RC21738 in 2000
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .