I am interested in the field with one element. I am thus interested in combinatorial interpretations of the Gaussian binomial coefficients. Richard Stanley's "Enumerative combinatorics" mentions that they count the number of $k$-dimensional vector subspaces of an $n$-dimensional vector space over a finite field $F_q$ of characteristic $q$. He mentions that they also count the number of Young tableaux that fit in a $k \times (n-k)$ rectangle where each cell has weight $q$. However, he doesn't mention the following interpretation in terms of simplexes and I would like to know if there is any related literature or if it seems original.

Give the vertices of an $n$-simplex weights $1,$ $q,$ $q_2,$ $\ldots,$ $q_{n-1}$ and give weight $1/q$ to each edge. Define the weight of a $k$-simplex to be the product of the weights of its vertices and edges. Then the Gaussian binomial coefficients enumerate the $k$-simplexes within the $n$-simplex. This can be seen by induction from the recurrence relation where given a new vertex of weight $q_{n-1}$, and calculating the polynomial for the $k$-simplexes, we sum the "existing solutions" $[n-1 \:\: k]$ and the "newly possible solutions" $[n-1 \:\: k-1]$ times the weight $q^{n-k}$. The $n$-th vertex, when used in a newly possible solution, contributes weight $q^{n-1}$ and its $k-1$ edges to the other vertices of the $k$-simplex contribute weight $q^{-(k-1)}$ for a total contribution of $q^{n-1}/q^{k-1} = q^{n-k}$.

The $n$-simplex models a total order, that is, an ordered set. The $k$-simplex models an ordered subset. When $q=1$, then we get unordered subsets of an unordered set. This sheds light on a vector space as intrinsically having, in practice, an ordered canonical basis which is constructed or deconstructed. Typically, in constructing the basis, we create elements $e_1$, then $e_2 + f_1\cdot e_1$, $e_3 + f_2\cdot e_2 + f_1\cdot e_1$ where each field element $f_i$ contributes weight $q$. The exponents of these weights indicate an order on the basis elements. When $q=1$, then there is only one scalar, there is no real choice and so there is no way to order the basis elements based on that choice. I wish to know what is known about all of this and where I might take this further? Thank you!

I am interested in the field with one element. I am thus interested in combinatorial interpretations of the Gaussian binomial coefficients. Richard Stanley's "Enumerative combinatorics" mentions that they count the number of $k$-dimensional vector subspaces of an $n$-dimensional vector space over a finite field $F_q$ of characteristic $q$. He mentions that they also count the number of Young tableaux that fit in a $k \times (n-k)$ rectangle where each cell has weight $q$. However, he doesn't mention the following interpretation in terms of simplexes and I would like to know if there is any related literature or if it seems original.

Give the vertices of an $n$-simplex weights $1,$ $q,$ $q^2,$ $\ldots,$ $q^{n-1}$ and give weight $1/q$ to each edge. Define the weight of a $k$-simplex to be the product of the weights of its vertices and edges. Then the Gaussian binomial coefficients enumerate the $k$-simplexes within the $n$-simplex. This can be seen by induction from the recurrence relation where given a new vertex of weight $q^{n-1}$, and calculating the polynomial for the $k$-simplexes, we sum the "existing solutions" $[n-1 \:\: k]$ and the "newly possible solutions" $[n-1 \:\: k-1]$ times the weight $q^{n-k}$. The $n$-th vertex, when used in a newly possible solution, contributes weight $q^{n-1}$ and its $k-1$ edges to the other vertices of the $k$-simplex contribute weight $q^{-(k-1)}$ for a total contribution of $q^{n-1}/q^{k-1} = q^{n-k}$.

The $n$-simplex models a total order, that is, an ordered set. The $k$-simplex models an ordered subset. When $q=1$, then we get unordered subsets of an unordered set. This sheds light on a vector space as intrinsically having, in practice, an ordered canonical basis which is constructed or deconstructed. Typically, in constructing the basis, we create elements $e_1$, then $e_2 + f_1\cdot e_1$, $e_3 + f_2\cdot e_2 + f_1\cdot e_1$ where each field element $f_i$ contributes weight $q$. The exponents of these weights indicate an order on the basis elements. When $q=1$, then there is only one scalar, there is no real choice and so there is no way to order the basis elements based on that choice. I wish to know what is known about all of this and where I might take this further? Thank you!

I am interested in the field with one element. I am thus interested in combinatorial interpretations of the Gaussian binomial coefficients. Richard Stanley's "Enumerative combinatorics" mentions that they count the number of k-dimensional vector subspaces of an n-dimensional vector space over a finite field Fq of characteristic q. He mentions that they also count the number of Young tableaux that fit in a k x (n-k) rectangle where each cell has weight q. However, he doesn't mention the following interpretation in terms of simplexes and I would like to know if there is any related literature or if it seems original.

Give the vertices of an n-simplex weights 1, q, q2, ..., qn-1 and give weight 1/q to each edge. Define the weight of a k-simplex to be the product of the weights of its vertices and edges. Then the Gaussian binomial coefficients enumerate the k-simplexes within the n-simplex. This can be seen by induction from the recurrence relation where given a new vertex of weight qn-1, and calculating the polynomial for the k-simplexes, we sum the "existing solutions" [n-1 k] and the "newly possible solutions" [n-1 k-1] x the weight q^(n-k). The nth vertex, when used in a newly possible solution, contributes weight q^(n-1) and its k-1 edges to the other vertices of the k-simplex contribute weight q^-(k-1) for a total contribution of q^(n-1)/q^(k-1) = q^(n-k).

The n-simplex models a total order, that is, an ordered set. The k-simplex models an ordered subset. When q=1, then we get unordered subsets of an unordered set. This sheds light on a vector space as intrinsically having, in practice, an ordered canonical basis which is constructed or deconstructed. Typically, in constructing the basis, we create elements e1, then e2 + f1e1, e3 + f2e2 + f1*e1 where each field element fi contributes weight q. The exponents of these weights indicate an order on the basis elements. When q=1, then there is only one scalar, there is no real choice and so there is no way to order the basis elements based on that choice. I wish to know what is known about all of this and where I might take this further? Thank you!

I am interested in the field with one element. I am thus interested in combinatorial interpretations of the Gaussian binomial coefficients. Richard Stanley's "Enumerative combinatorics" mentions that they count the number of $k$-dimensional vector subspaces of an $n$-dimensional vector space over a finite field $F_q$ of characteristic $q$. He mentions that they also count the number of Young tableaux that fit in a $k \times (n-k)$ rectangle where each cell has weight $q$. However, he doesn't mention the following interpretation in terms of simplexes and I would like to know if there is any related literature or if it seems original.

Give the vertices of an $n$-simplex weights $1,$ $q,$ $q_2,$ $\ldots,$ $q_{n-1}$ and give weight $1/q$ to each edge. Define the weight of a $k$-simplex to be the product of the weights of its vertices and edges. Then the Gaussian binomial coefficients enumerate the $k$-simplexes within the $n$-simplex. This can be seen by induction from the recurrence relation where given a new vertex of weight $q_{n-1}$, and calculating the polynomial for the $k$-simplexes, we sum the "existing solutions" $[n-1 \:\: k]$ and the "newly possible solutions" $[n-1 \:\: k-1]$ times the weight $q^{n-k}$. The $n$-th vertex, when used in a newly possible solution, contributes weight $q^{n-1}$ and its $k-1$ edges to the other vertices of the $k$-simplex contribute weight $q^{-(k-1)}$ for a total contribution of $q^{n-1}/q^{k-1} = q^{n-k}$.

The $n$-simplex models a total order, that is, an ordered set. The $k$-simplex models an ordered subset. When $q=1$, then we get unordered subsets of an unordered set. This sheds light on a vector space as intrinsically having, in practice, an ordered canonical basis which is constructed or deconstructed. Typically, in constructing the basis, we create elements $e_1$, then $e_2 + f_1\cdot e_1$, $e_3 + f_2\cdot e_2 + f_1\cdot e_1$ where each field element $f_i$ contributes weight $q$. The exponents of these weights indicate an order on the basis elements. When $q=1$, then there is only one scalar, there is no real choice and so there is no way to order the basis elements based on that choice. I wish to know what is known about all of this and where I might take this further? Thank you!