Related papers: The image complexity of an analytic map germ
We prove that the set of leaves of a holomorphic lamination of codimension one that are non-transversal to a germ of a holomorphic map is discrete.
Let $M$ be a smooth surface in $\mathbb R^3$ (or a complex surface in $\mathbb C^3$) and $k\geq 2$ be an integer. At any point on $M$ and for any plane in $\mathbb R^3$, we construct a holomorphic map-germ $(\mathbb C^2,0)\to(\mathbb…
In this paper we examine the concept of complexity as it applies to generative art and design. Complexity has many different, discipline specific definitions, such as complexity in physical systems (entropy), algorithmic measures of…
Let X be a minimal complex surface of general type such that its image via the canonical map is a surface; we denote by d the degree of the canonical map. In this expository work, first of all we recall the known possibilities for the…
We consider the problem of extending germs of plane holomorphic foliations to foliations of compact surfaces. We show that the germs that become regular after a single blow up and admit meromorphic first integrals can be extended, after…
A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…
This review presents various image segmentation methods using complex networks. Image segmentation is one of the important steps in image analysis as it helps analyze and understand complex images. At first, it has been tried to classify…
Following Favre, we define a holomorphic germ f:(C^d,0) -> (C^d,0) to be rigid if the union of the critical set of all iterates has simple normal crossing singularities. We give a partial classification of contracting rigid germs in…
It is shown that a formal mapping between two real-analytic hypersurfaces in complex space is convergent provided that neither hypersurface contains a nontrivial holomorphic variety. For higher codimensional generic submanifolds,…
We classify all tight holomorphic maps between Hermitian symmetric spaces of non-compact type.
In the study of holomorphic maps, the term "rigidity" refers to certain types of results that give us very specific information about a general class of holomorphic maps owing to the geometry of their domains or target spaces. Under this…
A map graph is a graph admitting a representation in which vertices are nations on a spherical map and edges are shared curve segments or points between nations. We present an explicit fixed-parameter tractable algorithm for recognizing map…
Graph-based representations of images have recently acquired an important role for classification purposes within the context of machine learning approaches. The underlying idea is to consider that relevant information of an image is…
A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…
Using nonstandard analysis we define a topology on the ring of germs of functions: $(mathbb R^n,0)\rightarrow(mathbb R,0)$. We prove that this topology is absolutely convex, Hausdorff, that convergent nets of continuous germs have…
Given a reflection group $G$ acting on a complex vector space $V$, a reflection map is the composition of an embedding $X \hookrightarrow V$ with the orbit map $V\to\mathbb C^p$ that maps a $G$-orbit to a point. Reflection maps can be very…
Let X be a compact complex surface with a real foliation. If all leaves are compact complex curves, the foliation must be holomorphic.
We prove that a meromorphic mapping, which sends a peace of a real analytic strictly pseudoconvex hypersurface in $\cc^2$ to a compact subset of $\cc^N$ which doesn't contain germs of non-constant complex curves is continuous from the…
A graph $G$ is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinct. Equivalently, a set graph is the underlying graph of the…
A map is an abstract visual representation of a region, taken from a given space, usually designed for final human consumption. Traditional cartography focuses on the mapping of Euclidean spaces by using some distance metric. In this paper…