混合体积、对数凹序列和B样条函数

本文主要通过样条函数方法研究与之相关的离散几何学和组合学问题.在离散几何学方面主要考虑超立方体切面(cube slicing)体积和混合体(mixed volume)的样条表示,利用B样条函数的几何解释,将超立方体切面问题转化为与之等价的样条函数问题,分别给出Laplace和P′olya关于超立方体切面定理的样条证明,将样条函数与混合体积联系起来,给出一类混合体积的样条解释.利用这种解释可以得到一类具有对数凹性质的组合序列,从而部分地回答了Schmidt和Simion所提出的关于混合体积的公开问题.在组合数学方面主要考虑多种组合多项式与样条函数的关联以及组合序列对数凹性质的样条方法研究.本文借助丰富的样条函数理论,不但验证了离散几何学和组合数学中很多现有的结果,而且得到了一系列离散数学对象的新性质,建立了离散数学问题与具有连续性特质的样条函数之间的内在联系.     

B—样条逼近曲线的应用

引进了一种构造曲线的逼近技术，它放松了曲线应包含所有数据点这一严格要求。为了度量一曲线能逼近已给数据多边形的好坏，使用了移动控制点的概念。     

样条空间S^13（Δ^（1）mn）上的插值与逼近

本文讨论样条空间Ｓ＾１３上的插值问题，导出了一类插值条件下样条插值的存在性与唯一性结论以及计算插值样条的递推格式，其主要结论是对四阶光滑的函数，插值样条可达２阶逼近度。     

B—样条曲线的一种高效臬法

为Ｂ－样条曲线及所有导数同时赋值提供一种高效算法，它从最高阶导数赋值开始，把高阶等数于低阶导数的求值。     

B样条基的转换矩阵及其应用

本文研究任意两个B样条基可转换的条件及转换矩阵，给出了关于转换矩阵元素的表示及性质等理论结果，并推导出了两个递推公式，为实际计算转换矩阵的元素提供了易于实现的数学方法。本文还讨论了B样条基转换矩阵在CAGD中的应用，特别讨论了B样条曲线的节点插入、升阶和分解问题。本文的结果为B样条曲线的节点插入、升阶、分解等运算提供了一个统一的数学模型和实现方法。     

三次均匀B样条在服装CAD中的应用

服装设计中三维向二维的转换是服装 CAD当今研究的重要课题之一 .依据投影原理寻找到三维衣片的边界点在平面上的对应位置 ,并利用三次均匀 B样条拟合二维边界点以实现三维衣片向二维衣片的转换 .经上机调试、运行、得到比较满意的结果 ,为今后深入研究奠定了基础     

B值一致渐近鞅强大数定律的一点注记

本利用了Ｂ值一致渐近鞅的Ｄｏｏｂ分解,对Ｂ值一致渐近鞅的收敛性作进一步的探讨,得到了Ｂ值一致渐近鞅的强大数定律的几个重要结果,从而将实值一致渐近鞅的强大数定律的一些结果推广到了Ｂ值一致渐近鞅的情形。     

样条最小二乘拟合在估计水塔水流量中的应用

本文采用样条最小二乘法 ,通过对水塔水位的观测数据进行拟合 ,能够估计出任意时刻水塔的水流量及一天内的总用水量 ,同时较好地克服了使用高次多项式时容易导致的正规方程组的病态性问题 .     

Eulerian numbers: A spline perspective

In this paper, the spline interpretations of Eulerian numbers and refined Eulerian numbers are presented. Many classical results about Eulerian numbers can follow from the properties of B-splines directly, and some new results about the refined Eulerian numbers and descent polynomials are also derived. Specifically, the explicit and recurrence formulas for the refined Eulerian numbers and descent polynomials are obtained. This paper also provides a new approach to study Eulerian numbers.     

Probabilistic asymptotic properties of some combinatorial optimization problems

A class of combinatorial optimization problems with sum- and bottleneck objective function is described, having the following probabilistic asymptotic behaviour: With probability tending to one the ratio between worst and optimal objective function value approaches one as the size of the problem tends to infinity.Problems belonging to this class are among others quadratic assignment problems, as well as certain combinatorial and graph theoretical optimization problems.The obtained results suggest that even very simple heuristic algorithms incline to yield good solutions for high dimensional problems of this class.     

The combinatorial properties of the Benoumhani polynomials for the Whitney numbers of Dowling lattices

In the papers (Benoumhani 1996;1997), Benoumhani defined two polynomials $F_{m,n,1}\left(x\right)$ and $F_{m,n,2}\left(x\right)$. Then, he defined $A_m(n,k)$ and $B_m(n,k)$ to be the polynomials satisfying $F_{m,n,1}\left(x\right)={\sum }_{k=0}^n{A}_m(n,k)x^{n?k}{(x+1)}^k$ and $F_{m,n,1}\left(x\right)={\sum }_{k=0}^n{B}_m(n,k)x^{n?k}{(x+1)}^k$. In this paper, we give a combinatorial interpretation of the coefficients of $A_{m+1}(n,k)$ and prove a symmetry of the coefficients, i.e., $\left[m^s\right]A_{m+1}(n,k)=\left[m^{n?s}\right]A_{m+1}(n,n?k)$. We give a combinatorial interpretation of $B_{m+1}(n,k)$ and prove that $B_{m+1}(n,n?1)$ is a polynomial in $m$ with non-negative integer coefficients. We also prove that if $n\ge 6$ then all coefficients of $B_{m+1}(n,n?2)$ except the coefficient of $m^{n?1}$ are non-negative integers. For all $n$, the coefficient of $m^{n?1}$ in $B_{m+1}(n,n?2)$ is $?(n?1)$, and when $n\le 5$ some other coefficients of $B_{m+1}(n,n?2)$ are also negative.     

On a generalized Eulerian distribution

The distribution with probability function p _k(n, , ) = A _{n, k}(, )/(+ )^[p], k = 0, 1, 2, ..., n, where the parameters and are positive real numbers, A _{n, k} (, ) is the generalized Eulerian number and ( + )^[n] = ( + )( + +1) ... ( + +n – 1), introduced and discussed by Janardan (1988, Ann. Inst. Statist. Math., 40, 439–450), is further studied. The probability generating function of the generalized Eulerian distribution is expressed by a generalized Eulerian polynomial which, when expanded suitably, provides the factorial moments in closed form in terms of non-central Stirling numbers. Further, it is shown that the generalized Eulerian distribution is unimodal and asymptotically normal.     

Asymptotics of orthogonal polynomials with asymptotic Freud-like weights

We derive uniform asymptotic expansions for polynomials orthogonal with respect to a class of weight functions that are real analytic and behave asymptotically like the Freud weight at infinity. Although the limiting zero distributions are the same as in the Freud cases, the asymptotic expansions are different due to the fact that the weight functions may have a finite or infinite number of zeros on the imaginary axis. To resolve the singularities caused by these zeros, an auxiliary function is introduced in the Riemann–Hilbert analysis. Asymptotic formulas are established in several regions covering the whole complex plane. We take the continuous dual Hahn polynomials as an example to illustrate our main results. Some numerical verifications are also given.     

Hankel determinants of some polynomials arising in combinatorial analysis

In this paper we investigate Hankel determinants of the form , where c _n (t) is one of a number of polynomials of combinatorial interest. We show how some results due to Radoux may be generalized, and also show how “stepped up” Hankel determinants of the form may be evaluated. This revised version was published online in June 2006 with corrections to the Cover Date.     

Asymptotic Eulerian expansions for binomial and negative binomial reciprocals

Asymptotic expansions of any order for expectations of inverses of random variables with positive binomial and negative binomial distributions are obtained in terms of the Eulerian polynomials. The paper extends and improves upon an expansion due to David and Johnson (1956-7).

     

Several improved asymptotic normality criteria and their applications to graph polynomials

As widely regarded, one of the most classical and remarkable tools to measure the asymptotic normality of combinatorial statistics is due to Harper's real-rooted method proposed in 1967. However, this classical theorem exists some obvious shortcomings, for example, it requests all the roots of the corresponding generating function, which is impossible in general.Aiming to overcome this shortcoming in some extent, in this paper we present an improved asymptotic normality criterion, along with several variant versions, which usually just ask for one coefficient of the generating function, without knowing any roots. In virtue of these new criteria, the asymptotic normality of some usual combinatorial statistics can be revealed and extended. Among which, we introduce the applications to matching numbers and Laplacian coefficients in detail. Some relevant conjectures, proposed by Godsil (Combinatorica, 1981) and Wang et al. (J. Math. Anal. Appl., 2017), are generalized and verified as corollaries.