多变元Sylvester结式与多余因子

经典的Sylvester结式方法是代数几何的一种基本消元方法,但它一次只能处理1个变元2个方程的多项式系统.本文将Sylvester结式扩展到n个变元n+1个方程的多项式系统,并且证明了新的多变元的Sylvester结式包含在原多项式系统的理想中.同时,给出了一种去掉其部分多余因子的方法.     

Multivariate Vandermonde Determinants and General Birkhoff Interpolation

In this paper, we consider the Straight Line Type Node Configuration C (SLTNCC) in multivariate polynomial interpolation as the result of different kinds of transformations of lines (such as parallel translations, rotations). Corresponding to these transformations we define different kinds of interpolation problems for the SLTNCC. The expression of the confluent multivariate Vandermonde determinant of the coefficient matrix for each of these interpolation problems is obtained, and from this expression we conclude the related interpolation problem is unisolvent. Also, we give a kind of generalization of the SLTNCC in Section 5. As well, we obtain an expression of the interpolating polynomial for a kind of interpolation problem discussed in this paper.     

多元分离子的构造与应用

本文研究了两类多元分离子的构造方法并提出计算公式.分析了多元分离子与Groebner 基的关系.把所求分离子应用到多元插值问题上,得到在字典序与广义字典序下用分离子表示的多元插值多项式.数值模拟显示了所述方法的有效性.     

The Existence and Local Behavior of Multivariate Algebraic Function Approximations

The existing scheme of rational polynomial approximants, defined by multivariate power series, is extended to define approximants with branch points. The existence theorem is obtained. The basic properties used to define the rational approximants can be preserved almost intactly. Especially, the local behavior of the     

Revisiting the Gross–Zagier discriminant formula

We derive a formula for the discriminant of the ring class polynomial of conductor N associated to the j-invariant and an imaginary quadratic field of odd discriminant $-d$ using the theory of Borcherds lifts. When d is a prime and $N=1$, the formula recovers the Gross–Zagier discriminant formula.     

关于多元多项式分解的必要条件

类似于一元多项式因式分解的相关结论,利用多元多项式函数与其偏导函数的关系,介绍多元多项式能够因式分解的必要条件,即若 f′xi （x1,x2,…,xn ）与 f （x1,…,xi-1,0,xi＋1,…,xn ）有公因式,则 f （x1,x2,…,xn ）可以分解。     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

How tangents solve algebraic equations, or a remarkable geometry of discriminant varieties

Let D_d,k denote the discriminant variety of degree d polynomials in one variable with at least one of its roots being of multiplicity ≥ k. We prove that the tangent cones to D_d,k span D_{d,k − 1} thus, revealing an extreme ruled nature of these varieties. The combinatorics of the web of affine tangent spaces to D_d,k in D_{d,k − 1} is directly linked to the root multiplicities of the relevant polynomials. In fact, solving a polynomial equation P(z) = 0 turns out to be equivalent to finding hyperplanes through a given point which are tangent to the discriminant hypersurface D_d,2. We also connect the geometry of the Viète map V_d: , given by the elementary symmetric polynomials, with the tangents to the discriminant varieties {D_d,k}.Various d-partitions {μ} provide a refinement {D^o_μ} of the stratification of by the D_d,k's. Our main result, Theorem 7.1, describes an intricate relation between the divisibility of polynomials in one variable and the families of spaces tangent to various strata {D^o_μ}.     

一种2型三角剖分上多元样条拟插值的精度提高策略

给定一个多元拟插值算子, 若其具有单位分解性质 (再生0次多项式), 我们提出一种利用其周围节点提高多项式再生性的方法. 所得算子不仅具有更高的逼近精度, 还不需要目标函数的任何导数信息. 然后利用此方法, 我们改进了2型三角剖分上的多元样条拟插值,使之具有更高的精度. 最后, 我们应用改进的拟插值算子数值求解时间发展偏微分方程. 数值实验验证了该方法的有效性.     

微分周形式与稀疏微分结式

代数周(Chow)形式和代数结式是代数几何的基本概念,同时还是消去理论的强大工具.一个自然的想法是在微分代数几何中发展相应的周形式和结式理论.但是由于微分结构的复杂性,在本文的研究工作之前,微分结式只有部分结果,而微分周形式与稀疏微分结式理论一直没有得到发展.本文的主要结果包括:第一,发展一般(generic)情形的微分相交理论,作为应用,证明一般情形的微分维数猜想.第二,初步建立微分周形式理论.对不可约微分代数簇定义微分周形式并证明其基本性质,特别地,给出微分周形式的Poisson分解公式,引入微分代数簇的主微分次数这一不变量并证明一类微分代数闭链的周簇和周坐标的存在性.作为应用,首次严格定义微分结式,证明其基本性质.第三,初步建立稀疏微分结式理论.引入Laurent微分本性系统的概念,定义稀疏微分结式,证明其基本性质,特别地,引入微分环面簇的概念,给出稀疏微分结式阶数和次数界的估计,并基于此给出计算稀疏微分结式的单指数时间算法.     

多元分次Lagrange插值

对多元多项式分次插值适定结点组的构造理论进行了深入的研究与探讨.在沿无重复分量代数曲线进行Lagrange插值的基础上,给出了沿无重复分量分次代数曲线进行分次Lagrane插值的方法,并利用这一结果进一步给出了在R~2上构造分次Lagrange插值适定结点组的基本方法.另外,利用弱Gr(o|¨)bner基这一新的数学概念,以及构造平面代数曲线上插值适定结点组的理论,进一步给出了构造平面分次代数曲线上分次插值适定结点组的方法,从而基本上弄清了多元分次Lagrange插值适定结点组的几何结构和基本特征.     

Dominance in the family of Sugeno-Weber t-norms

The dominance relationship between two members of the family of Sugeno-Weber t-norms is proven by using a quantifier elimination algorithm. Further it is shown that dominance is a transitive, and therefore also an order relation, on this family of t-norms.     

Varieties with small discriminant variety

Let be a smooth complex projective variety, let be an ample and spanned line bundle on , defining a morphism and let be its discriminant locus, the variety parameterizing the singular elements of . We present two bounds on the dimension of and its main component relying on the geometry of . Classification results for triplets reaching the bounds as well as significant examples are provided.

     

Approximate decoupling of multivariate polynomials using weighted tensor decomposition

Many scientific and engineering disciplines use multivariate polynomials. Decomposing a multivariate polynomial vector function into a sandwiched structure of univariate polynomials surrounded by linear transformations can provide useful insight into the function while reducing the number of parameters. Such a decoupled representation can be realized with techniques based on tensor decomposition methods, but these techniques have only been studied in the exact case. Generalizing the existing techniques to the noisy case is an important next step for the decoupling problem. For this extension, we have considered a weight factor during the tensor decomposition process, leading to an alternating weighted least squares scheme. In addition, we applied the proposed weighted decoupling algorithm in the area of system identification, and we observed smaller model errors with the weighted decoupling algorithm than those with the unweighted decoupling algorithm.     

多元线性混合模型方差分量矩阵的非负估计

本文研究了带有两个方差分量矩阵的多元线性混合模型方差分量矩阵的估计问题.对于平衡模型,给出了基于谱分解估计的一个方差分量矩阵的非负估计类.对于非平衡模型,给出了方差分量矩阵的广义谱分解估计类,讨论了与ANOVA估计等价的充要条件.同时,在广义谱分解估计的基础上给出了一种非负估计类,并讨论了其优良性.当具有较小二次风险的非负估计不存在时,从估计为非负的概率的角度考虑,将Kelly和Mathew(1993)提出的构造具有更小取负值概率的估计类的方法推广到本文的多元模型下,给出了较谱分解估计相比有更小取负值概率和更小风险的估计类.最后,模拟研究和实例分析表明文中理论结果有很好的表现.     

Characterization of rankings generated by linear discriminant analysis

Pairwise linear discriminant analysis can be regarded as a process to generate rankings of the populations. But in general, not all rankings are generated. We give a characterization of generated rankings. We also derive some basic properties of this model.     

Bounds for Systems of Maximal Differential Polynomials without Mixed Derivatives

Mathematical Notes -