Related papers: The image complexity of an analytic map germ
Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by…
It is known that every germ of an analytic set is homeomorphic to the germ of an algebraic set. In this paper we show that the homeomorphism can be chosen in such a way that the analytic and algebraic germs are tangent with any prescribed…
We consider the homotopy type of maps between symplectic surface whose graphs form symplectic submanifolds of the product. We give a purely topological model for this space in terms of maps with constrained numbers of pre-images. We use…
As in [5], we study holomorphic maps of positive degree between compact complex manifolds, and prove that any holomorphic map of degree one from a compact complex manifold to itself is biholomorphic. This conclusion confirms that under a…
In this paper, we explore holomorphic Segre preserving maps. First, we investigate holomorphic Segre preserving maps sending the complexification $\mathcal{M}$ of a generic real analytic submanifold $M \subseteq \C^N$ of finite type at some…
We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H the problem is either NP-complete, NL-complete, L-complete or is…
A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H. A…
Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political…
A regular map is a surface together with an embedded graph, having properties similar to those of the surface and graph of a platonic solid. We analyze regular maps with reflection symmetry and a graph of density strictly exceeding 1/2, and…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
Let $D\subset \C^n,$ $G\subset \C^m$ be open sets, let $A$ (resp. $B$) be a subset of the boundary $\partial D$ (resp. $\partial G$) and let $W$ be the 2-fold boundary cross $((D\cup A)\times B)\cup (A\times(B\cup G)).$ An open subset…
We present a complete classification of complex projective surfaces $X$ with nontrivial self-maps (i.e. surjective morphisms $f:X\rightarrow X$ which are not isomorphisms) of any given degree. The starting point of our classification are…
We consider the random hypergraph on a finite vertex set by choosing each set of vertices as an hyperedge independently at random. We express the probability distributions of the (lower-)associated simplicial complex and the…
The paper contains a description of the links of complex surface germ.
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
The study of topological information of spatial objects has for a long time been a focus of research in disciplines like computational geometry, spatial reasoning, cognitive science, and robotics. While the majority of these researches…
We propose approaches based on deep learning to localize objects in images when only a small training dataset is available and the images have low quality. That applies to many problems in medical image processing, and in particular to the…
We study the analytic continuation problem for a germ of a biholomorphic mapping from a non-minimal real hypersurface $M\subset\CC{n}$ into a real hyperquadric $\mathcal Q\subset\CP{n}$ and prove that under certain non-degeneracy conditions…
Pluriharmonic maps form an important class of harmonic maps which includes holomorphic maps. We study their morphisms, in particular the inter-relationships between $(1,1)$-geodesic, pluriharmonic and $\pm$holomorphic maps. Then we…
Data complexity is an important concept in the natural sciences and related areas, but lacks a rigorous and computable definition. In this paper, we focus on a particular sense of complexity that is high if the data is structured in a way…