English

Simplices for Numeral Systems

Combinatorics 2017-10-05 v2

Abstract

The family of lattice simplices in Rn\mathbb{R}^n formed by the convex hull of the standard basis vectors together with a weakly decreasing vector of negative integers include simplices that play a central role in problems in enumerative algebraic geometry and mirror symmetry. From this perspective, it is useful to have formulae for their discrete volumes via Ehrhart hh^\ast-polynomials. Here we show, via an association with numeral systems, that such simplices yield hh^\ast-polynomials with properties that are also desirable from a combinatorial perspective. First, we identify nn-simplices in this family that associate via their normalized volume to the nthn^{th} place value of a positional numeral system. We then observe that their hh^\ast-polynomials admit combinatorial formula via descent-like statistics on the numeral strings encoding the nonnegative integers within the system. With these methods, we recover ubiquitous hh^\ast-polynomials including the Eulerian polynomials and the binomial coefficients arising from the factoradic and binary numeral systems, respectively. We generalize the binary case to base-rr numeral systems for all r2r\geq2, and prove that the associated hh^\ast-polynomials are real-rooted and unimodal for r2r\geq2 and n1n\geq1.

Keywords

Cite

@article{arxiv.1706.00480,
  title  = {Simplices for Numeral Systems},
  author = {Liam Solus},
  journal= {arXiv preprint arXiv:1706.00480},
  year   = {2017}
}

Comments

15 pages; To appear in Transactions of the AMS

R2 v1 2026-06-22T20:06:54.595Z