The multidimensional cube recurrence

We introduce a recurrence which we term the multidimensional cube recurrence, generalizing the octahedron recurrence studied by Propp, Fomin and Zelevinsky, Speyer, and Fock and Goncharov and the three-dimensional cube recurrence studied by Fomin and Zelevinsky, and Carroll and Speyer. The states of this recurrence are indexed by tilings of a polygon with rhombi, and the variables in the recurrence are indexed by vertices of these tilings. We travel from one state of the recurrence to another by performing elementary flips. We show that the values of the recurrence are independent of the order in which we perform the flips; this proof involves nontrivial combinatorial results about rhombus tilings which may be of independent interest. We then show that the multidimensional cube recurrence exhibits the Laurent phenomenon - any variable is given by a Laurent polynomial in the other variables. We recognize a special case of the multidimensional cube recurrence as giving explicit equations for the isotropic Grassmannians IG(n−1,2n). Finally, we describe a tropical version of the multidimensional cube recurrence and show that, like the tropical octahedron recurrence, it propagates certain linear inequalities.     

纽结与多项式

In this paper, we deal with some corresponding relations between knots and polynomials by using the basic properties of knot polynomials （such as, some special values of knot polynomials, the Arf invariant and derivative of knot polynomials）. We give necessary and sufficient conditions that a Laurent polynomial with integer coefficients, whose breadth is less than five, is the Jones polynomial of a certain knot.     

CMV Biorthogonal Laurent Polynomials: Perturbations and Christoffel Formulas

Quasidefinite sesquilinear forms for Laurent polynomials in the complex plane and corresponding CMV biorthogonal Laurent polynomial families are studied. Bivariate linear functionals encompass large families of orthogonalities such as Sobolev and discrete Sobolev types. Two possible Christoffel transformations of these linear functionals are discussed. Either the linear functionals are multiplied by a Laurent polynomial, or are multiplied by the complex conjugate of a Laurent polynomial. For the Geronimus transformation, the linear functional is perturbed in two possible manners as well, by a division by a Laurent polynomial or by a complex conjugate of a Laurent polynomial, in both cases the addition of appropriate masses (linear functionals supported on the zeros of the perturbing Laurent polynomial) is considered. The connection formulas for the CMV biorthogonal Laurent polynomials, its norms, and Christoffel–Darboux kernels, in all the four cases, are given. For the Geronimus transformation, the connection formulas for the second kind functions and mixed Christoffel–Darboux kernels are also given in the two possible cases. For prepared Laurent polynomials, i.e., of the form , , these connection formulas lead to quasideterminantal (quotient of determinants) Christoffel formulas for all the four transformations, expressing an arbitrary degree perturbed biorthogonal Laurent polynomial in terms of 2n unperturbed biorthogonal Laurent polynomials, their second kind functions or Christoffel–Darboux kernels and its mixed versions. Different curves are presented as examples, such as the real line, the circle, the Cassini oval, and the cardioid. The unit circle case, given its exceptional properties, is discussed in more detail. In this case, a particularly relevant role is played by the reciprocal polynomial, and the Christoffel formulas provide now with two possible ways of expressing the same perturbed quantities in terms of the original ones, one using only the nonperturbed biorthogonal family of Laurent polynomials, and the other using the Christoffel–Darboux kernels and its mixed versions, as well. Two examples are discussed in detail.     

Laurent 多项式及其零点

本文给出了测度dψ为强分布的一个必要条件,并得到了dψ为强分布时的Laurent多项式最大零点的一个表示。     

Direct and inverse polynomial perturbations of hermitian linear functionals

This paper is devoted to the study of direct and inverse (Laurent) polynomial modifications of moment functionals on the unit circle, i.e., associated with hermitian Toeplitz matrices. We present a new approach which allows us to study polynomial modifications of arbitrary degree.The main objective is the characterization of the quasi-definiteness of the functionals involved in the problem in terms of a difference equation relating the corresponding Schur parameters. The results are presented in the general framework of (non-necessarily quasi-definite) hermitian functionals, so that the maximum number of orthogonal polynomials is characterized by the number of consistent steps of an algorithm based on the referred recurrence for the Schur parameters.The non-uniqueness of the inverse problem makes it more interesting than the direct one. Due to this reason, special attention is paid to the inverse modification, showing that different approaches are possible depending on the data about the polynomial modification at hand. These different approaches are translated as different kinds of initial conditions for the related inverse algorithm.Some concrete applications to the study of orthogonal polynomials on the unit circle show the effectiveness of this new approach: an exhaustive and instructive analysis of the functionals coming from a general inverse polynomial perturbation of degree one for the Lebesgue measure; the classification of those pairs of orthogonal polynomials connected by a certain type of linear relation with constant polynomial coefficients; and the determination of those orthogonal polynomials whose associated ones are related to a degree one polynomial modification of the original orthogonality functional.     

Remarks on Hilbert series of graded modules over polynomial rings

In this article we discuss a result on formal Laurent series and some of its implications for Hilbert series of finitely generated graded modules over standard-graded polynomial rings: For any integer Laurent function of polynomial type with non-negative values the associated formal Laurent series can be written as a sum of rational functions of the form ${\frac{Q_j(t)}{(1-t)^j}}$ , where the numerators are Laurent polynomials with non–negative integer coefficients. Hence any such series is the Hilbert series of some finitely generated graded module over a suitable polynomial ring ${\mathbb{F}[X_1 , \ldots , X_n]}$ . We give two further applications, namely an investigation of the maximal depth of a module with a given Hilbert series and a characterization of Laurent polynomials which may occur as numerator in the presentation of a Hilbert series as a rational function with a power of (1 ? t) as denominator.     

Formal Markoff maps are positive

This note defines a family of Laurent polynomials indexed in which generalize the Markoff numbers and relate to the character variety of the one-cusped torus. We describe which monomials appear in each polynomial and prove all the coefficients are positive integers. We also conjecture a generalization of that positivity result.      

A characterization of classical orthogonal Laurent polynomials

In [3] certain Laurent polynomials of ₂F₁ genus were called “Jacobi Laurent polynomials”. These Laurent polynomials belong to systems which are orthogonal with respect to a moment sequence ((a)_n/(c)_n)_nεℤ where a, c are certain real numbers. Together with their confluent forms, belonging to systems which are orthogonal with respect to 1/(c)_n)_nεℤ respectively ((a)_n)_nεℤ, these Laurent polynomials will be called “classical”. The main purpose of this paper is to determine all the simple (see section 1) orthogonal systems of Laurent polynomials of which the members satisfy certain second order differential equations with polynomial coefficients, analogously to the well known characterization of S. Bochner [1] for ordinary polynomials.     

Denominators in cluster algebras of affine type

The Fomin–Zelevinsky Laurent phenomenon states that every cluster variable in a cluster algebra can be expressed as a Laurent polynomial in the variables lying in an arbitrary initial cluster. We give representation-theoretic formulas for the denominators of cluster variables in cluster algebras of affine type. The formulas are in terms of the dimensions of spaces of homomorphisms in the corresponding cluster category, and hold for any choice of initial cluster.     

Chromatic Polynomials and the Symmetric Group

In this paper we give first a new combinatorial interpretation of the coefficients of chromatic polynomials of graphs in terms of subsets of permutations. Motivated by this new interpretation, we introduce next a combinatorially defined polynomial associated to a directed graph, and prove that it is related to chromatic polynomials. These polynomials are a specialization of cover polynomials of digraphs.I am grateful to the Swiss National Science Foundation for its partial financial supportFinal version received: June 25, 2003     

Companion orthogonal polynomials: some applications

In this paper the recurrence relations of symmetric orthogonal polynomials whose measures are related to each other in a certain way are considered. Many of the relations satisfied by the coefficients of the recurrence relations are exposed. The results are applied to obtain, for example, information regarding certain Sobolev orthogonal polynomials and regarding the measures of certain orthogonal polynomial sequences with twin periodic recurrence coefficients.     

Strong Asymptotics of Laguerre-Type Orthogonal Polynomials and Applications in Random Matrix Theory

We consider polynomials orthogonal on [0,∞) with respect to Laguerre-type weights w(x) = x^α e^-Q(x), where α > -1 and where Q denotes a polynomial with positive leading coefficient. The main purpose of this paper is to determine Plancherel-Rotach-type asymptotics in the entire complex plane for the orthonormal polynomials with respect to w, as well as asymptotics of the corresponding recurrence coefficients and of the leading coefficients of the orthonormal polynomials. As an application we will use these asymptotics to prove universality results in random matrix theory. We will prove our results by using the characterization of orthogonal polynomials via a 2 × 2 matrix valued Riemann--Hilbert problem, due to Fokas, Its, and Kitaev, together with an application of the Deift-Zhou steepest descent method to analyze the Riemann-Hilbert problem asymptotically.     

The stable computation of formal orthogonal polynomials

For many applications — such as the look-ahead variants of the Lanczos algorithm — a sequence of formal (block-)orthogonal polynomials is required. Usually, one generates such a sequence by taking suitable polynomial combinations of a pair of basis polynomials. These basis polynomials are determined by a look-ahead generalization of the classical three term recurrence, where the polynomial coefficients are obtained by solving a small system of linear equations. In finite precision arithmetic, the numerical orthogonality of the polynomials depends on a good choice of the size of the small systems; this size is usually controlled by a heuristic argument such as the condition number of the small matrix of coefficients. However, quite often it happens that orthogonality gets lost.We present a new variant of the Cabay-Meleshko algorithm for numerically computing pairs of basis polynomials, where the numerical orthogonality is explicitly monitored with the help of stability parameters. A corresponding error analysis is given. Our stability parameter is shown to reflect the condition number of the underlying Hankel matrix of moments. This enables us to prove the weak and strong stability of our method, provided that the corresponding Hankel matrix is well-conditioned.This work was partially supported by the HCM project ROLLS, under contract CHRX-CT93-0416.     

Traces in Complex Hyperbolic Triangle Groups

We present several formulas for the traces of elements in complex hyperbolic triangle groups generated by complex reflections. The space of such groups of fixed signature is of real dimension one. We parameterise this space by a real invariant α of triangles in the complex hyperbolic plane. The main result of the paper is a formula, which expresses the trace of an element of the group as a Laurent polynomial in e^{i α} with coefficients independent of α and computable using a certain combinatorial winding number. We also give a recursion formula for these Laurent polynomials and generalise the trace formulas for the groups generated by complex μ-reflections. We apply these formulas to prove some discreteness and some non-discreteness results for complex hyperbolic triangle groups.Research partially supported by NSF grant DMS-0072607 and by SFB 611 of the DFG.     

Bootstrapping and Askey–Wilson polynomials

The mixed moments for the Askey–Wilson polynomials are found using a bootstrapping method and connection coefficients. A similar bootstrapping idea on generating functions gives a new Askey–Wilson generating function. Modified generating functions of orthogonal polynomials are shown to generate polynomials satisfying recurrences of known degree greater than three. An important special case of this hierarchy is a polynomial which satisfies a four term recurrence, and its combinatorics is studied.     

分块平方和分解

本文定义了分块平方和可分解多项式的概念.粗略地说,它是这样一类多项式,只考虑其支撑集(不考虑系数)就可以把它的平方和分解问题等价地转换为较小规模的同类问题(换句话说,相应的半正定规划问题的矩阵可以分块对角化).本文证明了近年文献中提出的两类方法—分离多项式(split polynomial)和最小坐标投影(minimal coordinate projection)—都可以用分块平方和可分解多项式来描述,证明了分块平方和可分解多项式集在平方和多项式集中为零测集.     

Exceptional Laurent biorthogonal polynomials through spectral transformations of generalized eigenvalue problems

A formulation is given for the spectral transformation of the generalized eigenvalue problem through the decomposition of the second-order differential operators. This allows us to construct some Laurent biorthogonal polynomial systems with gaps in the degree of the polynomial sequence. These correspond to an exceptional-type extension of the orthogonal polynomials, as an extension of the Laurent biorthogonal polynomials. Specifically, we construct the exceptional extension of the Hendriksen–van Rossum polynomials, which are biorthogonal analogs of the classical orthogonal polynomials. Similar to the cases of exceptional extensions of classical orthogonal polynomials, both state-deletion and state-addition occur.     

A numerical method for the computation of Faber polynomials for starlike domains

We describe a simple numerical process for computing approximationsto Faber polynomials for starlike domains. This process is basedon using the Theodorsen integral equation method for computingthe Laurent series coefficients of the associated exterior conformalmapping, and then determining the corresponding Faber polynomialsby means of the well-known recurrence relation which is availablefor this purpose.     

Density of eigenvalues and its perturbation invariance in unitary ensembles of random matrices

We generally study the density of eigenvalues in unitary ensembles of random matrices from the recurrence coefficients with regularly varying conditions for the orthogonal polynomials. By using a new method, we calculate directly the moments of the density (which has been obtained in the work of Nevai and Dehesa, Van Assche and others on asymptotic zero distribution), and prove that scaling eigenvalues converge weakly, in probability and almost surely to the Nevai–Ullmann measure. Furthermore, we can prove that the density is invariant when the weight function is perturbed by a polynomial.     

Diophantine m-tuples for linear polynomials II. Equal degrees

In this paper we prove the best possible upper bounds for the number of elements in a set of polynomials with integer coefficients all having the same degree, such that the product of any two of them plus a linear polynomial is a square of a polynomial with integer coefficients. Moreover, we prove that there does not exist a set of more than 12 polynomials with integer coefficients and with the property from above. This significantly improves a recent result of the first two authors with Tichy [A. Dujella, C. Fuchs, R.F. Tichy, Diophantine m-tuples for linear polynomials, Period. Math. Hungar. 45 (2002) 21-33].