Resolvability properties via independent families

The authors give a consistent affirmative response to a question of Juhász, Soukup and Szentmiklóssy: If GCH fails, there are (many) extraresolvable, not maximally resolvable Tychonoff spaces. They show also in ZFC that for ω<λ?κ, no maximal λ-independent family of λ-partitions of κ is ω-resolvable. In topological language, that theorem translates to this: A dense, ω-resolvable subset of a space of the form (DI(λ)) is λ-resolvable.     

Chromatic polynomial, q-binomial counting and colored Jones function

We define a q-chromatic function and q-dichromate on graphs and compare it with existing graph functions. Then we study in more detail the class of general chordal graphs. This is partly motivated by the graph isomorphism problem. Finally we relate the q-chromatic function to the colored Jones function of knots. This leads to a curious expression of the colored Jones function of a knot diagram K as a chromatic operator applied to a power series whose coefficients are linear combinations of long chord diagrams. Chromatic operators are directly related to weight systems by the work of Chmutov, Duzhin, Lando and Noble, Welsh.     

一类广义Bent型S-Box的构造

S-box是密码理论与实践中十分重要的一种装置 ,它的密码性能由其分量函数所决定 .于是 ,选择适当的分量函数来构造 S-box就成了一个重要的研究课题 .在一定意义上 ,Bent函数是最优良的密码函数 .本文通过函数序列半群和置换群来构造其任何非零线性组合为 Bent函数与线性函数之和的函数组 ,从而可由 Bent函数构造出具有高度非线性度和其他良好性状的 S-box     

类氢类氦类锂镁离子双电子复合的旁观电子角动量研究

类氢类氦类锂镁离子经中间双激发态进行的双电子复合过程在研究惯性约束聚变电子温度中占有很重要的地位.用准相对论方法计算了双电子复合经不同Rydberg态跃迁通道的复合速率系数,并给出不同离化度离子的双电子复合速率系数随电子温度的变化规律.显示出离子的相关能对峰值的电子温度有很大影响,当类氢离子跃迁通道的旁观电子角动量为1时双电子复合系数最大,而类锂离子是旁观电子角动量为3时最大. 关键词： 双电子复合 镁离子 角动量     

Necessary and sufficient conditions in constrained optimization

Additional conditions are attached to the Kuhn-Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications. Necessary and sufficient conditions are also given for optimality of the dual problem. Duality and converse duality are treated accordingly.     

On the maximum cardinality search lower bound for treewidth

The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.     

用三个关系式与Mathematica软件求第二类自然数幂和公式

首先介绍三个第二类自然数幂和关系式并对其中的两式给出证明,接着利用这些关系式与数学软件M athem atica4.0,给出求解第二类自然数幂和公式的若干机械计算方法.     

On the structure of finite coverings of compact connected groups

Finite-sheeted covering mappings onto compact connected groups are studied. We show that for a covering mapping from a connected Hausdorff topological space onto a compact (in general, non-abelian) group there exists a topological group structure on the covering space such that the mapping becomes a homomorphism of groups. To prove this fact we construct an inverse system of covering mappings onto Lie groups which approximates the given covering mapping. As an application, it is shown that a covering mapping onto a compact connected abelian group G must be a homeomorphism provided that the character group of G admits division by degree of the mapping. We also get a criterion for triviality of coverings in terms of means and prove that each finite covering of G is equivalent to a polynomial covering.     

Positive solutions and eigenvalue regions of two-delay singular systems with a twin parameter

The paper is concerned with a two-delay singular differential system with a twin parameter. Applying fixed-point index theory, we show the relationship between the asymptotic behaviors of nonlinearities (at zero and infinity) and the open regions (eigenvalue regions) of parameters, which are correlated with delays, such that the system has zero, one and two positive solution(s).     

Bias of the structural quasi-score estimator of a measurement error model under misspecification of the regressor distribution

In a structural measurement error model the structural quasi-score (SQS) estimator is based on the distribution of the latent regressor variable. If this distribution is misspecified, the SQS estimator is (asymptotically) biased. Two types of misspecification are considered. Both assume that the statistician erroneously adopts a normal distribution as his model for the regressor distribution. In the first type of misspecification, the true model consists of a mixture of normal distributions which cluster around a single normal distribution, in the second type, the true distribution is a normal distribution admixed with a second normal distribution of low weight. In both cases of misspecification, the bias, of course, tends to zero when the size of misspecification tends to zero. However, in the first case the bias goes to zero in a flat way so that small deviations from the true model lead to a negligible bias, whereas in the second case the bias is noticeable even for small deviations from the true model.