Related papers: On Proper Polynomial Maps of $\mathbb{C}^2.$

We finish the proof of the conjecture of F. Bogomolov and F. Pop: Let $F_{1}$ and $F_{2}$ be fields finitely-generated and of transcendence degree $\geq 2$ over $k_{1}$ and $k_{2}$, respectively, where $k_{1}$ is either $\bar{\mathbb{Q}}$…

The main result of this paper is the following version of the real Jacobian conjecture: "Let $F=(p,q):\R^2\to\R^2$ be a polynomial map with nowhere zero Jacobian determinant. If the degree of $p$ is less than or equal to $4$, then $F$ is…

For any prism $(A, d)$, we construct an analogue of Fontaine's map $W_r(A/d) \to A/d\phi(d)\cdots\phi^{r-1}(d)$. Subsequently, we define a canonical map from de Rham-Witt forms to prismatic cohomology in the perfect case and prove that it…

Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like…

In the present paper, we prove the existence of universal polynomials which express multi-singularity loci classes of prescribed types for proper morphisms between smooth schemes over an algebraically closed field of characteristic zero --…

We consider complex polynomials $f(z) = z^\ell+c_1$ for $\ell \in 2\N$ and $c_1 \in \R$, and find some combinatorial types and values of $\ell$ such that there is no invariant probability measure equivalent to conformal measure on the Julia…

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

It is known that if $f\colon {\mathbb R}^2 \to {\mathbb R}$ is a polynomial in each variable, then $f$ is a polynomial. We present generalizations of this fact, when ${\mathbb R}^2$ is replaced by $G\times H$, where $G$ and $H$ are…

We study biharmonic maps and f-biharmonic maps from a round sphere $(S^2, g_0)$, the latter maps are equivalent to biharmonic maps from Riemann spheres $(S^2, f^{-1}g_0)$. We proved that for rotationally symmetric maps between rotationally…

In this paper, we present a linear algebraic approach to the study of permutation polynomials that arise from linear maps over a finite field $\mathbb{F}_{q^2}$. We study a particular class of permutation polynomials over…

Given a smooth, open, oriented surface $X$ endowed with a family of complex structures $\{J_b\}_{b\in B}$ depending continuously on the parameter $b$ in a metrisable space $B$, we construct a continuous family of proper holomorphic maps…

In this paper we present a geometric proof of the following fact. Let $D$ be a Jordan domain in $\mathbb{C}$, and let $f$ be analytic on $cl(D)$. Then there is an injective analytic map $\phi:D\to\mathbb{C}$, and a polynomial $p$, such that…

Let ${\bf M}_n(\mathbb{F})$ be the algebra of $n\times n$ matrices over an arbitrary field $\mathbb{F}$. We consider linear maps $\Phi: {\bf M}_n(\mathbb{F}) \rightarrow {\bf M}_r(\mathbb{F})$ preserving matrices annihilated by a fixed…

A common subgraph of two graphs $G_1$ and $G_2$ is a graph that is isomorphic to subgraphs of $G_1$ and $G_2$. In the largest common subgraph problem the task is to determine a common subgraph for two given graphs $G_1$ and $G_2$ that is of…

We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the…

The duality theorem of Lass relates the matching polynomials of a simple graph $G$ with the matching polynomials of its complement $\bar G$. In particular, this relation gives rise to Godsil's result, which offers a nice interpretation of…

We compare the capabilities of two approaches to approximating graph isomorphism using linear algebraic methods: the \emph{invertible map tests} (introduced by Dawar and Holm) and proof systems with algebraic rules, namely \emph{polynomial…

An \emph{equitable coloring} of a graph is a proper vertex coloring such that the sizes of every two color classes differ by at most 1. Chen, Lih, and Wu conjectured that every connected graph $G$ with maximum degree $\Delta \geq 2$ has an…

A regular equivalence between two graphs $\Gamma,\Gamma'$ is a pair of uniformly proper Lipschitz maps $V\Gamma\to V\Gamma'$ and $V\Gamma'\to V\Gamma$. Using separation profiles we prove that there are $2^{\aleph_0}$ regular equivalence…

We establish a one-to-one correspondence between 1-planar graphs and general and hole-free 4-map graphs and show that 1-planar graphs can be recognized in polynomial time if they are crossing-augmented, fully triangulated, and maximal…