广义Stirling数在组合与统计方面的应用

本文给出了广义 Ｓｔｉｒｌｉｎｇ数 Ｓ（ｎ,ｋ;α,β,γ）的组合解释以及对统计学方面的某些应用,包括Ｃｈａｒａｌａｍｂｉｄｅｓ－Ｋｏｕｔｒａｓ等人的结果为特例．     

一些与Riemann Zeta函数有关的级数的求和公式

采用组合数学的方法，利用第二类Ｓｔｉｒｌｉｎｇ数和Ｂｅｒｎｏｕｌｉ数给出级数∑∞ｋ＝２ｋｍζ（ｋ）、∑∞ｋ＝１ｋｍζ（２ｋ）及∑∞ｋ＝１（２ｋ＋１）ｍζ（２ｋ＋１）（其中ｍ≥１，ζ（ｘ）＝ζ（ｘ）－１）的求和公式。这些公式表述简洁并有鲜明的规律性。     

三类与Riemann Zeta函数有关的级数的求和公式

本文采用组合数学的方法,利用第二类Ｓｔｉｒｌｉｎｇ数和Ｂｅｒｎｏｕｌｌｉ数给出级数∑∞ｋ＝２ｋ＾ｍξ（２ｋ）及∑∞ｋ＝１（２ｋ＋１）＾ｍξ（２ｋ＋１）其中ｍ≥１,ξ（ｘ）＝ξ（ｘ）－１）的求和公式。这些公式表述简洁并有鲜明的规律性。     

自然数方幂和的一个性质的证明

自然数方幂和的一个性质的证明湖南浏阳十一中刘会成令Ｓｋ（ｎ）＝１ｋ＋２ｋ＋…＋ｎｋ（ｋ≥０，ｋ∈Ｚ）．文［１］，［２］，［３］均提到下面一个性质：Ｓ２ｋ（Ｎ）＝Ｓ２（ｎ）Ｐ２（ｎ）（ｉ）Ｓ２ｋ＋１（ｎ）＝Ｓ２１（ｎ）Ｐ１（ｎ）（ｉｉ）其中ｋ为自然数，...     

Q_k(x)与F_k(x)的渐近公式

设ｎ，ｋ为自然数，Ｇ（ｎ）阶群中的同构类数，Ｆｋ（ｘ）与Ｑｋ（ｘ）分别表示不超过ｘ的自然数中使Ｇ（ｎ）＝ｋ的自然数、无平方因子自然数的个数．本文的目的是用Ｂｒｕｎ筛法证明Ｑｋ（ｘ）的条件渐近公式并对Ｆｋ（ｘ）的渐近性质做出了推测．     

Stirling渐进公式的一个新的构造证明

本文用简易的分析工具，对ｎ！给出了一个精确等式，从而导出Ｓｔｉｒｌｉｎｇ渐近公式（２）的一个新的简短证明.     

对称本原有向图的广义本原指数集

本文证明了全体ｎ阶对称本原有向图的第ｋ个第一类（１≤ｋ＜ｎ－１）、第二类（１≤ｋ≤ｎ－１）和第三类（２≤ｋ≤ｎ－１）广义本原指数的指数集分别是｛１，２，…，ｎ－２＋ｋ｝和｛１，２，…，２（ｎ－ｋ）｝，其中「ａ］表不小于ａ的最小整数，［ｂ］表不大于ｂ的最大整数。     

一类离散型奇异积分算子

设｛αｋ｝∞ｋ＝－∞为正数缺项序列，满足ｉｎｆｋαｋ＋１／ｄｋ＝α＞１，Ω（ｙ′）为Ｂｅｓｏｖ空间Ｂ０，１１（Ｓｎ－１）上的函数，其中Ｓｎ－１为Ｒｎ（ｎ２）上的单位球面．本文证明：若∫Ｓｎ－１Ω（ｙ′）ｄσ（ｙ′）＝０，则离散型奇异积分ＴΩ（ｆ）（ｘ）＝∑∞ｋ＝－∞∫Ｓｎ－１ｆ（ｘ－αｋｙ′）Ω（ｙ′）ｄσ（ｙ′）和相关的极大算子ＴΩ（ｆ）（ｘ）＝ｓｕｐＮ∑∞ｋ＝Ｎ∫Ｓｎ－１ｆ（ｘ－αｋｙ′）Ω（ｙ′）ｄσ（ｙ′）均在Ｌ２（Ｒｎ）上有界．上述结果推广了Ｄｕｏａｎｄｉｋｏｅｔｘｅａ和ＲｕｂｉｏｄｅＦｒａｎｃｉａ［１］在Ｌ２情形下的一个结果     

从k到k 1思路受阻分析及转化策略

用数学归纳法证明不等式，特别是数列不等式，是一个行之有效的方法，也是中学数学中的一个基本方法，近些年高考试题中几次出现这类问题．运用这种方法时，往往有好多学生在证ｋ到（ｋ＋１）的过程中，卡了壳、断了思路，这是一种普遍现象．现就笔者在讲授这部分内容时学生暴露的问题，分析一下思路受阻的几种原因及转化策略．１　从ｋ到（ｋ＋１）添项不足在从ｋ到（ｋ＋１）的证明过程中，如果分析不透命题结构，就会造成添项不足，证明夭折．例１　已知Ｓｎ＝１＋１２＋１３＋…＋１ｎ，（ｎ∈Ｎ）．用数学归纳法证明Ｓ２ｎ＞１＋ｎ２　…     

平面上n个点的集合的一个性质

平面上ｎ个点的集合的一个性质歌今这是第三十届ＩＭＯ的一道竞赛题：“设ｎ和ｋ是正整数，Ｓ是平面上ｎ个点的集合，满足：（ｌ）Ｓ中任何三点不共线；（２）对Ｓ中的每一点Ｐ，Ｓ中存在ｋ个点与Ｐ距离相等．证明：ｋ＜．（第三题）对于这个困难问题，我们来提出一个具有...     

Identities arising from Gauss sums for finite classical groups

We consider Gauss sums for various finite classical groups, combine our previous results about explicit expressions for those sums with new ones obtained from our main formula based on Deligne-Lusztig theory and get some interesting identities, which are of combinatorial nature and involve various classical exponential sums.     

Divisibility properties of a class of binomial sums

We study congruence and divisibility properties of a class of combinatorial sums that involve products of powers of two binomial coefficients, and show that there is a close relationship between these sums and the theorem of Wolstenholme. We also establish congruences involving Bernoulli numbers, and finally we prove that under certain conditions the sums are divisible by all primes in specific intervals.     

Combinatorial sums through Riordan arrays

The aim of this work is to show how Riordan arrays are able to generate and close combinatorial identities, by means of the method of coefficients (generating functions). We also show how the same approach can be used to deal with other combinatorial problems, for instance asymptotic approximation and combinatorial inversion. Finally, we propose a method for generating new combinatorial sums by extending the concept of Riordan arrays to bi-infinite matrices.     

组合和的几个计算公式

In this paper, by Riordan array several computing formulas for the combinatorial sums are given.     

Riordan群的反演链及在组合和中的应用

利用函数复合关系,本文在Ｒｉｏｒｄａｎ群中引入Ｒｉｏｒｄａｎ反演链的概念及其Ｒｉｏｒ－ｄａｎ反演链存在的充要条件,给出计算组合和式的递推方法．进一步讨论了二项式系数所对应的Ｒｉｏｒｄａｎ反演链问题,建立了一个Ｒｉｏｒｄａｎ求和公式,该式蕴含了某些与Ｆｉｂｏｎａｃｃｉ数相关的恒等式在内的一系列组合恒等式     

Riemann Zeta函数的六阶和

利用概率论与组合数学的方法,研究了与Riemann-zeta函数ξ(k)的部分和ξ_n(k)有关的一些级数,计算出了一些重要的和式．特别的,Euler的著名结果5ξ(4)= 2ξ~2(2)能够从四阶和式直接推出．因此,通过计算全部的11个六阶和式,研究它们之间的非平凡关系,就有可能得到ξ(3)的数值．     

Left-inversion of combinatorial sums

The inversion of combinatorial sums is a fundamental problem in algebraic combinatorics. Some combinatorial sums, such as a_n = Σ_kd_n,kb_k, cannot be inverted in terms of the orthogonality relation because the infinite, lower triangular array P = {d_n,k}'s diagonal elements are equal to zero (except d_0,0). Despite this, we can find a left-inverse ̄P such that PP̄ = I and therefore are able to left-invert the original combinatorial sum, and thus obtain b_n = Σ_kd̄_n,ka_k.     

Lattice polytopes cut out by root systems and the Koszul property

We show that lattice polytopes cut out by root systems of classical type are normal and Koszul, generalizing a well-known result of Bruns, Gubeladze, and Trung in type A. We prove similar results for Cayley sums of collections of polytopes whose Minkowski sums are cut out by root systems. The proofs are based on a combinatorial characterization of diagonally split toric varieties.     

Lagrange Inversion: When and How

The aim of the present paper is to show how the Lagrange Inversion Formula (LIF) can be applied in a straight-forward way i) to find the generating function of many combinatorial sequences, ii) to extract the coefficients of a formal power series, iii) to compute combinatorial sums, and iv) to perform the inversion of combinatorial identities. Particular forms of the LIF are studied, in order to simplify the computation steps. Some examples are taken from the literature, but their proof is different from the usual, and others are new.      

Relative Stanley–Reisner theory and Upper Bound Theorems for Minkowski sums

In this paper we settle two long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of equality. We similarly give a (tight) upper bound theorem for mixed facets of Minkowski sums. This has a wide range of applications and generalizes the classical Upper Bound Theorems of McMullen and Stanley.Our main observation is that within (relative) Stanley–Reisner theory, it is possible to encode topological as well as combinatorial/geometric restrictions in an algebraic setup. We illustrate the technology by providing several simplicial isoperimetric and reverse isoperimetric inequalities in addition to our treatment of Minkowski sums.