Related papers: An algorithm to classify the asymptotic set associ…

We classify quadratic polynomial mappings from $\mathbb{C}^3$ to $\mathbb{C}^2$ up to affine equivalence and topological equivalence. This is a part of a larger project, we have already classified mappings from $\mathbb{C}^2$ to…

We prove that the stratification of the asymptotic set associated to a polynomial mapping $F: \mathbb{C}^n \to \mathbb{C}^n$ defined by "la m\'ethode des fa\c{c}ons" (arXiv:1407.5329) is a Thom-Mather stratification. Nous prouvons que la…

Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…

We present a formula describing the asymptotics of a class of multivariate orthogonal polynomials with hyperoctahedral symmetry as the degree tends to infinity. The polynomials under consideration are characterized by a factorized weight…

We study the asymptotic properties of monic orthogonal polynomials (OPs) with respect to some Freud weights when the degree of the polynomial tends to infinity, including the asymptotics of the recurrence coefficients, the nontrivial…

The purpose of this paper is to initiate a theory concerning the dynamics of asymptotically holomorphic polynomial-like maps. Our maps arise naturally as deep renormalizations of asymptotically holomorphic extensions of $C^r$ ($r>3$)…

In this paper, we consider a one-parameter family of degree $d\ge 2$ rational maps with an automorphism group containing the cyclic group of order $d$. We construct a polynomial whose roots correspond to parameter values for which the…

We give asymptotics for the cumulative distribution function (CDF) for degrees of large dense random graphs sampled from a graphon. The proof is based on precise asymptotics for binomial random variables. Replacing the indicator function in…

We deal with a general preferential attachment graph model with multiple type edges. The types are chosen randomly, in a way that depends on the evolution of the graph. In the $N$-type case, we define the (generalized) degree of a given…

We consider the problem of classifying the dynamics of complex polynomials $f: \mathbb{C} \to \mathbb{C}$ restricted to their basins of infinity. We synthesize existing combinatorial tools --- tableaux, trees, and laminations --- into a new…

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 introduce novel mathematical and computational tools to develop a complete algorithm for computing the set of non-properness of polynomials maps in the plane. In particular, this set, which we call \emph{the Jelonek set}, is a subset of…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Given a function $f$ in a finite field ${\mathbb F}_q$ of $q$ elements, we define the functional graph of $f$ as a directed graph on $q$ nodes labelled by the elements of ${\mathbb F}_q$ where there is an edge from $u$ to $v$ if and only if…

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

Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…

We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

By utilizing the idea of Colombeau's generalized function, we introduce a notion of asymptotic map between arbitrary diffeological spaces. The category consisting of diffeological spaces and asymptotic maps is enriched over the category of…

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…