Holomorphic Jackson's theorems in polydiscs

The purpose of this article is to establish Jackson-type inequality in the polydiscs U^N of for holomorphic spaces X, such as Bergman-type spaces, Hardy spaces, polydisc algebra and Lipschitz spaces. Namely,

where is the deviation of the best approximation of fX by polynomials of degree at most k_j about the jth variable z_j with respect to the X-metric and is the corresponding modulus of continuity.     

A Different Version of Flett＇s Mean Value Theorem and an Associated Functional Equation

In this paper we present a mean value theorem derived from Flett‘s mean value theorem. It turns out that cubic polynomials have the midpoint of the interval as their mean value point. To answer what class of functions have this property, we consider a functional equation associated with this mean value theorem. This equation is then solved in a general setting on abelian groups.     

Polynomial Pell's equation-II

The polynomial Pell's equation is X²−DY²=1, where D is a polynomial with integer coefficients and the solutions X,Y must be polynomials with integer coefficients. Let D=A²+2C be a polynomial in , where . Then for a prime, a necessary and sufficient condition for which the polynomial Pell's equation has a nontrivial solution is obtained. Furthermore, all solutions to the polynomial Pell's equation satisfying the above condition are determined.     

Polynomial detection of matrix subalgebras

The double Capelli polynomial of total degree is

It was proved by Giambruno-Sehgal and Chang that the double Capelli polynomial of total degree is a polynomial identity for . (Here, is a field and is the algebra of matrices over .) Using a strengthened version of this result obtained by Domokos, we show that the double Capelli polynomial of total degree is a polynomial identity for any proper -subalgebra of . Subsequently, we present a similar result for nonsplit inequivalent extensions of full matrix algebras.

     

Sampling sets and sufficient sets for A

We give new characterizations of the subsets S of the unit disc of the complex plane such that the topology of the space A^−∞ of holomorphic functions of polynomial growth on coincides with the topology of space of the restrictions of the functions to the set S. These sets are called weakly sufficient sets for A^−∞. Our approach is based on a study of the so-called (p,q)-sampling sets which generalize the A^−p-sampling sets of Seip. A characterization of (p,q)-sampling and weakly sufficient rotation invariant sets is included. It permits us to obtain new examples and to solve an open question of Khôi and Thomas.     

Codimension growth and minimal superalgebras

A celebrated theorem of Kemer (1978) states that any algebra satisfying a polynomial identity over a field of characteristic zero is PI-equivalent to the Grassmann envelope of a finite dimensional superalgebra . In this paper, by exploiting the basic properties of the exponent of a PI-algebra proved by Giambruno and Zaicev (1999), we define and classify the minimal superalgebras of a given exponent over a field of characteristic zero. In particular we prove that these algebras can be realized as block-triangular matrix algebras over the base field.

The importance of such algebras is readily proved: is a minimal superalgebra if and only if the ideal of identities of is a product of verbally prime T-ideals. Also, such superalgebras allow us to classify all minimal varieties of a given exponent i.e., varieties such that and for all proper subvarieties of . This proves in the positive a conjecture of Drensky (1988). As a corollary we obtain that there is only a finite number of minimal varieties for any given exponent. A classification of minimal varieties of finite basic rank was proved by the authors (2003).

As an application we give an effective way for computing the exponent of a T-ideal given by generators and we discuss the problem of what functions can appear as growth functions of varieties of algebras.

     

Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents

This paper considers the solution of nonconvex polynomial programming problems that arise in various engineering design, network distribution, and location-allocation contexts. These problems generally have nonconvex polynomial objective functions and constraints, involving terms of mixed-sign coefficients (as in signomial geometric programs) that have rational exponents on variables. For such problems, we develop an extension of the Reformulation-Linearization Technique (RLT) to generate linear programming relaxations that are embedded within a branch-and-bound algorithm. Suitable branching or partitioning strategies are designed for which convergence to a global optimal solution is established. The procedure is illustrated using a numerical example, and several possible extensions and algorithmic enhancements are discussed.     

生长曲线模型中的球性检验问题

本文给出了生长曲线模型中球性检验似然比准则在原假设相接近的两类备择假设下的非零渐近分布。     

Edge ranking of weighted trees

In this paper we consider the edge ranking problem of weighted trees. We prove that a special instance of this problem, namely edge ranking of multitrees is NP-hard already for multitrees with diameter at most 10. Note that the same problem but for trees is linearly solvable. We give an O(logn)-approximation polynomial time algorithm for edge ranking of weighted trees.     

Polyhedra related to integer-convex polynomial systems

This paper deals with the reformulation of a polynomial integer program. For deducing a linear integer relaxation of such a program a class of polyhedra that are associated with nonlinear functions is introduced. A characterization of the family of polynomials for which our approach leads to an equivalent linear integer program is given. Finally the family of so-called integer-convex polynomials is defined, and polyhedra related to such a polynomial are investigated. Supported by DFG-Forschergruppe FOR-468 Received: April, 2004