Counting with Two-Level Polynomials
The Electronic Journal of Combinatorics · 17.07.2026 · 33 (3)
DOI: 10.37236/14617 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 17.07.2026. Verfasst von Tristram Bogart und 1 weiteren Autor:innen.
Abstract (Originalsprache)
We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading coefficients. We carefully define these two-level polynomials, lay out their basic algebraic properties, and provide a schema for showing a function is a two-level polynomial. Using the schema, we prove that a variety of counting functions arising in different areas of combinatorics are two-level polynomials. These include chromatic polynomials for many infinite families of graphs, partitions of an integer into a given number of parts, placing non-attacking chess pieces on a board, Sidon sets, and Sheffer sequences (including binomial type and Appell sequences).
Zitieren
APA
Bogart, T., & Woods, K. (2026). Counting with Two-Level Polynomials. The Electronic Journal of Combinatorics, 33(3). https://doi.org/10.37236/14617
Vancouver
Bogart T, Woods K. Counting with Two-Level Polynomials. The Electronic Journal of Combinatorics. 2026;33(3). doi:10.37236/14617
BibTeX
@article{Bogart2026,
author = {Bogart, Tristram and Woods, Kevin},
title = {Counting with Two-Level Polynomials},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {3},
doi = {10.37236/14617}
}
EUVIMED