1 paper
Hiram H. López, Rodrigo San-José, Nart Shalqini
Given an ordered set B of a finite field, a combinatorial simplex over B is defined as the set of vectors such that the positions of the entries, with respect to B, sum up to…