Related papers: On irreducible maps and slices

This is a comprehensive study of the relations between the global, local and pointwise variants of irreducibility and integrity of schemes, including examples and counterexamples, and aimed especially at learners of algebraic geometry.

We view a conic optimization problem that has a unique solution as a map from its data to its solution. If sufficient regularity conditions hold at a solution point, namely that the implicit function theorem applies to the normalized…

Let $\Lambda$ be a local truncated path algebra over an algebraically closed field $K$, i.e., $\Lambda$ is a quotient of a path algebra $KQ$ by the paths of length $L+1$, where $Q$ is the quiver with a single vertex and a finite number of…

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…

Combinatorics of biopolymer structures, especially enumeration of various RNA secondary structures and protein contact maps, is of significant interest for communities of both combinatorics and computational biology. However, most of the…

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

We obtain a recursive formula answering the following question: How many irreducible, plane curves of degree d and (geometric) genus g pass through 3d-1+g general points in the plane? The formula is proved by studying suitable degenerations…

We consider the problem of computing the distance-dependent two-point function of general planar maps and hypermaps, i.e. the problem of counting such maps with two marked points at a prescribed distance. The maps considered here may have…

Answering connectivity queries is fundamental to fully dynamic graphs where edges and vertices are inserted and deleted frequently. Existing work proposes data structures and algorithms with worst-case guarantees. We propose a new data…

We introduce Integral Curve Coordinates, which identify each point in a bounded domain with a parameter along an integral curve of the gradient of a function $f$ on that domain; suitable functions have exactly one critical point, a maximum,…

This article begins the study of irreducible maps involving finite-dimensional uniserial modules over finite-dimensional associative algebras. We work on the classification of irreducible maps between two uniserials over triangular…

Given a planar graph G on n vertices and an integer parameter r<n, an r-division of G with few holes is a decomposition of G into O(n/r) regions of size at most r such that each region contains at most a constant number of faces that are…

A unicellular map is a map which has only one face. We give a bijection between a dominant subset of rooted unicellular maps of fixed genus and a set of rooted plane trees with distinguished vertices. The bijection applies as well to the…

We show that branched coverings of surfaces of large enough genus arise as characteristic maps of braided surfaces that is, lift to embeddings in the product of the surface with $\mathbb R^2$. This result is nontrivial already for…

In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…

We prove that there exists a>0 such that for any integer d>2 and any topological types S_1,...,S_n of plane curve singularities, satisfying $\mu(S_1)+...+\mu(S_n) \leq ad^2$, there exists a reduced irreducible plane curve of degree d with…

We study the following combinatorial problem. Given a planar graph $G=(V,E)$ and a set of simple cycles $\mathcal C$ in $G$, find a planar embedding $\mathcal E$ of $G$ such that the number of cycles in $\mathcal C$ that bound a face in…

Mobiles are a particular class of decorated plane trees which serve as codings for planar maps. Here we address the question of enumerating mobiles in their most general flavor, in correspondence with planar Eulerian (i.e., bicolored) maps.…

Martingale transport plans on the line are known from Beiglbock & Juillet to have an irreducible decomposition on a (at most) countable union of intervals. We provide an extension of this decomposition for martingale transport plans in R^d,…

A significant amount of recent research work has addressed the problem of solving various data management problems in the cloud. The major algorithmic challenges in map-reduce computations involve balancing a multitude of factors such as…