Related papers: Two-sided Eulerian numbers via balls in boxes
Article presents a short investigation into some properties of the Moser polynomials which appear in various problems from algebraic combinatorics. For instance, these polynomials can be used to solve the Generalized Moser's Problem on…
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
In this research announcement we present a new q-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or…
We prove certain identities involving Euler and Bernoulli polynomials that can be treated as recurrences. We use these and also other known identities to indicate connection of Euler and Bernoulli numbers with entries of inverses of certain…
We study several variants of Euler sums by using the methods of contour integration and residue theorem. These variants exhibit nice properties such as closed forms, reduction, etc., like classical Euler sums. In addition, we also define a…
We define the Euler number of a bipartite graph on $n$ vertices to be the number of labelings of the vertices with $1,2,...,n$ such that the vertices alternate in being local maxima and local minima. We reformulate the problem of computing…
We define some generalizations of the classical descent and inversion statistics on signed permutations that arise from the work of Sack and Ulfarsson [20] and called after width-k descents and width-k inversionsof type A in Davis's work…
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…
Below, we summarize the appearances and possible uses of the two-sided approach and the two-sided counting in the most diverse areas of (secondary) school mathematics.
A variety of descent and major-index statistics have been defined for symmetric groups, hyperoctahedral groups, and their generalizations. Typically associated to pairs of such statistics is an Euler--Mahonian distribution, a bivariate…
We introduce a guessing game, permutation Wordle, in which a guesser attempts to recover a hidden permutation in $S_n$. In each round, the guesser guesses a permutation (using information from previous rounds) and is told which entries of…
The number of alternating runs is a natural permutation statistic. We show it can be used to define some commutative subalgebras of the symmetric group algebra, and more precisely of the descent algebra. The Eulerian peak algebras naturally…
In this paper, first, I introduce two-layered numbers. Two-layered numbers are positive integers that their positive divisors except 1 can be partitioned into two disjoint subsets. Similarly, I defined a half-layered number as a positive…
In this paper, we revisit foundations of umbral calculus using a straightforward approach based on an explicit matrix realization of binomial convolution. We construct an umbral duality of Wronskian type for rational curves in echelon form,…
A descent of a labeled digraph is a directed edge (s, t) with s > t. We count strong tournaments, strong digraphs, and acyclic digraphs by descents and edges. To count strong tournaments we use Eulerian generating functions and to count…
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 derive two new identities involving the Bernoulli numbers, the Euler numbers, and the Stirling numbers of the first kind using analytic continuation of a well known identity for the Stirling numbers of the first kind.
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.
We consider different generalizations of the Euler formula and discuss the properties of the associated trigonometric functions. The problem is analyzed from different points of view and it is shown that it can be formulated in a natural…
Motivated by the difficulty to solve numerically the weakly compressible 1D isentropic Euler equations with classical methods, we develop in this paper a two scale numerical method on this model. This method is based on two scale…