Related papers: Arithmetic of Unicritical Polynomial Maps

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

The notion of the weighted degree of a polynomial is a basic tool in Affine Algebraic Geometry. In this paper, we study the properties of the weighted multidegrees of polynomial automorphisms by a new approach which focuses on stable…

A polynomial complexity algorithm is designed which tests whether a point belongs to a given tropical linear variety.

In this article we report a preliminary investigation of the large $N$ limit of a generalized one-matrix model which represents an $O(n)$ symmetric model on a random lattice. The model on a regular lattice is known to be critical only for…

$n$-to-$1$ mappings have wide applications in many areas, especially in cryptography, finite geometry, coding theory and combinatorial design. In this paper, many classes of $n$-to-$1$ mappings over finite fields are studied. First, we…

Define a boundary point of a graph which is embedded in the Euclidean plane a vertex which is incident to only one edge. In this paper we consider graphs which are embedded in the Euclidean plane with a finite number of boundary points. The…

We use the theory of self-similar groups to enumerate all combinatorial classes of non-exceptional quadratic Thurston maps with fewer than five postcritical points. The enumeration relies on our computation that the corresponding maps on…

In this note we show that the degree of the interpolation polynomial for equidistant base points is characterized by the regularity of matrices of combinatorical type.

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental…

We study the dynamics of polynomial mappings f:C^k to C^k of degree at least 2 that extend continuously to projective space P^k. Our approach is to study the dynamics near the hyperplane at infinity and then making a descent to K --- the…

The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…

In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…

The action of ring automorphisms of the polynomial ring in two variables over the real numbers on real plane curves is considered. The orbits containing degree-three polynomials are computed, with one representative per orbit being…

We consider the configuration space of planar $n$-gons with fixed perimeter, which is diffeomorphic to the complex projective space $\mathbb{C}P^{n-2}$. The oriented area function has the minimal number of critical points on the…

The usual univariate interpolation problem of finding a monic polynomial f of degree n that interpolates n given values is well understood. This paper studies a variant where f is required to be composite, say, a composition of two…

We present a list of all polynomial dominanting maps of the complex plane with branched value curve isomorphic to the complex line, up to polynomial automorphisms.

For every polynomial f of degree n with no double roots, there is an associated family C(f) of harmonic algebraic curves, fibred over the circle, with at most n-1 singular fibres. We study the combinatorial topology of C(f) in the generic…

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…