Related papers: The image complexity of an analytic map germ
In this paper, we introduce relative LS category of a map and study some of its properties. Then we introduce `higher topological complexity' of a map, a homotopy invariant. We give a cohomological lower bound and compare it with previously…
We prove an equivalence of categories from formal complex structures with formal holomorphic maps to homotopy algebras over a simple operad with its associated homotopy morphisms. We extend this equivalence to complex manifolds. A complex…
Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…
This is an expository paper which presents the holomorphic classification of rational complex surfaces from a simple and intuitive point of view, which is not found in the literature. Our approach is to compare this classification with the…
Due to the complexity of the human body, most diseases present a high inter-personal variability in the way they manifest, i.e. in their phenotype, which has important clinical repercussions - as for instance the difficulty in defining…
The complexity of visual stimuli plays an important role in many cognitive phenomena, including attention, engagement, memorability, time perception and aesthetic evaluation. Despite its importance, complexity is poorly understood and…
We say that a germ G of a geometric structure can be transplanted into a manifold M if there is a suitable geometric structure on M which agrees with G on a neighborhood of some point P of M. We show for a wide variety of geometric…
In this paper, we examine holomorphic Segre preserving maps between the complexifications of real hypersurfaces in $\mathbb{C}^{n+1}$. In particular, we find several sufficient conditions ensuring that Segre transversality and total Segre…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
Interactive image segmentation is a topic of many studies in image processing. In a conventional approach, a user marks some pixels of the object(s) of interest and background, and an algorithm propagates these labels to the rest of the…
It is often the case that a covering map of the open annulus is semiconjugate to a map of the circle of the same degree. We investigate this possibility and its consequences on the dynamics. In particular, we address the problem of the…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
In this purely experimental work we try to represent the set of plane maps with 3 vertices and 3 faces as a bipartite ribbon graph. In particular, this construction allows one to estimate the genus of the initial set.
The microbiome constitutes a complex microbial ecology of interacting components that regulates important pathways in the host. Measurements of microbial abundances are key to learning the intricate network of interactions amongst microbes.…
Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…
Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…
Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows,…
Image segmentation aims at identifying regions of interest within an image, by grouping pixels according to their properties. This task resembles the statistical one of clustering, yet many standard clustering methods fail to meet the basic…
A graph covering projection, also referred to as a locally bijective homomorphism, is a mapping between the vertices and edges of two graphs that preserves incidences and is a local bijection. This concept originates in topological graph…
We characterize locally injective semialgebraic maps between two semialgebraic sets in terms of the induced homomorphism between their rings of (continuous) semialgebraic functions.