Counting tame $SL_3$- and $SL_4$- frieze patterns over finite fields
Lucas Surmann

TL;DR
This paper counts tame SL_3 and SL_4 frieze patterns over finite fields by relating them to configurations of points in projective space, providing explicit counts for various widths and parameters.
Contribution
It introduces a method to count tame SL_k frieze patterns over finite fields by reducing the problem to counting specific point configurations, extending previous knowledge.
Findings
Derived explicit formulas for counting tame SL_3 and SL_4 frieze patterns.
Reduced counting problems to known configurations in projective space.
Provided counts for all widths w in the cases k=3 and k=4.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Advanced Differential Equations and Dynamical Systems · Chaos-based Image/Signal Encryption
