Indivisibility and divisibility polytopes

Coppersmith, Don;Lee, Jon
(2000)

Files

dp2000-31.pdf
  • Open Access
  • Adobe PDF
  • 332.1 KB
Download

Details

Authors
  • Coppersmith, Don
    Author
  • Lee, Jon
    Author
Abstract
We study thep olytopes 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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Coppersmith, D., & Lee, J. (2000). Indivisibility and divisibility polytopes (CORE Discussion Papers 2000/31). https://hdl.handle.net/2078.5/34239