Calculate the number of free n-polyominoes

  • Context: Graduate 
  • Thread starter Thread starter Aeneas
  • Start date Start date
Click For Summary
SUMMARY

There is currently no established formula for calculating the number of free n-polyominoes, only bounds exist. The problem remains unsolved, with historical references indicating that it has been a topic of interest since the works of Martin Gardner in the 1960s and 1970s. The complexity of the problem suggests that finding a definitive solution may be inherently challenging. Further exploration into the reasons behind the lack of a formula is warranted.

PREREQUISITES
  • Understanding of combinatorial geometry
  • Familiarity with polyominoes and their classifications
  • Knowledge of mathematical bounds and their applications
  • Awareness of historical mathematical literature, particularly works by Martin Gardner
NEXT STEPS
  • Research combinatorial methods for counting polyominoes
  • Explore the implications of bounds in combinatorial problems
  • Investigate recent advancements in polyomino research
  • Study the historical context of unsolved mathematical problems
USEFUL FOR

Mathematicians, combinatorial theorists, and anyone interested in the complexities of polyomino enumeration and unsolved mathematical problems.

Aeneas
Messages
26
Reaction score
0
As far as I can make out, there is no formula available to calculate the number of free n-polyominoes, only bounds. Can you please confirm whether this is the case. If there is a formula, could you please point me to it. If there is not, is the problem just unsolved or has it been shown in some way to be insoluble?

At first sight, it looks as if it ought to be a simple formula to find, so if one cannot be found, is it possible to identify the reason why?

Thanks in anticipation.
 
Mathematics news on Phys.org


I think Martin Gardner has written in one of his many books that the problem is unsolved. That was a while ago though, back in the 60ies/70ies and a lot has happened since then. Typically though, most problems of this sort are difficult to solve.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 55 ·
2
Replies
55
Views
7K
  • · Replies 12 ·
Replies
12
Views
3K
Replies
1
Views
3K
Replies
12
Views
2K
Replies
2
Views
415
  • · Replies 6 ·
Replies
6
Views
1K