Strict inequality in the box-counting dimension product formulas

Abstract

It is known that the upper box-counting dimension of a Cartesian product satisfies the inequality B(F× G)≤ B(F) + B(G) whilst the lower box-counting dimension satisfies the inequality LB(F× G)≥ LB(F) + LB(G). We construct Cantor-like sets to demonstrate that both of these inequalities can be strict.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…