Related papers: Eulerian Polynomials for Digraphs
In 1971 Griffiths used a generating function to define polynomials in d variables orthogonal with respect to the multinomial distribution. The polynomials possess a duality between the discrete variables and the degree indices. In 2004…
We show that, for any graph $F$ and $\eta>0$, there exists a $d_0=d_0(F,\eta)$ such that every $n$-vertex $d$-regular graph with $d \geq d_0$ has a collection of vertex-disjoint $F$-subdivisions covering at least $(1-\eta)n$ vertices. This…
A permutation sigma in Sn is a k-derangement if for any subset X = {a1, . . ., ak} \subseteq [n], {sigma(a1), . . ., sigma(ak)} is not equal to X. One can form the k-derangement graph on the set of permutations of Sn by connecting two…
We relate properties of weighted flags (or multiflags) of type AD to statistics of the corresponding Weyl groups. For type A, we recover the Mahonian statistics on symmetric groups. Finally, we sketch briefly an easy extension incorporating…
The Euler numbers have been widely studied. A signed version of the Euler numbers of even subscript are given by the coefficients of the exponential generating function 1/(1+x^2/2!+x^4/4!+...). Leeming and MacLeod introduced a…
Pondering upon the grammatical labeling of 0-1-2 increasing plane trees, we come to the realization that the grammatical labels play a role as records of chopped off leaves of the original increasing binary trees. While such an…
We continue to investigate the relation between the Mahler measure of certain two variable polynomials, the values of the Bloch--Wigner dilogarithm $D(z)$ and the values $\zeta_F(2)$ of zeta functions of number fields. Specifically, we…
We propose a general method to construct symmetric tensor polynomials in the D-dimensional Euclidean space which are orthonormal under a general weight. The D-dimensional Hermite polynomials are a particular case of the present ones for the…
Let $\mathcal{C}$ be a class of graphs that is closed under taking subgraphs. We prove that if for some fixed $0<\delta\le 1$, every $n$-vertex graph of $\mathcal{C}$ has a balanced separator of order $O(n^{1-\delta})$, then any depth-$k$…
The descent polynomials of separable permutations and derangements are both demonstrated to be unimodal. Moreover, we prove that the $\gamma$-coefficients of the first are positive with an interpretation parallel to the classical Eulerian…
We use the method of mutual interlacing to prove two conjectures on the real-rootedness of Eulerian-like polynomials: Brenti's conjecture on $q$-Eulerian polynomials for Weyl groups of type $D$, and Dilks, Petersen, and Stembridge's…
The goal of this short paper to advertise the method of gauge transformations (aka holographic reduction, reparametrization) that is well-known in statistical physics and computer science, but less known in combinatorics. As an application…
The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the…
The theory of orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to functional-difference…
We consider decompositions of digraphs into edge-disjoint paths and describe their connection with the $n$-th Weyl algebra of differential operators. This approach gives a graph-theoretic combinatorial view of the normal ordering problem…
For each graph, we construct a bigraded chain complex whose graded Euler characteristic is a version of the Tutte polynomial. This work is motivated by earlier work of Khovanov, Helme-Guizon and Rong, and others.
Gamma-positivity is an elementary property that polynomials with symmetric coefficients may have, which directly implies their unimodality. The idea behind it stems from work of Foata, Sch\"utzenberger and Strehl on the Eulerian…
We study the roots of generalized Eulerian polynomials via a novel approach. We interpret Eulerian polynomials as the generating polynomials of a statistic over inversion sequences. Inversion sequences (also known as Lehmer codes or…
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…
We derive precise formulas for the archimedean Euler factors occurring in certain standard Langlands $L$-functions for unitary groups. In the 1980s, Paul Garrett, as well as Ilya Piatetski-Shapiro and Stephen Rallis (independently of…