Related papers: A remark on a polynomial mapping from $\C^n$ to $\…

This document is a companion for the Maple program \textbf{Summing a polynomial function over integral points of a polygon}. It contains two parts. First, we see what this programs does. In the second part, we briefly recall the…

We prove a combinatorial version of Thom's Isotopy Lemma for projection maps applied to any complex or real toric variety. Our results are constructive and give rise to a method for associating the Whitney strata of the projection to the…

We introduce a Whitney polynomial for hypermaps and use it to generalize the results connecting the circuit partition polynomial to the Martin polynomial and the results on several graph invariants.

Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite…

In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation…

The Jacobian Conjecture would follow if it were known that real polynomial maps with a unipotent Jacobian matrix are injective. The conjecture that this is true even for $C^1$ maps is explored here. Some results known in the polynomial case…

We describe the topology of a general polynomial mapping $f:\Bbb C^2\to\Bbb C^2.$

In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…

In this short lecture, we compute asymptotics of orthogonal polynomials, from a saddle point approximation. This is an example of a calculation which shows the link between integrability, algebraic geometry and random matrices.

We update the state of the subject approximately 20 years after the publication of a previous article on this topic. This report is mostly a survey, with a sprinkling of assorted new results throughout.

We propose a mathematical walk around the gcd of the values $A(n)$ and $B(n)$ of two polynomials evaluated at an integer $n$. This is an opportunity to use a very powerful tool: the resultant.

We study matrix three term relations for orthogonal polynomials in two variables constructed from orthogonal polynomials in one variable. Using the three term recurrence relation for the involved univariate orthogonal polynomials, the…

In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.

Let f be a generic polynomial mapping mapping from the plane to the plane. There are constructed quadratic forms whose signatures determine the number of positive and negative cusps of f.

The purpose of this paper is to study some properties of the Newton maps associated to real quintic polynomials. First using the Tschirnhaus transformation, we reduce the study of Newton's method for general quintic polynomials to the case…

Zarhin showed that a matrix constructed from a polynomial with distinct roots has co-rank one. Some striking properties of this matrix are used to give a direct proof of his result. An account is given of calculations carried out to try to…

We give a topological model for a polynomial map from $\C^n$ to $\C$ in the neighborhood of a fiber with isolated singularities. This is motivated out of the ``unfolding of links'' described earlier by the first author and Lee Rudolph. The…

We study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…

We provide a naturally isomorphic description of the persistence map from merge trees to barcodes in terms of a monotone map from the partition lattice to the subset lattice. Our description is local, which offers the potential to speed up…

Constellations and hypermaps generalize combinatorial maps, i.e. embedding of graphs in a surface, in terms of factorization of permutations. In this paper, we extend a result of Jackson and Visentin (1990) stating an enumerative relation…