Composition operators on the Newton space

We investigate properties of composition operators C? on the Newton space (the Hilbert space of analytic functions which have the Newton polynomials as an orthonormal basis). We derive a formula for the entries of the matrix of C? with respect to the basis of Newton polynomials in terms of the value of the symbol ? at the non-negative integers. We also establish conditions on the symbol ? for boundedness, compactness, and self-adjointness of the induced composition operator C?. A key technique in obtaining these results is use of an isomorphism between the Newton space and the Hardy space via the Binomial Theorem.     

On almost hypoelliptic polynomials increasing at infinity

It is proved that a polynomial (the symbol of a differential operator), the Newton polygon of which is a rectangular parallelepiped with a vertex at the origin, is almost hypoelliptic if and only if it is regular. Also some algebraic conditions of almost hypoellipticity are obtained for nonregular polynomials increasing at infinity. The results are unimprovable for polynomials of two variables.     

Toward an arithmetic of polynomials

Summary ForR a commutative ring, which may have divisors of zero but which has no idempotents other than zero and one, we consider the problem of unique factorization of a polynomial with coefficients inR. We prove that, if the polynomial is separable, then such a unique factorization exists. We also define a Legendre symbol for a separable polynomial and a prime of commutative ring with exactly two idempotents in such a way that the symbols of classical number theory are subsumed. We calculate this symbol forR = Q in two cases where it has classically been of interest, namely quadratic extensions and cyclotomic extensions. We then calculate it in a situation which is new, namely the so called generalized cyclotomic extensions from a paper by S. Beale and D. K. Harrison. We study the Galois theory in the general ring situation and in particular define a category of separable polynomials (this is an extension of a paper by D. K. Harrison and M. Vitulli) and a cohomology theory of separable polynomials.     

Newton stratification for polynomials: The open stratum

In this paper we consider the Newton polygons of L-functions coming from additive exponential sums associated to a polynomial over a finite field Fq. These polygons define a stratification of the space of polynomials of fixed degree. We determine the open stratum: we give the generic Newton polygon for polynomials of degree d?2 when the characteristic p?3d, and the Hasse polynomial over Fp, i.e. the equation defining the hypersurface complementary to the open stratum.     

Computer Algebra and Bifurcations

In this paper we will present the family of Newton algorithms. From the computer algebra point of view, the most basic of them is well known for the local analysis of plane algebraic curves f(x,y)=0 and consists in expanding y as Puiseux series in the variable x. A similar algorithm has been developped for multi-variate algebraic equations and for linear differential equations, using the same basic tools: a “regular” case, associated with a “simple” class of solutions, and a “simple” method of calculus of these solutions; a Newton polygon; changes of variable of type ramification; changes of unknown function of two types y=ct ^μ+? or y=exp?(c/t ^μ)?. Our purpose is first to define a “regular” case for nonlinear implicit differential equations f(t,y,y′)=0. We will then apply the result to an explicit differential equation with a parameter y′=f(y,α) in order to make a link between the expansions of the solutions obtained by our local analysis and the classical theory of bifurcations.     

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.     

Variance of the spectral numbers and Newton polygons

Using the theory of the mixed Hodge structure one can define a notion of spectrum of a singularity or of a polynomial. Recently Claus Hertling proposed a conjecture about the variance of the spectrum of a singularity. Alexandru Dimca proposed a similar conjecture on polynomials. Here, we prove these two conjectures in the case of dimension 2 and when the singularity or the polynomial is Newton non-degenerated and commode.     

The complete classification of fibres in pencils of curves of genus two

This article contains geometrical classification of all fibres in pencils of curves of genus two, which is essentially different from the numerical one given by Ogg ([11]) and Iitaka ([7]). Given a family π:X→D of curves of genus two which is smooth overD′=D?{0}, we define a multivalued holomorphic mapT _π fromD′ into the Siegel upper half plane of degree two, and three invariants called “monodromy”, “modulus point” and “degree”. We assert that the family π is completely determined byT _π, and its singular fibre by these three invariants. Hence all types of fibres are classified by these invariants and we list them up in a table, which is the main part of this article.     

On pseudorandom properties of some Dirichlet characters

In this paper, we try to generalize the Mauduit–Sárközy pseudorandom properties of the Legendre symbol to Dirichlet characters. We prove that in our construction the well-distribution and correlation measures are as “small” as in the case of the Legendre symbol. Furthermore we provide with sufficient conditions to ensure the coincidence of two binary sequences using the Legendre symbol.     

Generation of some de Bruijn sequences

The cycle structure of the “connection” of feedback logics is applied to construct more polynomials which generate de Bruijn sequences.     

Enumeration of trees by inversions

Mallows and Riordan “The Inversion Enumerator for Labeled Trees,” Bulletin of the American Mathematics Society, vol. 74 [1968] pp. 92-94) first defined the inversion polynomial, J_n(q) for trees with n vertices and found its generating function. In the present work, we define inversion polynomials for ordered, plane, and cyclic trees, and find their values at q = 0, ± 1. Our techniques involve the use of generating functions (including Lagrange inversion), hypergeometric series, and binomial coefficient identities, induction, and bijections. We also derive asymptotic formulae for those results for which we do not have a closed form. © 1995 John Wiley & Sons, Inc.     

Clusters of point matrices

Along with classical orthogonal polynomials, we consider orthogonal polynomials of degree n ? 1 at n points. These arise naturally from interpolation polynomials. The name “point matrices” is justified by the fact that we deal, not with a class of similar or congruent matrices that play a key role in a linear space and are related to its bases, but with matrices with a fixed set of nodes (or points) x ₁, …, x _n . A certain matrix cluster corresponds to each set of nodes. It is stated that there exists a simple connection between eigenproblems of a Hankel matrix H and a symmetric Jacobi matrix T.     

Generic hypersurface singularities

The problem considered here can be viewed as the analogue in higher dimensions of the one variable polynomial interpolation of Lagrange and Newton. Let x₁,...,x_r be closed points in general position in projective spacePn, then the linear subspaceV ofH⁰ (?ⁿ,O(d)) (the space of homogeneous polynomials of degreed on ?ⁿ) formed by those polynomials which are singular at eachx_i, is given by r(n + 1) linear equations in the coefficients, expressing the fact that the polynomial vanishes with its first derivatives at x₁,...,x_r. As such, the “expected” value for the dimension ofV is max(0,h⁰(O(d))?r(n+1)). We prove thatV has the “expected” dimension for d≥5 (theorem A). This theorem was first proven in [A] using a very complicated induction with many initial cases. Here we give a greatly simplified proof using techniques developed by the authors while treating the corresponding problem in lower degrees.     

Tutte polynomials for trees

We define two two-variable polynomials for rooted trees and one two-variable polynomial for unrooted trees, all of which are based on the coranknullity formulation of the Tutte polynomial of a graph or matroid. For the rooted polynomials, we show that the polynomial completely determines the rooted tree, i.e., rooted trees T₁ and T₂ are isomorphic if and only if f(T₁) = f(T₂). The corresponding question is open in the unrooted case, although we can reconstruct the degree sequence, number of subtrees of size k for all k, and the number of paths of length k for all k from the (unrooted) polynomial. The key difference between these three polynomials and the standard Tutte polynomial is the rank function used; we use pruning and branching ranks to define the polynomials. We also give a subtree expansion of the polynomials and a deletion-contraction recursion they satisfy.     

Ordering of nested square roots of 2 according to the Gray code

In this paper, we discuss some relations between zeros of Lucas–Lehmer polynomials and the Gray code. We study nested square roots of 2 applying a “binary code” that associates bits 0 and 1 to “plus” and “minus” signs in the nested form. This gives the possibility to obtain an ordering for the zeros of Lucas–Lehmer polynomials, which take the form of nested square roots of 2.     

On the integral of the product of four and more Bernoulli polynomials

In 1958, L.J. Mordell provided a formula for the integral of the product of two Bernoulli polynomials. He also remarked: “The integrals containing the product of more than two Bernoulli polynomials do not appear to lead to simple results.” In this paper, we provide explicit formulas for the integral of the product of r Bernoulli polynomials, where r is any positive integer. Many results in this direction, including those by Nörlund, Mordell, Carlitz, Agoh, and Dilcher, are special cases of the formulas given in this paper.     

Fast computation of generic bivariate resultants

We prove that the resultant of two “sufficiently generic” bivariate polynomials over a finite field can be computed in quasi-linear expected time, using a randomized algorithm of Las Vegas type. A similar complexity bound is proved for the computation of the lexicographical Gröbner basis for the ideal generated by the two polynomials.     

Interpolation and Parallel Lines

Here we consider 3 interpolation problems for homogeneous polynomials in n n + 1 variables (i.e. for zero-dimensional subschemes Z of Pⁿ) in which the scheme Z is contained in a “ small number ” of “ parallel lines ”; here a finite union D₁ ∪ … ∪ D _x ? Pⁿ of lines is called a set of parallel lines if there is P ∈ Pⁿ such that P ∈ D _i for all i.     

Lattice paths and the q-ballot polynomials

Two statistics with respect to “upper-corners” and “lower-corners” are introduced for lattice paths. The corresponding refined generating functions are shown to be closely related to the q-ballot polynomials that extend the well-known Narayana polynomials and Catalan numbers.