Related papers: Universal holomorphic maps with slow growth I. An …
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…
In this paper, we give some results on the number of meromorphic mappings of C^m into P^n under a condition on the inverse images of hyperplanes in P^n. At the same time, we give an answer for an open question by H.Fujimoto.
We show that any two holomorhpic maps, not both of which are constant, from a generalized Hopf manifold to its base must have a coincidence. We prove a similar result for holomorphic maps from a generalized Calabi-Eckmann manifold.
We study bifurcations of non-orientable area-preserving maps with quadratic homoclinic tangencies. We study the case when the maps are given on non-orientable two-dimensional surfaces. We consider one and two parameter general unfoldings…
Assume that all spaces and maps are localised at a fixed prime $p$. We study the possibility of generating a universal space $U(X)$ from a space $X$ which is universal in the category of homotopy associative, homotopy commutative H-spaces…
We give new upper bounds for the number of nonconstant holomorphic maps depending only on the genus. Our estimates improve previously known bounds. The proof is based on the study of pullbacks of holomorphic differentials, together with…
The aim of this paper is to investigate the links between ${\cal T}_C$-class algorithms, CQ Algorithm and shrinking projection methods. We show that strong convergence of these algorithms are related to coherent ${\cal T}_C$-class sequences…
In this paper, we shall prove that a harmonic map from $\mathbb{C}^{n}$ ($n\geq2$) to any Kahler manifold must be holomorphic under an assumption of energy density. It can be considered as a complex analogue of the Liouville type theorem…
The idea of renormalization and scale invariance is pervasive across disciplines. It has not only drawn numerous surprising connections between physical systems under the guise of holographic duality, but has also inspired the development…
Multi-connected Universe models with space idenfication scales smaller than the size of the observable universe produce topological images in the catalogs of cosmic sources. In this review, we present the recent developments for the search…
In this paper, we establish a general second main theorem for meromorphic mappings from $\mathbb C^m$ into a subvariety $V$ of $\mathbb P^n(\mathbb C)$ with respect to an arbitrary family of slowly moving hypersurfaces $\mathcal…
In this paper, we consider holomorphic mappings between real hypersurfaces in different dimensional complex spaces. We give a number of conditions that imply that such mappings are transversal to the target hypersurface at most points.
Inspired by the prospect of having discretized spaces emerge from random graphs, we construct a collection of simple and explicit exponential random graph models that enjoy, in an appropriate parameter regime, a roughly constant vertex…
We construct homotopically non-trivial maps from the unit m-sphere to the unit (m-1)-sphere with arbitrarily small k-dilation for each k greater than (m + 1)/2. We prove that homotopically non-trivial maps from the unit m-sphere to the unit…
A special generic map is a smooth map regarded as a natural generalization of Morse functions with just 2 singular points on homotopy spheres. Canonical projections of unit spheres are simplest examples of such maps and manifolds admitting…
This paper develops a theory of polynomial maps from commutative semigroups to arbitrary groups and proves that it has desirable formal properties when the target group is locally nilpotent. We apply this theory to solve Waring's Problem…
We give the first O(m polylog(n)) time algorithms for approximating maximum flows in undirected graphs and constructing polylog(n) -quality cut-approximating hierarchical tree decompositions. Our algorithm invokes existing algorithms for…
Given a set of $n$ points in the Euclidean plane, such that just $k$ points are strictly inside the convex hull of the whole set, we want to find the shortest tour visiting every point. The fastest known algorithm for the version when $k$…
We use orbifold structures to deduce degeneracy statements for holomorphic maps into logarithmic surfaces. We improve former results in the smooth case and generalize them to singular pairs. In particular, we give applications on nodal…
Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and…