中文
相关论文

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

200 篇论文

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…

历史与综述 · 数学 2007-11-26 Leonhard Euler

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…

组合数学 · 数学 2026-01-27 Giovanni Gaiffi , Giovanni Interdonato

The ordinary factorial may be written in terms of the Stirling numbers of the second kind as shown by Quaintance and Gould and the odd double factorial in terms of the Stirling numbers of the first kind as shown by Callan. During the…

组合数学 · 数学 2018-11-27 Saud Hussein

We transformed the generalized exponential power series to another functional form suitable for further analysis. By applying the Cauchy-Euler differential operator in the form of an exponential operator, the series became a sum of…

综合数学 · 数学 2017-01-04 Henrik Stenlund

A result of Legendre asserts that the difference between the numbers of (length) even and odd partitions of $n$ into distinct parts is $0$, $1$, or $-1$; this also follows from Euler's pentagonal number theorem. We establish an analogous…

组合数学 · 数学 2024-05-07 Jia Huang

A Parity Alternating Permutation of the set $[n] = \{1, 2,\ldots, n\}$ is a permutation with even and odd entries alternatively. We deal with parity alternating permutations having an odd entry in the first position, PAPs. We study the…

组合数学 · 数学 2022-04-04 Frether Getachew Kebede , Fanja Rakotondrajao

A permutation $\pi$ is ballot if, for all $k$, the word $\pi_1\cdots \pi_k$ has at least as many ascents as it has descents. Let $b(n)$ denote the number of ballot permutations of order $n$, and let $p(n)$ denote the number of permutations…

组合数学 · 数学 2019-03-15 Sam Spiro

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…

组合数学 · 数学 2013-03-21 Mirkó Visontai

We reveal a relationship between the prime counting function and an operation performed on a unique subsequence of the primes.

综合数学 · 数学 2023-06-21 Michael P. May

We give a new construction of q-Genocchi numbers, Euler numbers of higher order, which are different than the q-Genocchi numbers of Cangul-Ozden-Simsek. By using our q-Genoucchi, Euler nimbers of higher order, we can investigate the…

数论 · 数学 2009-01-06 Taekyun Kim

Using a new colored analogue of P-partitions, we prove the existence of a colored Eulerian descent algebra which is a subalgebra of the Mantaci-Reutenauer algebra. This algebra has a basis consisting of formal sums of colored permutations…

组合数学 · 数学 2014-11-03 Matthew Moynihan

A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.

密码学与安全 · 计算机科学 2008-01-16 Ephraim Feig , Vivian Feig

In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing…

经典分析与常微分方程 · 数学 2014-06-24 Bai-Ni Guo , Feng Qi

Controlled ordinary differential equations driven by continuous bounded variation curves can be considered a continuous time analogue of recurrent neural networks for the construction of expressive features of the input curves. We ask up to…

经典分析与常微分方程 · 数学 2025-02-06 Mie Glückstad , Nicola Muca Cirone , Josef Teichmann

In an award-winning expository article, V. Pozdnyakov and J.M. Steele gave a beautiful demonstration of the ramifications of a basic bijection for permutations. The aim of this note is to connect this correspondence to a seemingly unrelated…

组合数学 · 数学 2024-01-08 William Y. C. Chen

We introduce and study new refinements of inversion statistics for permutations, such as k-step inversions, (the number of inversions with fixed position differences) and non-inversion sums (the sum of the differences of positions of the…

组合数学 · 数学 2012-01-13 Joshua Sack , Henning Úlfarsson

We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, $\tau=123$ and $n$ even, is a bijection that associates a Dyck prefix of…

组合数学 · 数学 2009-10-14 Marilena Barnabei , Flavio Bonetti , Matteo Silimbani

In this paper, we introduce two differential equations arising from the generating function of the Catalan numbers which are `inverses' to each other in some sense. From these differential equations, we obtain some new and explicit…

数论 · 数学 2016-05-20 Taekyun Kim , Dae San Kim

We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…

经典分析与常微分方程 · 数学 2026-04-30 Alexandre Benoit , Nicolas Brisebarre , Bruno Salvy

In this short note, we establish an operator theoretic version of the Wiener-Ikehara tauberian theorem, and point out how this leads to a new proof of the Prime number theorem that should be accessible to anyone with a basic knowledge of…

泛函分析 · 数学 2020-11-16 Jan-Fredrik Olsen