Related papers: Rational Combinatorics
Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…
Eulerian polynomials are fundamental in combinatorics and algebra. In this paper we study the linear transformation $\mathcal{A} : \mathbb{R}[t] \to \mathbb{R}[t]$ defined by $\mathcal{A}(t^n) = A_n(t)$, where $A_n(t)$ denotes the $n$-th…
We survey some general-purpose symbolic software packages that implement algorithms from enumerative and analytic combinatorics. Software for the following areas is covered: basic combinatorial objects, symbolic combinatorics, P\'olya…
Back in 1755, Euler explored an interesting array of numbers that now frequently appears in polynomial identities, combinatorial problems, and finite calculus, among other places. These numbers share a strong connection with well-known…
The purpose of this paper is to present a syatemic study of some familes of higher-order Euler numbers and polynomials. In particular, by using the basis property of higher-order Euler polynomials for the space of polynomials of degree less…
This monograph is a study of the category of polynomial endofunctors on the category of sets and its applications to modeling interaction protocols and dynamical systems. We assume basic categorical background and build the categorical…
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…
In this series of papers, we propose a theory of enumerative invariants counting self-dual objects in self-dual categories. Ordinary enumerative invariants in abelian categories can be seen as invariants for the structure group $\mathrm{GL}…
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…
We give combinatorial formulas for F-polynomials in cluster algebras of classical types in terms of the weighted paths in certain directed graphs. As a consequence we prove the positivity of F-polynomials in cluster algebras of classical…
In this paper, we consider the degenerate multi-poly-Bernoulli numbers and polynomials which are defined by means of the multiple polylogarithms and degenerate versions of the multi-poly-Bernoulli numbers and polynomials. We investigate…
We describe recent advances in the study of random analogues of combinatorial theorems.
The purpose of this paper is to introduce basic concepts that are fundamental in the examination of composite moduli, while avoiding the notoriously difficult problem of prime-factorization. We introduce a new class of numbers, called…
We introduce and study a `level two' generalization of the poly-Bernoulli numbers, which may also be regarded as a generalization of the cosecant numbers. We prove a recurrence relation, two exact formulas, and a duality relation for…
In this paper, applying the Fa\`a di Bruno formula and some properties of Bell polynomials, several closed formulas and determinantal expressions involving Stirling numbers of the second kind for higher-order Bernoulli and Euler polynomials…
We investigate the combinatorics of the general formulas for the powers of the operator $h \partial^k$, where $h$ is a central element of a ring and $\partial$ is a differential operator. This generalizes previous work on the powers of…
In this survey paper, I first review the history of Bernoulli numbers, then examine the modern definition of Bernoulli numbers and the appearance of Bernoulli numbers in expansion of functions. I revisit some properties of Bernoulli numbers…
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.
We propose a theory of combinatorially explicit Schubert polynomials which represent the Schubert classes in the Borel presentation of the cohomology ring of orthogonal flag varieties. We use these polynomials to describe the arithmetic…
We will use analytic function theory and Fourier analysis to establish a characterization for some classical umbral calculus, which will focus on the generalization of the evaluation function. Although we cannot cover all the umbral…