login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: ex:EX6381
Displaying 1-8 of 8 results found.     page 1
     Sort: id      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP531 Fractal is tiled by three smaller copies of itself vs. fractal is tiled by five smaller copies of itself.
(edit; present; nest [left/right]; search; history)
COMMENTS

More specifically, all left examples shown in this Problem have Hausdorff dimension log2(3) while all right examples have Hausdorff dimension log3(5).


Left examples can tile themselves by any power of 3 smaller same-sized copies of themselves while right examples can tile themselves by any power of 5 smaller same-sized copies of themselves.


Homage to Bongard's original three versus five Problems.

CROSSREFS

Adjacent-numbered pages:
BP526 BP527 BP528 BP529 BP530  *  BP532 BP533 BP534 BP535 BP536

KEYWORD

perfect, infinitedetail

CONCEPT fractal (info | search),
recursion (info | search),
self-reference (info | search),
tiling (info | search),
three (info | search),
five (info | search)

WORLD

fractal_self_tile [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP532 Self-tiling fractal using one size of tile vs. does not tile itself with a single size of itself.
(edit; present; nest [left/right]; search; history)
CROSSREFS

This is BP344 ("rep-tiles") but for fractals.

See BP1119 for the version with multiple different sizes of tile allowed.

Adjacent-numbered pages:
BP527 BP528 BP529 BP530 BP531  *  BP533 BP534 BP535 BP536 BP537

KEYWORD

hardsort, proofsrequired, perfect, infinitedetail, contributepairs

CONCEPT fractal (info | search),
recursion (info | search),
self-reference (info | search),
tiling (info | search)

WORLD

[smaller | same | bigger]
zoom in left (fractal_self_tile)

AUTHOR

Aaron David Fairbanks

BP1118 Self-similar only scaled about one point vs. multiple centers of self-similarity.
(edit; present; nest [left/right]; search; history)
COMMENTS

There is only ever one such center of self-similarity or infinitely many.

CROSSREFS

Adjacent-numbered pages:
BP1113 BP1114 BP1115 BP1116 BP1117  *  BP1119 BP1120 BP1121 BP1122 BP1123

KEYWORD

nice, perfect, infinitedetail

CONCEPT fractal (info | search),
recursion (info | search),
self-reference (info | search)

WORLD

[smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1119 Tiled by finitely many smaller copies of itself (different sizes allowed) vs. not so.
(edit; present; nest [left/right]; search; history)
COMMENTS

These are sometimes called "irreptiles".

CROSSREFS

See BP532 for the version with only one size of tile allowed.

Adjacent-numbered pages:
BP1114 BP1115 BP1116 BP1117 BP1118  *  BP1120 BP1121 BP1122 BP1123 BP1124

KEYWORD

hardsort, proofsrequired, perfect, infinitedetail

CONCEPT fractal (info | search),
recursion (info | search),
self-reference (info | search),
tiling (info | search)

WORLD

[smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1120 No same-sized copies of self overlap vs. distinct same-sized copies overlap.
(edit; present; nest [left/right]; search; history)
COMMENTS

With mathematical jargon:

No distinct same-sized copies of self overlap on a subset with positive measure in the Hausdorff measure using the Hausdorff dimension.


For a covering of a fractal by finitely many scaled down copies of itself, the condition of that no two have an intersection with positive measure is equivalent to the condition that the Hausdorff dimension coincides with the similarity dimension.

(There is another similar condition in this context called the "open set condition" which implies this but is not equivalent. The open set condition is equivalent to the condition that the Hausdorff measure using the similarity dimension is nonzero.)

REFERENCE

https://en.wikipedia.org/wiki/Hausdorff_dimension

https://en.wikipedia.org/wiki/Open_set_condition

CROSSREFS

Adjacent-numbered pages:
BP1115 BP1116 BP1117 BP1118 BP1119  *  BP1121 BP1122 BP1123 BP1124 BP1125

KEYWORD

challenge, perfect, infinitedetail

CONCEPT fractal (info | search),
recursion (info | search),
self-reference (info | search),
overlap (info | search)

WORLD

[smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1237 Connected fractal vs. disconnected fractal.
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP1232 BP1233 BP1234 BP1235 BP1236  *  BP1238 BP1239 BP1240 BP1241 BP1242

KEYWORD

notso, perfect, infinitedetail

CONCEPT connected_component (info | search),
fractal (info | search)

WORLD

fractal_self_tile [smaller | same | bigger]
zoom in left (connected_fractal_self_tile)

AUTHOR

Jago Collins

BP1238 Fractal with hole vs. fractal with no hole (simply connected).
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP1233 BP1234 BP1235 BP1236 BP1237  *  BP1239 BP1240 BP1241 BP1242 BP1243

KEYWORD

notso, perfect, infinitedetail

CONCEPT existence (info | search),
fractal (info | search),
hole (info | search),
loop (info | search)

WORLD

connected_fractal_self_tile [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1239 Fractal topologically closed (each white point has a neighborhood of pure white surrounding it) vs. not
(edit; present; nest [left/right]; search; history)
COMMENTS

It isn't possible to unambiguously communicate whether or not a few specific points are missing.

CROSSREFS

Adjacent-numbered pages:
BP1234 BP1235 BP1236 BP1237 BP1238  *  BP1240 BP1241 BP1242 BP1243 BP1244

KEYWORD

notso, perfect, infinitedetail

CONCEPT fractal (info | search)

AUTHOR

Aaron David Fairbanks

    page 1

Welcome | Solve | Browse | Lookup | Recent | Links | Register | Contact
Contribute | Keywords | Concepts | Worlds | Ambiguities | Transformations | Invalid Problems | Style Guide | Goals | Glossary