关于非均匀剖分下多元样条空间S_2~1(△_(mn)~(2))的拟插值算子

１引言随着计算机科学技术的发展,多元样条在力学和计算机辅助几何设计（ＣＡＧＤ）中的应用越来越引起人们极大兴趣．然而,由于一般剖分下样条空间的研究有相当的难度,迄今为止只对于一些特殊剖分的样条空间取得了一定的进展,如：矩形剖分,均匀的１－型,２－型三角剖分等．王仁宏和崔锦泰讨论了均匀２－型三角剖下的拟插值算子以及其逼近性质,鉴于在工程和实际应用中均匀剖分具有一定局限性,作者在文献（［１］,［３］）的基础上,对于非均匀２－型三角剖分,给出了一类拟插值算子,并研究了它的逼近性质．同时,利用其构造了一类…     

内网点连通剖分下网线的编号

本文讨论内网点连通剖分下网线的编号方法，以使协调方程的带宽尽量的小．这样对解协调方程，进而确定给定剖分下的作条函数空间是有意义的．文中给出一个随机选取的剖分的网线的一个具体编号．对矩形剖分、Ｉ型与Ⅱ型三角剖分，给出了它们的带宽分析．     

关于二元样条空间下的三角剖分的分解

本文指出，在一定条件下，对于一个二元样条空间，所考虑的三种剖分中的某些胞腔和网线可以消去，而前后两个三角剖分下样条空间的结构有着紧密的联系，从而可以用简单划分下的空间结构表示复杂剖分下的空间结构。该分解剖分的步骤可以递推的进行，尤其对Ｓ＾１ｓ。据此，本文还分析了剖分对Ｓ＾１２的奇异性并给出一组奇异的剖分。     

有限元方法(二)

§2. 剖分插值 本节讨论平面区域的几何剖分和相应的分片插值方法.对区域进行剖分时,基本单元可以取为三角形、矩形、四边形等等.插值函数可以取为一次(线性)或高次多项式等等.其中以三角剖分和相应的三顶点线性插值最简单,最常用,故主要讨论这一情况.为了尽快进入有限元离散化,可以只读这里的§§2.1-3而转至§3.     

样条的机械化求解

本文在逐次分解法的基础上，给出一种样条机械化求解方法．该方法对多项式样条，有理样条乃至更一般样条的研究都是十分有效的．它适用于三角剖分，矩形剖分乃至更一般的代数曲线剖分     

一类分层三角剖分下三次样条空间的维数

本文定义了平面单连通多边形域的一类较任意的三角剖分－分层三角剖分，并通过分析二元样条的积分协调条件，确定了分层三角剖分卜三次Ｃ^１作条函数空间的维数．     

一类与BB型对偶剖分相关的广义差分格式的L2模误差估计

广义差分法的研究涉及到对求解区域做某种剖分及相应的对偶剖分,对区域做三角形剖分时,最常用的对偶剖分是所谓的外心对偶剖分和重心对偶剖分[4][2],在计算流体中,还经常用到另一种对偶剖分即重心相联对偶剖分(BB型对偶剖分)[6]。[6]对一类椭圆     

贯穿剖分的若干性质

用有限条直线对区域 D进行的剖分称为贯穿剖分 ,形成剖分的直线称为贯穿线 .称始于内网点终止于 D的边界的线段为 D内的射线 ,如果一个剖分中的每一条网线或者是贯穿线的一部分或者是某一射线的一部分 ,则称该剖分为拟贯穿剖分 .由于贯穿剖分具有的特殊优越性 ,使其成为多元样条中最常用的剖分 .在多元样条里应用最广的均匀 1-型均匀 2 -型剖分就是贯穿剖分的特例 .但是 ,目前对贯穿剖分的性质研究较少 ,这限制了贯穿剖分优越性的进一步挖掘 .针对这一问题本文研究的贯穿剖分的多种性质 ,如 :边缘点的存在性 ,特型剖分域的存在性 ,染色定…     

一类三角剖分下样条空间S13(Δ)维数

首次提出了一种判别样条空间S13(Δ)维数不依赖剖分几何性质的协调条件.依此,在一类较一般的三角剖分下,获得了S13(Δ)的维数.     

Morgan-Scott剖分上样条空间S^48（△ms）的维数

Morgen-Scott剖分上样条空间的维数依赖于剖分的几何性质，本文证明了Diener 1990年提出的猜想对r=4是不正确的，需要修正．     

Equistable graphs, general partition graphs, triangle graphs, and graph products

In this paper we examine the connections between equistable graphs, general partition graphs and triangle graphs. While every general partition graph is equistable and every equistable graph is a triangle graph, not every triangle graph is equistable, and a conjecture due to Jim Orlin states that every equistable graph is a general partition graph. The conjecture holds within the class of chordal graphs; if true in general, it would provide a combinatorial characterization of equistable graphs.Exploiting the combinatorial features of triangle graphs and general partition graphs, we verify Orlin’s conjecture for several graph classes, including AT-free graphs and various product graphs. More specifically, we obtain a complete characterization of the equistable graphs that are non-prime with respect to the Cartesian or the tensor product, and provide some necessary and sufficient conditions for the equistability of strong, lexicographic and deleted lexicographic products. We also show that the general partition graphs are not closed under the strong product, answering a question by McAvaney et al.     

A conjectural generalization of the n! result to arbitrary groups

The aim of this paper is to formulate a conjecture for an arbitrary simple Lie algebra g in terms of the geometry of principal nilpotent pairs. When g is specialized to sln, this conjecture readily implies the n! result and it is very likely that, in fact, it is equivalent to the n! result in this case. In addition, this conjecture can be thought of as generalizing an old result of Kostant. In another direction, we show that to prove the validity of the n! result for an arbitrary n and an arbitrary partition of n, it suffices to show its validity only for the staircase partitions.     

关于Mycielski图循环色数的猜想

通过引进Mycielski图点集的一类特殊划分,利用该划分在Mycielski图循环着色中的特点改进了如下猜想:完全图的Mycielski图的循环色数等于它的点色数.     

A conjecture of B. Lin on cubic partition pairs

B. Lin introduced the study of cubic partition pairs, and made a conjecture concerning divisibility by a high power of 3. Among other things, we not only prove his conjecture, but indeed a stronger result.     

Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight 1. Strongly equistable graphs are graphs such that for every and every nonempty subset T of vertices that is not a maximal stable set, there exist positive vertex weights assigning weight 1 to every maximal stable set such that the total weight of T does not equal c . General partition graphs are the intersection graphs of set systems over a finite ground set U such that every maximal stable set of the graph corresponds to a partition of U . General partition graphs are exactly the graphs every edge of which is contained in a strong clique. In 1994, Mahadev, Peled, and Sun proved that every strongly equistable graph is equistable, and conjectured that the converse holds as well. In 2009, Orlin proved that every general partition graph is equistable, and conjectured that the converse holds as well. Orlin's conjecture, if true, would imply the conjecture due to Mahadev, Peled, and Sun. An “intermediate” conjecture, posed by Miklavi? and Milani? in 2011, states that every equistable graph has a strong clique. The above conjectures have been verified for several graph classes. We introduce the notion of equistarable graphs and based on it construct counterexamples to all three conjectures within the class of complements of line graphs of triangle‐free graphs. We also show that not all strongly equistable graphs are general partition.     

A unified approach to known and unknown cases of Berge's conjecture

Berge's elegant dipath partition conjecture from 1982 states that in a dipath partition P of the vertex set of a digraph minimizing , there exists a collection C^k of k disjoint independent sets, where each dipath P∈P meets exactly min{|P|, k} of the independent sets in C. This conjecture extends Linial's conjecture, the Greene–Kleitman Theorem and Dilworth's Theorem for all digraphs. The conjecture is known to be true for acyclic digraphs. For general digraphs, it is known for k=1 by the Gallai–Milgram Theorem, for k?λ (where λis the number of vertices in the longest dipath in the graph), by the Gallai–Roy Theorem, and when the optimal path partition P contains only dipaths P with |P|?k. Recently, it was proved (Eur J Combin (2007)) for k=2. There was no proof that covers all the known cases of Berge's conjecture. In this article, we give an algorithmic proof of a stronger version of the conjecture for acyclic digraphs, using network flows, which covers all the known cases, except the case k=2, and the new, unknown case, of k=λ?1 for all digraphs. So far, there has been no proof that unified all these cases. This proof gives hope for finding a proof for all k.     

On Residue Symbols and the Mullineux Conjecture

This paper is concerned with properties of the Mullineux map, which plays a rôle in p-modular representation theory of symmetric groups. We introduce the residue symbol for a p-regular partitions, a variation of the Mullineux symbol, which makes the detection and removal of good nodes (as introduced by Kleshchev) in the partition easy to describe. Applications of this idea include a short proof of the combinatorial conjecture to which the Mullineux conjecture had been reduced by Kleshchev.     

On Eckhoff's conjecture for Radon numbers; or how far the proof is still away

Eckhoff's conjecture for the Τ-Radon numbers r(Τ) of a convexity space. (X,C) says r(Τ) ≦ (r?1)(Τ?1)+1, with r = r(2). The main result of this note is that Eckhoff's conjecture is true in case ¦X¦ ≦ 2r and Τ = 3, i.e. each (2r?1)-set in a space with 2r?1 or 2r elements has a 3-Radon partition.     

Log Concavity of a Sequence in a Conjecture of Simion

Simion presented a conjecture involving the unimodality of a sequence whose elements are the number of lattice paths in a rectangular grid with the Ferrers diagram of a partition removed. In this paper, the author uses ideas from an earlier paper where special cases of this conjecture were proved to prove log concavity and unimodality of the sequence.     

The Borsuk dimension of a graph and Borsuk's partition conjecture for finite sets

Borsuk's partition conjecture for finite subsets of euclidean space is placed in a graph theoretic setting and equivalent graph theoretic conjectures are raised. The Borsuk dimension of a graph is defined and the Borsuk dimensions of various graphs are tabulated.AMS Subject Classification (1985 Revision): 05C99, 05A17