中文
相关论文

相关论文: A New Approach to Signed Eulerian Numbers

200 篇论文

The Euler number $E_n$ (resp. Entringer number $E_{n,k}$) enumerates the alternating (down-up) permutations of $\{1,\dots,n\}$ (resp. starting with $k$). The Springer number $S_n$ (resp. Arnold number $S_{n,k}$) enumerates the type $B$…

组合数学 · 数学 2022-03-22 Heesung Shin , Jiang Zeng

The study of degenerate versions of certain special polynomials and numbers, which was initiated by Carlitz's work on degenerate Euler and degenerate Bernoulli polynomials, has recently seen renewed interest among mathematicians. The aim of…

数论 · 数学 2025-01-13 Taekyun Kim , Dae san Kim

This note highlights an interesting connection between Euler sums of even weight and prime numbers.

综合数学 · 数学 2008-03-14 Donal F. Connon

We give several families of polynomials which are related by Eulerian summation operators. They satisfy interesting combinatorial properties like being integer-valued at integral points. This involves nearby-symmetries and a recursion for…

组合数学 · 数学 2018-07-31 Kathrin Maurischat , Rainer Weissauer

Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…

数论 · 数学 2023-11-23 Neha Elizabeth Thomas , K Vishnu Namboothiri

In this paper, we will define general Eulerian numbers and Eulerian polynomials based on general arithmetic progressions. Under the new definitions, we have been successful in extending several well-known properties of traditional Eulerian…

组合数学 · 数学 2012-07-03 Tingyao Xiong , Hung-ping Tsao , Jonathan I. Hall

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…

组合数学 · 数学 2009-09-30 Emeric Deutsch , Sergi Elizalde

In the present paper we generalize the Eulerian numbers (also of the second and third orders). The generalization is connected with an autonomous first-order differential equation, solutions of which are used to obtain integral…

组合数学 · 数学 2023-07-07 Grzegorz Rzadkowski , Malgorzata Urlinska

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…

组合数学 · 数学 2007-05-23 John Shareshian , Michelle L. Wachs

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.

组合数学 · 数学 2020-02-18 Sumit Kumar Jha

Let $\Bigl\langle\matrix{n\cr k}\Bigr\rangle$, $\Bigl\langle\matrix{B_n\cr k}\Bigr\rangle$, and $\Bigl\langle\matrix{D_n\cr k}\Bigr\rangle$ be the Eulerian numbers in the types A, B, and D, respectively -- that is, the number of…

计算机科学中的逻辑 · 计算机科学 2024-02-14 Luigi Santocanale

We define a generalization of the Eulerian polynomials and the Eulerian numbers by considering a descent statistic on segmented permutations coming from the study of 2-species exclusion processes and a change of basis in a Hopf algebra. We…

组合数学 · 数学 2018-05-07 Arthur Nunge

By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…

组合数学 · 数学 2024-04-16 Nadia Na Li , Wenchang Chu

The powers of matrices with Stirling number-coefficients are investigated. It is revealed that the elements of these matrices have a number of properties of the ordinary Stirling numbers. Moreover, "higher order" Bell, Fubini and Eulerian…

组合数学 · 数学 2008-12-23 Istvan Mezo

In this paper, we first present combinatorial proofs of a kind of expansions of the Eulerian polynomials of types A and B, and then we introduce Stirling permutations of the second kind. In particular, we count Stirling permutations of the…

组合数学 · 数学 2016-07-07 Shi-Mei Ma , Yeong-Nan Yeh

An odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$. Similarly, an even perfect number $M$ is said to be given in Euclidean form if $M…

数论 · 数学 2017-08-28 Jose Arnaldo B. Dris

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…

代数几何 · 数学 2025-02-10 Gaku Liu , Mateusz Michałek , Julian Weigert

The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…

数论 · 数学 2018-05-16 Yilmaz Simsek

In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…

数论 · 数学 2008-08-14 Taekyun Kim

The object of this paper is to give a systematic treatment of excedance-type polynomials. We first give a sufficient condition for a sequence of polynomials to have alternatingly increasing property, and then we present a systematic study…

组合数学 · 数学 2021-04-05 Shi-Mei Ma , Jun Ma , Jean Yeh , Yeong-Nan Yeh