Related papers: Signed Mahonian Polynomials on Colored Derangement…

We prove a canonical polynomial Van der Waerden's Theorem. More precisely, we show the following. Let $\{p_1(x),\ldots,p_k(x)\}$ be a set of polynomials such that $p_i(x)\in \mathbb{Z}[x]$ and $p_i(0)=0$, for every $i\in \{1,\ldots,k\}$.…

Each degree $n+k$ polynomial of the form $(x+1)^k(x^n+c_1x^{n-1}+\cdots +c_n)$, $k\in \mathbb{N}$, is representable as Schur-Szeg\H{o} composition of $n$ polynomials of the form $(x+1)^{n+k-1}(x+a_j)$. We study properties of the affine…

In this paper, we study Eulerian polynomials for permutations and signed permutations of the multiset $\{1,1,2,2,\ldots,n,n\}$. Properties of these polynomials, including recurrence relations and unimodality are discussed. In particular, we…

We investigate the $\alpha$-colored Eulerian polynomials and a notion of descents introduced in a recent paper of Hedmark and show that such polynomials can be computed as a polynomial encoding descents computed over a quotient of the…

A difficult problem in the theory of random tensors is to calculate the expectation values of polynomials in the tensor entries, even in the large N limit and in a Gaussian distribution. Here we address this issue, focusing on a family of…

For a set of permutations $S\subseteq S_n$, consider the quasisymmetric generating function $$Q(S): = \sum_{w\in S}F_{n, \mathrm{Des}(w)},$$ where $\mathrm{Des}(w) := \{i\mid w(i)> w(i+1)\}$ is the descent set of $w$ and $F_{n,…

Let $w$ be any word over the alphabet $\{0,1,\ldots, q-1\}$, and denote by $h$ either a polynomial of degree $d\geq 1$ or $h: n\mapsto m^n$ for a fixed $m$. Furthermore, denote by $e_q(w;h(n))$ the number of occurrences of $w$ as a subword…

Given a polynomial \( H(x) \) over \(\mathbb{F}_{q^n}\), we study permutation polynomials of the form \( x + \gamma \mathrm{Tr}(H(x)) \) over \(\mathbb{F}_{q^n}\). Let \[P_H=\{\gamma\in \mathbb{F}_{q^n} : x+\gamma \mathrm{Tr}(H(x))~\text{is…

Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…

We propose and study the properties of a set of polynomials $M_{n\alpha, H\ }^{s}(z)$, $C_{n\alpha, H}^{s}(z)$ $W_{n\alpha, H}^{s}(z)$ with $n,s\in N$ $;\alpha =\pm 1;$and where $H$ stands for Hermite ; the ''root '' polynomial >.These…

Wreath Macdonald polynomials arise from the geometry of $\Gamma$-fixed loci of Hilbert schemes of points in the plane, where $\Gamma$ is a finite cyclic group of order $r\ge 1$. For $r=1$, they recover the classical (modified) Macdonald…

In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P,…

The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components.…

In this note, we study the polynomial representation of the quantum Olshanetsky-Perelomov system for a finite reflection group $W$ of type $B_n$. We endow the polynomial ring ${\mathbb C} [x_1,\ldots\\\ldots, x_n]$ with a structure of…

The \emph{Wiener polynomial} of a connected graph $G$ is the polynomial $W(G;x) = \sum_{i=1}^{D(G)} d_i(G)x^i$ where $D(G)$ is the diameter of $G$, and $d_i(G)$ is the number of pairs of vertices at distance $i$ from each other. We examine…

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

We study the differential uniformity of the Wan-Lidl polynomials over finite fields. A general upper bound, independent of the order of the field, is established. Additional bounds are established in settings where one of the parameters is…

We consider the sum of dichromatic polynomials over non-separable rooted planar maps, an interesting special case of which is the enumeration of such maps. We present some known results and derive new ones. The general problem is equivalent…

Let G be a graph. The black-white polynomial W_G(t) enumerates colorings of the vertices of G with two colors (black and white), where the power of t keeps track of how many white vertices have an even number of black neighbors. Such…

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…