Related papers: A unified approach to combinatorial triangles: a g…
Recently there has been a renewed interest in asymptotic Euler-MacLaurin formulas, partly due to applications to spectral theory of differential operators. Using elementary means, we recover such formulas for compactly supported smooth…
We introduce new generalizations of the Bernoulli, Euler, and Genocchi polynomials and numbers based on the Carlitz-Tsallis degenerate exponential function and concepts of the Umbral Calculus associated with it. Also, we present…
Ma-Ma-Yeh made a beautiful observation that a transformation of the grammar of Dumont instantly leads to the $\gamma$-positivity of the Eulerian polynomials. We notice that the transformed grammar bears a striking resemblance to the grammar…
Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…
We present explicit formulas for the Macdonald polynomials of types $C_n$ and $D_n$ in the one-row case. In view of the combinatorial structure, we call them "tableau formulas". For the construction of the tableau formulas, we apply some…
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…
We introduce a family of quasisymmetric functions called {\em Eulerian quasisymmetric functions}, which have the property of specializing to enumerators for the joint distribution of the permutation statistics, major index and excedance…
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…
We show how Andrews' generating functions for generalized Frobenius partitions can be understood within the theory of Eichler and Zagier as specific coefficients of certain Jacobi forms. This reformulation leads to a recursive process which…
We study the joint distribution of descents and inverse descents over the set of permutations of n letters. Gessel conjectured that the two-variable generating function of this distribution can be expanded in a given basis with nonnegative…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…
In a previous paper, Rahmani introduced a new family of p-Bernoulli numbers and polynomials by means of the Gauss hypergeometric function. Motivated by this paper and as a degenerate version of those numbers and polynomials, we introduce…
This paper introduces a degenerate version of the Euler-Seidel method by incorporating a parameter lambda into the classical recurrence relation. We define a degenerate Euler-Seidel matrix associated with an initial sequence and establish…
We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical…
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 derive explicit formulas for the matroidal mixed Eulerian numbers. We resolve a question posed by Berget, Spink, and Tseng, demonstrating that the invariant defined by matroidal mixed Eulerian numbers is precisely equivalent to Derksen's…
It is shown that Euler's theorem for graphs can be generalized for 2-complexes. Two notions that generalize cycle and Eulerian tour are introduced (``circlet'' and ``Eulerian cover''), and we show that for a strongly-connected, pure…
We study the integrals of type $I(a)=\int_{O_n}\prod u_{ij}^{a_{ij}}\,du$, depending on a matrix $a\in M_{p\times q}(\mathbb N)$, whose exact computation is an open problem. Our results are as follows: (1) an extension of the "elementary…
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…
In this paper, we introduce the notion of a grammatical labeling to describe a recursive process of generating combinatorial objects based on a context-free grammar. For example, by labeling the ascents and descents of a Stirling…