Related papers: Polynomials Modulo Composite Numbers: Ax-Katz type…

We gather together several bounds on the sizes of coefficients which can appear in factors of polynomials in Z[x]; we include a new bound which was latent in a paper by Mignotte, and a few minor improvements to some existing bounds. We…

We give an upper bound on the z-degree of the Kauffman polynomial of a link, using bridges of length greater than one which are separated in some tangle decomposition of a link diagram. We construct some examples by wiring together rational…

An algorithm and its first implementation in C# are presented for assembling arbitrary quantum circuits on the base of Hadamard and Toffoli gates and for constructing multivariate polynomial systems over the finite field Z_2 arising when…

The ring of integer-valued polynomials on an arbitrary integral domain is well-studied. In this paper we initiate and provide motivation for the study of integer-valued polynomials on commutative rings and modules. Several examples are…

This paper considers some work done by the author and Catlin [CD1,CD2,CD3] concerning positivity conditions for bihomogeneous polynomials and metrics on bundles over certain complex manifolds. It presents a simpler proof of a special case…

We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…

We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius…

We estimate the number of possible types degree patterns of $k$-lacunary polynomials of degree $t < p$ which split completely modulo $p$. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with…

Birack modules are modules over an algebra Z[X] associated to a finite birack X. In previous work, birack module structures on Z mod n were used to enhance the birack counting invariant. In this paper, we use birack modules over Laurent…

In this paper we study of *-representations for polynomial algebras on quantum matrix spaces. We deal with two special cases of the polynomial algebras, namely the algebra of polynomials on quantum complex matrices $\mathrm{Mat_2}$ and on…

We determine the maximal angular perturbation of the (n+1)th roots of unity permissible in the Marcinkiewicz-Zygmund theorem on L^p means of polynomials of degree at most n. For p=2, the result is an analogue of the Kadets 1/4 theorem on…

We make explicit the exponential bound on the degrees of the polynomials appearing in the Effective Quillen-Suslin Theorem, and apply it jointly with the Hilbert-Burch Theorem to show that the syzygy module of a sequence of m polynomials in…

We prove a factorization formula for the Taylor series coefficients of a zero of a polynomial as a function of the polynomial's coefficients. This result extends to more general functions which we call "complex-exponent polynomials". To…

We introduce the notion of "quasi-symmetric" polynomials, which is a generalization of the notion of symmetry, and is particularly suited to the setting of polynomial rings over finite fields. The properties of this new class of functions…

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

The well-known theorem of Ax and Katz gives a p-divisibility bound for the number of rational points on an algebraic variety V over a finite field of characteristic p in terms of the degree and number of variables of defining polynomials of…

This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

The Schwartz-Zippel Lemma states that if a low-degree multivariate polynomial with coefficients in a field is not zero everywhere in the field, then it has few roots on every finite subcube of the field. This fundamental fact about…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…