On a Result of Telyakovskii and Multiple Hilbert Transforms with Polynomial Phases

In this paper, we prove a multiple analog of the theorem proved by Arkhipov and the author in 1987, which provides an estimate for the discrete Hilbert transform with polynomial phase. For the linear case, the corresponding estimates of the sum of multiple trigonometric series was proved by Telyakovskii.     

The Comparison Theorem for Bergman and Kobayashi Metrics on Cartan-Hartogs Domain of the Third Type

In this paper, we give the holomorphic sectional curvature under invariant Kähler metric on a Cartan-Hartogs domain of the third type Y _III (N,q,K) and construct an invariant Kähler metric, which is complete and not less than the Bergman metric, such that its holomorphic sectional curvature is bounded above by a negative constant. Hence we obtain a comparison theorem for the Bergman and Kobayashi metrics on Y _III (N,q,K).     

Classification of Calabi hypersurfaces with parallel Fubini-Pick form

In this paper, we present the classification of 2 and 3-dimensional Calabi hypersurfaces with parallel Fubini-Pick form with respect to the Levi-Civita connection of the Calabi metric.     

The Hilbert number of a class of differential equations

The notion of Hilbert number from polynomial differential systems in the plane of degree $n$ can be extended to the differential equations of the form \[\dfrac{dr}{d\theta}=\dfrac{a(\theta)}{\displaystyle \sum_{j=0}^{n}a_{j}(\theta)r^{j}} \eqno(*)\] defined in the region of the cylinder $(\tt,r)\in \Ss^1\times \R$ where the denominator of $(*)$ does not vanish. Here $a, a_0, a_1, \ldots, a_n$ are analytic $2\pi$--periodic functions, and the Hilbert number $\HHH(n)$ is the supremum of the number of limit cycles that any differential equation $(*)$ on the cylinder of degree $n$ in the variable $r$ can have. We prove that $\HHH(n)= \infty$ for all $n\ge 1$.     

The Hilbert Series of the Clique Complex

For a graph G, we show a theorem that establishes a correspondence between the fine Hilbert series of the Stanley-Reisner ring of the clique complex for the complementary graph of G and the fine subgraph polynomial of G. We obtain from this theorem some corollaries regarding the independent set complex and the matching complex.     

Hilbert Polynomial of a Certain Ladder-Determinantal Ideal

A ladder-shaped array is a subset of a rectangular array which looks like a Ferrers diagram corresponding to a partition of a positive integer. The ideals generated by the p-by-p minors of a ladder-type array of indeterminates in the corresponding polynomial ring have been shown to be hilbertian (i.e., their Hilbert functions coincide with Hilbert polynomials for all nonnegative integers) by Abhyankar and Kulkarni [3, p 53–76]. We exhibit here an explicit expression for the Hilbert polynomial of the ideal generated by the two-by-two minors of a ladder-type array of indeterminates in the corresponding polynomial ring. Counting the number of paths in the corresponding rectangular array having a fixed number of turning points above the path corresponding to the ladder is an essential ingredient of the combinatorial construction of the Hilbert polynomial. This gives a constructive proof of the hilbertianness of the ideal generated by the two-by-two minors of a ladder-type array of indeterminates.     

Hilbert Scheme of a Pair of Codimension Two Linear Subspaces

We study the component H _n of the Hilbert scheme whose general point parameterizes a pair of codimension two linear subspaces in ? ⁿ for n ≥ 3. We show that H _n is smooth and isomorphic to the blow-up of the symmetric square of 𝔾(n ? 2, n) along the diagonal. Further H _n intersects only one other component in the full Hilbert scheme, transversely. We determine the stable base locus decomposition of its effective cone and give modular interpretations of the corresponding models, hence conclude that H _n is a Mori dream space.     

The Hilbert Series of the Face Ring of a Flag Complex

 It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of , the subgraph polynomial of the complement of G. We also find a simple relationship between the size of a minimum vertex cover of a graph G and its subgraph polynomial. This yields a formula for the h-vector of the flag complex in terms of those two invariants of . Some computational issues are addressed and a recursive formula for the Hilbert series is given based on an algorithm of Bayer and Stillman. Received: December 10, 1999 Acknowledgments. I would like to thank Rick Wilson and the mathematics department of the California Institute of Technology for their kind hospitality, and Richard Stanley for pointing out an error in an earlier draft.     

求多项式根的幂次和的一种新方法

用微积分的级数理论,得到了求一元多项式根的幂次和计算的一种简便竖式算法。     

判定P_n(Γ)的Hilbert基的一个充要

设Γ是一作用在R^n上的紧李群，P_n(Γ)是Γ不变的多项式芽构成的环. Hilbert-Weyl定理证明了对于P_n(Γ)总存在一组由Γ不变的齐次多项式芽组成的Hilbert基. 然而，如何从Γ不变的齐次多项式芽中选出一组Hilbert基？如何判定Γ不变的齐次多项式芽的一个有限集就是P_n(Γ)的一组Hilbert基？该文借助于Noether环和不变积分的某些基本性质以及奇点理论的有关定理，证明了判定P_n(Γ)的Hilbert基的一个充要条件. 这对某些P_n(Γ)提供了计算一组Hilbert基的新途径.     

The depth of an ideal with a given Hilbert function

Let denote the polynomial ring in variables over a field with each . Let be a homogeneous ideal of with and the Hilbert function of the quotient algebra . Given a numerical function satisfying for some homogeneous ideal of , we write for the set of those integers such that there exists a homogeneous ideal of with and with . It will be proved that one has either for some or .

     

Hilbert空间H中G-框架等式

框架已获得广泛的应用,g-框架是框架的推广.本文运用算子理论方法,根据Hilbert空间H中的g-框架和g-框架算子的性质,得到有关g-框架的几个等式,给出一些有意义的结果.     

多项式函数的次数与极值点的关系

本文给出并严格证明了"一元实系数偶数(≥2)次多项式函数有极值"这一定理,并对多项式函数的次数及最高次项系数的符号与极值点的关系进行了归纳.     

一类基函数的构造问题

对文[1]中给出的基函数作了改进,改进后的基函数不仅形式简单,而且具有良好的几何性质.然后引进多项式树的概念,从更广泛意义出发讨论了一类基函数的构造问题.给基函数的构造提供了一个直观的途径.     

一类图的伴随多项式的根

设G是不含三角形的简单图,本文讨论了G的伴随多项式h(G,x)的根的分布情况.     

The characteristic polynomial of a multiarrangement

Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic polynomial of a multiarrangement which generalizes the characteristic polynomial of an arrangement. The characteristic polynomial of an arrangement is a combinatorial invariant, but this generalized characteristic polynomial is not. However, when the multiarrangement is free, we are able to prove the factorization theorem for the characteristic polynomial. The main result is a formula that relates ‘global’ data to ‘local’ data of a multiarrangement given by the coefficients of the respective characteristic polynomials. This result gives a new necessary condition for a multiarrangement to be free. Consequently it provides a simple method to show that a given multiarrangement is not free.     

The Dimension of the Linear Space Spanned by All Partial Derivatives of a Symmetric Polynomial

In this note we compute the dimension of the linear space spanned by all partial derivatives of an elementary symmetric polynomial in n real variables.