Computation methods for combinatorial sums and Euler‐type numbers related to new families of numbers

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. We can show that these numbers are related to the well‐known numbers and polynomials such as the Stirling numbers of the second kind and the central factorial numbers, the array polynomials, the rook numbers and polynomials, the Bernstein basis functions and others. In order to derive our new identities and relations for these numbers, we use a technique including the generating functions and functional equations. Finally, we give not only a computational algorithm for these numbers but also some numerical values of these numbers and the Euler numbers of negative order with tables. We also give some combinatorial interpretations of our new numbers. Copyright © 2016 John Wiley & Sons, Ltd.     

涉及广义Fibonacci-Lucas数的幂的一些级数的近似值

计算出涉及广义Fibonacci-Lucas数的幂的一些级数的近似值。     

Sums of products of Cauchy numbers

In this paper, we consider a kind of sums involving Cauchy numbers, which have not been studied in the literature. By means of the method of coefficients, we give some properties of the sums. We further derive some recurrence relations and establish a series of identities involving the sums, Stirling numbers, generalized Bernoulli numbers, generalized Euler numbers, Lah numbers, and harmonic numbers. In particular, we generalize some relations between two kinds of Cauchy numbers and some identities for Cauchy numbers and Stirling numbers.     

Degenerate Bernoulli polynomials, generalized factorial sums, and their applications

We prove a general symmetric identity involving the degenerate Bernoulli polynomials and sums of generalized falling factorials, which unifies several known identities for Bernoulli and degenerate Bernoulli numbers and polynomials. We use this identity to describe some combinatorial relations between these polynomials and generalized factorial sums. As further applications we derive several identities, recurrences, and congruences involving the Bernoulli numbers, degenerate Bernoulli numbers, generalized factorial sums, Stirling numbers of the first kind, Bernoulli numbers of higher order, and Bernoulli numbers of the second kind.     

Applications of an Explicit Formula for the Generalized Euler Numbers

The authors establish an explicit formula for the generalized Euler NumbersE2n^（x）, and obtain some identities and congruences involving the higher＇order Euler numbers, Stirling numbers, the central factorial numbers and the values of the Riemann zeta-function.     

Sums of products of hypergeometric Bernoulli numbers

We give a formula for sums of products of hypergeometric Bernoulli numbers. This formula is proved by using special values of multiple analogues of hypergeometric zeta functions.     

高阶Bernoulli数与Stirling数的几个恒等式

利用第一、二类高阶Bernoulli数和二类Stirling数S1(n,k),S2(n,k)的定义.研究了二类高阶Bernoulli数母函数的幂级数展开,揭示了二类高阶Bernoulli数之间以及与第一类Stirling数S1(n,k)、第二类Stirling数S2(n,k)之间的内在联系,得到了几个关于二类高阶Bernoulli数和第一类Stirling数S1(n,k)、第二类Stirling数S2(n,k)之间有趣的恒等式.     

Prime and composite numbers as integer parts of powers

We study prime and composite numbers in the sequence of integer parts of powers of a fixed real number. We first prove a result which implies that there is a transcendental number ξ>1 for which the numbers [ξ^{n !}], n =2,3, ..., are all prime. Then, following an idea of Huxley who did it for cubics, we construct Pisot numbers of arbitrary degree such that all integer parts of their powers are composite. Finally, we give an example of an explicit transcendental number ζ (obtained as the limit of a certain recurrent sequence) for which the sequence [ζⁿ], n =1,2,..., has infinitely many elements in an arbitrary integer arithmetical progression. This revised version was published online in June 2006 with corrections to the Cover Date.     

Yet another way of calculating moments of the Kesten's distribution and its consequences for Catalan numbers and Catalan triangles

We calculate moments of the so-called Kesten distribution by means of the expansion of the denominator of the density of this distribution and then integrate all summands with respect to the semicircle distribution. By comparing this expression with the formulae for the moments of Kesten's distribution obtained by other means, we find identities involving polynomials whose power coefficients are closely related to Catalan numbers, Catalan triangles, binomial coefficients. Finally, as applications of these identities we obtain various interesting relations between the aforementioned numbers, also concerning Lucas, Fibonacci and Fine numbers.     

高阶退化Bernoulli数和多项式

本文研究了高阶退化Berrioulli数和多项式的两个显明公式，得到了一个包含高阶Bemoulli数和Stirling数的恒等式，并推广了F．H．Howard，S．Shirai和K．I．Sato的结果。     

The Boson Normal Ordering Problem and Generalized Bell Numbers

For any function F(x) having a Taylor expansion we solve the boson normal ordering problem for $F [(a^\dag)^r a^s]$, with r, s positive integers, $F [(a, a^\dag]=1$, i.e., we provide exact and explicit expressions for its normal form $\mathcal{N} \{F [(a^\dag)^r a^s]\} = F [(a^\dag)^r a^s]$, where in $ \mathcal{N} (F) $ all a's are to the right. The solution involves integer sequences of numbers which, for $ r, s \geq 1 $, are generalizations of the conventional Bell and Stirling numbers whose values they assume for $ r=s=1 $. A complete theory of such generalized combinatorial numbers is given including closed-form expressions (extended Dobinski-type formulas), recursion relations and generating functions. These last are special expectation values in boson coherent states.AMS Subject Classification: 81R05, 81R15, 81R30, 47N50.     

Weighted covering numbers of convex sets

In this paper we define the notions of weighted covering number and weighted separation number for convex sets, and compare them to the classical covering and separation numbers. This sheds new light on the equivalence of classical covering and separation. We also provide a formula for computing these numbers via a limit of classical covering numbers in higher dimensions.     

Coloring arcs of convex sets

In this note we consider Ramsey-type problems on graphs whose vertices are represented by the vertices of a convex polygon in the Euclidean plane. The edges of the graph are represented by the segments between the points of the polygon. The edges are arbitrarily colored by a fixed number of colors and the problem is to decide whether there exist monochromatic subgraphs of certain types satisfying some geometric conditions. We will give lower and upper bounds for these geometric Ramsey numbers for certain paths and cycles and also some exact values. It turns out that the particular type of the embedding is crucial for the growth rate of the corresponding geometric Ramsey numbers. In particular, the Ramsey numbers for crossing 4-cycles and t colors grow quadratically in t, while for convex 4-cycles they grow at least exponentially.     

Polynomial Hurwitz Numbers and Intersections on \overline M _{0,k}

We express Hurwitz numbers of polynomials of arbitrary topological type in terms of intersection numbers on the moduli space of curves of genus zero with marked points.     

A generalization of the formula for the triangular number of the sum and product of natural numbers

This note generalizes the formula for the triangular number of the sum and product of two natural numbers to similar results for the triangular number of the sum and product of r natural numbers. The formula is applied to derive formula for the sum of an odd and an even number of consecutive triangular numbers.     

A 2-adic formula for Bernoulli numbers of the second kind and for the Nörlund numbers

We give a formula expressing Bernoulli numbers of the second kind as 2-adically convergent sums of traces of algebraic integers. We use this formula to prove and explain the formulas and conjectures of Adelberg concerning the initial 2-adic digits of these numbers. We also give analogous results for the Nörlund numbers.     

随机变量序列的大数定律及常返性定理

对一类有界独立或相依的随机变量序列|ξn|,获得了它的伯努利大数定律、波雷尔强大数定律及常返性定理.作为应用,得出了Loève专著[1]中的推广的伯努利大数定律、常返性定理,改进了[1]中的推广的波雷尔强大数定律.     

关于高阶Genocchi数的一些恒等式

讨论了高阶Genocchi数的性质,建立了一些包含高阶Genocchi数和高阶Euler-Bernoulli数的恒等式.     

CO‐irredundant Ramsey numbers for graphs

The study of the CO‐irredundant Ramsey numbers t(n₁, ···, n_k) is initiated. It is shown that several values and bounds for these numbers may be obtained from the well‐studied generalized graph Ramsey numbers and the values of t(4, 5), t(4, 6) and t(3, 3, m) are calculated. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 258–268, 2000     

Introduction to Fibonacci and Lucas hybrinomials

ABSTRACT

The hybrid numbers are generalization of complex, hyperbolic and dual numbers. In this paper, we introduce and study the Fibonacci and Lucas hybrinomials, i.e. polynomials, which are a generalization of the Fibonacci hybrid numbers and the Lucas hybrid numbers, respectively.