相关论文: Topological equivalence of complex polynomials

In this paper, we study the Hamiltonian differential systems with homogeneous nonlinearity parts on $\mathbb{C}^2$. Firstly, we present a series of topological properties of polynomial Hamiltonian functions, with a particular focus on the…

A cubic Galois polynomial is a cubic polynomial with rational coefficients that defines a cubic Galois field. Its discriminant is a full square and its roots $x_1,x_2,x_3$ (enumerated in some order) are real. There exists (and only one)…

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…

The descent polynomials of separable permutations and derangements are both demonstrated to be unimodal. Moreover, we prove that the $\gamma$-coefficients of the first are positive with an interpretation parallel to the classical Eulerian…

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…

A non-zero constant Jacobian polynomial map $F=(P,Q):\mathbb{C}^2 \longrightarrow \mathbb{C}^2$ has a polynomial inverse if the component $P$ is a simple polynomial, i.e. if, when $P$ extended to a morphism $p:X\longrightarrow \mathbb{P}^1$…

In this work we consider holomorphic foliations of degree two on the projective plane $\mathbb{P}^2$ having an invariant line. In a suitable choice of affine coordinates these foliations are induced by a quadratic vector field over the…

The union of a directed family of topological groups can be equipped with two noteworthy topologies: the finest topology making each injection continuous, and the finest group topology making each injection continuous. This begs the…

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

We consider a continuous family $(f_s)$, $s\in[0,1]$ of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant (or…

For a nonautonomous linear system with nonuniform contraction, we construct a topological equivalence between this system and an unbounded nonlinear perturbation. This topological equivalence is constructed as a composition of…

In this paper we describe the well studied process of renormalization of quadratic polynomials from the point of view of their natural extensions. In particular, we describe the topology of the inverse limit of infinitely renormalizable…

This paper continues the authors' work on the question of unitary equivalence of matrices with entries in the complex-valued functions of a topological space (matrices over spaces). Specifically, we here consider the question of unitary…

Homeomorphisms allowing us to prove topological equivalences between one-parameter families of maps undergoing the same bifurcation are constructed in this paper. This provides a solution for a classical problem in bifurcation theory that…

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…

We show some applications of the formulas-as-polynomials correspondence: 1) a method for (dis)proving formula isomorphism and equivalence based on showing (in)equality; 2) a constructive analogue of the arithmetical hierarchy, based on the…

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero. In the paper we give a criterion of nearly irreducibility for a given polynomial f in…

We show that the monodromy operator at infinity plus the decomposition of the homology given by the vanishing cycles completely determine the homology monodromy representation of any complex polynomial.