The On-Line Encyclopedia of Bongard Problems

Search: ex:EX10228

Displaying 1-2 of 2 results found.

page 1

Sort: id Format: long Filter: (all | no meta | meta) Mode: (words | no words)

Sequence contains each possible way its distinct elements can be arranged as a subsequence vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Superpermutation`
	CROSSREFS	`Adjacent-numbered pages: BP1268 BP1269 BP1270 BP1271 BP1272 * BP1274 BP1275 BP1276 BP1277 BP1278`
	EXAMPLE	`There are 6 ways of arranging the letters A, B and C: ABC, ACB, BAC, BCA, CAB, and CBA. The string "ABCABACBA" contains each of these as a substring, and would therefore be sorted left.`
	KEYWORD	`precise, allsorted, notso, sequence, traditional, miniworlds`
	CONCEPT	`sequence (info \| search),` `overlap (info \| search)`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Leo Crabbe`

There is a way of grouping elements into (more than one) equal-sized blocks such that no block appears twice vs. there exists no such grouping.

(edit; present; nest [left/right]; search; history)

	COMMENTS	`Sequences with a prime number of elements are sorted left when all their elements are unique, and sorted right otherwise.`
	CROSSREFS	`Adjacent-numbered pages: BP1270 BP1271 BP1272 BP1273 BP1274 * BP1276 BP1277 BP1278 BP1279 BP1280`
	EXAMPLE	`The sequence ABBABB would be sorted left, as it could be grouped into (AB)(BA)(BB), where each block is unique.`
	KEYWORD	`precise, unwordable, notso, sequence, miniworlds`
	CONCEPT	`element_grouping (info \| search)`
	AUTHOR	`Leo Crabbe`

page 1

		Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)