login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: author:Aaron David Fairbanks
Displaying 41-50 of 232 results found. ( prev | next )     page 1 2 3 4 5 6 7 8 9 10 11 ... 24
     Sort: recent      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP1130 Start with a rectangle subdivided further into rectangles and shrink the vertical lines into points vs. the shape does not result from this process.
?
(edit; present; nest [left/right]; search; history)
COMMENTS

The description in terms of rectangles was noted by Sridhar Ramesh when he solved this.


All examples in this Bongard Problem feature arced line segments connected at endpoints; these segments do not cross across one another and they are nowhere vertical; they never double back over themselves in the horizontal direction.

Furthermore, in each example, there is a single leftmost point and a single rightmost point, and every segment is part of a path bridging between them. So, there is a topmost total path of segments and bottommost total chain of segments.


Any picture on the left can be turned into a subdivided rectangle by the process of expanding points into vertical lines.


Here is another answer:

"Right examples: some junction point has a single line coming out from either the left or right side."


If there is some junction point with only a single line coming out from a particular side, the point cannot be expanded into a vertical segment with two horizontal segments bookending its top and bottom (as it would be if this were a subdivision of a rectangle).


And this was the original, more convoluted idea of the author:

"Start with a string along the top path. Sweep it down, region-by-region, until it lies along the bottom path. The string may only enter a region when it fully covers that region's top edge and likewise it must exit by fully covering the bottom edge. Only in left images can this process be done so that no segment of the string ever hesitates."

Quite convoluted when spelled out in detail, but not terribly complicated to imagine visually. (See the keyword unwordable.)


The string-sweeping answer is the same as the rectangle answer because a rectangle represents the animation of a string throughout an interval of time. (A horizontal cross-section of the rectangle represents the string, and the vertical position is time.) Distorting the rectangle into a new shape is the same as animating a string sweeping across that new shape.

In particular, shrinking vertical lines of a rectangle into points means just those points of the string stay still as the string sweeps down.

The principle that horizontal lines subdividing the original rectangle become the segments in the final picture corresponds to the idea that the string must enter or exit a single region all at once.

CROSSREFS

BP1129 started as an incorrect solution for this Bongard Problem. Anything fitting right in BP1130 fits right in BP1129.

Adjacent-numbered pages:
BP1125 BP1126 BP1127 BP1128 BP1129  *  BP1131 BP1132 BP1133 BP1134 BP1135

KEYWORD

hard, unwordable, solved

CONCEPT topological_transformation (info | search),
imagined_motion (info | search)

WORLD

[smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1129 An oval is sorted left; shapes are sorted left when they can be built out of others sorted left by A) joining side by side (at a point) or B) joining one on top of the other (joining one's entire bottom edge to the other's entire top edge).
(edit; present; nest [left/right]; search; history)
COMMENTS

This was an unintended solution for BP1130.


In category theory lingo, left examples are built by repeated horizontal composition and vertical composition. (Making horizontal lines as 0-ary vertical compositions is here forbidden.)

CROSSREFS

Anything fitting right in BP1130 fits right here.

Adjacent-numbered pages:
BP1124 BP1125 BP1126 BP1127 BP1128  *  BP1130 BP1131 BP1132 BP1133 BP1134

KEYWORD

hard, less, convoluted, solved, inductivedefinition

CONCEPT or (info | search)

WORLD

[smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1127 There is no rule for how the objects in a cluster interrelate vs. there is.
(edit; present; nest [left/right]; search; history)
COMMENTS

Other ways of phrasing this:

"Local" vs. "global" properties of collections: to check a collection satisfies a "local" property, it is only necessary to check each individual thing in it satisfies some property.

The rule all collections satisfy is just "every object is a ___" vs. the rule is something more.

CROSSREFS

Adjacent-numbered pages:
BP1122 BP1123 BP1124 BP1125 BP1126  *  BP1128 BP1129 BP1130 BP1131 BP1132

KEYWORD

abstract, creativeexamples, left-unknowable, rules, miniworlds

CONCEPT local_global (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

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

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

BP1116 Contains self somewhere within any area around any point within self vs. not so.
(edit; present; nest [left/right]; search; history)
COMMENTS

Very similar to the less clearly-defined solution "tiles itself with infinitely many copies (different sizes allowed) vs. does not".


The left hand side of this is a weaker condition than the left hand side of BP1241.

CROSSREFS

Adjacent-numbered pages:
BP1111 BP1112 BP1113 BP1114 BP1115  *  BP1117 BP1118 BP1119 BP1120 BP1121

KEYWORD

notso, perfect, infinitedetail

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

WORLD

connected_fractal [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1115 Fractals tile one another vs. not so (fractals are rather tiled by some combination of one another and themselves).
(edit; present; nest [left/right]; search; history)
COMMENTS

Rotations and reflections avoided in all examples for simplicity.

CROSSREFS

Adjacent-numbered pages:
BP1110 BP1111 BP1112 BP1113 BP1114  *  BP1116 BP1117 BP1118 BP1119 BP1120

KEYWORD

perfect, infinitedetail, unorderedpair

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

AUTHOR

Aaron David Fairbanks

BP1114 Fractals contain one another vs. only one contains the other.
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP1109 BP1110 BP1111 BP1112 BP1113  *  BP1115 BP1116 BP1117 BP1118 BP1119

KEYWORD

perfect, infinitedetail, unorderedpair

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

AUTHOR

Aaron David Fairbanks

BP1108 Solid chunk of black space in neighborhood of any point of the fractal vs. solid chunk of white space in any neighborhood.
?
?
?
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP1103 BP1104 BP1105 BP1106 BP1107  *  BP1109 BP1110 BP1111 BP1112 BP1113

KEYWORD

right-null, perfect, infinitedetail, assumesfamiliarity, neither

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

WORLD

fractal [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

( prev | next )     page 1 2 3 4 5 6 7 8 9 10 11 ... 24

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