English
Related papers

Related papers: Two-sided Eulerian numbers via balls in boxes

200 papers

Let P be the set of the sequence of polynomials of degree n. The aim of this paper is to study the Stirling numbers of the second kind associated with P and of the first kind associated with P, in a unified and systematic way with the help…

Number Theory · Mathematics 2022-02-24 Dae san Kim , taekyun Kim

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

Combinatorics · Mathematics 2013-04-05 Adrian Ocneanu

We introduce Euler summability method for sequences of fuzzy numbers and state a Tauberian theorem concerning Euler summability method, of which proof provides an alternative to that of K. Knopp[\"Uber das Eulersche Summierungsverfahren II,…

Classical Analysis and ODEs · Mathematics 2017-11-27 Enes Yavuz

In this paper we look at polynomials arising from statistics on the classes of involutions, $I_n$, and involutions with no fixed points, $J_n$, in the symmetric group. Our results are motivated by F. Brenti's conjecture which states that…

Combinatorics · Mathematics 2007-05-23 W. M. B. Dukes

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…

Classical Analysis and ODEs · Mathematics 2014-06-24 Bai-Ni Guo , Feng Qi

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…

Combinatorics · Mathematics 2019-03-15 Sam Spiro

We collect, survey and develop methods of (one-dimensional) stochastic approximation in a framework that seems suitable to handle fairly broad generalizations of Polya urns. To show the applicability of the results we determine the limiting…

Probability · Mathematics 2010-02-22 Henrik Renlund

Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…

Combinatorics · Mathematics 2019-07-16 Sergi Elizalde , Justin M. Troyka

We establish some identities of Euler related sums. By using these identities, we discuss the closed form representations of sums of harmonic numbers and reciprocal parametric binomial coefficients through parametric harmonic numbers,…

Number Theory · Mathematics 2022-07-29 Junjie Quan , Ce Xu , Xixi Zhang

This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white balls from which at every time unit a fixed number of balls…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-12-07 Marie Albenque , Lucas Gerin

Recently, the second author studied an Eulerian statistic (called cover) in the context of convex polytopes, and proved an equal joint distribution of (cover,des) with (des,exc). In this paper, we present several direct bijective proofs…

Combinatorics · Mathematics 2012-08-16 Travis Hance , Nan Li

In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…

Combinatorics · Mathematics 2007-05-23 Einar Steingrimsson , Lauren K. Williams

We explicitly evaluate a special type of multiple Dirichlet $L$-values at positive integers in two different ways: One approach involves using symmetric functions, while the other involves using a generating function of the values. Equating…

Number Theory · Mathematics 2012-12-07 Yoshinori Yamasaki

We express the N\"{o}rlund polynomials in terms of the second-order Eulerian numbers. Based on this expression, we derive several identities related to the Bernoulli numbers. In particular, we present a short proof of the problem raised by…

Combinatorics · Mathematics 2021-04-21 Amy M. Fu

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…

Combinatorics · Mathematics 2012-02-06 Ana Luzón , Manuel A. Morón

The emergent field of probabilistic numerics has thus far lacked clear statistical principals. This paper establishes Bayesian probabilistic numerical methods as those which can be cast as solutions to certain inverse problems within the…

Methodology · Statistics 2019-11-15 Jon Cockayne , Chris Oates , Tim Sullivan , Mark Girolami

We present a probabilistic proof of Euler's pentagonal number theorem based on a shuffling model.

Number Theory · Mathematics 2025-09-17 Shane Chern

We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the…

Combinatorics · Mathematics 2025-03-31 Jerónimo Valencia-Porras

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…

Number Theory · Mathematics 2016-05-20 Taekyun Kim , Dae San Kim

Using Reiner's definition of Stirling numbers of type B of the second kind, we provide a 'balls into urns' approach for proving a generalization of a well-known identity concerning the classical Stirling numbers of the second kind:…

Combinatorics · Mathematics 2019-03-08 Eli Bagno , David Garber