2000 character limit reached
Strict inequality in the box-counting dimension product formulas (1007.4222v1)
Published 23 Jul 2010 in math.MG
Abstract: It is known that the upper box-counting dimension of a Cartesian product satisfies the inequality $\dim_{B}\left(F\times G\right)\leq \dim_{B}\left(F\right) + \dim_{B}\left(G\right)$ whilst the lower box-counting dimension satisfies the inequality $\dim_{LB}\left(F\times G\right)\geq \dim_{LB}\left(F\right) + \dim_{LB}\left(G\right)$. We construct Cantor-like sets to demonstrate that both of these inequalities can be strict.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
