MOVES Seminar 5 July 2010, 14:30

 

Michael Codish

 

Optimal Base Problems

 

 

Abstract:

 

We define a simple mathematical problem which we call the optimal base
problem: Given a multiset S of positive integers, find a numeral base
B such that the size of the representation of S in B is minimal. For
example if S = {16,30,54,60} then in base 10 the sum of the digits is
25, while in base 2 it is 13, and in base 3 it is 12. The problem gets
more interesting when we allow mixed radix bases such as B = <3,5,2,2>
with respect to which the sum of the digits in S is only 9.

We present an algorithm to solve the optimal base problem and show
that it improves significantly on existing techniques. Finally we
present also an application to the encoding of Pseudo-Boolean
constraints to SAT.

Joint work with Yoav Fekete, Carsten Fuhs and Peter Schneider-Kamp