环面上一般有根地图的计数

这篇文章给出了环面上以内面个数，根面次和非根节点个数为参数的一般有根地图的计数方程，导出了以内面个数和非根节点个数为参数的这类地图的计数方程的精确解。作为推论，推出了以边数为参数的这类地图的个数，其近似解在文献[2]中已讨论。     

牛顿-莱布尼兹公式与泰勒公式的拓展与应用

探讨牛顿—莱布尼兹公式和泰勒公式对含参数函数的拓展形式,并用来研究含参数函数的零点的个数和微分方程周期解的个数的判定问题.     

多时滞环状神经网络的稳定性

本文针对—个带自反馈的多时滞环状神经网络系统,给出了系统平凡解稳定与不稳定的条件,讨论了平凡解对应特征方程在不同参数条件下的正实部根的个数以及正实部根个数随参数变动的变化规律.     

基于模式搜索的渴求函数法在多响应优化中的应用

渴求函数法是处理多响应参数优化的常用方法之一,它通过最大化总体渴求值获得因子的最佳水平组合.然而,随着因子个数和响应个数的增加,渴求函数往往变得多约束、多峰分布、高度非线性,传统的基于梯度的优化算法不适用.根据因子及响应个数等问题复杂程度不同,提出了以模式搜索算法为基础,用重叠等值线图或遗传算法设定模式搜索的起始点,对总体渴求函数进行寻优的新方法.算例验证了该方法的有效性.     

一维Minkowski平均曲率型方程Dirichlet问题的分歧曲线

本文运用时间映像法研究了一类非线性项不满足符号条件的Minkowski型平均曲率方程Dirichlet问题■正解的分歧曲线形状及相应正解的存在性和多解性,其中λ> 0是参数,f∈C[0,∞)∩C²(0,∞).本文的主要结果揭示了非线性项f的零点个数与正解个数之间的关系,推广和改进了已有文献中的相关结果.     

三次方程根的个数与参数范围问题的解法

对于含有某一参数的三次方程,若已知方程根的个数,则可确定参数的取值范围;若已知参数的取值范围,则可确定方程根的个数。对这类问题的解答方法很多,下面从两方面以含有参数的三次方程问题为例进行分析。     

混合效应模型的最优区组设计

本文对将驻点个数等于参数个数的混合效应模型做D-最优设计.以两种误差分布的组合为例做近似区组设计,然后给出精确区组设计的设计点位置及区组的权数的解析方程组,给出精确设计比近似设计好的条件.最后,给出数值结果及效率比较.     

关于复模态参数的冗余性

生成仿真传递函数是考核模态识别算法和评估模态分析软件的不可缺少的环节．比较可行的3种计算方案表明:若选择将传递函数表示为复模态参数的展开式,则可以自由设定仿真模态的特性,如密频、大阻尼和复模态;然而,即使采用这种格式也不能随意设置一组复模态振型,因为这种格式的表观参数个数大于物理参数个数;故而,若对应的物理参数有意义,那么复模态参数必须满足一组约束关系．通过分析复模态系统的特征值问题,和复模态参数反演物理参数的方程式,给出了复模态参数间的一组非线性冗余约束．讨论了实模态、无阻尼和不完全模态等特殊情形的冗余约束具体形式与独立参数的个数,值得注意的是,对于实模态系统,冗余约束自动满足．给出冗余约束在传递函数矩阵和一列传递函数上的等价形式．这些结果有助于产生仿真传递函数,实施优化型识别算法,以及评估识别结果;还可用来评价残余模态和识别完整性．     

一类不依赖于局部极小解个数的填充函数

求解无约束总体优化问题的一类单参数填充函数需要假设问题的局部极小解的个数只有有限个,而且填充函数中参数的选取与局部极小解的谷域的半径有关.本文对填充函数的定义作适当改进,而且对已有的这一类填充函数作改进,构造了一类双参数填充函数.新的填充函数不仅无须对问题的局部极小解的个数作假设,而且其中参数的选取与局部极小解的谷域的半径无关.     

总体优化一类双参数填充函数算法的改进

求解无约束总体优化问题的一类双参数填充函数算法需要假设该问题的局部极小解的个数只有有限个，而且填充函数中参数的选取与局部极小解的谷域的半径有关．该文对其填充函数作了适当改进，使得新的填充函数算法不仅无需对问题的局部极小解的个数作假设，而且填充函数中参数的选取与局部极小解的谷域的半径无关．数值试验表明算法是有效的．     

ENUMERATION OF ROOTED VERTEX NON-SEPARABLE PLANAR MAPS

In a rooted planar map, the rooted vertex is said to be non-separable if the vertex onthe boundary of the outer face as an induced graph is not a cut-vertex. In this paper, the author derives a functional equation satisfied by the enumeratingfuuction of rooted vertex non-separable planar maps dependent on the edge number and thenumber of the edges on the outer face boundary, finds a parametric expression of itssolution, and obtains an explicit formula for the function. Particularly, the number of rooted vertex non-separable maps only replying on theedge number and that of rooted vertex non-separable tree-like maps defined in [4] accordingto the two indices, the edge number and the number of the edges on the outer face boundary,or only one index, the edge number, are also determined.     

Simplification of formulas for the number of maps on surfaces

Two combinatorial identities obtained by the author are used to simplify formulas for the number of general rooted cubic planar maps, for the number of g-essential maps on surfaces of small genus, and also for rooted Eulerian maps on the projective plane. Besides, an asymptotics for the number of maps with a large number of vertices is obtained.     

ENUMERATING ROOTED EULERIAN PLANAR MAPS

1 IntroductionSince Thtte's papers oll enunlerating planar InaPs in [7,8] published iu the beginlling Ofsixties, the enumerative theory has been developed greatly up to now. The enumeration ofgenera1 Eulerian planar maps is dependent on two paranleters as the valency of rooted vertexalld the uunther of edges Of the nmps. Y.P.Liu found tl1e functional equation firstly for thenlaPs aud then obtained the number of general rooted Elllerian planar maPs with the nuntherof edges given in 1989[1].…     

Enumerating near-4-regular maps on the sphere and the torus

In this paper rooted near-4-regular maps on the plane and the torus are counted with formulae with respect to four parameters: the root valency, the number of edges, the inner faces, and nonroot-vertex loops. In particular, the number of rooted near-4-regular maps on those surfaces with exactly k nonroot-vertex loops is investigated.     

字典序地生成有序根树的一个算法

§1.引言由于树的生成在计算机科学中有着重要应用,近年来许多文章研究了树的生成,其中大多数文章是讨论2分树及 k 分树的生成.研究一般有序根树的文章尚少.文献[1]给出了有序根树的一个序列表示法,并描述了一个生成有序根树的算法.文献[2]及[3]讨论了生成2分树及 k 分树的算法.本文用0,1序列表示有序根树,并给出了一个字典序地生成具有 n 个顶点的所有有序根树的算法.本文的表示法及算法与文献[1]中所提方法不同.本算法亦可用来生成具有 n 个叶子的所有2分树.它比[2]中的算法更简单.本文中未加说明的术语皆见[1].     

Counting rooted maps by Genus. I

Using a combinatorial equivalent for maps, we take the first census of maps on orientable surfaces of arbitrary genus. We generalize to higher genus Tutte's recursion formula for counting slicings, and thus obtain an algorithm for counting rooted maps by genus, number of edges, and number of vertices. We then solve a special case of this recursion formula, to count slicngs with one face by genus. This leads to an explicit formula which counts rooted maps with one face by genus and number of edges.     

环面上近三角剖分地图的计数

本文提供了环面上带边数和根面次这两个参数的有根近三角剖分的函数方程及其参数表达式，并给出了根面次为1以边数为参数的有根近三角剖分地图的精确解．     

Spanning trees in a cactus

We prove a best possible lower bound for the number of isomorphism classes into which all rooted spanning trees of a rooted cactus partition. We announce a best possible lower bound for the number of isomorphism classes into which all spanning trees of a cactus partition.     

Enumerative Properties of Rooted Circuit Maps

In 1966, Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar graphs share many interesting properties which are not satisfied by general 2-connected planar graphs. Circuit graphs have nice closure properties which make them easier to deal with than 3-connected planar graphs for studying some graph-theoretic properties. In this paper, we study some enumerative properties of circuit graphs. For enumeration purpose, we define rooted circuit maps and compare the number of rooted circuit maps with those of rooted 2-connected planar maps and rooted 3-connected planar maps.