Related papers: Caylerian polynomials
In this paper, we consider Hermite and poly-Bernoulli mixed-type polynomials and investigate the properties of those polynomials which are derived from umbral calculus. Finally, we give various identities associated with Stirling numbers,…
We present a method to compute the Euler characteristic of an algebraic subset of $\bc^n$. This method relies on clasical tools such as Gr\"obner basis and primary decomposition. The existence of this method allows us to define a new…
We introduce the generalized degenerate Euler-Genocchi polynomials as a degenerate version of the Euler-Genocchi polynomials. In addition, we introduce their higher-order version, namely the generalized degenerate Euler-Genocchi polynomials…
We prove that the enumerative polynomials of generalized Stirling permutations by the statistics of plateaux, descents and ascents are partial $\gamma$-positive. Specialization of our result to the Jacobi-Stirling permutations confirms a…
We compute the compactly supported Euler characteristic of the space of degree $d$ irreducible polynomials in $n$ variables with real coefficients and show that the values are given by the digits in the so-called balanced binary expansion…
In this paper we first present summation formulas for $k$-order Eulerian polynomials and $1/k$-Eulerian polynomials. We then present combinatorial expansions of $(c(x)D)^n$ in terms of inversion sequences as well as $k$-Young tableaux,…
Carlitz and Scoville in 1973 considered a four variable polynomial that enumerates permutations in $\mathfrak{S}_n$ with respect to the parity of its descents and ascents. In recent work, Pan and Zeng proved a $q$-analogue of…
A permutation is defined to be cycle-up-down if it is a product of cycles that, when written starting with their smallest element, have an up-down pattern. We prove bijectively and analytically that these permutations are enumerated by the…
In a paper by Lin an interesting family of semipermutations comes out to index the elements of a cohomology basis of a Hessenberg type variety. The corresponding Betti numbers are a generalization of Eulerian numbers. We show three…
By considering Eulerian numbers and ordered Stirling numbers of the second and third kinds over a multiset, we generalize identities of Eulerian numbers and Stirling numbers of the second and third kinds and provide $q$-analogs of these…
Character polynomials are used to study the restriction of a polynomial representation of a general linear group to its subgroup of permutation matrices. A simple formula is obtained for computing inner products of class functions given by…
We construct a bijection from permutations to some weighted Motzkin paths known as Laguerre histories. As one application of our bijection, a neat $q$-$\gamma$-positivity expansion of the $(\inv,\exc)$-$q$-Eulerian polynomials is obtained.
We develop a nonstandard approach to exploring polynomials associated with peaks and runs of permutations. With the aid of a context-free grammar, or a set of substitution rules, one can perform a symbolic calculus, and the computation…
We study a new class of palindromic descent polynomials. Given a Dyck path $d$ of semilength $n$ and a permutation $\sigma$ of size $n$, one can label the up-steps and down-steps of $d$ with the elements of $\sigma$. The labeled Dyck path…
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…
In the present paper, we introduce Eulerian polynomials with a and b parameters and give the definition of them. By using the definition of generating function for our polynomials, we derive some new identities in Theory of Analytic…
It is known that Euler numbers, defined as the Taylor coefficients of the tangent and secant functions, count alternating permutations in the symmetric group. Springer defined a generalization of these numbers for each finite Coxeter group…
In recent years, the notion of characteristic polynomial of representations of Lie algebras has been widely studied. This paper provides more properties of these characteristic polynomials. For simple Lie algebras, we characterize the…
The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solutions to a dual recursion. Exploiting connections with random…
We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.