Tight Lower Bound for Average Number of Terms in Optimal Double-base Number System

04/13/2021
by   Vorapong Suppakitpaisarn, et al.
0

We show in this note that the average number of terms in the optimal double-base number system is in Omega(n / log n). The lower bound matches the upper bound shown earlier by Dimitrov, Imbert, and Mishra (Math. of Comp. 2008).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2017

A Note on Tight Lower Bound for MNL-Bandit Assortment Selection Models

In this note we prove a tight lower bound for the MNL-bandit assortment ...
research
07/11/2012

Discretized Approximations for POMDP with Average Cost

In this paper, we propose a new lower approximation scheme for POMDP wit...
research
11/03/2017

A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings

Stable matching is a classical combinatorial problem that has been the s...
research
07/29/2013

Tight Lower Bounds for Homology Inference

The homology groups of a manifold are important topological invariants t...
research
12/14/2022

Optimality Despite Chaos in Fee Markets

Transaction fee markets are essential components of blockchain economies...
research
03/23/2022

Tight Bounds for Repeated Balls-into-Bins

We study the repeated balls-into-bins process introduced by Becchetti, C...
research
01/27/2021

A Note on the Representation Power of GHHs

In this note we prove a sharp lower bound on the necessary number of nes...

Please sign up or login with your details

Forgot password? Click here to reset