Related papers: Zig-zag Eulerian polynomials
The main purpose of this paper is to construct new families of special numbers with their generating functions. These numbers are related to the many well-known numbers, which are the Bernoulli numbers, the Fibonacci numbers, the Lucas…
The central binomial series at negative integers are expressed as a linear combination of values of certain two polynomials. We show that one of the polynomials is a special value of the bivariate Eulerian polynomial and the other…
We study the limiting behavior of the zeros of the Euler polynomials. When linearly scaled, they approach a definite curve in the complex plane related to the Szego curve which governs the behavior of the roots of the Taylor polynomials…
We derive an identity for certain linear combinations of polylogarithm functions with negative exponents, which implies relations for linear combinations of Eulerian numbers. The coefficients of our linear combinations are related to…
A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…
We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…
In this note we will present how Euler's investigations on various different subjects lead to certain properties of the Legendre polynomials. More precisely, we will show that the generating function and the difference equation for the…
We show that the Circular Orthogonal Ensemble of random matrices arises naturally from a family of random polynomials. This sheds light on the appearance of random matrix statistics in the zeros of the Riemann zeta-function.
We introduce the theory of $(\mathcal{P},\rho)$-partitions, depending on a poset $\mathcal{P}$ and a map $\rho$ from $\mathcal{P}$ to positive integers. The generating function $\mathfrak{F}_{\mathcal{P},\rho}$ of…
We study the minimal homogeneous generating sets of the Eulerian ideal associated with a simple graph and its maximal generating degree. We show that the Eulerian ideal is a lattice ideal and use this to give a characterization of binomials…
This paper has two primary contributions. First, we explore degenerate Sheffer-type polynomials, a hybrid of higher-order degenerate Bernoulli and Euler polynomials, and derive their properties. Second, assuming that the moment generating…
This paper investigates the Terwilliger algebra of some group association schemes related to codes. In addition, it also shows the generators of invariant rings appearing by E-polynomials.
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…
In combinatorics, a derangement is a permutation of the elements of a set, such that no element appears in its original position. The number of derangement of an n-element set is called the nth derangement number. Recently, the degenerate…
Binomial Eulerian polynomials first appeared in work of Postnikov, Reiner and Williams on the face enumeration of generalized permutohedra. They are $\gamma$-positive (in particular, palindromic and unimodal) polynomials which can be…
Let $\Phi$ be a root system. Postnikov introduced and studied the mixed $\Phi$-Eulerian numbers. These numbers indicate the mixed volumes of $\Phi$-hypersimplices. As specializations of these numbers, one can obtain the usual Eulerian…
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…
In this paper we use Euler-Seidel matrices method to find out some properties of exponential and geometric polynomials and numbers. Some known results are reproved and some new results are obtained.
The generalized Lucas numbers are polynomials in two variables with nonnegative integer coefficients. Lucas versions of some combinatorial numbers with known formulas in terms of quotient and products of nonnegative integers have been…
Every polynomial $P(X)\in \mathbb Z[X]$ satisfies the congruences $P(n+m)\equiv P(n) \mod m$ for all integers $n, m\ge 0$. An integer valued sequence $(a_n)_{n\ge 0}$ is called a pseudo-polynomial when it satisfies these congruences. Hall…