Related papers: On quasi-polynomials counting planar tight maps
Enumeration of hypermaps is widely studied in many fields. In particular, enumerating hypermaps with a fixed edge-type according to the number of faces and genus is one topic of great interest. However, it is challenging and explicit…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…
Explicit formulas are obtained for the number of periodic points and maximum tail length of split polynomial maps over finite fields for affine and projective space. This work includes a detailed analysis of the structure of the directed…
Using a Quot scheme compactification, we calculate the virtual count of maps of degree $d$ from a smooth projective curve of genus $g$ to a hypersurface in a Grassmannian, sending specified points of the curve to special Schubert…
Two proper polynomial maps $f_1, \,f_2 \colon \mC^n \lr \mC^n$ are said to be \emph{equivalent} if there exist $\Phi_1,\, \Phi_2 \in \textrm{Aut}(\mC^n)$ such that $f_2=\Phi_2 \circ f_1 \circ \Phi_1$. In this article we investigate proper…
Let $\nu_d : \mathbb{P}^n \longrightarrow \mathbb{P}^N$ be the Veronese mapping of degree $d$ where $N = {n+d \choose n} -1$. By an elementary approach it is shown that $\nu_d$ is an isomorphism of $\mathbb{P}^n$ onto the projective variety…
In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…
We study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an…
The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…
In this paper we focus on the map matching problem where the goal is to find a path through a planar graph such that the path through the vertices closely matches a given polygonal curve. The map matching problem is usually approached with…
We define the notion of complex stratification by quasifolds and show that such spaces occur as complex quotients by certain nonclosed subgroups of tori associated to convex polytopes. The spaces thus obtained provide a natural…
We consider maps on orientable surfaces. A map is called \emph{unicellular} if it has a single face. A \emph{covered map} is a map (of genus $g$) with a marked unicellular spanning submap (which can have any genus in $\{0,1,...,g\}$). Our…
A graph is near-bipartite if its vertex set can be partitioned into an independent set and a set which induces a forest. In this paper, planar graphs without cycles of length from 4 to 7 are shown to be near-bipartite.
In this article, we provide an infinite family of examples to disprove a recent conjecture due to Ballantine and her collaborators on the injectivity of a class of maps, namely pre_k, defined on integer partitions. These maps arise from…
A closed subscheme of codimension two $T \subset P^2$ is a quasi complete intersection (q.c.i.) of type $(a,b,c)$ if there exists a surjective morphism $\mathcal{O} (-a) \oplus \mathcal{O} (-b) \oplus \mathcal{O} (-c) \to \mathcal{I} _T$.…
A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…
Interpreting tangency as a limit of two transverse intersections, we obtain a concrete formula to enumerate smooth degree $d$ plane curves tangent to a given line at multiple points with arbitrary order of tangency. Extending that idea, we…
The treedepth of a graph $G$ is the least possible depth of an elimination forest of $G$: a rooted forest on the same vertex set where every pair of vertices adjacent in $G$ is bound by the ancestor/descendant relation. We propose an…
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…