相关论文: Compositional Bernoulli numbers

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise…

In this survey we discuss the notion of combinatorial interpretation in the context of Algebraic Combinatorics and related areas. We approach the subject from the Computational Complexity perspective. We review many examples, state a…

In this paper, we give the determinant expressions of the hypergeometric Bernoulli numbers, and some relations between the hypergeometric and the classical Bernoulli numbers which include Kummer's congruences. By applying Trudi's formula,…

In this paper, we give new identities involving Phillips q-Bernstein polynomials and we derive some interesting properties of q-Berstein polynomials associated with q-Stirling numbers and q-Bernoulli polynomials.

We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…

In this paper we present a recurrent relation for counting meaningful compositions of the higher-order differential operations on the space $R^{n}$ (n=3,4,...) and extract the non-trivial compositions of order higher than two.

Borel's triangle is an array of integers closely related to the classical Catalan numbers. In this paper we study combinatorial statistics counted by Borel's triangle. We present various combinatorial interpretations of Borel's triangle in…

We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…

In this paper, we consider Barnes' multiple Bernoulli and poly-Bernoulli mixed-type polynomials. From the properties of Sheffer sequences of these polynomials arising from umbrral calculus, we derive new and interesting identities.

In this paper, we study some properties of umbral calculus related to Appell sequence. From those properties, we derive new and interesting identities of Frobenius-Euler polynomials.

We review and discuss some results on the representation of Bernoulli, poly-Bernoulli numbers, and Bernoulli and Cauchy polynomials in terms of Stirling numbers of the first or second kind, or in terms of r-Stirling numbers.

In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…

The study of combinatorial properties of mathematical objects is a very important research field and continued fractions have been deeply studied in this sense. However, multidimensional continued fractions, which are a generalization…

We study a composition operator on Lorentz spaces. In particular we provide necessary and sufficient conditions under which a measurable mapping induces a bounded composition operator.

We discuss a general combinatorial framework for operator ordering problems by applying it to the normal ordering of the powers and exponential of the boson number operator. The solution of the problem is given in terms of Bell and Stirling…

This paper considers the properties of Tribonacci numbers on identities, matrices, and determinants. In the first front part, we obtain several symmetric identities of Tribonacci numbers by a matrix-based approach and binomial inversion…

In this paper, we consider the problem of representing any polynomial in terms of the degenerate Bernoulli polynomials and more generally of the higher-order degenerate Bernoulli polynomials. We derive explicit formulas with the help of…

Despite ample evidence that our concepts, our cognitive architecture, and mathematics itself are all deeply compositional, few models take advantage of this structure. We therefore propose a radically compositional approach to computational…

The main purpose and motivation of this article is to create a linear transformation on the polynomial ring of rational numbers. A matrix representation of this linear transformation based on standard fundamentals will be given. For some…