坡矩阵的积和式算子及若干不等式

引入坡矩阵积和式算子的概念．获得坡矩阵积和式算子关于偏序“≤”的若干不等式．     

积和式及行列式的一个推广

基于对积和式性质的讨论,给出了积和式的"化长为方"计算方法;基于对积和式概念的研究,作为行列式的推广,给出了一般m×n矩阵的行式定义,讨论了行式的性质和计算方法,推广了克莱姆法则.     

分配伪格上矩阵积和式的不等式

在分配伪格上研究矩阵的积和式问题,得到关于矩阵积和式的若干不等式.其结果推广了已有文献上的结论.     

Riemann Zeta函数的七阶和式

通过构造一个Riemann Zeta函数ζ(k)的部分和ζ_n(k)的幂级数函数,利用牛顿二项式展开及柯西乘积公式可以计算出一些重要的和式.再将该幂级数函数由一元推广到二元甚至多元,由此得到Riemann Zeta函数的高次方和式之间的关系.并利用对数函数与第一类Stirling数之间的关系式及ζ(k)函数满足的相关等式,可得出Riemann Zeta函数的18个七阶和式,以及其它一些高次方的和式.     

一类含参量和式极限的定积分方法

借助于定积分定义,考虑一类与Riemann和有关的和式的极限,该和式中含有参数.得到一个有意思的结果并给出应用例子.     

(0,1)-矩阵的积和式的图表示及其相关性质

将(0，1)．矩阵的积和式的记数问题转化为它的伴随图或伴随有向图上相关元素的记数问题，能使复杂的计数问题变得相对直观化和简单化．本文给出了(0，1)-矩阵的积和式的图论表达式，并以该表达式为基础，主要解决了2．正则图类的邻接矩阵的最大积和式的记数问题以及它的反问题，即确定了零积和式临界图的极大边数及其图类．     

和式∑nk=0μkf(k)的发生函数算法

利用普通幂级数发生函数方法,通过对发生函数进行xD算子,得到和式∑nk=0μkf(k)的计算公式,并计算该类和式.     

和式sum from k=o to n(μ~kf(k))的发生函数算法

利用普通幂级数发生函数方法,通过对发生函数进行xD算子,得到和式∑k=0μkf(k)的计算公式,并计算该类和式.     

Delannoy数与Schröder数的一些和式公式

研究了Delannoy数与Schr?der数.利用分析方法和组合技巧,建立了任意多个Delannoy数乘积的一些和式公式,并对Schroder数的和式公式进行了类似的研究.     

和式∑k=0^nμ^kf（k）的发生函数算法

利用普通幂级数发生函数方法，通过对发生函数进行xD算子，得到和式∑k=0^nμ^kf（k）的计算公式，并计算该类和式＋     

一些同余问题的例外集合

利用特征和与指数和的估计,研究了一些同余问题的例外集合.具体来说,设p为充分大的素数,集合Y■Zp,正整数N相似文献   

Recursions associated to trapezoid,symmetric and rotation symmetric functions over Galois fields

Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential sums of rotation symmetric Boolean functions satisfy homogeneous linear recurrences with integer coefficients. In this work, a generalization of this result is proved over any Galois field. That is, exponential sums over Galois fields of some rotation symmetric polynomials satisfy linear recurrences with integer coefficients. In the particular case of ${\mathbb{F}}_2$, an elementary method is used to obtain explicit recurrences for exponential sums of some of these functions. The concept of trapezoid Boolean function is also introduced and it is showed that the linear recurrences that exponential sums of trapezoid Boolean functions satisfy are the same as the ones satisfied by exponential sums of the corresponding rotations symmetric Boolean functions. Finally, it is proved that exponential sums of trapezoid and symmetric polynomials also satisfy linear recurrences with integer coefficients over any Galois field ${\mathbb{F}}_q$. Moreover, the Discrete Fourier Transform matrix and some Complex Hadamard matrices appear as examples in some of our explicit formulas of these recurrences.     

整数环上矩阵平方和的两个新结论

本文利用 F2 上方阵为平方矩阵的充要条件 ,证明了 :1任一阶数为偶数的整数矩阵可表示成 5个平方次幂整数矩阵之和 ;2任一整数矩阵可表示成 6个平方次幂整数矩阵之和 ,从而改进了文 [2 ,3 ]的主要结论 .     

Stirling numbers and integer partitions

In this paper, we prove that the Stirling numbers of both kinds can be written as sums over integer partitions. As corollaries, we rewrite some identities with Stirling numbers of both kinds without Stirling numbers.     

算子稳定随机向量序列的一些极限结果

对于独立同分布的没有Gauss分量的指数为可逆线性算子A的算子稳定的R~d值随机向量序列,本文通过积分检验讨论了其部分和及加权和(包括一些经典的加权和,如Cesàro加权和,后置和方式,Euler可和方式,Borel可和方式,几何加权和等)的极限结果.由此得到了部分和及加权和在相对于A的谱分解下的Chover型重对数律,这是与A的特征值的实部有关的结果.     

多指标独立随机变量的重对数律及其应用

对于多指标独立同分布的随机变量序列,在某些更广泛的正则化序列下,本文给出了重对数律成立的充分必要条件.作为应用,本文讨论了正则和极大值函数的矩存在的充分必要条件.     

Brunn-Minkowski inequalities for contingency tables and integer flows

We establish approximate log-concavity for a wide family of combinatorially defined integer-valued functions. Examples include the number of non-negative integer matrices (contingency tables) with prescribed row and column sums (margins), as a function of the margins and the number of integer feasible flows in a network, as a function of the excesses at the vertices. As a corollary, we obtain approximate log-concavity for the Kostant partition function of type A. We also present an indirect evidence that at least some of the considered functions might be genuinely log-concave.     

矩阵幂和问题的进一步讨论

本文证明了;(1)F_p~m上p~m次幂矩阵的充要条件;(2)F_p~m上任一方阵都可表示为2个其最小多项式均无重因式的q次幂矩阵之和;(3)任一整数方阵可表示成不超过7个平方次幂整数矩阵之和,从而推广和改进了文[1,2]的结果.     

Integer matrices with constraints on leading partial row and column sums

Consider the problem of finding an integer matrix that satisfies given constraints on its leading partial row and column sums. For the case in which the specified constraints are merely bounds on each such sum, an integer linear programming formulation is shown to have a totally unimodular constraint matrix. This proves the polynomial-time solvability of this case. In another version of the problem, one seeks a zero-one matrix with prescribed row and column sums, subject to certain near-equality constraints, namely, that all leading partial row (respectively, column) sums up through a given column (respectively, row) are within unity of each other. This case admits a polynomial reduction to the preceding case, and an equivalent reformulation as a maximum-flow problem. The results are developed in a context that relates these two problems to consistent matrix rounding.     

Nonvanishing of Siegel Poincaré series

We prove that, under suitable conditions, certain Siegel Poincaré series of exponential type of even integer weight and degree 2 do not vanish identically. We also find estimates for twisted Kloosterman sums and Salié sums in all generality.