Related papers: Th\'eorie G\'eom\'etrique des Polyn\^omes Eul\'eri…
For every positive integer $n\in \mathbb{Z}_+$ we define an `Euler polynomial' $\mathscr{E}_n(t)\in \mathbb{Z}[t]$, and observe that for a fixed $n$ all Chern numbers (as well as other numerical invariants) of all smooth hypersurfaces in…
In this paper, we establish more properties of generalized poly-Euler polynomials with three parameters and we investigate a kind of symmetrized generalization of poly- Euler polynomials. Moreover, we introduce a more general form of multi…
In this study we introduce a second type of higher order generalised geometric polynomials. This we achieve by examining the generalised stirling numbers $S(n; k;\alpha;\beta;\gamma)$ [Hsu & Shiue,1998] for some negative arguments. We study…
We use some basic properties of binomial and Stirling numbers to prove that the Euler characteristic is, essentially, the unique numerical topological invariant for compact polyhedra which can be expressed as a linear combination of the…
The Eulerian numbers form a triangular array with many interesting properties. The numbers arise from various combinatorial and probabilistic interpretations, and have been studied in a variety of mathematical contexts. In this article we…
E158 in the Enestrom index. Translation of the Latin original "Observationes analyticae variae de combinationibus" (1741). This paper introduces the problem of partitions, or partitio numerorum (the partition of integers). In the first part…
Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, we define a new polynomial related to the higher-order generalized…
The Euler-Maclaurin summation formula is generalized to a modified form by expanding the periodic Bernoulli polynomials as its Fourier series and taking cuts, which includes both the Euler-Maclaurin summation formula and the Poission…
This is a textbook about elementary number theory, with emphasis on classical topics around the Euklidean Algorithm.
In the present article, we introduce a $(p,q)$-analogue of the poly-Euler polynomials and numbers by using the $(p,q)$-polylogarithm function. These new sequences are generalizations of the poly-Euler numbers and polynomials. We give…
The relations between the Bernoulli and Eulerian polynomials of higher order and the complete Bell polynomials are found that lead to new identities for the Bernoulli and Eulerian polynomials and numbers of higher order. General form of…
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…
The $(q,r)$-Eulerian polynomials are the $(\maj-$$\exc,\fix,\exc)$ enumerative polynomials of permutations. Using Shareshian and Wachs' exponential generating function of these Eulerian polynomials, Chung and Graham proved two symmetrical…
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…
E30 in the Enestrom index. Translated from the Latin original "De formis radicum aequationum cuiusque ordinis coniectatio" (1733). For an equation of degree n, Euler wants to define a "resolvent equation" of degree n-1 whose roots are…
We introduce the Primitive Eulerian polynomial $P_{\cal A}(z)$ of a central hyperplane arrangement ${\cal A}$. It is a reparametrization of its cocharacteristic polynomial. Previous work of the first author implicitly show that, for…
In recent, H. Sun defined a new kind of refined Eulerian polynomials, namely, \begin{eqnarray*} A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)} \end{eqnarray*} for $n\geq 1$, where ${odes}(\pi)$ and ${edes}(\pi)$…
Eulerian polynomials record the distribution of descents over permutations. Caylerian polynomials likewise record the distribution of descents over Cayley permutations, where a Cayley permutation is a word of positive integers such that if…
In this paper, we explore (slightly generalized) $f$-Eulerian polynomials introduced by Stanley and frequently appearing in combinatorics. Notable special cases include the classical Eulerian polynomials, the generating polynomials of order…
By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.