In this article we count tame - and -frieze patterns with width over a finite field , as well as some tame -frieze patterns for higher . Let . We consider the sets of tuples of points in the projective space , such that consecutive points are always independent (the first and last point in the tuple are considered to be consecutive). First assume . In this case, we prove that the problem of counting tame -frieze patterns can be reduced to counting . We also show that is essentially already known as long as and are coprime, and we derive the number of tame -frieze-patterns in that case. In the case , we define certain subsets and show that it is sufficient to count these sets. Afterwards, we count in the cases and and thus the number of tame - and -frieze patterns for any width .

生成讲解博客的中文版本

生成AI智能校验的中文版本