Related papers: Counting with two-level polynomials
Polynomial functions on the group of units Q_n of the ring Z_{2^n} are considered. A finite set of reduced polynomials RP_n in Z[x] that induces the polynomial functions on Q_n is determined. Each polynomial function on Q_n is induced by a…
In this article, the 2-iterated Sheffer polynomials are introduced by means of generating function and operational representation. Using the theory of Riordan arrays and relations between the Sheffer sequences and Riordan arrays, a…
Given a graph $G=(V,E)$ and a linear form $\lambda \in \mathbb{Z}_{ > 0 }^V$, Bajo et al. (2025) introduced the $q$-chromatic polynomial $\chi_G^\lambda(q,n) := \sum q^{\sum_{v \in V} \lambda_v c(v)}$ where the sum is over all proper…
In this article, the 2-iterated q-Appell family is introduced. Certain 2-iterated q-Appell and mixed type q-special polynomials are considered as members of this family. The numbers related to these polynomials are obtained. The determinant…
We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…
Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…
Let $\UT_n(q)$ denote the group of unipotent $n\times n$ upper triangular matrices over a field with $q$ elements. The degrees of the complex irreducible characters of $\UT_n(q)$ are precisely the integers $q^e$ with $0\leq e\leq \lfloor…
2-level polytopes naturally appear in several areas of pure and applied mathematics, including combinatorial optimization, polyhedral combinatorics, communication complexity, and statistics. In this paper, we present a study of some 2-level…
We develop a theory of two-parameter quantum polynomial functors. Similar to how (strict) polynomial functors give a new interpretation of polynomial representations of the general linear groups $\operatorname{GL}_n$, the two-parameter…
We discuss three distinct topics of independent interest; one in enumerative combinatorics, one in symmetric function theory, and one in algebraic geometry. The topic in enumerative combinatorics concerns a q-analog of a generalization of…
The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
We present combinatorial and analytical results concerning a Sheffer sequence with a generating function of the form $G(x,z)=Q(z)^{x}Q(-z)^{1-x}$, where $Q$ is a quadratic polynomial with real zeros. By using the properties of Riordan…
The chromatic polynomial and its generalization, the chromatic symmetric function, are two important graph invariants. Celebrated theorems of Birkhoff, Whitney, and Stanley show how both objects can be expressed in three different ways: as…
We establish, for every family of orthogonal polynomials in the $ q $-Askey scheme and the Askey scheme, a combinatorial model for mixed moments and coefficients in terms of paths on the lecture hall graph. This generalizes the previous…
In this sequence of work we investigate polynomial equations of additive functions. We consider the solutions of equation \[ \sum_{i=1}^{n}f_{i}(x^{p_{i}})g_{i}(x)^{q_{i}}= 0 \qquad \left(x\in \mathbb{F}\right), \] where $n$ is a positive…
Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…
This paper realizes of two families of combinatorial symmetric functions via the complex character theory of the finite general linear group $\mathrm{GL}_{n}(\mathbb{F}_{q})$: chromatic quasisymmetric functions and vertical strip LLT…