Related papers: Whitney theorem for complex polynomial mappings

We use the stabilization functors to study the combinatorial aspects of the $F$-polynomial of a representation of any finite-dimensional basic algebra. We characterize the vertices of their Newton polytopes. We give an explicit formula for…

We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like…

Given a graph G, an incidence matrix N(G) is defined for the set of distinct isomorphism types of induced subgraphs of G. If Ulam's conjecture is true, then every graph invariant must be reconstructible from this matrix, even when the…

The geometry of the deltoid curve gives rise to a self-map of $\mathbb{C}^2$ that is expressed in coordinates by $f(x,y) = (y^2 - 2x, x^2 - 2y)$. This is one in a family of maps that generalize Chebyshev polynomials to several variables. We…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

Density of stable maps is the common thread of this paper. We review Whitney's contribution to singularities of differentiable mappings and Thom-Mather theories on $C^{\infty}$ and $C^{0}$-stability. Infinitesimal and algebraic methods are…

We construct C-algebras for a class of surfaces that are inverse images of certain polynomials of arbitrary degree. By using the directed graph associated to a matrix, the representation theory can be understood in terms of ``loop'' and…

This is an overview article. After an introduction to convenient calculus in infinite dimensions, the foundational material for manifolds of mappings is presented. The central character is the smooth convenient manifold $C^{\infty}(M,N)$ of…

Let $(X, T)$ be a weakly mixing minimal system, $p_1, \cdots, p_d$ be integer-valued generalized polynomials and $(p_1,p_2,\cdots,p_d)$ be non-degenerate. Then there exists a residual subset $X_0$ of $X$ such that for all $x\in X_0$ $$\{…

In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…

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 study the exponential map for A_n = R^2^n, the Cayley_Dickson algebras for n bigher than 1,wich generalize the Complex exponential map to Quaternions,Octonions and so forth. As application,we show that the self-map of the unit sphere in…

We introduce the formal extension of the Whitney functor and the polynomial extension of the tempered cohomology functor, and prove a natural topological duality between them.

This paper studies the C-compact-open topology on the set C(X) of all realvalued continuous functions on a Tychonov space X and compares this topology with several well-known and lesser known topologies. We investigate the properties…

We prove the formula \begin{equation*} TC(X\vee Y)=\max\{TC(X),TC(Y),cat(X\times Y)\} \end{equation*} for the topological complexity of the wedge $X\vee Y$.

General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…

Let $F:(\mathbb{C}^2,0)\to (\mathbb{C}^n,0)$ be the germ of a finite map and $(X,0)$ be its image. We will in this article using the topology of the link show that $(X,0)$ has to be a quotient singularity if it is normal and describe the…

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

Universality theorems (in the sense of N. Mn\"{e}v) claim that the realization space of a combinatorial object (a point configuration, a hyperplane arrangement, a convex polytope, etc.) can be arbitrarily complicated. In the paper, we prove…

Newton's method is used to approximate roots of complex valued functions f by creating a sequence of points that converges to a root of f in the usual topology. For any field K equipped with a set of pairwise inequivalent absolute values…