English

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

Combinatorics 2026-01-14 v2

Abstract

In this article we count tame SL3 SL_3 - and SL4 SL_4 -frieze patterns with width w w over a finite field K K , as well as some tame SLk SL_k -frieze patterns for higher k k . Let n=w+k+1 n = w + k + 1 . We consider the sets Ck(n) C_k(n) of tuples of n n points in the projective space Pk1(K) \mathbb{P}^{k-1}(K) , such that k k consecutive points are always independent (the first and last point in the tuple are considered to be consecutive). First assume gcd(k,n)=1 \gcd(k,n) = 1 . In this case, we prove that the problem of counting tame SLk SL_k -frieze patterns can be reduced to counting Ck(n) C_k(n) . We also show that Ck(n) \lvert C_k(n) \rvert is essentially already known as long as k k and n n are coprime, and we derive the number of tame SLk SL_k -frieze-patterns in that case. In the case gcd(k,n)1 \gcd(k,n) \neq 1 , we define certain subsets Ck(n) C_k^*(n) and show that it is sufficient to count these sets. Afterwards, we count Ck(n) C_k^*(n) in the cases k=3 k = 3 and k=4 k = 4 and thus the number of tame SL3 SL_3 - and SL4 SL_4 -frieze patterns for any width w w .

Keywords

Cite

@article{arxiv.2505.04563,
  title  = {Counting tame $SL_3$- and $SL_4$- frieze patterns over finite fields},
  author = {Lucas Surmann},
  journal= {arXiv preprint arXiv:2505.04563},
  year   = {2026}
}

Comments

Unlike the previous version of this article this version includes the complete case $ k=4 $. It also includes a result by Galashin and Lam that allows us to give a complete answer in the case $ \gcd(k,n) = 1 $